An LP-Based Heuristic for Optimal Planning

DOI10.1007/978-3-540-74970-7_46zbMath1145.68537OpenAlexW2155752154MaRDI QIDQ3523080

Menkes H. L. van den Briel, Jessica Benton, Thomas W. M. Vossen, Subbarao Kambhampati

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_46

zbMATH Keywords

automated planningimproving admissible heuristicsoptimal relaxed planning

Mathematics Subject Classification ID

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

Related Items (5)

Concise finite-domain representations for PDDL planning tasks ⋮ Anytime heuristic search for partial satisfaction planning ⋮ Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners ⋮ Optimal admissible composition of abstraction heuristics ⋮ Red-black planning: a new systematic approach to partial delete relaxation

Uses Software

• Graphplan

This page was built for publication: An LP-Based Heuristic for Optimal Planning