Factored planning using decomposition trees

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 1942-1947

  Kelareva, Elena ^a   Buffet, Olivier ^b,c   Huang, Jinbo ^b   Thiébaux, Sylvie ^b  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c LAAS CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AI PLANNING; DECOMPOSITION TREES; PLANNING ALGORITHMS; PROTOTYPE ALGORITHMS; SUB-DOMAINS;

ARTIFICIAL INTELLIGENCE; FORESTRY; TREES (MATHEMATICS);

ALGORITHMS;

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

References (11)

1. E. Amir and B. Engelhardt. Factored planning. In Eighteenth International Joint Conference on Artificial Intelligence (IJCAI'03), 2003.
2. R. Brafman and C. Domshlak. Factored planning: How, when and when not. In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI'06), 2006.
3. A. Darwiche and M. Hopkins. Using recursive decomposition to construct elimination orders, join trees, and dtrees. In Proceedings of the Sixth European Conference for Symbolic and Quantitative Approaches to Reasoning under Uncertainty (ECSQARU' 01), 2001.
4. A. Darwiche. Recursive conditioning. Artificial Intelligence Journal, 125(1-2):5-41, 2001. (Pubitemid 32196230)
5. M. Helmert. Planning heuristic based on causal graph analysis. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS' 04), pages 161-170, 2004.
6. J. Huang and A. Darwiche. A structure-based variable ordering heuristic for SAT. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI'03), 2003.
7. H. A. Kautz and B. Selman. Planning as satisfiability. In Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI'92), 1992.
8. C.A. Knoblock, J.D. Tenenberg, and Q. Yang. Characterizing abstraction hierarchies for planning. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI'91), 1991.
9. A.L. Lansky and L.C. Getoor. Scope and abstraction: Two criteria for localized planning. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI'95), pages 1924-1930, 1995.
10. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: engineering an efficient SAT solver. In Proceedings of the Thirty-Eighth Conference on Design Automation, pages 530-535, 2001.
11. N. Robertson and P. D. Seymour. Graph minors X: Obstructions to tree-decomposition. Journal of Combinatorial Theory, Series B, 52(2):153-190, 1991.