Complexity results for standard benchmark domains in planning

Artificial Intelligence

Volumn 143, Issue 2, 2003, Pages 219-262

  Helmert, Malte ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

Complexity of planning; Planning benchmarks; Planning domains; Transportation problems

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

TRANSPORTATION PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 0037301799     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00364-8     Document Type: Article

References (16)

1. Bacchus F. The AIPS'00 planning competition. AI Magazine. 22:(3):2001;47-56.
2. + planning. Comput. Intelligence. 11:(4):1995;625-655.
3. Blum A., Furst M. Fast planning through planning graph analysis. Artificial Intelligence. 90:(1-2):1997;281-300.
4. Bylander T. The computational complexity of propositional STRIPS planning. Artificial Intelligence. 69:(1-2):1994;165-204.
5. Erol K., Nau D.S., Subrahmanian V.S. Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence. 76:(1-2):1995;65-88.
6. Garey M.R., Johnson D.S. Computers and Intractability - A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco, CA.
7. Gupta N., Nau D.S. On the complexity of blocks-world planning. Artificial Intelligence. 56:(2-3):1992;223-254.
8. M. Helmert, On the complexity of planning in transportation and manipulation domains, Master's Thesis, Albert-Ludwigs-Universität Freiburg, 2001. Postscript available at http://www.informatik.uni-freiburg.de/̃ki/theses.html.
9. Hoffmann J. Local search topology in planning benchmarks: An empirical analysis. Proc. IJCAI-01, Seattle, WA. 2001;453-458.
10. Hoffmann J., Nebel B. The FF planning system: Fast plan generation through heuristic search. J. Artificial Intelligence Res. 14:2001;253-302.
11. Köhler J., Nebel B., Hoffmann J., Dimopoulos Y. Extending planning graphs to an ADL subset. Steel S., Alami R. Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97). Lecture Notes in Artifical Intelligence. 1348:1997;273-285 Springer, New York.
12. Köhler J., Schuster K. Elevator control as a planning problem. Chien S., Kambhampati S., Knoblock C.A. Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000), Breckenridge, CO. 2000;331-338.
13. Long D., Fox M. Automatic synthesis and use of generic types in planning. Chien S., Kambhampati S., Knoblock C.A. Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000), Breckenridge, CO. 2000;196-205.
14. McDermott D. The 1998 AI planning systems competition. AI Magazine. 21:(2):2000;35-55.
15. Selman B. Near-optimal plans, tractability, and reactivity. Doyle J., Sandewall E., Torasso P. Principles of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference (KR'94). 1994;521-529 Morgan Kaufmann, San Mateo, CA.
16. Slaney J., Thiébaux S. Blocks World revisited. Artificial Intelligence. 125:2001;119-153.