Semi-relaxed plan heuristics

ICAPS 2012 - Proceedings of the 22nd International Conference on Automated Planning and Scheduling

Volumn , Issue , 2012, Pages 128-136

  Keyder, Emil ^a   Hoffmann, Jörg ^b   Haslum, Patrik ^c  

^a INRIA   (France)

^b SAARLAND UNIVERSITY   (Germany)

^c AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL EFFECTS; DOMAIN-INDEPENDENT PLANNING; FLUENTS; HEURISTIC FUNCTIONS; PLANNING TASKS;

HEURISTIC ALGORITHMS;

EID: 84866439137     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Baier, J. A., and Botea, A. 2009. Improving planning performance using low-conflict relaxed plans. In Gerevini et al. (2009).
2. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. Artificial Intelligence 129(1-2):5-33.
3. Bonet, B.; Palacios, H.; and Geffner, H. 2009. Automatic derivation of memoryless policies and finite-state controllers using classical planners. In Gerevini et al. (2009).
4. Garey, M. R., and Johnson, D. S. 1979. Computers and Intractability - A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman.
5. Gazen, B. C., and Knoblock, C. 1997. Combining the expressiveness of UCPOP with the efficiency of Graphplan. In Steel, S., and Alami, R., eds., Recent Advances in AI Planning. 4th European Conference on Planning (ECP'97), volume 1348 of Lecture Notes in Artificial Intelligence, 221-233. Toulouse, France: Springer-Verlag.
6. Gerevini, A.; Howe, A.; Cesta, A.; and Refanidis, I., eds. 2009. Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 2009). AAAI Press.
7. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Chien, S.; Kambhampati, R.; and Knoblock, C., eds., Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS-00), 140-149. Breckenridge, CO: AAAI Press, Menlo Park.
8. m. In Gerevini et al. (2009), 354-357.
9. Haslum, P. 2012. Incremental lower bounds for additive cost planning problems. In Bonet, B.; McCluskey, L.; Silva, J. R.; and Williams, B., eds., Proceedings of the Twenty-second International Conference on Automated Planning and Scheduling (ICAPS 2012). AAAI Press.
10. Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: What's the difference anyway? In Gerevini et al. (2009), 162-169.
11. Helmert, M., and Geffner, H. 2008. Unifying the causal graph and additive heuristics. In Rintanen, J.; Nebel, B.; Beck, J. C.; and Hansen, E., eds., Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008), 140-147. AAAI Press.
12. Helmert, M. 2006. The Fast Downward planning system. Journal of Artificial Intelligence Research 26:191-246.
13. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
14. Keyder, E., and Geffner, H. 2008. Heuristics for planning with action costs revisited. In Ghallab, M., ed., In Proc. ECAI 2008, 588-592. Wiley.
15. Palacios, H., and Geffner, H. 2009. Compiling uncertainty away in conformant planning problems with bounded width. Journal of Artificial Intelligence Research 35:623-675.
16. Richter, S., and Westphal, M. 2010. The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research 39:127-177.