Causal graphs and structurally restricted planning

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

Volumn , Issue , 2008, Pages 36-43

  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

GRAPH THEORY;

CAUSAL GRAPHS; COMPLETE CLASSIFICATIONS; DIRECTED GRAPHS; GRAPH SETS; PLANNING PROBLEMS; POLYNOMIAL-TIME;

SCHEDULING;

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

References (16)

1. Bodirsky, M., and Grohe, M. 2008. Non-dichotomies in constraint satisfaction complexity. To appear in ICALP 2008.
2. Brafman, R., and Domshlak, C. 2003. Structure and Complexity in Planning with Unary Operators. Journal of Artificial Intelligence Research 18:315-349.
3. Brafman, R., and Domshlak, C. 2006. Factored Planning: How, When, and When Not. In Proceedings of the 21st National Conference on Artificial Intelligence.
4. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69:165-204.
5. Domshlak, C., and Dinitz, Y. 2001. Multi-Agent Off-line Coordination: Structure and Complexity. In Proceedings of the 6th European Conference on Planning, 277-288.
6. Downey, R., and Fellows, M. 1995. Fixed-parameter tractability and completeness II: On completeness for W[l]. Theoretical Computer Science 141.
7. Flum, J., and Grohe, M. 2006. Parameterized Complexity Theory. Springer-Verlag.
8. Giménez, O., and Jonsson, A. 2008. The Complexity of Planning Problems with Simple Causal Graphs. Journal of Artificial Intelligence Research 31:319-351.
9. Gottlob, G.; Leone, N.; and Scarcello, F. 2000. A comparison of structural CSP decomposition methods. Artif Intell. 124(2):243-282.
10. Grohe, M. 2007. The complexity of homomorphism and constraint satisfaction problems seen from the other side. J. ACM 54(1).
11. Helmert, M. 2004. A planning heuristic based on causal graph analysis. In Proceedings of the 14th International Conference on Automated Planning and Scheduling, 161-170.
12. Helmert, M. 2006. The Fast Downward Planning System. Journal of Artificial Intelligence Research 26:191-246.
13. Jonsson, P., and Bäckström, C. 1998. Tractable plan existence does not imply tractable plan generation. Annals of Mathematics and Artificial Intelligence 22(3-4):281-296.
14. Jonsson, A. 2007. The Role of Macros in Tractable Planning Over Causal Graphs. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, 1936-1941.
15. Katz, M., and Domshlak, C. 2007. Structural patterns of tractable sequentially-optimal planning. In Proceedings of the 17th International Conference on Automated Planning and Scheduling.
16. Knoblock, C. 1994. Automatically generating abstractions for planning. Artificial Intelligence 68(2):243-302.