Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length

In this paper we present a general-purposed algorithm for transforming a planning problem specified in Strips into a concise state description for single state or symbolic exploration.

[1]  D. Long,et al.  E cient Implementation of the Plan Graph in STAN , 1999 .

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

[3]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

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

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

[6]  Jonathan Schaeffer,et al.  Single-Agent Search in the Presence of Deadlocks , 1998, AAAI/IAAI.

[7]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[8]  R. Korf.  An Optimal Admissible Tree Search , 1985 .

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

[10]  S. Edelkamp,et al.  Deterministic State Space Planning with BDDs , 1999 .

[11]  Sven Schuierer,et al.  Efficient Memory-Limited Graph Search , 1995, KI.

[12]  Richard E. Korf,et al.  Complexity Analysis of Admissible Heuristic Search , 1998, AAAI/IAAI.

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

[14]  Stuart J. Russell.  Eecient Memory-bounded Search Methods , 1992 .

[15]  Otthein Herzog,et al.  KI-98: Advances in Artificial Intelligence , 1998, Lecture Notes in Computer Science.

[16]  Maria Fox,et al.  The Detection and Exploitation of Symmetry in Planning Problems , 1999, IJCAI.

[17]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

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

[19]  Stuart J. Russell.  Efficient Memory-Bounded Search Methods , 1992, ECAI.

[20]  Edwin P. D. Pednault,et al.  ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus , 1989, KR.

[21]  Alexander Reinefeld,et al.  Enhanced Iterative-Deepening Search , 1994, IEEE Trans. Pattern Anal. Mach. Intell..

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

[23]  Richard E. Korf,et al.  The Branching Factor of Regular Search Spaces , 1998, AAAI/IAAI.

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

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

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