Planning over chain causal graphs for variables with domains of size 5 is NP-hard

Journal of Artificial Intelligence Research

Volumn 34, Issue , 2009, Pages 675-706

  Gimeńez, 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; ELECTRONICS ENGINEERING;

BOUNDED SIZE; CAUSAL GRAPH; DIRECTED PATHS; NP-HARD; PLANNING PROBLEM; STATE VARIABLES; UNARY OPERATORS; UPPER BOUND;

DIRECTED GRAPHS;

EID: 78650615310     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2742     Document Type: Article

References (16)

1. Brafman, R., & Domshlak, C. (2003). Structure and Complexity in Planning with Unary Operators. Journal of Artificial Intelligence Research, 18, 315-349. (Pubitemid 41525939)
2. Brafman, R., & Domshlak, C. (2006). Factored Planning: How, When, and When Not. In Proceedings of the 21st National Conference on Artificial Intelligence, pp. 809-814.
3. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69, 165-204.
4. Chapman, D. (1987). Planning for conjunctive goals. Artificial Intelligence, 32(3), 333-377.
5. Chen, H., & Giménez, O. (2008). Causal Graphs and Structurally Restricted Planning. In Proceedings of the 18th International Conference on Automated Planning and Scheduling, pp. 36-43.
6. Domshlak, C., & Dinitz, Y. (2001). Multi-Agent Off-line Coordination: Structure and Complexity. In Proceedings of the 6th European Conference on Planning, pp. 277-288.
7. Erol, K., Nau, D., & Subrahmanian, V. (1995). Complexity, Decidability and Undecidability Results for Domain-Independent Planning. Artificial Intelligence, 76(1-2), 75-88.
8. Giménez, O., & Jonsson, A. (2008a). The Complexity of Planning Problems with Simple Causal Graphs. Journal of Artificial Intelligence Research, 31, 319-351. (Pubitemid 351761990)
9. Giménez, O., & Jonsson, A. (2008b). In Search of the Tractability Boundary of Planning Problems. In Proceedings of the 18th International Conference on Automated Planning and Scheduling, pp. 99-106.
10. Helmert, M. (2006). The Fast Downward Planning System. Journal of Artificial Intelligence Research, 26, 191-246.
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, pp. 1936-1941.
12. Jonsson, P., & 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.
13. Katz, M., & Domshlak, C. (2008a). New Islands of Tractability of Cost-Optimal Planning. Journal of Artificial Intelligence Research, 32, 203-288.
14. Katz, M., & Domshlak, C. (2008b). Structural Patterns Heuristics via Fork Decompositions. In Proceedings of the 18th International Conference on Automated Planning and Scheduling, pp. 182-189.
15. Knoblock, C. (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68(2), 243-302.
16. Williams, B., & Nayak, P. (1997). A reactive planner for a model-based executive. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pp. 1178-1185.