Planning with Pattern Databases

Heuristic search planning effectively finds solutions for large planning problems, but since the estimates are either not admissible or too weak, optimal solutions are found in rare cases only. In contrast, heuristic pattern databases are known to significantly improve lower bound estimates for optimally solving challenging single-agent problems like the 24-Puzzle or Rubik’s Cube. This paper studies the effect of pattern databases in the context of deterministic planning. Given a fixed state description based on instantiated predicates, we provide a general abstraction scheme to automatically create admissible domain-independent memory-based heuristics for planning problems, where abstractions are found in factorizing the planning space. We evaluate the impact of pattern database heuristics in A* and hill climbing algorithms for a collection of benchmark domains.

[1]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

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

[3]  Randal E. Bryant,et al.  Symbolic Manipulation of Boolean Functions Using a Graphical Representation , 1985, 22nd ACM/IEEE Design Automation Conference.

[4]  Richard E. Korf,et al.  Pruning Duplicate Nodes in Depth-First Search , 1993, AAAI.

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

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

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

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

[9]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

[10]  Hitoshi Matsubara,et al.  Automatic Making of Sokoban Problems , 1996, PRICAI.

[11]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[12]  Richard E. Korf,et al.  Finding Optimal Solutions to Rubik's Cube Using Pattern Databases , 1997, AAAI/IAAI.

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

[14]  Frank Reffel,et al.  OBDDs in Heuristic Search , 1998, KI.

[15]  Jonathan Schaeffer,et al.  Pushing the limits: new developments in single-agent search , 1999 .

[16]  Malte Helmert,et al.  Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length , 1999, ECP.

[17]  PlanningFrameworkRune M. Jensen,et al.  OBDD-based Deterministic Planning using the UMOP , 2000 .

[18]  Patrik Haslum,et al.  Extending TALplanner with Concurrency and Resources , 2000, ECAI.

[19]  R. Holte,et al.  The Automatic Creation of Memory-based Search Heuristics , 2000 .

[20]  Ioannis P. Vlahavas,et al.  Heuristic Planning with Resources , 2000, ECAI.

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

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

[23]  Stephan Merz,et al.  Model Checking , 2000 .

[24]  Manuela M. Veloso,et al.  OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains , 2000, J. Artif. Intell. Res..

[25]  Malte Helmert.  On the Complexity of Planning in Transportation and Manipulation Domains , 2001 .

[26]  Stefan Edelkamp.  Directed symbolic exploration and its application to AI-planning , 2001 .

[27]  John K. Slaney,et al.  Blocks World revisited , 2001, Artif. Intell..

[28]  Jörg Hoffmann,et al.  Local Search Topology in Planning Benchmarks: An Empirical Analysis , 2001, IJCAI.

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

[30]  Richard E. Korf,et al.  Disjoint pattern database heuristics , 2002, Artif. Intell..

[31]  David King.  ER , 2008, BMJ : British Medical Journal.

[32]  M. Zeldin.  Heuristics! , 2010 .

[33]  Malte Helmert,et al.  On the Complexity of Planning in Transportation Domains , 2014 .