Algorithms and Limits for Compact Plan Representations

Compact representations of objects is a common concept in computer science. Automated planning can be viewed as a case of this concept: a planning instance is a compact implicit representation of a graph and the problem is to find a path (a plan) in this graph. While the graphs themselves are represented compactly as planning instances, the paths are usually represented explicitly as sequences of actions. Some cases are known where the plans always have compact representations, for example, using macros. We show that these results do not extend to the general case, by proving a number of bounds for compact representations of plans under various criteria, like efficient sequential or random access of actions. In addition to this, we show that our results have consequences for what can be gained from reformulating planning into some other problem. As a contrast to this we also prove a number of positive results, demonstrating restricted cases where plans do have useful compact representations, as well as proving that macro plans have favourable access properties. Our results are finally discussed in relation to other relevant contexts.

[1]  Hubie Chen,et al.  Causal graphs and structurally restricted planning , 2010, J. Comput. Syst. Sci..

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

[3]  Earl D. Sacerdott.  Planning in a hierarchy of abstraction spaces , 1973, IJCAI 1973.

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

[5]  Malte Helmert,et al.  The Causal Graph Revisited for Directed Model Checking , 2009, SAS.

[6]  P. Pandurang Nayak,et al.  Remote Agent: To Boldly Go Where No AI System Has Gone Before , 1998, Artif. Intell..

[7]  Stefan Edelkamp,et al.  Summary of Dagstuhl Seminar 06172 on Directed Model Checking , 2007 .

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

[9]  Chee-Keng Yap,et al.  Some Consequences of Non-Uniform Conditions on Uniform Classes , 1983, Theor. Comput. Sci..

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

[11]  Maria Fox,et al.  Reformulation in Planning , 2002, SARA.

[12]  Paolo Liberatore,et al.  On the complexity of case-based planning , 2004, J. Exp. Theor. Artif. Intell..

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

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

[15]  Stefan Edelkamp,et al.  06172 Executive Summary -- Directed Model Checking , 2006, Directed Model Checking.

[16]  B. Nebel.  Complexity Results for Sas + Planning Christer Bb Ackstrr Om , 1993 .

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

[18]  Arthur Gill.  Applied algebra for the computer sciences , 1976 .

[19]  Luca Spalzzi,et al.  A Survey on Case-Based Planning , 2001 .

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

[21]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[22]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

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

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

[25]  Harry Buhrman,et al.  New applications of the incompressibility method: Part II , 1998, Theor. Comput. Sci..

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

[27]  Christer Bäckström,et al.  Limits for compact representations of plans , 2011, ICAPS 2011.

[28]  Ronen I. Brafman,et al.  Strucutre and Complexitiy in Planning with Unary Operators , 2000, PuK.

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

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

[31]  Mihalis Yannakakis,et al.  On Generating All Maximal Independent Sets , 1988, Inf. Process. Lett..

[32]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[33]  Christer Bäckström,et al.  Planning in polynomial time: the SAS‐PUBS class , 1991, Comput. Intell..

[34]  Richard W. Southwick.  Explaining reasoning: an overview of explanation in knowledge-based systems , 1991, The Knowledge Engineering Review.

[35]  Christer Bäckström,et al.  State-Variable Planning Under Structural Restrictions: Algorithms and Complexity , 1998, Artif. Intell..

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

[37]  Christer Bäckström,et al.  Tractable plan existence does not imply tractable plan generation , 2004, Annals of Mathematics and Artificial Intelligence.

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

[39]  Jörg Hoffmann,et al.  Ordered Landmarks in Planning , 2004, J. Artif. Intell. Res..

[40]  Christer Backstrom,et al.  Computational Complexity of Reasoning about Plans , 1992 .

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

[42]  Bernhard Nebel,et al.  Plan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis , 1995, Artif. Intell..

[43]  Fahiem Bacchus,et al.  Using temporal logics to express search control knowledge for planning , 2000, Artif. Intell..

[44]  Craig A. Knoblock.  Generating abstraction hierarchies - an automated approach to reducing search in planning , 1993, The Kluwer international series in engineering and computer science.

[45]  Christer Bäckström,et al.  Expressive Equivalence of Planning Formalisms , 1995, Artif. Intell..

[46]  Christer Bäckström,et al.  Planning with Abstraction Hierarchies can be Exponentially Less Efficient , 1995, IJCAI.

[47]  Wolfgang Minker,et al.  Verbal Plan Explanations for Hybrid Planning , 2010, MKWI.

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

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

[50]  Christer Bäckström,et al.  All PSPACE-Complete Planning Problems Are Equal but Some Are More Equal than Others , 2011, SOCS.

[51]  Klaus W. Wagner,et al.  The complexity of combinatorial problems with succinct input representation , 1986, Acta Informatica.

[52]  Richard E. Korf,et al.  Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..

[53]  Luca Spalazzi,et al.  A Survey on Case-Based Planning , 2004, Artificial Intelligence Review.

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

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

[56]  José L. Balcázar.  The Complexity of Searching Implicit Graphs , 1996, Artif. Intell..

[57]  Eugene Fink,et al.  Integrating planning and learning: the PRODIGY architecture , 1995, J. Exp. Theor. Artif. Intell..

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