A Domain-Independent Algorithm for Plan Adaptation

The paradigms of transformational planning, case-based planning, and plan debugging all involve a process known as plan adaptation -- modifying or repairing an old plan so it solves a new problem. In this paper we provide a domain-independent algorithm for plan adaptation, demonstrate that it is sound, complete, and systematic, and compare it to other adaptation algorithms in the literature. Our approach is based on a view of planning as searching a graph of partial plans. Generative planning starts at the graph's root and moves from node to node using plan-refinement operators. In planning by adaptation, a library plan--an arbitrary node in the plan graph--is the starting point for the search, and the plan-adaptation algorithm can apply both the same refinement operators available to a generative planner and can also retract constraints and steps from the plan. Our algorithm's completeness ensures that the adaptation algorithm will eventually search the entire graph and its systematicity ensures that it will do so without redundantly searching any parts of the graph.

[1]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[2]  Roger C. Schank,et al.  SCRIPTS, PLANS, GOALS, AND UNDERSTANDING , 1988 .

[3]  Anthony Barrett,et al.  Partial-Order Planning: Evaluating Possible Efficiency Gains , 1994, Artificial Intelligence.

[4]  Austin Tate,et al.  Generating Project Networks , 1977, IJCAI.

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

[6]  Jana Koehler,et al.  Avoiding Pitfalls in Case-based Planning , 1994, AIPS.

[7]  Manuela Veloso Learning by analogical reasoning in general problem-solving , 1992 .

[8]  Subbarao Kambhampati,et al.  On the Utility of Systematicity: Understanding Tradeoffs between Redundancy and Commitment in Partial-ordering Planning , 1993, IJCAI.

[9]  Richard Alterman,et al.  Adaptive Planning , 1988, Cogn. Sci..

[10]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[11]  James A. Hendler,et al.  A Validation-Structure-Based Theory of Plan Modification and Reuse , 1992, Artif. Intell..

[12]  Brian C. Williams,et al.  Interaction-Based Invention: Designing Novel Devices from First Principles , 1990, AAAI.

[13]  Dedre Gentner,et al.  STRUCTURE-MAPPING APPROACH TO ANALOGY AND METAPHOR. , 1982 .

[14]  Pat Langley,et al.  Toward an Experimental Science of Planning , 1990 .

[15]  Kristian J. Hammond,et al.  Explaining and Repairing Plans that Fail , 1987, IJCAI.

[16]  Oren Etzioni,et al.  Omnipotence Without Omniscience: Efficient Sensor Management for Planning , 1994, AAAI.

[17]  Reid G. Simmons,et al.  A Theory of Debugging Plans and Interpretations , 1988, AAAI.

[18]  Steven Minton,et al.  Quantitative Results Concerning the Utility of Explanation-based Learning , 1988, Artif. Intell..

[19]  Oren Etzioni,et al.  Omnipotence without Omniscience: Sensor Management in Planning , 1994, AAAI 1994.

[20]  C SchankRoger,et al.  Dynamic Memory: A Theory of Reminding and Learning in Computers and People , 1983 .

[21]  James A. Hendler,et al.  Readings in Planning , 1994 .

[22]  Daniel S. Weld,et al.  Innovative Design as Systematic Search , 1993, AAAI.

[23]  Paul R. Cohen,et al.  Benchmarks, Test Beds, Controlled Experimentation, and the Design of Agent Architectures , 1993, AI Mag..

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

[25]  Roger C. Schank,et al.  Dynamic memory - a theory of reminding and learning in computers and people , 1983 .

[26]  Mark A. Peot,et al.  Threat-Removal Strategies for Partial-Order Planning , 1993, AAAI.

[27]  Anthony Barrett,et al.  Task-Decomposition via Plan Parsing , 1994, AAAI.

[28]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[29]  Edwin P. D. Pednault,et al.  Synthesizing plans that contain actions with context‐dependent effects 1 , 1988, Comput. Intell..

[30]  Drew McDermott,et al.  Introduction to artificial intelligence , 1986, Addison-Wesley series in computer science.