On the Complexity of Domain-Independent Planning

In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show how the time complexity varies depending on a wide variety of conditions: • whether or not delete lists are allowed; • whether or not negative preconditions are allowed; • whether or not the predicates are restricted to be propositions (i.e., 0-ary); • whether the planning operators are given as part of the input to the planning problem, or instead are fixed in advance.

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

[2]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[3]  Ronald L. Graham,et al.  Concrete Mathematics, a Foundation for Computer Science , 1991, The Mathematical Gazette.

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

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

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

[7]  Dana S. Nau,et al.  Complexity Results for Blocks-World Planning , 1991, AAAI.

[8]  Tom Bylander,et al.  Complexity Results for Planning , 1991, IJCAI.

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Dana S. Nau,et al.  On the Complexity of Blocks-World Planning , 1992, Artif. Intell..

[11]  V. S. Subrahmanian,et al.  When is Planning Decidable?**This work was supported in part by NSF Grant NSFD CDR-88003012 to the University of Maryland Systems Research Center, as well as NSF grants IRI-8907890 and IRI-9109755. , 1992 .

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

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

[14]  James A. Hendler,et al.  Optimization of multiple-goal plans with limited interaction , 1990 .

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