New islands of tractability of cost-optimal planning

Journal of Artificial Intelligence Research

Volumn 32, Issue , 2008, Pages 203-288

  Katz, Michael ^a   Domshlak, Carmel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED OPTIMIZATION; PLANNING;

CAUSAL GRAPH; CLASSICAL PLANNING; CONSTRAINT OPTIMIZATIONS; CONSTRUCTIVE PROOF; IN-DEGREE; OPTIMAL PLANNING; PLANNING PROBLEM; STATE VARIABLES;

TOPOLOGY;

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

References (35)

1. Bacchus, F., & Yang, Q. (1994). Downward refinement and the efficiency of hierarchical problem solving. Artificial Intelligence, 71(1), 43-100.
2. Bäckström, C., & Klein, I. (1991). Planning in polynomial time: The SAS-PUBS class. Computational Intelligence, 7(3), 181-197.
3. + planning. Computational Intelligence, 11(4), 625-655.
4. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(12), 5-33.
5. Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., & Poole, D. (2004). CP-nets: A tool for representing and reasoning about conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research, 21, 135-191.
6. Brafman, R. I., & Domshlak, C. (2003). Structure and complexity of planning with unary operators. Journal of Artificial Intelligence Research, 18, 315-349.
7. Brafman, R. I., & Domshlak, C. (2006). Factored planning: How, when, and when not. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), pp. 809-814, Boston, MA.
8. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69(1-2), 165-204.
9. Chapman, D. (1987). Planning for conjunctive goals. Artificial Intelligence, 32(3), 333-377.
10. Gormen, T. H., Leiserson, C. E., & Rivest, R. L. (1990). Introduction to Algorithms. MIT Press.
11. Dechter, R. (2003). Constraint Processing. Morgan Kaufmann.
12. Edelkamp, S. (2001). Planning with pattern databases. In Proceedings of the European Conference on Planning (ECP), pp. 13-34.
13. Erol, K., Nau, D. S., & Subrahmanian, V. S. (1995). Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, Special Issue on Planning, 76(1-2), 75-88.
14. Garey, M. R., & Johnson, D. S. (1978). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New-York.
15. Gimenez, O., & Jonsson, A. (2008). The complexity of planning problems with simple causal graphs. Journal of Artificial Intelligence Research, 31, 319-351.
16. Haslum, P. (2006). Admissible Heuristics for Automated Planning. Ph.D. thesis, Linköping University, Department of Computer and Information Science.
17. Haslum, P., Bonet, B., & Geffner, H. (2005). New admissible heuristics for domain-independent planning. In Proceedings of the 20th National Conference on Artificial Intelligence (AAAI), pp. 1163-1168, Pittsburgh, PA.
18. Haslum, P., & Geffner, H. (2000). Admissible heuristics for optimal planning. In Proceedings of the 15th International Conference on Artificial Intelligence Planning Systems (AIPS), pp. 140-149, Breckenridge, CO.
19. Helmert, M. (2003). Complexity results for standard benchmark domains in planning. Artificial Intelligence, 146(2), 219-262.
20. Helmert, M. (2006). The Fast Downward planning system. Journal of Artificial Intelligence Research, 26, 191-246.
21. Hoffmann, J. (2003). Utilizing Problem Structure in Planning: A Local Search Approach. No. 2854 in LNAI. Springer-Verlag.
22. Hoffmann, J., & Edelkamp, S. (2005). The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research, 24, 519-579.
23. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
24. Jonsson, P., & Bäckström, C. (1995). Incremental planning. In New Directions in AI Planning: EWSP'95-3rd European Workshop on Planning, pp. 79-90, Assisi, Italy.
25. Jonsson, P., & Bäckström, C. (1998a). State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence, 100(1-2), 125-176.
26. Jonsson, P., & Bäckström, C. (1998b). Tractable plan existence does not imply tractable plan generation. Annals of Mathematics and Artificial Intelligence, 22(3-4), 281-296.
27. Kambhampati, S. (1995). Admissible pruning strategies based on plan minimality for planspace planning. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp. 1627-1635, Montreal, Canada.
28. Katz, M., & Domshlak, C. (2007). Structural patterns heuristics. In ICAPS-07 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges, Providence, RI.
29. Klein, I., Jonsson, P., & Bäckström, C. (1998). Efficient planning for a miniature assembly line. Artificial Intelligence in Engineering, 13(1), 69-81.
30. Knoblock, C. (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68(2), 243-302.
31. Newell, A., & Simon, H. A. (1963). GPS: A program that simulates human thought. In Feigenbaum, E. A., & Feldman, J. (Eds.), Computers and Thought, pp. 279-293. Oldenbourg.
32. Sacerdoti, E. (1974). Planning in a hierarchy of abstraction spaces. Artificial Intelligence, 5, 115-135.
33. Tenenberg, J. D. (1991). Abstraction in planning. In Allen, J. F., Kautz, H. A., Pelavin, R. N., & Tenenberg, J. D. (Eds.), Reasoning About Plans, chap. 4, pp. 213-283. Morgan Kaufmann.
34. Williams, B., & Nayak, P. (1996). A model-based approach to reactive self-configuring systems. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI), pp. 971-977, Portland, OR.
35. Williams, B., & Nayak, P. (1997). A reactive planner for a model-based executive. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI), pp. 1178-1185, Nagoya, Japan.