Act local, think global: Width notions for tractable planning

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

Volumn , Issue , 2007, Pages 73-80

  Chen, Hubie ^a   Giménez, Omer ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

AI PLANNING; BENCHMARK DOMAINS; DOMAIN INDEPENDENTS; STRUCTURAL CONDITION; TRACTABLE PLANNING;

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

References (15)

1. Amir, E., and Engelhardt, B. 2003. Factored planning. In IJCAI 2003, 929-935.
2. Bäckström, C., and Nebel, B. 1995. Complexity results for SAS+ planning. Computational Intelligence 11(4):625-655.
3. Barrett, A., and Weld, D. 1993. Characterizing subgoal interactions for planning. In Proceedings of IJCAI-93, 1388-1393.
4. Brafman, R., and Domshlak, C. 2003. Structure and complexity of planning with unary operators. JAIR 18:315-349.
5. Brafman, R., and Domshlak, C. 2006. Factored planning: How, when, and when not. In AAAI 2006.
6. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69:165-204.
7. Erol, K.; Nau, D. S.; and Subrahmanian, V. S. 1995. Complexity, decidability and undecidability results for domainindependent planning. Artificial intelligence 76:625-655.
8. Haslum, P. 2007. Reducing accidental complexity in planning problems. In Proc. 20th International Joint Conference on Artificial Intelligence.
9. Helmert, M. 2004. A planning heuristic based on causal graph analysis. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 161-170.
10. Helmert, M. 2006. The fast downward planning system. Journal of Artifical Intelligence Research 26:191-246.
11. Hoffmann, J., and Nebel, B. 2001. The ff planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14:253-302.
12. Jonsson, P., and Backstrom, C. 1994a. Complexity results for state-variable planning under mixed syntactical and structural restrictions. Technical Report R-95-17, Department of Computer and Information Science, Linköping University.
13. Jonsson, P., and Bäckström, C. 1994b. Tractable planning with state variables by exploiting structural restrictions. Technical Report R-95-16, Department of Computer and Information Science, Linköping University.
14. Korf, R. E. 1987. Planning as search: A quantitative approach. Artificial Intelligence 33:65-88.
15. Vidal, V., and Geffner, H. 2005. Solving simple planning problems with more inference and no search. In Proc. of the 11th Int. Conf. on Principles and Practice of Constraint Programming (CP-05).