Extracting Effective and Admissible State Space Heuristics from the Planning Graph

Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches have hither-to been seen as largely orthogonal. In this paper, we show that the planning graph structure that Graphplan builds in polynomial time, provides a rich substrate for deriving more effective heuristics for state space planners. Specifically, we show that the heuristics used by planners such as HSP-R and UNPOP do badly in several domains due to their failure to consider the interactions between subgoals, and that the mutex information in the planning graph captures exactly this interaction information. We develop several families of heuristics, some aimed at search speed and others at optimality of solutions. Our empirical studies show that our heuristics significantly out-perform the existing state space heuristics.

[1]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Richard E. Korf,et al.  Linear-Space Best-First Search , 1993, Artif. Intell..

[3]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[4]  Richard E. Korf,et al.  Finding Optimal Solutions to the Twenty-Four Puzzle , 1996, AAAI/IAAI, Vol. 2.

[5]  S. Kambhampati Challenges in Bridging Plan Synthesis Paradigms , 1997, IJCAI.

[6]  Bernhard Nebel,et al.  Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.

[7]  Blai Bonet,et al.  A Robust and Fast Action Selection Mechanism for Planning , 1997, AAAI/IAAI.

[8]  Subbarao Kambhampati,et al.  Understanding and Extending Graphplan , 1997, ECP.

[9]  Maria Fox,et al.  The Automatic Inference of State Invariants in TIM , 1998, J. Artif. Intell. Res..

[10]  Lenhart K. Schubert,et al.  Inferring State Constraints for Domain-Independent Planning , 1998, AAAI/IAAI.

[11]  Blai Bonet,et al.  Planning as Heuristic Search: New Results , 1999, ECP.

[12]  Subbarao Kambhampati,et al.  Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning , 1999, AIPS.

[13]  M. Fox,et al.  Efficient Implementation of the Plan Graph in STAN , 2011, J. Artif. Intell. Res..

[14]  Ioannis P. Vlahavas,et al.  GRT: A Domain Independent Heuristic for STRIPS Worlds Based on Greedy Regression Tables , 1999, ECP.

[15]  Daniel S. Weld Recent Advances in AI Planning , 1999, AI Mag..

[16]  Jörg Hoffmann A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm , 2000, PuK.

[17]  Patrik Haslum,et al.  Admissible Heuristics for Optimal Planning , 2000, AIPS.

[18]  Jörg Hoffmann A Heuristic for Domain Independent Planning and its Use in an Enforced Hill-climbing Algorithm , 2000, Planen und Konfigurieren.

[19]  Subbarao Kambhampati,et al.  Distance-Based Goal-Ordering Heuristics for Graphplan , 2000, AIPS.

[20]  Jussi Rintanen,et al.  An Iterative Algorithm for Synthesizing Invariants , 2000, AAAI/IAAI.