Accuracy of Admissible Heuristic Functions in Selected Planning Domains

The efficiency of optimal planning algorithms based on heuristic search crucially depends on the accuracy of the heuristic function used to guide the search. Often, we are interested in domain-independent heuristics for planning. In order to assess the limitations of domain-independent heuristic planning, we analyze the (in)accuracy of common domain-independent planning heuristics in the IPC benchmark domains. For a selection of these domains, we analytically investigate the accuracy of the h+ heuristic, the hm family of heuristics, and certain (additive) pattern database heuristics, compared to the perfect heuristic h*. Whereas h+and additive pattern database heuristics usually return cost estimates proportional to the true cost, non-additive hm and nonadditive pattern-database heuristics can yield results underestimating the true cost by arbitrarily large factors.

[1]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[2]  Drew McDermott,et al.  The 1998 AI Planning Systems Competition , 2000, AI Mag..

[3]  Malte Helmert,et al.  Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition , 2008, Lecture Notes in Computer Science.

[4]  Patrik Haslum,et al.  New Admissible Heuristics for Domain-Independent Planning , 2005, AAAI.

[5]  Fahiem Bacchus,et al.  The AIPS '00 Planning Competition , 2001, AI Mag..

[6]  J. Hoffmann,et al.  Where 'Ignoring Delete Lists' Works: Local Search Topology in Planning Benchmarks , 2005, J. Artif. Intell. Res..

[7]  M. Fox,et al.  The 3rd International Planning Competition: Results and Analysis , 2003, J. Artif. Intell. Res..

[8]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[9]  Malte Helmert,et al.  The Model Checking Integrated Planning System (MIPS) , 2001 .

[10]  Larry S. Davis,et al.  Pattern Databases , 1979, Data Base Design Techniques II.

[11]  Drew McDermott,et al.  A Heuristic Estimator for Means-Ends Analysis in Planning , 1996, AIPS.

[12]  Jonathan Schaeffer,et al.  Searching with Pattern Databases , 1996, Canadian Conference on AI.

[13]  Malte Helmert,et al.  Solving Planning Tasks in Theory and Practice , 2006 .

[14]  Blai Bonet,et al.  Planning as heuristic search , 2001, Artif. Intell..

[15]  Bart Selman,et al.  Unifying SAT-based and Graph-based Planning , 1999, IJCAI.

[16]  Fahiem Bacchus,et al.  AIPS 2000 Planning Competition: The Fifth International Conference on Artificial Intelligence Planning and Scheduling Systems , 2001 .

[17]  Patrik Haslum,et al.  Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning , 2007, AAAI.

[18]  Patrik Haslum,et al.  Flexible Abstraction Heuristics for Optimal Sequential Planning , 2007, ICAPS.

[19]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[20]  S. Edelkamp,et al.  The Deterministic Part of IPC-4: An Overview , 2005, J. Artif. Intell. Res..

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