Landmarks, critical paths and abstractions: What's the difference anyway?

ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2009, Pages 162-169

  Helmert, Malte ^a   Domshlak, Carmel ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CRITICAL PATHS; DOMAIN-INDEPENDENT PLANNING; HEURISTIC FUNCTIONS; STATE OF THE ART;

ABSTRACTING; HEURISTIC ALGORITHMS;

SCHEDULING;

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

References (22)

1. + planning. Computational Intelligence 11 (4):625-655.
2. +- Heuristik. Diplomarbeit, Albert-Ludwigs-Universität Freiburg.
3. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1):5-33.
4. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. AIJ 69(1-2):165-204.
5. Coles, A.; Fox, M.; Long, D.; and Smith, A. 2008. Additive-disjunctive heuristics for optimal planning. In Proc. ICAPS 2008, 44-51.
6. Edelkamp, S. 2001. Planning with pattern databases. In Proc. ECP 2001, 13-24.
7. Edelkamp, S. 2002. Symbolic pattern databases in heuristic search planning. In Proc. AIPS 2002, 274-283.
8. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In Proc. AIPS 2000, 140-149.
9. Haslum, P.; Botea, A.; Helmert, M.; Bonet, B.; and Koenig, S. 2007. Domain-independent construction of pattern database heuristics for cost-optimal planning. In Proc. AAAI 2007, 1007-1012.
10. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In Proc. AAAI 2005, 1163-1168. (Pubitemid 43006592)
11. Helmert, M., and Mattmüller, R. 2008. Accuracy of admissible heuristic functions in selected planning domains. In Proc. AAAI 2008, 938-943.
12. Helmert, M., and Röger, G. 2008. How good is almost perfect? In Proc. AAAI 2008, 944-949.
13. Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In Proc. ICAPS 2007, 176-183.
14. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302. (Pubitemid 33738066)
15. Hoffmann, J. 2005. Where 'ignoring delete lists' works: Local search topology in planning benchmarks. JAIR 24:685-758.
16. Karpas, E., and Domshlak, C. 2009. Cost-optimal planning with landmarks. In Proc. IJCAI 2009.
17. Katz, M., and Domshlak, C. 2008a. Optimal additive composition of abstraction-based admissible heuristics. In Proc. ICAPS 2008, 174-181.
18. Katz, M., and Domshlak, C. 2008b. Structural patterns heuristics via fork decomposition. In Proc. ICAPS 2008, 182-189.
19. Keyder, E., and Geffner, H. 2008. Heuristics for planning with action costs revisited. In Proc. ECAI 2008, 588-592.
20. +. In Proc. ICAPS 2007, 240-247.
21. Porteous, J.; Sebastia, L.; and Hoffmann, J. 2001. On the extraction, ordering, and usage of landmarks in planning. In Proc. ECP 2001, 37-48.
22. Richter, S.; Helmert, M.; and Westphal, M. 2008. Landmarks revisited. In Proc. AAAI 2008, 975-982.