Design and Implementation of a Replay Framework Based on a Partial Order Planner

In this paper we describe the design and implementation of the derivation replay framework, DERSNLP+EBL (Derivational SNLP+EBL), which is based within a partial order planner. DERSNLP+EBL replays previous plan derivations by first repeating its earlier decisions in the context of the new problem situation, then extending the replayed path to obtain a complete solution for the new problem. When the replayed path cannot be extended into a new solution, explanation-based learning (EBL) techniques are employed to identify the features of the new problem which prevent this extension. These features are then added as censors on the retrieval of the stored case. To keep retrieval costs low, DERSNLP+EBL normally stores plan derivations for individual goals, and replays one or more of these derivations in solving multi-goal problems. Cases covering multiple goals are stored only when subplans for individual goals cannot be successfully merged. The aim in constructing the case library is to predict these goal interactions and to store a multi-goal case for each set of negatively interacting goals. We provide empirical results demonstrating the effectiveness of DERSNLP+EBL in improving planning performance on randomly-generated problems drawn from a complex domain.

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

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

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

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

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

[6]  Laurie H. Ihrig.  The design and implementation of a case-based planning framework within a partial-order planner , 1996 .

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

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

[9]  Steven Minton,et al.  Machine Learning Methods for Planning , 1994 .

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

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

[12]  Kristian J. Hammond,et al.  CHEF: A Model of Case-Based Planning , 1986, AAAI.

[13]  Subbarao Kambhampati,et al.  Learning Expla sed Search Control Rules For Partial Order Planning , 1994 .

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

[15]  Subbarao Kambhampati,et al.  An explanation-based approach to improve retrieval in case-based planning , 1996 .

[16]  Jaime G. Carbonell,et al.  Control Knowledge to Improve Plan Quality , 1994, AIPS.

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

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

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

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