The role of macros in tractable planning

Journal of Artificial Intelligence Research

Volumn 36, Issue , 2009, Pages 471-511

  Jonsson, Anders ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; POLYNOMIALS;

PLANNING PROBLEM; TRACTABLE PLANNING;

TREES (MATHEMATICS);

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

References (29)

1. Amir, E., & Engelhardt, B. (2003). Factored Planning. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 929-935.
2. Botea, A., Enzenberger, M., Müller, M., & Schaeffer, J. (2005). Macro-FF: Improving AI Planning with Automatically Learned Macro-Operators. Journal of Artificial Intelligence Research, 24, 581-621. (Pubitemid 43130945)
3. Botea, A., Muller, M., & Schaeffer, J. (2007). Fast Planning with Iterative Macros. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 1828-1833.
4. Brafman, R., & Domshlak, C. (2003). Structure and Complexity in Planning with Unary Operators. Journal of Artificial Intelligence Research, 18, 315-349. (Pubitemid 41525939)
5. Brafman, R., & Domshlak, C. (2006). Factored Planning: How, When, and When Not. In Proceedings of the 21st National Conference on Artificial Intelligence.
6. Bylander, T. (1994). The computational complexity of propositional STRIPS planning. Artificial Intelligence, 69, 165-204.
7. Chapman, D. (1987). Planning for conjunctive goals. Artificial Intelligence, 32(3), 333-377.
8. Chen, H., & Giménez, O. (2007). Act Local, Think Global: Width Notions for Tractable Planning. In Proceedings of the 17th International Conference on Automated Planning and Scheduling.
9. Chen, H., & Giménez, O. (2008a). Causal Graphs and Structurally Restricted Planning. In Proceedings of the 18th International Conference on Automated Planning and Scheduling.
10. Chen, H., & Giménez, O. (2008b). On-the-fly macros. CoRR, abs/0810.1186.
11. 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.
12. Erol, K., Nau, D., & Subrahmanian, V. (1995). Complexity, decidability and undecidability results for domain-independent planning. Artificial Intelligence, 76(1-2), 75-88.
13. Fikes, R., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 5 (2), 189-208.
14. Giménez, O., & Jonsson, A. (2008). The Complexity of Planning Problems with Simple Causal Graphs. Journal of Artificial Intelligence Research, 31, 319-351. (Pubitemid 351761990)
15. Giménez, O., & Jonsson, A. (2009). Planning over Chain Causal Graphs for Variables with Domains of Size 5 Is NP-Hard. Journal of Artificial Intelligence Research, 34, 675-706.
16. Haslum, P. (2008). A New Approach To Tractable Planning. In Proceedings of the 18th International Conference on Automated Planning and Scheduling.
17. Helmert, M. (2006). The Fast Downward Planning System. Journal of Artificial Intelligence Research, 26, 191-246.
18. 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.
19. Jonsson, P., & Bäckström, C. (1998a). State-variable planning under structural restrictions: Algorithms and complexity. Artificial Intelligence, 100(1-2), 125-176. (Pubitemid 128403239)
20. 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.
21. Katz, M., & Domshlak, C. (2008a). New Islands of Tractability of Cost-Optimal Planning. Journal of Artificial Intelligence Research, 32, 203-288.
22. 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.
23. Kelareva, E., Buffet, O., Huang, J., & Thiébaux, S. (2007). Factored Planning Using Decomposition Trees. In Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 1942-1947.
24. Knoblock, C. (1994). Automatically generating abstractions for planning. Artificial Intelligence, 68(2), 243-302.
25. Korf, R. (1987). Planning as search: A quantitative approach. Artificial Intelligence, 33(1), 65-88.
26. Minton, S. (1985). Selectively generalizing plans for problem-solving. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pp. 596-599.
27. Newton, M., Levine, J., Fox, M., & Long, D. (2007). Learning Macro-Actions for Arbitrary Planners and Domains. In Proceedings of the 17th International Conference on Automated Planning and Scheduling, pp. 256-263.
28. Vidal, V. (2004). A Lookahead Strategy for Heuristic Search Planning. In Proceedings of the 14th International Conference on Automated Planning and Scheduling, pp. 150-159.
29. 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.