The LAMA planner: Guiding cost-based anytime planning with landmarks

Journal of Artificial Intelligence Research

Volumn 39, Issue , 2010, Pages 127-177

  Richter, Silvia ^a,b   Westphal, Matthias ^c  

^a GRIFFITH UNIVERSITY   (Australia)

^b CSIRO   (Australia)

^c UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME PLANNING; BINARY STATE; CLASSICAL PLANNING; CORE FEATURES; COST-SENSITIVE; HEURISTIC SEARCH; HIGH-QUALITY SOLUTIONS; INTERNATIONAL PLANNING COMPETITIONS; NONUNIFORM; PLANNING SYSTEMS; PLANNING TASKS; PROPOSITIONAL FORMULAS; SATISFICING; SYNERGY EFFECT;

COMPETITION; COSTS;

PLANNING;

EID: 77956050972     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2972     Document Type: Article

References (49)

1. Aine, S., Chakrabarti, P. P., & Kumar, R. (2007). AWA* - A window constrained anytime heuristic search algorithm. In Veloso, M. M. (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2250-2255.
2. Bacchus, F. (2001). The AIPS'00 planning competition. AI Magazine, 22(3), 47-56.
3. + planning. Computational Intelligence, 11(4), 625-655.
4. Boddy, M., Gohde, J., Haigh, T., & Harp, S. (2005). Course of action generation for cyber security using classical planning. In Biundo, S., Myers, K., & Rajan, K. (Eds.), Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), pp. 12-21. AAAI Press.
5. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(1), 5-33.
6. Bryce, D., & Kambhampati, S. (2007). A tutorial on planning graph based reachability heuristics. AI Magazine, 28(1), 47-83.
7. Buffet, O., & Hoffmann, J. (2010). All that glitters is not gold: Using landmarks for reward shaping in FPG. In Proceedings of the ICAPS 2010 Workshop on Planning and Scheduling Under Uncertainty.
8. Chen, Y., Wah, B. W., & Hsu, C.-W. (2006). Temporal planning using subgoal partitioning and resolution in SGPlan. Journal of Artificial Intelligence Research, 26, 323-369.
9. Cheng, J., & Irani, K. B. (1989). Ordering problem subgoals. In Sridharan, N. S. (Ed.), Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI 1989), pp. 931- 936. Morgan Kaufmann.
10. Do, M. B., & Kambhampati, S. (2003). Sapa: A scalable multi-objective heuristic metric temporal planner. Journal of Artificial Intelligence Research, 20, 155-194.
11. Do, M. B., Ruml, W., & Zhou, R. (2008). On-line planning and scheduling: An application to controlling modular printers. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 1519-1523. AAAI Press.
12. Edelkamp, S., & Hoffmann, J. (2004). PDDL2.2: The language for the classical part of the 4th International Planning Competition. Tech. rep. 195, Albert-Ludwigs-Universität Freiburg, Institut für Informatik.
13. Fink, A., & Voß, S. (1999). Applications of modern heuristic search methods to pattern sequencing problems. Computers and Operations Research, 26(1), 17-34.
14. Fox, M., & Long, D. (2003). PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research, 20, 61-124.
15. Fuentetaja, R., Borrajo, D., & Linares López, C. (2009). A unified view of cost-based heuristics. In ICAPS 2009 Workshop on Heuristics for Domain-Independent Planning, pp. 70-77.
16. Gerevini, A., Haslum, P., Long, D., Saetti, A., & Dimopoulos, Y. (2009). Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artificial Intelligence, 173(5-6), 619-668.
17. Gerevini, A., & Serina, I. (2002). LPG: A planner based on local search for planning graphs with action costs. In Ghallab, M., Hertzberg, J., & Traverso, P. (Eds.), Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 13-22. AAAI Press.
18. Gregory, P., Cresswell, S., Long, D., & Porteous, J. (2004). On the extraction of disjunctive landmarks from planning problems via symmetry reduction. In Proceedings of the Fourth International Workshop on Symmetry and Constraint Satisfaction Problems, pp. 34-41.
19. Hansen, E. A., & Zhou, R. (2007). Anytime heuristic search. Journal of Artificial Intelligence Research, 28, 267-297.
20. Hansen, E. A., Zilberstein, S., & Danilchenko, V. A. (1997). Anytime heuristic search: First results. Technical report cmpsci 97-50, University of Massachusetts, Amherst.
21. Helmert, M. (2006). The Fast Downward planning system. Journal of Artificial Intelligence Research, 26, 191-246.
22. Helmert, M. (2009). Concise finite-domain representations for PDDL planning tasks. Artificial Intelligence, 173, 503-535.
23. Helmert, M., Do, M., & Refanidis, I. (2008). IPC 2008, deterministic part. Web site, http://ipc. informatik.uni-freiburg.de.
24. Helmert, M., & Geffner, H. (2008). Unifying the causal graph and additive heuristics. In Rintanen, J., Nebel, B., Beck, J. C., & Hansen, E. (Eds.), Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008), pp. 140-147. AAAI Press.
25. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
26. Hoffmann, J., Porteous, J., & Sebastia, L. (2004). Ordered landmarks in planning. Journal of Artificial Intelligence Research, 22, 215-278.
27. Irani, K. B., & Cheng, J. (1987). Subgoal ordering and goal augmentation for heuristic problem solving. In McDermott, J. P. (Ed.), Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI 1987), pp. 1018-1024. Morgan Kaufmann.
28. Jonsson, P., & Bäckström, C. (1998). State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence, 100(1-2), 125-176.
29. Karpas, E., & Domshlak, C. (2009). Cost-optimal planning with landmarks. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1728-1733.
30. Keyder, E., & Geffner, H. (2008). Heuristics for planning with action costs revisited. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 588-592.
31. Keyder, E., & Geffner, H. (2009). Trees of shortest paths vs. Steiner trees: Understanding and improving delete relaxation heuristics. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 1734-1749.
32. Keyder, E., Richter, S., & Helmert, M. (2010). Sound and complete landmarks for and/or graphs. In Coelho, H., Studer, R., & Wooldridge, M. (Eds.), Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 335-340.
33. Koehler, J., & Hoffmann, J. (2000). On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research, 12, 338-386.
34. Likhachev, M., Ferguson, D., Gordon, G. J., Stentz, A., & Thrun, S. (2008). Anytime search in dynamic graphs. Artificial Intelligence, 172(14), 1613-1643.
35. Likhachev, M., Gordon, G. J., & Thrun, S. (2004). ARA*: Anytime A* with provable bounds on sub-optimality. In Thrun, S., Saul, L. K., & Schölkopf, B. (Eds.), Advances in Neural Information Processing Systems 16 (NIPS 2003).
36. Lipovetzky, N., & Geffner, H. (2009). Inference and decomposition in planning using causal consistent chains. In Gerevini, A., Howe, A., Cesta, A., & Refanidis, I. (Eds.), Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 2009). AAAI Press.
37. Liu, Y., Koenig, S., & Furcy, D. (2002). Speeding up the calculation of heuristics for heuristic search-based planning. In Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI 2002), pp. 484-491. AAAI Press.
38. Pohl, I. (1970). Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1, 193-204.
39. Porteous, J., & Cresswell, S. (2002). Extending landmarks analysis to reason about resources and repetition. In Proceedings of the 21st Workshop of the UK Planning and Scheduling Special Interest Group (PLANSIG '02), pp. 45-54.
40. Porteous, J., Sebastia, L., & Hoffmann, J. (2001). On the extraction, ordering, and usage of landmarks in planning. In Cesta, A., & Borrajo, D. (Eds.), Pre-proceedings of the Sixth European Conference on Planning (ECP 2001), pp. 37-48, Toledo, Spain.
41. Richter, S., & Helmert, M. (2009). Preferred operators and deferred evaluation in satisficing planning. In Gerevini, A., Howe, A., Cesta, A., & Refanidis, I. (Eds.), Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 273-280. AAAI Press.
42. Richter, S., Helmert, M., & Westphal, M. (2008). Landmarks revisited. In Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 975-982. AAAI Press.
43. Richter, S., Thayer, J. T., & Ruml, W. (2010). The joy of forgetting: Faster anytime search via restarting. In Brafman, R., Geffner, H., Hoffmann, J., & Kautz, H. (Eds.), Proceedings of the Twentieth International Conference on Automated Planning and Scheduling (ICAPS 2010). AAAI Press. To appear.
44. Röger, G., & Helmert, M. (2010). The more, the merrier: Combining heuristic estimators for satis-ficing planning. In Brafman, R., Geffner, H., Hoffmann, J., & Kautz, H. (Eds.), Proceedings of the Twentieth International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 246-249. AAAI Press.
45. Ruml, W., & Do, M. B. (2007). Best-first utility-guided search. In Veloso, M. M. (Ed.), Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 2378- 2384.
46. Sebastia, L., Onaindia, E., & Marzal, E. (2006). Decomposition of planning problems. AI Communications, 19(1), 49-81.
47. Vidal, V. (2004). A lookahead strategy for heuristic search planning. In Zilberstein, S., Koehler, J., & Koenig, S. (Eds.), Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 150-159. AAAI Press.
48. Zhou, R., & Hansen, E. A. (2005). Beam-stack search: Integrating backtracking with beam search. In Biundo, S., Myers, K., & Rajan, K. (Eds.), Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), pp. 90-98. AAAI Press.
49. Zhu, L., & Givan, R. (2003). Landmark extraction via planning graph propagation. In ICAPS 2003 Doctoral Consortium, pp. 156-160.