The deterministic part of IPC-4: An overview

Journal of Artificial Intelligence Research

Volumn 24, Issue , 2005, Pages 519-579

  Hoffmann, Jörg ^a   Edelkamp, Stefan ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPETITION; DATA ACQUISITION; ONLINE SYSTEMS; PLANNING; SET THEORY;

APPENDIX; COMPETING SYSTEMS; PREDECESSORS; PRIZES;

SOCIETIES AND INSTITUTIONS;

EID: 31144462519     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1677     Document Type: Article

References (44)

1. Bacchus, F. (2000). Subset of PDDL for the AIPS2000 Planning Competition. The AIPS-00 Planning Competition Committee.
2. Bacchus, F. (2001). The AIPS'00 planning competition. The AI Magazine, 22(3), 47-56.
3. Bertoli, P., Cimatti, A., Slaney, J., & Thiébaux, S. (2002). Solving power supply restoration problems with planning via symbolic model-checking. In Harmelen, F. V. (Ed.), Proceedings of the 15th European Conference on Artificial Intelligence (ECAI-02), pp. 576-580, Lyon, France. Wiley.
4. Blum, A. L., & Furst, M. L. (1995). Fast planning through planning graph analysis. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 1636-1642, Montreal, Canada. Morgan Kaufmann.
5. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 279-298.
6. Bonet, B., & Thiebaux, S. (2003). GPT meets PSR. In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS-03), pp. 102-111, Trento, Italy. Morgan Kaufmann.
7. Cesta, A., & Borrajo, D. (Eds.). (2001). Recent Advances in AI Planning. 6th European Conference on Planning (ECP'01), Toledo, Spain. Springer-Verlag.
8. Clarke, E. M., Grumberg, O., & Peled, D. (2000). Model Checking. MIT Press.
9. Edelkamp, S. (2003a). Limits and possibilities of PDDL for model checking software.. In Edelkamp, & Hoffmann (Edelkamp & Hoffmann, 2003).
10. Edelkamp, S. (2003b). Promela planning. In Proceedings of Model Checking Software (SPIN), pp. 197-212.
11. Edelkamp, S. (2003c). Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Intelligence Research, 20, 195-238.
12. Edelkamp, S., & Hoffmann, J. (Eds.). (2003). Proceedings of Workshop on the Competition: Impact, Organization, Evaluation, Benchmarks, at ICAPS'03. AAAI Press.
13. Edelkamp, S., Hoffmann, J., Englert, R., Liporace, F., Thiebaux, S., & Trüg, S. (2005). Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4. Journal of Artificial Intelligence Research. Submitted.
14. Edelkamp, S., Hoffmann, J., Littman, M., & Younes, H. (Eds.). (2004). Proceedings of the 4th International Planning Competition. JPL.
15. Englert, R. (2003). Re-scheduling with temporal and operational resources for the mobile execution of dynamic UMTS applications. In KI-Workshop AI in Planning, Scheduling, Configuration and Design (PUK).
16. Englert, R. (2005). Planning to optimize the UMTS call set-up for the execution of mobile agents. Journal of Applied Artificial Intelligence (AAI), 19(2), 99-117.
17. Fikes, R. E., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2, 189-208.
18. Fox, M., Long, D., & Halsey, K. (2004). An investigation into the expressive power of PDDL2.1. In Saitta, L. (Ed.), Proceedings of the 16th European Conference on Artificial Intelligence (ECAI-04), Valencia, Spain. Wiley.
19. Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20, 61-124.
20. Gerevini, A., Saetti, A., & Serina, I. (2003). Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research, 20, 239-290.
21. Haslum, P., & Geffner, H. (2001). Heuristic planning with time and resources.. In Cesta, & Borrajo (Cesta & Borrajo, 2001), pp. 121-132.
22. Hatzack, W., & Nebel, B. (2001). The operational traffic control problem: Computational complexity and solutions.. In Cesta, & Borrajo (Cesta &z Borrajo, 2001), pp. 49-60.
23. Helmert, M. (2001). On the complexity of planning in transportation domains.. In Cesta, & Borrajo (Cesta & Borrajo, 2001), pp. 349-360.
24. Helmert, M. (2003). Complexity results for standard benchmark domains in planning. Artificial Intelligence, 143, 219-262.
25. Helmert, M. (2004). A planning heuristic based on causal graph analysis. In Koenig, S., Zilberstein, S., & Koehler, J. (Eds.), Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04), pp. 161-170, Whistler, Canada. Morgan Kaufmann.
26. Hipke, C. A. (2000). Distributed Visualization of Geometric Algorithms. Ph.D. thesis, University of Freiburg.
27. Hoffmann, J. (2003). The Metric-FF planning system: Translating "ignoring delete lists" to numeric state variables. Journal of Artificial Intelligence Research, 20, 291-341.
28. Hoffmann, J. (2005). Where ignoring delete lists works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research. To appear.
29. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
30. Holzmann, G. J. (2004). The SPIN model checker: Primer and reference manual. Addison Wesley.
31. Long, D., & Fox, M. (2003). The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research, 20, 1-59.
32. McDermott, D. (2000). The 1998 AI planning systems competition. The AI Magazine, 21(2), 35-55.
33. McDermott, D., et al. (1998). The PDDL Planning Domain Definition Language. The AIPS-98 Planning Competition Committee.
34. Milidiú, R. L., & dos Santos Liporace, F. (2004). Plumber, a pipeline transportation planner. In Proceedings of the International Workshop on Harbour and Maritime Simulation, HMS, pp. 99-106, Rio de Janeiro, Brazil.
35. Milidiu, R. L., dos Santos Liporace, F., & de Lucena, C. J. (2003). Pipesworld: Planning pipeline transportation of petroleum derivatives.. In Edelkamp, & Hoffmann (Edelkamp & Hoffmann, 2003).
36. Pednault, E. P. (1989). ADL: Exploring the middle ground between STRIPS and the situation calculus. In Brachman, R., Levesque, H. J., & Reiter, R. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 1st International Conference (KR-89), pp. 324-331, Toronto, ON. Morgan Kaufmann.
37. Penberthy, J. S., &: Weld, D. S. (1992). UCPOP: A sound, complete, artial order planner for ADL. In Nebel, B., Swartout, W., & Rich, C. (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference (KR-92), pp. 103-114, Cambridge, MA. Morgan Kaufmann.
38. Thiébaux, S., & Cordier, M.-O. (2001). Supply restoration in power distribution systems a benchmark for planning under uncertainty.. In Cesta, & Borrajo (Cesta & Borrajo, 2001), pp. 85-95.
39. Thiébaux, S., Cordier, M.-O., Jehl, O., & Krivine, J.-P. (1996). Supply restoration in power distribution systems - a case study in integrating model-based diagnosis and repair planning. In Horvitz, E., & Jensen, F. (Eds.), Proceedings of the, 12th International Conference on Uncertainty in AI (UAI-96), pp. 525-532, Portland, OR, USA. Morgan Kaufmann.
40. Thiebaux, S., Hoffmann, J., & Nebel, B. (2003). In defence of PDDL axioms. In Gottlob, G. (Ed.), Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 961-966, Acapulco, Mexico. Morgan Kaufmann.
41. Thiebaux, S., Hoffmann, J., & Nebel, B. (2005). In defence of PDDL axioms. Artificial Intelligence. To appear.
42. Trüg, S., Hoffmann, J., & Nebel, B. (2004). Applying automatic planning systems to airport ground-traffic control - a feasibility study. In Biundo, S., Frühwirth, T., & Palm, G. (Eds.), KI-04: Advances in Artificial Intelligence, pp. 183-197, Ulm, Germany. Springer-Verlag.
43. Vidal, V., & Geffner, H. (2004). Branching and pruning: An optimal temporal POCL planner based on constraint programming. In Proceedings of the 19th National Conference of the American Association for Artificial Intelligence (AAAI-04), pp. 570-577, San Jose, CA. MIT Press.
44. Younes, H., & Littman, M. (2005). Probabilistic part of the 4th international planning competition. Journal of Artificial Intelligence Research. Submitted.