New complexity results for classical planning benchmarks

ICAPS 2006 - Proceedings, Sixteenth International Conference on Automated Planning and Scheduling

Volumn 2006, Issue , 2006, Pages 52-61

  Helmert, Malte ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; DECISION MAKING; OPTIMIZATION; PROBLEM SOLVING; THEOREM PROVING;

CLASSICAL PREPOSITIONAL PLANNING; OPTIMAL PARALLEL PLANS; OPTIMAL SEQUENTIAL PLANS; PLANNER PERFORMANCE;

STRATEGIC PLANNING;

EID: 33746067113     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Boddy, M.; Gohde, J.; Haigh, T.; and Harp, S. 2005. Course of action generation for cyber security using classical planning. In Proc. ICAPS 2005 (2005), 12-21.
2. Cormen, T. H.; Leiserson, C. E.; and Rivest, R. L. 1990. Introduction to Algorithms. The MIT Press.
3. Edelkamp, S., and Hoffmann, J. 2003. Quo vadis, IPC-4? - Proposals for the classical part of the 4th International Planning Competition. In Proc. ICAPS 2003 Workshop on the Competition.
4. Edelkamp, S. 2003. Limits and possibilities of PDDL for model checking software. In Proc. ICAPS 2003 Workshop on the Competition.
5. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman.
6. Hatzack, W., and Nebel, B. 2001. The operational traffic control problem: Computational complexity and solutions. In Proc. ECP 2001, 49-60.
7. Hearn, R. A., and Demaine, E. D. 2005. PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343(1-2):72-96.
8. Helmert, M.; Mattmüller, R.; and Roger, G. 2006. Approximation properties of planning benehmarks. Technical Report 224, Albert-Ludwigs- Universität Freiburg, Institut für Informatik.
9. Helmert, M. 2001. On the complexity of planning in transportation domains. In Proc. ECP 2001, 349-360.
10. Helmert, M. 2003. Complexity results for standard benehmark domains in planning. Artificial Intelligence 143(2):219-262.
11. Helmert, M. 2004. A planning heuristic based on causal graph analysis. In Proc. ICAPS 2004, 161-170.
12. Hoffmann, J., and Edelkamp, S. 2005. The deterministic part of IPC-4: An overview. JAIR 24:519-579.
13. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
14. Holzmann, G. J. 1997. The model checker SPIN. IEEE Transactions on Software Engineering 23(5):279-295.
15. 2005. Proc. ICAPS 2005.
16. Koehler, J.; Nebel, B.; Hoffmann, J.; and Dimopoulos, Y. 1997. Extending planning graphs to an ADL subset. In Proc. ECP-97. 273-285.
17. Long, D., and Fox, M. 2003. The 3rd International Planning Competition: Results and analysis. JAIR 20:1-59.
18. McDermott, D. 2000. The 1998 AI Planning Systems competition. AI Magazine 21(2):35-55.
19. Milidiú, R. L.; dos Santos Liporace, F.; and de Lucena, C. J. P. 2003. Pipesworld: Planning pipeline transportation of petroleum derivatives. In Proc. ICAPS 2003 Workshop on the Competition.
20. Pessoa, A. A. 2004. Planning the transportation of multiple commodities in bidirectional pipeline networks. In Fleischer, R., and Trippen, G., eds., Algorithms and Computation, 15th International Symposium (ISAAC 2004), volume 3341 of Lecture Notes in Computer Science, 766-777. New York: Springer-Verlag.
21. Slaney, J., and Thiébaux, S. 2001. Blocks World revisited. Artificial Intelligence 125:119-153.
22. Thiébaux, S., and Cordier, M.-O. 2001. Supply restoration in power distribution systems - a benchmark for planning under uncertainty. In Proc. ECP 2001, 85-95.