A Case Study on the Mergeability of Cases with a Partial-Order Planner

Retrieving multiple cases is supposed to be an adequate retrieval strategy for guiding partial-order planners because of the recognized flexibility of these planners to interleave steps in the plans. Cases are combined by merging them. In this paper, we will examine two different kinds of merging cases in the context of partial-order planning. We will see that merging cases can be very difficult if the cases are merged eagerly. On the other hand, if cases are merged by avoiding redundant steps, the guidance of the additional cases tends to decrease with the number of covered goals and retrieved cases in domains having a certain kind of interactions. Thus, to retrieve a single case covering many of the goals of the problem or to retrieve fewer cases covering many of the goals is at least equally effective as to retrieve several cases covering all goals in these domains.

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

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

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

[4]  Mark A. Peot,et al.  Postponing Threats in Partial-Order Planning , 1993, AAAI.

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

[6]  Subbarao Kambhampati,et al.  Combining Specialized Reasoners and General Purpose Planners: A Case Study , 1991, AAAI.

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

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

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

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

[11]  Ashwin Ram,et al.  A Domain-Independent Algorithm for Multi-Plan Adaptation and Merging in Least-Commitment Planners , 1995 .

[12]  Yolanda Gil,et al.  A specification of manufacturing processes for planning , 1991 .

[13]  Satyandra K. Gupta,et al.  AI Planning Versus Manufacturing-Operation Planning: A Case Study , 1995, IJCAI.

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

[15]  Frank Weberskirch,et al.  A Speciication of the Domain of Process Planning: Properties, Problems and Solutions , 1996 .

[16]  Michael M. Marefat,et al.  Hierarchical Plan Merging with Application to Process Planning , 1995, IJCAI.

[17]  Qiang Yang,et al.  Handling feature interactions in process-planning , 1992, Appl. Artif. Intell..

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

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

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

[21]  Caroline C. Hayes.  Using Goal Interactions to Guide Planning , 1987, AAAI.

[22]  Jana Koehler,et al.  Flexible Plan Reuse in a Formal Framework , 1994 .

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