hm(P) = h1{Pm: Alternative characterisations of the generalisation from hmax to hm

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

Volumn , Issue , 2009, Pages 354-357

  Haslum, Patrik ^a  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

GENERALISATION; HEURISTIC FUNCTIONS; PLANNING PROBLEM; STRIPS PLANNING;

HEURISTIC ALGORITHMS;

SCHEDULING;

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

References (9)

1. Bonet, B., and Geffner, H. 1999. Planning as heuristic search: New results. In Proc. 5th European Conference on Planning (ECP'99), 360-372.
2. Edelkamp, S. 2001. Planning with pattern databases. In Proc. 6th European Conference on Planning (ECP'01), 13-24.
3. Ghallab, M.; Nau, D.; and Traverso, P. 2004. Automated Planning: Theory and Practice. Morgan Kaufmann Publishers. ISBN: 1-55860-856-7.
4. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In Proc. 20th National Conference on AI (AAAI'05), 1163-1168.
5. Haslum, P. 2006. Admissible Heuristics for Automated Planning. Ph.D. Dissertation, Linköpings Universitet.
6. Helmert, M., and Domshlak, C. 2009. Landmarks, critical paths and abstractions: What's the difference anyway? In Proc. 19th International Conference on Automated Planning and Scheduling (ICAPS'09).
7. Katz, M., and Domshlak, C. 2008. Optimal additive composition of abstraction-based admissible heuristics. In Proc. of the 18th International Conference on Automated Planning and Scheduling (ICAPS'08).
8. Nebel, B. 2000. On the compilability and expressive power of propositional planning formalisms. Journal of AI Research 12:271-315.
9. Yang, F.; Culberson, J.; Holte, R.; Zahavi, U.; and Feiner, A. 2008. A general theory of additive state space abstractions. Journal of AI Research 32:631-662.