Structural patterns of tractable sequentially-optimal planning

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 200-207

  Katz, Michael ^a   Domshlak, Carmel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; SCHEDULING;

CLASSICAL PLANNING; CONSTRAINT OPTIMIZATIONS; CONSTRUCTIVE PROOF; OPTIMAL PLANNING; OPTIMISATIONS; PLANNING PROBLEM; SEARCH HEURISTICS; STRUCTURAL CHARACTERISTICS; STRUCTURAL PATTERN; STRUCTURE-BASED;

CONSTRAINED OPTIMIZATION;

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

References (27)

1. Bacchus, E, and Yang, Q. 1994. Downward refinement and the efficiency of hierarchical problem solving. AIJ 71(1):43-100.
2. Bäckström, C., and Klein, I. 1991. Planning in polynomial time: The SAS-PUBS class. Comp. Intell. 7(3):181-197.
3. + planning. Comp. Intell. 11(4):625-655.
4. Bonet, B., and Geffner, H. 2001. Planning as heuristic search. AIJ 129(1-2):5-33.
5. Brafman, R. I., and Domshlak, C. 2003. Structure and complexity of planning with unary operators. JAIR 18:315-349.
6. Brafman, R. I., and Domshlak, C. 2006. Factored planning: How, when, and when not. In AAAI, 809-814.
7. Bylander, T. 1994. The computational complexity of prepositional STRIPS planning. AIJ 69(1-2):165-204.
8. Chapman, D. 1987. Planning for conjunctive goals. AIJ 32(3):333-377.
9. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Comp. Intell. 14(4):318-334.
10. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
11. Domshlak, C., and Dinitz, Y. 2001. Multi-agent off-line coordination: Structure and complexity. In ECP, 277-288.
12. Edelkamp, S. 2001. Planning with pattern databases. In ECP, 13-34.
13. Edelkamp, S. 2002. Symbolic pattern databases in heuristic search planning. In AIPS, 274-293.
14. Erol, K.; Nau, D. S.; and Subrahmanian, V. S. 1995. Complexity, decidability and undecidability results for domainindependent planning. AIJ 76(1-2):75-88.
15. Felner, A.; Korf, R. E.; and Hanan, S. 2004. Additive pattern database heuristics. JAIR 22:279-318.
16. Gimenez, O. 2006. Solving planning domains with polytree causal graphs is NP-complete. arXiv:cs.AI/0610095.
17. Haslum, P., and Geffner, H. 2000. Admissible heuristics for optimal planning. In ICAPS, 140-149.
18. Helmert, M. 2006. The Fast Downward planning system. JAIR 26:191-246.
19. Hoffmann, J., and Nebel, B. 2001. The FF planning system: Fast plan generation through heuristic search. JAIR 14:253-302.
20. Holte, R. C.; Felner, A.; Newton, J.; Meshulam, R.; and Furcy, D. 2006. Maximizing over multiple pattern databases speeds up heuristic search. AIJ 170(16-17):1123-1136.
21. Jonsson, P., and Bäckström, C. 1998. State-variable planning under structural restrictions: Algorithms and complexity. AIJ 100(1-2):125-176.
22. Jonsson, A. 2007. The role of macros in tractable planning over causal graphs. In IJCAI, 1936-1941.
23. Katz, M., and Domshlak, C. 2007. Structural patterns heuristics. In ICAPS-07 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges.
24. Klein, I.; Jonsson, P.; and Bäckström, C. 1998. Efficient planning for a miniature assembly line. Artificial Intelligence in Engineering 13(1):69-81.
25. Knoblock, C. 1994. Automatically generating abstractions for planning. AIJ 68(2):243-302.
26. Refanidis, I., and Vlahavas, I. P. 2001. The GRT planning system: Backward heuristic construction in forward statespace planning. JAIR 15:115-161.
27. Williams, B., and Nayak, P. 1997. A reactive planner for a model-based executive. In IJCAI, 1178-1185.