Complexity results for state-variable planning under mixed syntactical and structural restrictions

Most tractable planning problems reported in the literature have been deened by syntactical restrictions. To better exploit the inherent structure of problems, however, it is probably necessary to study also structural restrictions on the state-transition graph. We present an almost exhaustive map of complexity results for state-variable planning under all combinations of our previously analysed syntactical (P, U, B, S) and structural (I, A, O) restrictions, considering both optimal and non-optimal plan generation.

[1]  Christer Bäckström,et al.  Parallel Non-Binary Planning in Polynomial Time , 1991, IJCAI.

[2]  V. S. Subrahmanian,et al.  On the Complexity of Domain-Independent Planning , 1992, AAAI.

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

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

[5]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

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

[7]  Christer Backstrom,et al.  Computational Complexity of Reasoning about Plans , 1992 .

[8]  Bernhard Nebel,et al.  COMPLEXITY RESULTS FOR SAS+ PLANNING , 1995, Comput. Intell..

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

[10]  Tom Bylander,et al.  Complexity Results for Serial Decomposability , 1992, AAAI.

[11]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

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

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

[14]  T. Bylander.  Complexity results for extended planning , 1992 .

[15]  Christer Bäckström,et al.  Tractable Planning with State Variables by Exploiting Structural Restrictions , 1994, AAAI.

[16]  Christer Bäckström.  Equivalence and Tractability Results for SAS+ Planning , 1992, KR.

[17]  Christer Bäckström,et al.  Planning in polynomial time: the SAS‐PUBS class , 1991, Comput. Intell..

[18]  Fritz Mädler,et al.  Towards structural abstraction , 1992 .