Automated Creation of Pattern Database Search Heuristics

Pattern databases are dictionaries for heuristic estimates storing state-to-goal distances in state space abstractions. Their effectiveness is sensitive to the selection of the underlying patterns. Especially for multiple and additive pattern databases, the manual selection of patterns that leads to good exploration results is involved. For automating the selection process, greedy bin-packing has been suggested. This paper proposes genetic algorithms to optimize its output. Patterns are encoded as binary strings and optimized using an objective function that predicts the heuristic search tree size based on the distribution of heuristic values in abstract space. To reduce the memory requirements we construct the pattern databases symbolically. Experiments in heuristic search planning indicate that the total search efforts can be reduced significantly.

[1]  Ion Muslea,et al.  A GENERAL-PURPOSE AI PLANNING SYSTEM BASED ON THE GENETIC PROGRAMMING PARADIGM , 1997 .

[2]  Albert Nymeyer,et al.  Guided Invariant Model Checking Based on Abstraction and Symbolic Pattern Databases , 2004, TACAS.

[3]  Michael E. Wall,et al.  Galib: a c++ library of genetic algorithm components , 1996 .

[4]  István T. Hernádvölgyi.  Automatically generated lower bounds for search , 2004 .

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

[6]  David Furcy,et al.  Multiple Pattern Databases , 2004, ICAPS.

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

[8]  Philippe Morignot,et al.  Genetic Planning Using Variable Length Chromosomes , 2005, ICAPS.

[9]  Brian Tanner,et al.  Hierarchical Heuristic Search Revisited , 2005, SARA.

[10]  Lee Spector,et al.  Genetic Programming and AI Planning Systems , 1994, AAAI.

[11]  Robert C. Holte,et al.  Hierarchical A*: Searching Abstraction Hierarchies Efficiently , 1996, AAAI/IAAI, Vol. 1.

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

[13]  Jonathan Schaeffer,et al.  Dual Lookups in Pattern Databases , 2005, IJCAI.

[14]  Manuela M. Veloso,et al.  SetA*: an efficient BDD-based heuristic search algorithm , 2002, AAAI/IAAI.

[15]  John Gaschnig,et al.  A Problem Similarity Approach to Devising Heuristics: First Results , 1979, IJCAI.

[16]  Jean-Daniel Zucker,et al.  Abstraction, Reformulation and Approximation, 6th International Symposium, SARA 2005, Airth Castle, Scotland, UK, July 26-29, 2005, Proceedings , 2005, SARA.

[17]  Stefan Edelkamp,et al.  Symbolic Pattern Databases in Heuristic Search Planning , 2002, AIPS.

[18]  Hassen Saïdi,et al.  Construction of Abstract State Graphs with PVS , 1997, CAV.

[19]  Ion Muslea,et al.  SINERGY: A Linear Planner Based on Genetic Programming , 1997, ECP.

[20]  S. Edelkamp,et al.  Abstraction Databases in Theory and Model Checking Practice , 2004 .

[21]  Richard E. Korf,et al.  Compressing Pattern Databases , 2004, AAAI.

[22]  Jonathan Schaeffer,et al.  Chips Challenging Champions: Games, Computers and Artificial Intelligence , 2002 .

[23]  Sarfraz Khurshid,et al.  Exploring very large state spaces using genetic algorithms , 2004, International Journal on Software Tools for Technology Transfer.

[24]  Andreas Podelski,et al.  ACSAR: Software Model Checking with Transfinite Refinement , 2007, SPIN.

[25]  Eric A. Hansen,et al.  Space-Efficient Memory-Based Heuristics , 2004, AAAI.

[26]  Eric A. Hansen,et al.  External-Memory Pattern Databases Using Structured Duplicate Detection , 2005, AAAI.

[27]  Ariel Felner,et al.  Solving the 24 Puzzle with Instance Dependent Pattern Databases , 2005, SARA.

[28]  Richard E. Korf,et al.  Frontier search , 2005, JACM.

[29]  S. Schroedl.  An Improved Search Algorithm for Optimal Multiple-Sequence Alignment , 2005, J. Artif. Intell. Res..

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

[31]  David Silver,et al.  Cooperative Pathfinding , 2005, AIIDE.

[32]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[33]  Charles E. Taylor.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .

[34]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[35]  Craig A. Knoblock.  Automatically Generating Abstractions for Planning , 1994, Artif. Intell..

[36]  Dan Klein,et al.  A* Parsing: Fast Exact Viterbi Parse Selection , 2003, NAACL.

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

[38]  Jack Mostow,et al.  Discovering Admissible Search Heuristics by Abstracting and Optimizing , 1989, ML.

[39]  Stefan Edelkamp,et al.  Abstraction in directed model checking , 2004 .

[40]  Jack Mostow,et al.  Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach , 1989, IJCAI.

[41]  Robert C. Holte,et al.  A Space-Time Tradeoff for Memory-Based Heuristics , 1999, AAAI/IAAI.

[42]  Marco Valtorta,et al.  A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm , 1983, IJCAI.

[43]  Malte Helmert,et al.  A Planning Heuristic Based on Causal Graph Analysis , 2004, ICAPS.

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

[45]  Albert Nymeyer,et al.  Heuristic Search Algorithms Based on Symbolic Data Structures , 2003, Australian Conference on Artificial Intelligence.

[46]  Othar Hansson,et al.  A New Result on the Complexity of Heuristic Estimates for the A* Algorithm , 1992, Artif. Intell..

[47]  S. Kupferschmid,et al.  Adapting an AI Planning Heuristic for Directed Model Checking , 2006, SPIN.

[48]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

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

[50]  Stefan Edelkamp,et al.  External Symbolic Heuristic Search with Pattern Databases , 2005, ICAPS.

[51]  Richard E. Korf,et al.  Time complexity of iterative-deepening-A* , 2001, Artif. Intell..

[52]  Zhengzhu Feng,et al.  Symbolic Heuristic Search Using Decision Diagrams , 2002, SARA.

[53]  Stefan Edelkamp,et al.  Taming Numbers and Durations in the Model Checking Integrated Planning System , 2003, PuK.

[54]  Jonathan Schaeffer,et al.  Pattern Databases , 1998, Comput. Intell..