Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners

Artificial Intelligence

Volumn 173, Issue 5-6, 2009, Pages 619-668

  Gerevini, Alfonso E ^a   Haslum, Patrik ^b   Long, Derek ^c   Saetti, Alessandro ^a   Dimopoulos, Yannis ^d  

^a UNIVERSITY OF BRESCIA   (Italy)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^d UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Automated planning; Benchmarks for planning; Experimental evaluation of planning systems; International planning competition; Knowledge representation in planning; PDDL; Plan constraints; Planning languages; Planning systems; Preferences in planning

Indexed keywords

BENCHMARKING; COMPETITION; KNOWLEDGE REPRESENTATION; LINGUISTICS; QUERY LANGUAGES;

AUTOMATED PLANNING; BENCHMARKS FOR PLANNING; EXPERIMENTAL EVALUATION OF PLANNING SYSTEMS; INTERNATIONAL PLANNING COMPETITION; PDDL; PLAN CONSTRAINTS; PLANNING LANGUAGES; PLANNING SYSTEMS; PREFERENCES IN PLANNING;

PLANNING;

EID: 60549110392     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2008.10.012     Document Type: Article

References (67)

1. Bacchus F. The AIPS '00 planning competition. AI Magazine 22 3 (2001) 47-56
2. Bacchus F., and Kabanza F. Planning for temporally extended goals. Annals of Mathematics and Artificial Intelligence 22 1-2 (1998) 5-27
3. Bacchus F., and Kabanza F. Using temporal logics to express search control knowledge for planning. Artificial Intelligence 116 (2000) 123-191
4. Bäckström C. Expressive equivalence of planning formalisms. Artificial Intelligence 76 (1995) 17-34
5. J. Baier, S. McIlraith, Planning with first-order temporally extended goals using heuristic search, in: Proc. of 21st National Conf. on Artificial Intelligence (AAAI'06), 2006
6. J. Baier, S. McIlraith, Planning with temporally extended goals using heuristic search, in: Proc. of 16th Int. Conf. on Automated Planning and Scheduling (ICAPS'06), 2006
7. J. Benton, S. Kambhampati, YochanPS: PDDL3 simple preferences as partial satisfaction planning, in: 5th Int. Planning Competition Booklet, 2006
8. J. Benton, M. van den Briel, S. Kambhampati, A hybrid linear programming and relaxed plan heuristic for partial satisfaction planning problems, in: Proc. of 17th Int. Conf. on Automated Planning and Scheduling (ICAPS'07), 2007
9. Bistarelli S., Montanari U., and Rossi F. Semiring-based constraint solving and optimization. Journal of ACM (1997)
10. Blum A., and Furst M.L. Fast planning through planning graph analysis. Artificial Intelligence 90 (1997) 281-300
11. Bonet B., and Geffner H. Planning as heuristic search. Artificial Intelligence 129 1-2 (2001) 5-33
12. B. Bonet, H. Geffner, Heuristics for planning with penalties and rewards using compiled knowledge, in: Proc. of 10th Int. Conf. on Knowledge Representation (KR'06), 2006
13. Bonet B., Gerevini A.E., and Givan R. Abstract booklet of the Fifth Int. Planning Competition (2006). http://ipc5.ing.unibs.it
14. R. Brafman, Y. Chernyavsky, Planning with goal preferences and constraints, in: Proc. of 15th Int. Conf. on Automated Planning and Scheduling (ICAPS'05), 2005
15. M. Briel, R. Sanchez, M. Do, S. Kambhampati, Effective approaches for partial satisfaction (over-subscription) planning, in: Proc. of 19th National Conf. on Artificial Intelligence (AAAI'04), 2004
16. Chabrier N. (2003). http://contraintes.inria.fr/BIOCHAM/EXAMPLES/~cell_cycle/cell_cycle.bc
17. Chen Y., Wah B.W., and Hsu C. Temporal planning using subgoal partitioning and resolution in SGPlan. Journal of Artificial Intelligence Research 26 (2006) 323-369
18. Clarke E.M., Emerson E.A., and Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8 2 (1986) 244-263
19. Clarke E.M., Grumberg O., and Peled D. Model Checking (1999), MIT Press
20. S. Cresswell, A. Coddington, Compilation of LTL goal formulas into PDDL, in: Proc. of 15th European Conf. on Artificial Intelligence, (ECAI'04), 2004
21. P.J. Delgrande, T. Schaub, H. Tompits, A general framework for expressing preferences in causal reasoning and planning, in: Proc. of 7th Int. Symposium on Logical Formalizations of Commonsense Reasoning, 2005
22. M. Do, J. Benton, M. van den Briel, S. Kambhampati, Planning with goal utility dependencies, in: Proc. of 20th Int. Conf. on Artificial Intelligence (IJCAI'07), 2007
23. M.B. Do, S. Kambhampati, Partial satisfaction (over-subscription) planning as heuristic search, in: Proc. of 5th Int. Conf. on Knowledge Based Computer Systems (KBCS'04), 2004
24. Dubois D., Fargier H., and Prade H. Possibility theory in constraint satisfaction problems: Handling priority, preference and uncertainty. Applied Intelligence 6 (1996) 287-309
25. S. Edelkamp, On the compilation of plan constraints and preferences, in: Proc. of 16th Int. Conf. on Automated Planning and Scheduling (ICAPS'06), 2006
26. S. Edelkamp, J. Hoffmann, PDDL2.2: The language for the classic part of the 4th International Planning Competition, Technical Report 195, Institut für Informatik, Freiburg, Germany, 2004
27. Fink A., and Voss S. Applications of modern heuristic search methods to pattern sequencing problems. Computers & Operations Research 26 (1999) 17-34
28. M. Fox, D. Long, K. Halsey, An investigation into the expressive power of PDDL2.1, in: Proc. of 16th European Conf. on Artificial Intelligence (ECAI-04), 2004
29. Fox M., and Long D. PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research 20 (2003) 61-124
30. H. Geffner, P. Haslum, M. Helmert, J. Hoffmann, V. Vidal, B. Bonet, C. Domshlak, in: Proceedings of the ICAPS-07 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges, 17th Int. Conf. on Automated Planning and Scheduling (ICAPS'07), 2007
31. A. Gerevini, D. Long, Plan constraints and preferences in PDDL3, Technical Report RT-2005-08-47, Dipartimento di Elettronica per l'Automazione, Universitá di Brescia, 2005
32. A. Gerevini, D. Long, Preferences and soft constraints in PDDL3, in: Proc. of ICAPS-2006 Workshop on Preferences and Soft Constraints in Planning, 2006
33. A. Gerevini, A. Saetti, P. Haslum, D. Long, Y. Dimopoulos, Deterministic planning in the fifth planning competition: PDDL3 and experimental evaluation of the planners, Technical Report RT-2008-02-59, Dipartimento di Elettronica per l'Automazione, Universitá di Brescia, 2008
34. Gerevini A., Saetti A., and Serina I. An approach to efficient planning with numerical fluents and multi-criteria plan quality. Artificial Intelligence 172 8-9 (2008) 899-944
35. R. Gerth, D. Peled, M. Vardi, P. Wolper, Simple on-the-fly automatic verification of linear temporal logic, in: Proc. of 15th Workshop on Protocol Specification, Testing and Verification, 1995
36. M. Ghallab, A. Howe, C. Knoblock, D. McDermott, A. Ram, M. Veloso, D. Weld, D. Wilkins, PDDL - the planning domain definition language, Technical Report CVC TR98-003/DCS TR-1165, Yale Center for Computational Vision and Control, 1998
37. E. Giunchiglia, M. Maratea, Planning as satisfiability with preferences, in: Proc. of 22nd Conf. of Artificial Intelligence (AAAI'07), 2007
38. P. Haslum, Quality of solutions to IPC5 benchmark problems: Preliminary results, in: Proc. of ICAPS-07 Workshop on Int. Planning Competition: Past, Present & Future, 2007
39. P. Haslum, P. Jonsson, Some results on the complexity of planning with incomplete information, in: Proc. of 5th European Conf. on Planning (ECP'99), 1999
40. Helmert M. The fast downward planning system. Journal of Artificial Intelligence Research 26 (2006) 191-246
41. Hoffmann J., and Edelkamp S. The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research 24 (2005) 519-579
42. Hoffmann J., Edelkamp S., Thiébaux S., Englert R., Liporace F., and Trüg S. Engineering benchmarks for planning: The domains used in the deterministic part of IPC-4. Journal of Artificial Intelligence Research 26 (2006) 453-541
43. Hoffmann J., and Nebel B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14 (2001) 253-302
44. C. Hsu, B.W. Wah, Y. Chen, Personal communication, October 2007
45. F. Kabanza, S. Thiébaux, Search control in planning for temporally extended goals, in: Proc. of 15th Int. Conf. on Automated Planning and Scheduling (ICAPS'05), 2005
46. H. Kautz, SATPLAN04: Planning as satisfiability, in: 4th Int. Planning Competition Booklet, 2004
47. Kohn K. Molecular interaction map of the mammalian cell cycle control and DNA repair systems. Molecular Biology of the Cell 10 8 (1999)
48. Kvarnström J., and Doherty P. TALplanner: A temporal logic based forward chaining planner. Annals of Mathematics and Artificial Intelligence 30 1-4 (2000) 119-169
49. Linhares A., and Yanasse H.H. Connection between cutting-pattern sequencing, VLSI design and flexible machines. Computers & Operations Research 29 (2002) 1759-1772
50. Long D., and Fox M. The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research 20 (2003) 1-59
51. Long D., Kautz H., Selman B., Bonet B., Geffner H., Koehler J., Brenner M., Hoffmann J., Rittinger F., Anderson C., Weld D., Smith D., and Fox M. The AIPS-98 planning competition. AI Magazine 21 2 (2000) 13-33
52. Manna Z., and Pnueli A. The Temporal Logic of Reactive AND Concurrent Systems (1992), Springer
53. Miguel I., Jarvis P., and Shen Q. Efficient flexible planning via dynamic flexible constraint satisfaction. Engineering Applications of Artificial Intelligence 14 3 (2001) 301-327
54. Nebel B. On the compilability and the expressive power of propositional planning formalisms. Journal of Artificial Intelligence Research 12 (2000) 271-315
55. J.S. Penberthy, Planning with continuous change, PhD thesis University of Washington, 1993. Available as technical report UW-CSE-93-12-01
56. A. Pnueli, The temporal logic of programs, in: Proc. of 18th IEEE Symposium on Foundations of Computer Science, 1977
57. Riera-Ledesma J., and Salazar-Gonzalez J.J. A heuristic approach for the travelling purchaser problem. European Journal of Operational Research 160 3 (2005) 599-613
58. J. Rintanen, Incorporation of temporal logic control into plan operators, in: Proc. of 14th European Conf. on Artificial Intelligence (ECAI'00), 2000
59. J. Rintanen, Complexity of concurrent temporal planning, in: Proc. of 17th Int. Conf. on Automated Planning and Scheduling, 2007
60. F. Rossi, K.B. Venable, N. Yorke-Smith, Controllability of soft temporal constraint problems, in: Proc. of 10th Int. Conf. on Principles and Practice of Constraint Programming (CP'04), 2004
61. Smith B.M., and Gent I.P. Constraint modelling challenge 2005 (2005). http://www.dcs.st-and.ac.uk/~ipg/challenge/
62. D. Smith, Choosing objectives in over-subscription planning, in: Proc. of 14th Int. Conf. on Automated Planning and Scheduling (ICAPS'04), 2004
63. T.C. Son, E. Pontelli, Planning with preferences using logic programming, in: Proc. of 7th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR'04), 2004
64. Thagard P. Pathways to biomedical discovery. Philosophy of Science 70 (2003)
65. Thiébaux S., Hoffmann J., and Nebel B. In defense of PDDL axioms. Artificial Intelligence 168 (2005) 38-69
66. Vidal V., and Geffner H. Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artificial Intelligence 170 3 (2006) 298-335
67. Wilcoxon F., and Wilcox R.A. Some Rapid Approximate Statistical Procedures (1964), Lederle Laboratories, Pearl River, New York, USA