On the complexity of case-based planning

This paper analyses the computational complexity of problems related to case-based planning: planning when a plan for a similar instance is known, and planning from a library of plans. It is proven that planning from a single case has the same complexity than generative planning (i.e. planning ‘from scratch’); using an extended definition of cases, complexity is reduced if the domain stored in the case is similar to the one to search plans for. Planning from a library of cases is shown to have the same complexity. In both cases, the complexity of planning remains, in the worst case, PSPACE-complete.

[1]  Tom Bylander,et al.  A Probabilistic Analysis of Propositional STRIPS Planning , 1996, Artif. Intell..

[2]  Jana Koehler,et al.  Planning from Second Principles , 1996, Artif. Intell..

[3]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[4]  Stefan Wess,et al.  Case-Based Reasoning Technology: From Foundations to Applications , 1998, Lecture Notes in Computer Science.

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

[6]  Kristian J. Hammond,et al.  Case-Based Planning: Viewing Planning as a Memory Task , 1989 .

[7]  Jaime G. Carbonell,et al.  Derivational Analogy in PRODIGY: Automating Case Acquisition, Storage, and Utilization , 1993, Machine Learning.

[8]  Bernhard Nebel,et al.  Plan Modification versus Plan Generation: A Complexity-Theoretic Perspective , 1993, IJCAI.

[9]  Bernhard Nebel,et al.  On the Computational Complexity of Planning and Story Understanding , 1992, ECAI.

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

[11]  Christer Bäckström.  Equivalence and Tractability Results for SAS+ Planning , 1992, KR.

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

[13]  Kristian J. Hammond,et al.  Chapter 8 – Case-based Planning , 1989 .

[14]  Francesco M. Donini,et al.  Preprocessing of Intractable Problems , 2002, Inf. Comput..

[15]  Subbarao Kambhampati,et al.  Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures , 1997, J. Artif. Intell. Res..

[16]  Jaime G. Carbonell,et al.  Derivational analogy: a theory of reconstructive problem solving and expertise acquisition , 1993 .

[17]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

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

[19]  Hector Muñoz-Avila,et al.  On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework , 2002, ECCBR.

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

[21]  Tom Bylander,et al.  Complexity Results for Planning , 1991, IJCAI.

[22]  Manuela M. Veloso,et al.  Flexible Strategy Learning: Analogical Replay of Problem Solving Episodes , 1994, AAAI.

[23]  Daniel S. Weld,et al.  A Domain-Independent Algorithm for Plan Adaptation , 1994, J. Artif. Intell. Res..

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

[25]  Ian D. Watson,et al.  Applying case-based reasoning - techniques for the enterprise systems , 1997 .

[26]  Subbarao Kambhampati,et al.  Mapping and Retrieval During Plan Reuse: A Validation Structure Based Approach , 1990, AAAI.

[27]  Paolo Liberatore.  Monotonic reductions, representative equivalence, and compilation of intractable problems , 2001, JACM.

[28]  Agnar Aamodt,et al.  Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches , 1994, AI Commun..

[29]  Bernhard Nebel,et al.  Ignoring Irrelevant Facts and Operators in Plan Generation , 1997, ECP.

[30]  Bernhard Nebel,et al.  On the Computational Complexity of Temporal Projection, Planning, and Plan Validation , 1994, Artif. Intell..

[31]  Subbarao Kambhampati,et al.  A Theory of Plan Modification , 1990, AAAI.

[32]  Janet L. Kolodner,et al.  Case-Based Reasoning , 1989, IJCAI 1989.

[33]  Ralph Bergmann,et al.  CBR Applied to Planning , 1998, Case-Based Reasoning Technology.

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