Implicit Abstraction Heuristics

DOI10.1613/jair.3063zbMath1205.68377arXiv1401.3853OpenAlexW2150289807WikidataQ129520526 ScholiaQ129520526MaRDI QIDQ3055801

No author found.

Publication date: 10 November 2010

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.3853

zbMATH Keywords

cost-optimal planningfork-decomposition

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Optimal Sokoban solving using pattern databases with specific domain knowledge ⋮ On the complexity of planning for agent teams and its implications for single agent planning ⋮ Landmark-enhanced abstraction heuristics ⋮ Optimal admissible composition of abstraction heuristics

This page was built for publication: Implicit Abstraction Heuristics