Multi-Contributor Causal Structures for Planning: A Formalization and Evaluation

Abstract Explicit causal structure representations have been widely used in classical planning systems to guide a variety of aspects of planning, including plan generation, modification and generalization. For the most part, these representations were limited to single-contributor causal structures. Although widely used, single-contributor causal structures have several limitations in handling partially ordered and partially instantiated plans. Specifically they are (i) incapable of exploiting redundancy in the plan causal structure and (ii) force premature commitment to individual contributors thereby causing unnecessary backtracking. In this paper, we study multi-contributor causal structures as a way of overcoming these limitations. We will provide a general formulation for multi-contributor causal links, and explore the properties of several special classes of this formulation. We will then describe two planning algorithms—MP and MP-I—that use multi-contributor causal links to organize their search for plans. We will describe empirical studies demonstrating the advantages of MP and MP-I over planners that use single contributor causal structures, and argue that they strike a more favorable balance in the tradeoff between search space redundancy and premature commitment to contributors. Finally, we will present a framework for justifying plans with respect to multi-contributor causal structures and describe its applications in plan modification and generalization.

[1]  Austin Tate,et al.  Interacting Goals And Their Use , 1975, IJCAI.

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

[3]  Subbarao Kambhampati,et al.  A Unified Framework for Explanation-Based Generalization of Partially Ordered and Partially Instantiated Plans , 1994, Artif. Intell..

[4]  Subbarao Kambhampati,et al.  On the Nature and Role of Modal Truth Criteria in Planning , 1996, Artif. Intell..

[5]  Steve Ankuo Chien An explanation-based learning approach to incremental planning , 1991 .

[6]  Subbarao Kambhampati,et al.  Refinement Search as a Unifying Framework for Analyzing Planning Algorithms , 1994, KR.

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

[8]  Joachim Hertzberg,et al.  Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans , 1989, IJCAI.

[9]  Austin Tate,et al.  Goal Structure, Holding Periods and “Clouds” , 1987 .

[10]  Jens Christensen A Hierarchical Planner that Generates Its Own Hierarchies , 1990, AAAI.

[11]  Martha E. Pollack,et al.  A Model of Plan Inference That Distinguishes Between the Beliefs of Actors and Observers , 1986, ACL.

[12]  Melville C. Branch,et al.  Planning and Operations Research , 1957 .

[13]  P. Langley Systematic and nonsystematic search strategies , 1992 .

[14]  Austin Tate,et al.  O-Plan: The open Planning Architecture , 1991, Artif. Intell..

[15]  Subbarao Kambhampati,et al.  Planning as Refinement Search: A unified framework for comparative analysis of Search Space Size and Performance , 1995 .

[16]  Steven Minton,et al.  Commitment Strategies in Planning: A Comparative Analysis , 1991, IJCAI.

[17]  Richard Waldinger,et al.  Achieving several goals simultaneously , 1977 .

[18]  P. Rosenbloom,et al.  Bias in Planning and Explanation-Based Learning , 1993 .

[19]  Daniel S. Weld,et al.  Systematic adaptation for case-based planning , 1992 .

[20]  Qiang Yang,et al.  ABTWEAK: Abstracting a Nonlinear, Least Commitment Planner , 1990, AAAI.

[21]  Gerald Jay Sussman,et al.  A Computer Model of Skill Acquisition , 1975 .

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

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

[24]  Earl D. Sacerdoti,et al.  Planning in a Hierarchy of Abstraction Spaces , 1974, IJCAI.

[25]  S. Kambhampati Characterizing multi-contributor causal structures for planning , 1992 .

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

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

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

[29]  Keith Price,et al.  Review of "Principles of Artificial Intelligence by Nils J. Nilsson", Tioga Publishing Company, Palo Alto, CA, ISBN 0-935382-01-1. , 1980, SGAR.

[30]  David E. Wilkins,et al.  Domain-Independent Planning: Representation and Plan Generation , 1984, Artif. Intell..

[31]  Mark Jeffrey Stefik Planning with constraints , 1980 .

[32]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[33]  Qiang Yang,et al.  Characterizing Abstraction Hierarchies for Planning , 1991, AAAI.