An LP-based heuristic for optimal planning

Menkes Van Den Briel, J. Benton, Subbarao Kambhampati, Thomas Vossen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

33 Scopus citations

Abstract

One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners is based on relaxing the planning task by ignoring the delete effects of the actions. In several planning domains, however, this relaxation produces rather weak estimates to guide search effectively. We present a relaxation using (integer) linear programming that respects delete effects but ignores action ordering, which in a number of problems provides better distance estimates. Moreover, our approach can be used as an admissible heuristic for optimal planning.

Original languageEnglish (US)
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2007 - 13th International Conference, CP 2007, Proceedings
PublisherSpringer Verlag
Pages651-665
Number of pages15
ISBN (Print)3540749691, 9783540749691
DOIs
StatePublished - 2007
Externally publishedYes
Event13th International Conference on Principles and Practice of Constraint Programming, CP 2007 - Providence, RI, United States
Duration: Sep 23 2007Sep 27 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4741 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other13th International Conference on Principles and Practice of Constraint Programming, CP 2007
CountryUnited States
CityProvidence, RI
Period9/23/079/27/07

Keywords

  • Automated planning
  • Improving admissible heuristics
  • Optimal relaxed planning

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An LP-based heuristic for optimal planning'. Together they form a unique fingerprint.

Cite this