Storing and Indexing Plan Derivations through Explanation-based Analysis of Retrieval Failures

Case-Based Planning (CBP) provides a way of scaling up domain-independent planning to solve large problems in complex domains. It replaces the detailed and lengthy search for a solution with the retrieval and adaptation of previous planning experiences. In general, CBP has been demonstrated to improve performance over generative (from-scratch) planning. However, the performance improvements it provides are dependent on adequate judgements as to problem similarity. In particular, although CBP may substantially reduce planning effort overall, it is subject to a mis-retrieval problem. The success of CBP depends on these retrieval errors being relatively rare. This paper describes the design and implementation of a replay framework for the case-based planner DERSNLP+EBL. DERSNLP+EBL extends current CBP methodology by incorporating explanation-based learning techniques that allow it to explain and learn from the retrieval failures it encounters. These techniques are used to refine judgements about case similarity in response to feedback when a wrong decision has been made. The same failure analysis is used in building the case library, through the addition of repairing cases. Large problems are split and stored as single goal subproblems. Multi-goal problems are stored only when these smaller cases fail to be merged into a full solution. An empirical evaluation of this approach demonstrates the advantage of learning from experienced retrieval failure.

[1]  J. Carbonell Learning by Analogy: Formulating and Generalizing Plans from Past Experience , 1983 .

[2]  James A. Hendler,et al.  MERGING SEPARATELY GENERATED PLANS WITH RESTRICTED INTERACTIONS , 1992, Comput. Intell..

[3]  David B. Leake,et al.  Using Introspective Reasoning to Refine Indexing , 1995, IJCAI.

[4]  Ashwin Ram,et al.  MULTI-PLAN RETRIEVAL AND ADAPTATION IN AN EXPERIENCE-BASED AGENT , 1996 .

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

[6]  Subbarao Kambhampati,et al.  Derivation Replay for Partial-Order Planning , 1994, AAAI.

[7]  Subbarao Kambhampati,et al.  Relative Utility of EBG based Plan Reuse in Partial Ordering vs. Total Ordering Planning , 1993, AAAI.

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

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

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

[11]  Hector Muñoz-Avila,et al.  A Case Study on the Mergeability of Cases with a Partial-Order Planner , 1997, ECP.

[12]  Manuela M. Veloso,et al.  Planning and Learning by Analogical Reasoning , 1994, Lecture Notes in Computer Science.

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

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

[15]  Subbarao Kambhampati,et al.  Planning as Refinement Search: A Unified Framework for Evaluating Design Tradeoffs in Partial-Order Planning , 1995, Artif. Intell..

[16]  Subbarao Kambhampati,et al.  Failure Driven Dynamic Search Control for Partial Order Planners: An Explanation Based Approach , 1996, Artif. Intell..

[17]  Robert B. Doorenbos Production Matching for Large Learning Systems , 1995 .

[18]  Hector Muñoz-Avila,et al.  Planning for Manufacturing Workpieces by Storing, Indexing and Replaying Planning Decisions , 1996, AIPS.

[19]  Manuela M. Veloso,et al.  Linkability: Examining Causal Link Commitments in Partial-order Planning , 1994, AIPS.

[20]  Subbarao Kambhampati,et al.  Design and Implementation of a Replay Framework Based on a Partial Order Planner , 1996, AAAI/IAAI, Vol. 1.

[21]  Ralph Bergmann,et al.  Building and Refining Abstract Planning Cases by Change of Representation Language , 1995, J. Artif. Intell. Res..

[22]  Ashwin Ram,et al.  Introspective reasoning using meta-explanations for multistrategy learning , 1995 .

[23]  Jack Mostow,et al.  Failsafe - A Floor Planner that Uses EBG to Learn from Its Failures , 1987, IJCAI.

[24]  Steven Minton Issues in the Design of Operator Composition Systems , 1990, ML.

[25]  Ashwin Ram,et al.  A Comparitive Utility Analysis of Case-Based Reasoning and Control-Rule Learning Systems , 1995, ECML.

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

[27]  John W. Roach,et al.  A Theoretical Analysis of Conjunctive-Goal Problems , 1989, Artif. Intell..

[28]  Jaime G. Carbonell,et al.  Toward Scaling Up Machine Learning: A Case Study with Derivational Analogy in PRODIGY , 1993 .

[29]  Subbarao Kambhampati,et al.  Plan-space vs state-space planning in reuse and replay , 1996 .

[30]  Michael Redmond,et al.  Distributed Cases for Case-Based Reasoning: Facilitating Use of Multiple Cases , 1990, AAAI.

[31]  Gerald DeJong,et al.  COMPOSER: A Probabilistic Solution to the Utility Problem in Speed-Up Learning , 1992, AAAI.

[32]  Subbarao Kambhampati,et al.  A Candidate Set Based Analysis of Subgoal Interactions in Conjunctive Goal Planning , 1996, AIPS.

[33]  Subbarao Kambhampati,et al.  EXPLOITING CAUSAL STRUCTURE TO CONTROL RETRIEVAL AND REFITTING DURING PLAN REUSE , 1994, Comput. Intell..

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

[35]  William Mark,et al.  Explanation-Based Indexing of Cases , 1988, AAAI.

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

[37]  David B. Leake,et al.  Learning to Refine Indexing by Introspective Reasoning , 1995, ICCBR.

[38]  Kilian Stoffel,et al.  High Performance Support for Case-Based Planning Applications* , 1996 .

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