A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems

J. Benton, Menkes Van Den Briel, Subbarao Kambhampati

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

22 Scopus citations

Abstract

The availability of informed (but inadmissible) planning heuristics has enabled the development of highly scalable planning systems. Due to this success, a body of work has grown around modifying these heuristics to handle extensions to classical planning. Most recently, there has been an interest in addressing partial satisfaction planning problems, but existing heuristics fail to address the complex interactions that occur in these problems between action and goal selection. In this paper we provide a unique admissible heuristic based on linear programming that we use to solve a relaxed version of the partial satisfaction planning problem. We incorporate this heuristic in conjunction with a lookahead strategy in a branch and bound algorithm to solve a class of over-subscribed planning problems.

Original languageEnglish (US)
Title of host publicationICAPS 2007, 17th International Conference on Automated Planning and Scheduling
Pages34-41
Number of pages8
StatePublished - Dec 1 2007
EventICAPS 2007, 17th International Conference on Automated Planning and Scheduling - Providence, RI, United States
Duration: Sep 22 2007Sep 26 2007

Publication series

NameICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Other

OtherICAPS 2007, 17th International Conference on Automated Planning and Scheduling
CountryUnited States
CityProvidence, RI
Period9/22/079/26/07

ASJC Scopus subject areas

  • Strategy and Management
  • Computer Science Applications
  • Mathematics(all)

Fingerprint Dive into the research topics of 'A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems'. Together they form a unique fingerprint.

Cite this