Engineering benchmarks for planning: The domains used in the deterministic part of IPC-4

Journal of Artificial Intelligence Research

Volumn 26, Issue , 2006, Pages 453-541

  Hoffmann, Jörg ^a   Edelkamp, Stefan ^b   Thiébaux, Sylvie ^c   Englert, Roman ^d   Dos Santos Liporace, Frederico ^e   Trüg, Sebastian ^f  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b TU DORTMUND UNIVERSITY   (Germany)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^d DEUTSCHE TELEKOM LABORATORIES   (Germany)

^e PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^f UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AIRPORT VEHICULAR TRAFFIC; BENCHMARKING; COMPETITION; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SAFETY FACTOR;

PIPELINE NETWORKS; POWER SUPPLY RESTORATION; SAFETY PROPERTIES; STRUCTURAL PROPERTIES;

LEARNING ALGORITHMS;

EID: 33748987920     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1982     Document Type: Article

References (93)

1. 3GPP (2004). 3G Partnership Project, www.3gpp.org.
2. Appleby, S., & Steward, T. (1999). Mobile Software Agents for Control in Telecommunication Networks, chap. 11 in Hayzelden, A./Bigham, J. (eds.), Software Agents for Future Telecommunication Systems. Springer.
3. Apt, K., Blair, H., & Walker, A. (1988). Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming, pp. 89-148. Morgan Kaufmann.
4. Bacchus, F., & Kabanza, F. (2000). Using temporal logics to express search control knowledge for planning. Artificial Intelligence, 116, 123-191.
5. Bacchus, F. (2000). Subset of PDDL for the AIPS2000 Planning Competition. The AIPS-00 Planning Competition Comitee. Available at http://www.cs.toronto.edu/aips2000/pddl-subset.ps.
6. Bacchus, F. (2001). The AIPS'00 planning competition. The AI Magazine, 22(3), 47-56.
7. Bertoli, P., Cimatti, A., Roveri, M., & Traverso, P. (2001). Planning in nondeterministic domains under partial observability via symbolic model checking.. In Nebel (Nebel, 2001).
8. Bertoli, P., Cimatti, A., Slaney, J., & Thiébaux, S. (2002). Solving power supply restoration problems with planning via symbolic model checking. In Proceedings of the 15th European Conference on Artificial Intelligence (ECAI-02), pp. 576-80, Lyon, France. Wiley.
9. Biundo, S., Myers, K., & Rajan, K. (Eds.)., ICAPS-05 (2005). Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), Monterey, CA, USA. Morgan Kaufmann.
10. Bloem, R., Ravi, K., & Somenzi, F. (2000). Symbolic guided search for CTL model checking. In Conference on Design Automation (DAC), pp. 29-34.
11. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90(1-2), 279-298.
12. Boddy, M., Gohde, J., Haigh, T., & Harp, S. (2005). Course of action generation for cyber security using classical planning.. In Biundo et al. (Biundo, Myers, & Rajan, 2005), pp. 12-21.
13. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 729(1-2), 5-33.
14. Bonet, B., Loerincs, G., & Geffner, H. (1997). A robust and fast action selection mechanism for planning. In Proceedings of the 14th National Conference of the American Association for Artificial Intelligence (AAAI-97), pp. 714-719. MIT Press.
15. Bonet, B., & Thiébaux, S. (2003). GPT meets PSR. In Giunchiglia, E., Muscettola, N., & Nau, D. (Eds.), Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS-03), pp. 102-111, Trento, Italy. Morgan Kaufmann.
16. Busuioc, M. (1999). Distributed Intelligent Agents - A Solution for the Management of Complex Telecommunications Services, chap. 4 in Hayzelden, A./Bigham, J. (eds.), Software Agents for Future Telecommunication Systems. Springer.
17. Bylander, T. (1994). The computational complexity of prepositional STRIPS planning. Artificial Intelligence, 59(1-2), 165-204.
18. Cesta, A., & Borrajo, D. (Eds.). (2001). Recent Advances in AI Planning. 6th European Conference on Planning (ECP'01), Toledo, Spain. Springer-Verlag.
19. Chen, Y., Hsu, C., & Wah, B. (2004). SGPlan: Subgoal partitioning and resolution in planning. In Edelkamp, S., Hoffmann, J., Littman, M., & Younes, H. (Eds.), Proceedings of the 4th International Planning Competition, Whistler, BC, Canada. JPL.
20. Chien, S., Kambhampati, R., & Knoblock, C. (Eds.)., AIPS-00 (2000). Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-00). AAAI Press, Menlo Park.
21. Cimatti, A., Roveri, M., & Traverso, P. (1998). Automatic OBDD-based generation of universal plans in non-deterministic domains. In Proceedings of the 15th National Conference of the American Association for Artificial Intelligence (AAAI-98), pp. 875-881, Madison, WI. MIT Press.
22. Clarke, E. M., Grumberg, O., & Peled, D. A. (1999). Model Checking. MIT Press.
23. Dierks, H. (2005). Finding optimal plans for domains with restricted continuous effects with uppaal cora. In ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems.
24. Edelkamp, S. (2003a). Promela planning. In Workshop on Model Checking Software (SPIN), Lecture Notes in Computer Science, pp. 197-212. Springer.
25. Edelkamp, S. (2003b). Taming numbers and durations in the model checking integrated planning system. Journal of Artificial Intelligence Research, 20, 195-238.
26. Edelkamp, S., & Jabbar, S. (2005). Action planning for directed model checking of Petri nets. Electronic Notes in Theoretical Computer Science, 149(2), 3-18.
27. Edelkamp, S., Jabbar, S., & Lluch-Lafuente, A. (2005). Action planning for graph transition systems. In ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems, pp. 48-57.
28. Edelkamp, S., Leue, S., & Lluch-Lafuente, A. (2004). Directed explicit-state model checking in the validation of communication protocols. International Journal on Software Tools for Technology, 5, 247 - 267.
29. Englert, R. (2005). Planning to optimize the UMTS call set-up for the execution of mobile applications. Int. Journal of Applied Artificial Intelligence, 19(2), 99-117.
30. Englert, R., & Cremers, A. B. (2001). Configuration of Applications for the 3rd Generation Mobile Communication. In KI Workshop on AI in Planning, Scheduling, Configuration and Design (PUK). Vienna, Austria.
31. Farjami, P., Görg, C., & Bell, F. (2000). Advanced service provisioning based on mobile agents. Computer Communications, 23, 754 - 760.
32. Fikes, R. E., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 2, 189-208.
33. Fourman, M. P. (2000). Prepositional planning. In AIPS Workshop on Model-Theoretic Approaches to Planning.
34. 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.
35. Fox, M., & Long, D. (1999). The detection and exploitation of symmetry in planning problems. In Pollack, M. (Ed.), Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pp. 956-961, Stockholm, Sweden. Morgan Kaufmann.
36. Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20, 61-124.
37. Frank, J., Cheeseman, P., & Stutz, J. (1997). When gravity fails: Local search topology. Journal of Artificial Intelligence Research, 7, 249-281.
38. Garagnani, M. (2000). A correct algorithm for efficient planning with preprocessed domain axioms. In Research and Development in Intelligent Systems XVII. Springer-Verlag.
39. Gazen, B. C., & Knoblock, C. (1997). Combining the expressiveness of UCPOP with the efficiency of Graphplan.. In Steel, & Alami (Steel & Alami, 1997), pp. 221-233.
40. Gerevini, A., & Long, D. (2005). Plan Constraints and Preferences. The AIPS-06 Planning Competition Comitee. Available at http://zeus.ing.unibs.it/ipc-5/pddl-ipc5.pdf.
41. Gerevini, A., Saetti, A., & Serina, I. (2006). An approach to temporal planning and scheduling in domains with predictable exogenous events. Journal of Artificial Intelligence Research, 25, 187-231.
42. Giunchiglia, F., & Traverso, P. (1999). Planning as model checking. In Biundo, S., & Fox, M. (Eds.), Recent Advances in AI Planning. 5th European Conference on Planning (ECP'99), Lecture Notes in Artificial Intelligence, pp. 1-19, Durham, UK. Springer-Verlag.
43. Haslum, P., & Geffner, H. (2001). Heuristic planning with time and resources.. In Cesta, & Borrajo (Cesta & Borrajo, 2001), pp. 121-132.
44. Hatzack, W. (2002). Entwicklung und Auswertung von Algorithmen zur autonomen Verkehrskoordinierung und Konfliktauflsung an Flughfen. Ph.D. thesis, University of Freiburg, Freiburg, Germany.
45. Hatzack, W., & Nebel, B. (2001). The operational traffic control problem: Computational complexity and solutions.. In Cesta, & Borrajo (Cesta & Borrajo, 2001), pp. 49-60.
46. Helmert, M. (2003). Complexity results for standard benchmark domains in planning. Artificial Intelligence, 143, 219-262.
47. Helmert, M. (2004). A planning heuristic based on causal graph analysis.. In Koenig et al. (Koenig, Zilberstein, & Koehler, 2004), pp. 161-170.
48. Helmert, M. (2005) Personal communication.
49. Helmert, M. (2006a). The fast downward planning system. Journal of Artificial Intelligence Research, 26. Accepted for Publication.
50. Helmert, M. (2006b). New complexity results for classical planning benchmarks. In Long, D., & Smith, S. (Eds.), Proceedings of the 16th International Conference on Automated Planning and Scheduling (ICAPS-06), pp. 52-61, The English Lake District, UK. Morgan Kaufmann.
51. Hoffmann, J. (2001). Local search topology in planning benchmarks: An empirical analysis.. In Nebel (Nebel, 2001), pp. 453-458.
52. Hoffmann, J. (2002). Local search topology in planning benchmarks: A theoretical analysis. In Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.), Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02), pp. 92-100, Toulouse, France. Morgan Kaufmann.
53. Hoffmann, J. (2003). The Metric-FF planning system: Translating "ignoring delete lists" to numeric state variables. Journal of Artificial Intelligence Research, 20, 291-341.
54. Hoffmann, J. (2005). Where 'ignoring delete lists' works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research, 24, 685-758.
55. Hoffmann, J., & Edelkamp, S. (2005). The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research, 24, 519-579.
56. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
57. Hölldobler, S., & Stör, H.-P. (2000). Solving the entailment problem in the fluent calculus using binary decision diagrams. In ICAPS Workshop on Model-Theoretic Approaches to Planning.
58. Holma, H., & Toskala, A. (2000). WCDMA for UMTS - Radio Access for 3rd Generation Mobile Communications. Wiley & Sons.
59. Holzmann, G. (2003). The Spin Model Checker - Primer and Reference Manual. Addison-Wesley.
60. Holzmann, G. J. (1990). Design and Validation of Computer Protocols. Prentice Hall.
61. Howe, A., & Dahlman, E. (2002). A critical assessment of benchmark comparison in planning. Journal of Artificial Intelligence Research, 17, 1-33.
62. Kabanza, F., & Thiébaux, S. (2005). Search control in planning for temporally extended goals.. In Biundo et al. (Biundo et al., 2005), pp. 130-139.
63. Koehler, J., & Hoffmann, J. (2000). On the instantiation of ADL operators involving arbitrary first-order formulas. In ECAI Workshop on New Results in Planning, Scheduling and Design.
64. Koehler, J., Nebel, B., Hoffmann, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset.. In Steel, & Alami (Steel & Alami, 1997), pp. 273-285.
65. Koehler, J., & Schuster, K. (2000). Elevator control as a planning problem.. In Chien et al. (Chien, Kambhampati, & Knoblock, 2000), pp. 331-338.
66. Koenig, S., Zilberstein, S., & Koehler, J. (Eds.)., ICAPS-04 (2004). Proceedings of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04), Whistler, Canada. Morgan Kaufmann.
67. Korf, R. E. (1990). Real-time heuristic search. Artificial Intelligence, 42, 189-211.
68. Kvarnström, J., Doherty, P., & Haslum, P. (2000). Extending TALplanner with concurrency and ressources. In Horn, W. (Ed.), Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-00), pp. 501-505, Berlin, Germany. Wiley.
69. Lago, U. D., Pistore, M., & Traverso, P. (2002). Planning with a language for extended goals. In Proceedings of the 18th National Conference of the American Association for Artificial Intelligence (AAAI-02), pp. 447-454, Edmonton, AL. MIT Press.
70. Long, D., & Fox, M. (2000). Automatic synthesis and use of generic types in planning.. In Chien et al. (Chien et al., 2000), pp. 196-205.
71. Long, D., & Fox, M. (2003). The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research, 20, 1-59.
72. McDermott, D. (1996). A heuristic estimator for means-ends analysis in planning. In Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems (AIPS-96), pp. 142-149. AAAI Press, Menlo Park.
73. McDermott, D. (1998). The PDDL Planning Domain Definition Language. The AIPS-98 Planning Competition Comitee. Available at http://ls5-www.cs.uni-dortmund.de/edelkamp/ipc-4/DOCS/pddl.ps.gz.
74. McDermott, D. (2000). The 1998 AI planning systems competition. The AI Magazine, 27(2), 35-55.
75. McDermott, D. V. (1999). Using regression-match graphs to control search in planning. Artificial Intelligence, 709(1-2), 111-159.
76. Milidiú, R. L., & dos Santos Liporace, F. (2004a). Plumber, a pipeline transportation planner. In International Workshop on Harbour and Maritime Simulation (HMS), pp. 99-106, Rio de Janeiro, Brazil.
77. Milidiú, R. L., & dos Santos Liporace, F. (2004b). Pipesworld: Applying planning systems to pipeline transportation. In Proceedings of the International Pipeline Conference (IPC), pp. 713-719.
78. Nebel, B. (Ed.)., IJCAI-01 (2001). Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), Seattle, Washington, USA. Morgan Kaufmann.
79. Nebel, B. (2000). On the compilability and expressive power of prepositional planning formalisms. Journal of Artificial Intelligence Research, 12, 271-315.
80. 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.
81. Reffel, F., & Edelkamp, S. (1999). Error detection with directed symbolic model checking. In World Congress on Formal Methods (FM), pp. 195-211.
82. Rintanen, J. (2004). Phase transitions in classical planning: An experimental study.. In Koenig et al. (Koenig et al., 2004), pp. 101-110.
83. Ruml, W., Do, M., & Fromherz, M. (2005). On-line planning and scheduling for high-speed manufacturing.. In Biundo et al. (Biundo et al., 2005), pp. 30-39.
84. Steel, S., & Alami, R. (Eds.). (1997). Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), Vol. 1348 of Lecture Notes in Artificial Intelligence, Toulouse, France. Springer-Verlag.
85. 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.
86. 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. V. (Eds.), Proceedings of the 12th International Conference on Uncertainty in AI (UAI-96), pp. 525-532, Portland, Oregon, USA. Morgan Kaufmann.
87. Thiébaux, S., Hoffmann, J., & Nebel, B. (2003). In defense 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.
88. Thiébaux, S., Hoffmann, J., & Nebel, B. (2005). In defense of PDDL axioms. Artificial Intelligence, 168(1-2), 38-69.
89. rd Generation Partnership Project: Technical Specification Group Service and System Aspects: QoS Concept and Architecture (Release 5), TS 23.107, V5.3.0, 3GPP.
90. Vidai, V. (2004). A lookahead strategy for heuristic search planning.. In Koenig et al. (Koenig et al., 2004), pp. 150-160.
91. Wah, B., & Chen, Y. (2004). Subgoal partitioning and global search for solving temporal planning problems in mixed space. International Journal of Artificial Intelligence Tools, 13(4), 767-790.
92. Yang, C. H., & Dill, D. L. (1998). Validation with guided search of the state space. In Conference on Design Automation (DAC), pp. 599-604.
93. Younes, H., Littman, M., Weissman, D., & Asmuth, J. (2005). The first probabilistic track of the international planning competition. Journal of Artificial Intelligence Research, 24, 851-88.