On the hardness of planning problems with simple causal graphs

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

Volumn , Issue , 2007, Pages 152-159

  Giménez, Omer ^a   Jonsson, Anders ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GRAPHIC METHODS;

BINARY STATE; CAUSAL GRAPH; COMPLEXITY RESULTS; EXPONENTIALS; MULTI-VALUED; PLAN GENERATION; PLANNING PROBLEM; POLYNOMIAL-TIME ALGORITHMS; SIMPLE++; STATE-VARIABLES;

POLYNOMIAL APPROXIMATION;

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

References (16)

1. Bäckström, C., and Nebel, B. 1995. Complexity Results for SAS+ Planning. Computational Intelligence 11(4):625-655.
2. Botea, A.; Enzenberger, M.; Müller, M.; and Schaeffer, J. 2005. Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. Journal of Artificial Intelligence Research 24:581-621.
3. Brafman, R., and Domshlak, C. 2003. Structure and Complexity in Planning with Unary Operators. Journal of Artificial Intelligence Research 18:315-349.
4. Brafman, R., and Domshlak, C. 2006. Factored Planning: How, When, and When Not. In Proceedings of the 21st National Conference on Artificial Intelligence.
5. Bylander, T. 1994. The computational complexity of propositional STRIPS planning. Artificial Intelligence 69:165-204.
6. Chapman, D. 1987. Planning for conjunctive goals. Artificial Intelligence 32(3):333-377.
7. 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.
8. Fikes, R., and Nilsson, N. 1971. STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 5(2):189-208.
9. Helmert, M. 2006. The Fast Downward Planning System. Journal of Artificial Intelligence Research 26:191-246.
10. Jonsson, P., and Backstrom, C. 1998. Tractable plan existence does not imply tractable plan generation. Annals of Mathematics and Artificial Intelligence 22(3-4):281-296.
11. 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.
12. Knoblock, C. 1994. Automatically generating abstractions for planning. Artificial Intelligence 68(2):243-302.
13. Korf, R. 1987. Planning as search: A quantitative approach. Artificial Intelligence 33(1):65-88.
14. Minton, S. 1985. Selectively generalizing plans for problem-solving. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, 596-599.
15. Vidal, V. 2004. A Lookahead Strategy for Heuristic Search Planning. In Proceedings of the 14th International Conference on Automated Planning and Scheduling, 150-159.
16. Williams, B., and Nayak, P. 1997. A reactive planner for a model-based executive. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, 1178-1185.