Macros, Reactive Plans and Compact Representations

The use and study of compact representations of objects is widespread in computer science. AI planning can be viewed as the problem of finding a path in a graph that is implicitly described by a compact representation in a planning language. However, compact representations of the path itself (the plan) have not received much attention in the literature. Although both macro plans and reactive plans can be considered as such compact representations, little emphasis has been placed on this aspect in earlier work. There are also compact plan representations that are defined by their access properties, for instance, that they have efficient random access or efficient sequential access. We formally compare two such concepts with macro plans and reactive plans, viewed as compact representations, and provide a complete map of the relationships between them.

[1]  Bernhard Nebel,et al.  On the Compilability and Expressive Power of Propositional Planning Formalisms , 2000, J. Artif. Intell. Res..

[2]  Richard E. Korf,et al.  Using Partitions and Superstrings for Lossless Compression of Pattern Databases , 2011, AAAI.

[3]  Anders Jonsson.  The Role of Macros in Tractable Planning , 2009, J. Artif. Intell. Res..

[4]  P. Pandurang Nayak,et al.  A Reactive Planner for a Model-based Executive , 1997, IJCAI.

[5]  Anders Jonsson,et al.  The Complexity of Planning Problems With Simple Causal Graphs , 2008, J. Artif. Intell. Res..

[6]  Andrei A. Bulatov,et al.  A Simple Algorithm for Mal'tsev Constraints , 2006, SIAM J. Comput..

[7]  Jos,et al.  The Complexity of Searching Implicit Graphs , 1996 .

[8]  Abhi Shelat,et al.  The smallest grammar problem , 2005, IEEE Transactions on Information Theory.

[9]  Christopher W. Geib,et al.  Assessing the Complexity of Plan Recognition , 2004, AAAI.

[10]  Patrik Haslum,et al.  Towards efficient universal planning: A randomized approach , 2000, Artif. Intell..

[11]  Blai Bonet,et al.  Planning with Incomplete Information as Heuristic Search in Belief Space , 2000, AIPS.

[12]  Kunihiko Sadakane,et al.  Compressed random access memory , 2010, ArXiv.

[13]  Richard E. Korf,et al.  Compressed Pattern Databases , 2007, J. Artif. Intell. Res..

[14]  Richard E. Korf,et al.  Linear-time disk-based implicit graph search , 2008, JACM.

[15]  Marco Schaerf,et al.  On the size of data structures used in symbolic model checking , 2010, ArXiv.

[16]  Craig Boutilier,et al.  Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations , 1996, AAAI/IAAI, Vol. 2.

[17]  Wojciech Rytter,et al.  Application of Lempel-Ziv factorization to the approximation of grammar-based compression , 2002, Theor. Comput. Sci..

[18]  Blai Bonet,et al.  Conformant plans and beyond: Principles and complexity , 2010, Artif. Intell..

[19]  Patrik Haslum,et al.  Planning with Reduced Operator Sets , 2000, AIPS.

[20]  Christer Bäckström,et al.  Algorithms and Limits for Compact Plan Representations , 2012, J. Artif. Intell. Res..

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

[22]  Avi Wigderson,et al.  Succinct Representations of Graphs , 1984, Inf. Control..

[23]  Gad M. Landau,et al.  Random access to grammar-compressed strings , 2010, SODA '11.

[24]  Paolo Liberatore,et al.  Complexity Issues in Finding Succinct Solutions of PSPACE-Complete Problems , 2005, ArXiv.

[25]  Prosenjit Bose,et al.  Efficient visibility queries in simple polygons , 2002, Comput. Geom..

[26]  Christer Bäckström,et al.  From Macro Plans to Automata Plans , 2012, ECAI.

[27]  Francesco M. Donini,et al.  Space Efficiency of Propositional Knowledge Representation Formalisms , 2000, J. Artif. Intell. Res..