Structural patterns heuristics via fork decomposition

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 182-189

  Katz, Michael ^a   Domshlak, Carmel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DECOMPOSITION; HEURISTIC METHODS; SCHEDULING;

BASIC IDEAS; CAUSAL GRAPHS; INFORMATIVENESS; LOW DIMENSIONALITIES; NON-PARAMETRIC; OPTIMAL PLANNING; STANDARD DOMAINS; STRUCTURAL PATTERNS;

ABSTRACTING;

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

References (22)

1. Bäckström, C., and Nebel, B. 1995. Complexity results for SAS+ planning. Comp. Intell. 11(4):625-655.
2. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1-2):5-33.
3. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. AIJ 69(1-2):165-204.
4. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Comp. Intell. 14(4):318-334.
5. Domshlak, C., and Dinitz, Y. 2001. Multi-agent off-line coordination: Structure and complexity. In ECP, 277-288.
6. Edelkamp, S. 2001. Planning with pattern databases. In ECP, 13-34.
7. Felner, A.; Korf, R. E.; and Hanan, S. 2004. Additive pattern database heuristics. JAIR 22:279-318.
8. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In ICAPS, 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 AAAI, 1007-1012.
10. Haslum, P.; Bonet, B.; and Geffner, H. 2005. New admissible heuristics for domain-independent planning. In AAAI, 1163-1168.
11. Helmert, M., and Mattmuller, R. 2008. Accuracy of admissible heuristic functions in selected planning domains. In AAAI. (Extended abstract in the ICAPS'07 workshops).
12. Helmert, M.; Haslum, P.; and Hoffmann, J. 2007. Flexible abstraction heuristics for optimal sequential planning. In ICAPS, 176-183.
13. Helmert, M. 2003. Complexity results for standard benchmark domains in planning. AIJ 146(2):219-262.
14. Helmert, M. 2004. A planning heuristic based on causal graph analysis. In ICAPS, 161-170.
15. Helmert, M. 2006a. The Fast Downward planning system. JAIR 26:191-246.
16. Helmert, M. 2006b. Solving Planning Tasks in Theory and Practice. Ph.D. Dissertation, Albert-Ludwigs University, Freiburg.
17. Hoffmann, J.; Sabharwal, A.; and Domshlak, C. 2006. Friends or foes? An AI planning perspective on abstraction and search. In ICAPS, 294-303.
18. Jonsson, P., and Bäckström, C. 1998. State-variable planning under structural restrictions: Algorithms and complexity. AIJ 100(1-2):125-176.
19. Jonsson, A. 2007. The role of macros in tractable planning over causal graphs. In IJCAI, 1936-1941.
20. Katz, M., and Domshlak, C. 2007. Structural patterns of tractable sequentially-optimal planning. In ICAPS, 200-207.
21. Katz, M., and Domshlak, C. 2008. Optimal additive composition of abstraction-based admissible heuristics. In ICAPS (this volume).
22. Pearl, J. 1984. Heuristics-Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.