Learning from planner performance

Artificial Intelligence

Volumn 173, Issue 5-6, 2009, Pages 536-561

  Roberts, Mark ^a   Howe, Adele ^a  

^a Colorado State University   (United States)

Author keywords

Classical planning; Empirical studies of performance

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; LINGUISTICS;

BENCH-MARK PROBLEMS; CLASSICAL PLANNING; CURRENT CAPABILITIES; EMPIRICAL STUDIES OF PERFORMANCE; OFF-THE-SHELF MACHINES; PLANNING COMMUNITIES; SEARCH SPACES; STATE-OF-THE ARTS;

PLANNING;

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

References (76)

1. A. Blum, M. Furst, Fast planning through planning graph analysis, in: Proc. of the 14th Int'l Joint Conf. on Artificial Intelligence (IJCAI-95), Montreal, Quebec, Canada. August 20-25, 1995, pp. 1636-1642
2. Fikes R.E., and Nilsson N.J. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2 3-4 (1971) 189-208
3. Pednault E. ADL: Exploring the middle ground between strips and the situation calculus. In: Brachman R.J., Levesque H.J., and Reiter R. (Eds). Proc. of the 1st Int'l Conf. on Principles of Knowledge Representation and Reasoning (KR-89). Toronto, Canada, May 15-18, 1989 (1989), Morgan Kaufmann
4. AIPS-98 International Planning Competition Committee, PDDL: The planning domain definition language, Tech. rep., Yale Center for Computational Vision and Control, the AIPS-98 committee consisted of: M. Ghallab, A. Howe, C. Knoblock, D. McDermott, A. Ram, M. Veloso, D. Weld, D. Wilkins, October 1998
5. Hoffmann J., and Edelkamp S. The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research 24 (2005) 519-579
6. Long D., and Fox M. The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research 20 (2003) 1-59
7. Howe A., and Dahlman E. A critical assessment of benchmark comparison in planning. Journal of Artificial Intelligence Research 17 (2002) 1-33
8. Hoffmann J. Utilizing Problem Structure in Planning: A Local Search Approach (2004), Springer-Verlag, Berlin, New York
9. McDermott D. The 1998 AI planning systems competition. AI Magazine 2 2 (2000) 35-55
10. Bacchus F. AIPS'00 planning competition. AI Magazine 22 3 (2001) 47-56
11. Y. Dimopoulos, A. Gerevini, P. Haslum, A. Saetti, The benchmark domains of the deterministic part of IPC-5, in: Special Booklet for the Planning Competition in the Working Notes of the 16th Int'l Conf. on Automated Planning and Scheduling (ICAPS-06), Monterey, CA, USA, June 5-10, 2006
12. Howe A., Dahlman E., Hansen C., Scheetz M., and vonMayrhauser A. Exploiting competitive planner performance. In: Biundo S., and Fox M. (Eds). Proc. 5th European Conf. on Planning (ECP-99). Durham UK September 8-10. Lecture Notes on Computer Science vol. 1809 (1999), Springer
13. R Development Core Team. R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing (2006), Vienna, Austria. 3-900051-07-0
14. Hoffmann J. Local search topology in planning benchmarks: An empirical analysis. Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI'01) (2001), Kaufmann, Seattle WA 453-458
15. Witten I.H., and Frank E. Data Mining: Practical Machine Learning Tools and Techniques. 2nd ed. (2005), Morgan Kaufmann, San Francisco
16. J. Hoffmann, Local search topology in planning benchmarks: A theoretical analysis, Tech. Rep. 165, Institute for Computer Science, Albert Ludwigs University, Georges-Koehler-Allee, Geb. 52, 79110 Freiburg, Germany, November 16 2001
17. Hoffmann J. Where ignoring delete lists works: Local search topology in planning benchmarks. Journal of Artificial Intelligence Research 24 (2005) 685-758
18. Taillard E. Benchmarks for basic scheduling problems. European Journal of Operational Research 64 (1993) 278-285
19. Wilkins D.E. Using the SIPE-2 Planning System: A Manual for Version 6.1 (1999), SRI International, Artificial Intelligence Center, Menlo Park, CA
20. Watson J., Barbulescu L., Howe A., and Whitley L. Algorithm performance and problem structure for flow-shop scheduling. Proc. of the 16th National Conference on Artificial Intelligence (AAAI-99). Orlando, FL (1999), AAAI/MIT Press, Anaheim, CA
21. Ruml W., Do M.B., and Fromherz M.P. On-line planning and scheduling for high-speed manufacturing. Proc. of the 15th Int'l Conf. on Automated Planning and Scheduling (ICAPS-05). Monterey, CA, USA, June 5-10, 2005 (2005), AAAI Press, Menlo Park, CA 30-39
22. Haitjema M., Chen Y., Roman C., and Gill C. A PDDL domain generator for workflow allocation. available at (2007). http://www.cse.wustl.edu/~chen/workflow/
23. Boddy M., Gohde J., Haigh J.T., and Harp S. Course of action generation for cyber security using classical planning. Proc. of the 15th Int'l Conf. on Automated Planning and Scheduling (ICAPS-05). Monterey, CA, USA, June 5-10, 2005 (2005), AAAI Press, Menlo Park, CA
24. Veloso M., and Blythe J. Linkability: Examining causal link commitments in partial-order planning. In: Hammond K.J. (Ed). Proc. of the 2nd Int'l Conf. on Artificial Intelligence Planning Systems (AIPS-94). Chicago, Illinois, June 13-15, 1994 (1994), AAAI Press 170-175
25. Roberts M., Howe A., Wilson B., and desJardins M. What makes planners predictable?. Proc. of the 18th Int'l Conf. on Automated Planning and Scheduling (ICAPS-08). Sydney, Australia, September 14-18, 2008 (2008), AAAI Press, Menlo Park, CA
26. D. Vrakas, G. Tsoumakas, N. Bassiliades, I. Vlahavas, Machine learning for adaptive planning, in: Intelligent Techniques for Planning, Idea Group, 2005, pp. 90-120
27. Fox M., and Long D. The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research 9 (1998) 367-421
28. Y. Chen, X. Zhao, W. Zhang, Long distance mutual exclusion for propositional planning, in: Proc. of the 20th Int'l Joint Conf. on Artificial Intelligence (IJCAI-07). Hyderabad, India, January 6-12, 2007
29. Gerevini A., and Serina I. Planning as propositional CSP: from Walksat to local search for action graphs. CONSTRAINTS 8 (2003) 389-413
30. *a in the 2004 planning competition. Journal of Artificial Intelligence Research 25 (2006) 233-267
31. Helmert M. The fast downward planning system. Journal of Artificial Intelligence Research 26 (2006) 191-246
32. Coles A.I., and Smith A.J. Marvin: A heuristic search planner with online macro-action learning. Journal of Artificial Intelligence Research 28 (2007) 119-156
33. Helmert M. Complexity results for standard benchmark domains in planning. Artificial Intelligence 143 2 (2003) 219-262
34. Helmert M. New complexity results for classical planning benchmarks. Proc. of the 16th Int'l Conf. on Automated Planning and Scheduling (ICAPS-06). Cumbria, UK, June 6-10, 2006 (2006), AAAI Press, Menlo Park, CA 52-61
35. Lin F. A planner called R. Artificial Intelligence 22 3 (2001) 73-76
36. V. Vidal, H. Geffner, Branching and pruning: An optimal temporal POCL planner based on constraint programming, in: Proc. of the 19th National Conference on Artificial Intelligence (AAAI-04), San Jose, CA, 2004
37. Fink E., and Blythe J. Prodigy bidirectional planning. Journal of Experimental and Theoretical Artificial Intelligence 17 3 (2005) 161-200
38. Veloso M., Carbonell J., Perez A., Borrajo D., Fink E., and Blythe J. Integrating planning and learning: The PRODIGY architecture. Journal of Experimental and Theoretical Artificial Intelligence 7 1 (1995) 81-120
39. McAllester D., and Rosenblitt D. Systematic nonlinear planning. Proc. of the 9th National Conference on Artificial Intelligence (AAAI-91), vol. 2 (1991), AAAI Press/MIT Press, Anaheim, CA 634-639
40. Penberthy J.S., and Weld D. UCPOP: A sound, complete, partial-order planner for ADL. In: Nebel B., Rich C., and Swartout W.R. (Eds). Proc. of the 3rd Int'l Conf. on Principles of Knowledge Representation and Reasoning (KR-92). Cambridge, MA, October 25-29, 1992 (1992), Morgan Kaufmann
41. Younes H., and Simmons R. VHPOP: Versatile heuristic partial order planner. Journal of Artificial Intelligence Research 20 (2003) 405-430
42. J. Koehler, B. Nebel, J. Hoffmann, Y. Dimopoulos, Extending planning graphs to an ADL subset, Tech. Rep. 88/97, Institute for Computer Science, Albert Ludwigs University, 1997
43. Koehler J., Nebel B., Hoffmann J., and Dimopoulos Y. Extending planning graphs to an ADL subset. In: Steel S., and Alami R. (Eds). Proc. of the 4th European Conference on Planning (ECP-97). Toulouse, France, September 24-26, 1997. Lecture Notes in Computer Science vol. 1348 (1997), Springer 273-285
44. Koehler J. IPP homepage. Web Page at. http://www.informatik.uni-freiburg.de/~koehler/ipp.html last accessed September 11, 2007 (October 15 2006)
45. J. Koehler, J. Hoffmann, Planning with goal agendas, Tech. Rep. 110, Institute for Computer Science, Albert Ludwigs University, 1998
46. Koehler J., and Hoffmann J. On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research 12 (2000) 338-386
47. Nebel B., Dimopoulos Y., and Koehler J. Ignoring irrelevant facts and operators in plan generation. Proceedings of the 4th European Conference on Planning. LNAI vol. 1348 (1997), Springer 338-350
48. Weld D.S., Anderson C.R., and Smith D.E. Extending Graphplan to handle uncertainty and sensing actions. Proc. of the 15th National Conference on Artificial Intelligence (AAAI-98). Madison, WI (1998), AAAI/MIT Press, Anaheim, CA 897-904
49. Weld D.S. Recent advances in AI planning. AI Magazine 20 2 (1999) 93-123
50. Long D., and Fox M. Efficient implementation of the plan graph in STAN. Journal of Artificial Intelligence Research 10 (1999) 87-115
51. Bonet B., and Geffner H. Planning as heuristic search. Artificial Intelligence 129 1-2 (2001) 5-33
52. Bonet B., and Geffner H. Planning as heuristic search: New results. In: Biundo S., and Fox M. (Eds). Proc. 5th European Conf. on Planning (ECP-99). Durham, UK, September 8-10, 1999. Lecture Notes on Computer Science vol. 1809 (1999), Springer 359-371
53. Haslum P., and Geffner H. Admissible heuristics for optimal planning. Proc. of the 5th Int'l Conf. on Artificial Intelligence Planning Systems (AIPS-00). Breckenridge, CO, USA, April 14-17, 2000 (2000), AAAI Press, Menlo Park, CA 140-149
54. Helmert M. A planning heuristic based on causal graph analysis. Proc. of the 14th Int'l Conf. on Automated Planning and Scheduling (ICAPS-04). Whistler, BC, Canada (2004), AAAI Press, Menlo Park, CA 161-170
55. + planning. Computational Intelligence 11 4 (1995) 625-655
56. Hoffmann J., and Nebel B. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14 (2001) 253-302
57. Hoffmann J. The Metric-FF planning system: Translating "ignoring delete lists" to numeric state variables. Journal of Artificial Intelligence Research 20 (2003) 291-341
58. Gerevini A., and Serina I. LPG: A planner based on local search for planning graphs. In: Ghallab M., Hertzberg J., and Traverso P. (Eds). Proc. of the 6th Int'l Conf. on Artificial Intelligence Planning Systems (AIPS-02). Toulouse, France, April 23-27, 2002 (2002), AAAI Press, Menlo Park, CA 13-22
59. Gerevini A., Serina I., Saetti A., and Spinoni S. Local search techniques for temporal planning in LPG. Proc. of the 13th Int'l Conf. on Automated Planning and Scheduling (ICAPS-03). Trento, Italy, June 9-13, 2003 (2003), AAAI Press
60. Gerevini A., Saetti A., and Serina I. An approach to temporal planning and scheduling in domains with predicatable exogenous events. Journal of Artificial Intelligence Research 25 (2006) 187-231
61. Gerevini A., Saetti A., and Serina I. Planning through stochastic local search and temporal action graphs in LPG. Journal of Artificial Intelligence Research 20 (2003) 239-290
62. A. Gerevini, A. Saetti, I. Serina, Planning in PDDL2.2 domains with LPG-TD, in: Special Booklet for the Planning Competition in the Working Notes of the 14th Int'l Conf. on Automated Planning and Scheduling (ICAPS-04), Whistler, BC, Canada, 2004
63. D. McDermott, The Optop planner, in: Special Booklet for the Planning Competition in the Working Notes of the 16th Int'l Conf. on Automated Planning and Scheduling (ICAPS-06), Monterey, CA, USA, June 5-10, July 2004
64. McDermott D. The Opt and Optop API. 0.9 edition (2005), Yale Computer Science Department
65. McDermott D. A heuristic estimator for means ends analysis in planning. In: Drabble B. (Ed). Proc. of the 3rd Int'l Conf. on Artificial Intelligence Planning Systems (AIPS-98). Edinburgh, Scotland, May 29-31, 1996 (1996), AAAI Press, Menlo Park, CA 142-149
66. McDermott D. Using regression-match graphs to control search in planning. Artificial Intelligence 109 1-2 (1999) 111-159
67. Sapena O., and Onainda E. Domain independent on-line planning for STRIPS domains. Proc. IBERAMIA-02. LNAI vol. 2527 (2002), Springer-Verlag
68. Do M.B., and Kambhampati S. Sapa: A multi-objective metric temporal planner. Journal of Artificial Intelligence Research 20 (2003) 155-194
69. R. Sanchez-Nigenda, X. Nguyen, S. Kambhampati, AltAlt: Combining the advantages of graphplan and heuristic state search, in: Proceedings of the 3rd International Conference on Knowledge-based Systems (KBCS), Bombay, 2000
70. Nguyen X., Kambhampati S., and Nigenda R.S. Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search. Artificial Intelligence 135 (2002) 73-124
71. Chen Y., and Wah B.W. Automated planning and scheduling using calculus of variations in discrete space. Proc. of the 13th Int'l Conf. on Automated Planning and Scheduling (ICAPS-03). Trento, Italy, June 9-13, 2003 (2003), AAAI Press 2-11
72. Chen Y., Wah B.W., and Hsu C.-W. Temporal planning using subgoal partitioning and resolution in SGPlan. Journal of Artificial Intelligence Research 26 (2006) 323-369
73. Kautz H., and Selman B. BLACKBOX: A new approach to the application of theorem proving to problem solving. Workshop on Planning as Combinatorial Search, Working Notes of the 4th Int'l Conf. on Artificial Intelligence Planning Systems (AIPS-98). Pittsburgh, PA, USA, June 7-10, 1998 (1998), AAAI Press, Menlo Park, CA
74. H. Kautz, B. Selman, Unifying SAT-based and graph-based planning, in: Proc. of the 16th Int'l Joint Conf. on Artificial Intelligence (IJCAI-99), Stockholm, Sweden, July 31-August 6, 1999
75. H. Kautz, B. Selman, J. Hoffmann, Satplan: Planning as satisfiability, in: Special Booklet for the International Planning Competition in the Working Notes of the 16th Int'l Conf. on Automated Planning and Scheduling (ICAPS-06), Monterey, CA, USA, June 5-10, 2006
76. Edelkamp S., and Helmert M. On the implementation of MIPS. Proc. of the 5th Int'l Conf. on Artificial Intelligence Planning Systems (AIPS-00). Breckenridge, CO, USA, April 14-17, 2000 (2000), AAAI Press, Menlo Park, CA