Macro-FF: Improving AI planning with automatically learned macro-operators

Journal of Artificial Intelligence Research

Volumn 24, Issue , 2005, Pages 581-621

  Botea, Adi ^a   Enzenberger, Markus ^a   Müller, Martin ^a   Schaeffer, Jonathan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPETITION; INFORMATION ANALYSIS; PLANNING; PROBLEM SOLVING;

COMPLEX DOMAINS; DOMAIN STRUCTURE; MACRO-OPERATORS; STRUCTURAL INFORMATION;

LEARNING SYSTEMS;

EID: 31144471495     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1696     Document Type: Article

References (31)

1. Bacchus, F. (2001). AIPS'00 Planning Competition. AI Magazine, 22(3), 47-56.
2. Bacchus, F., & Kabanza, F. (2000). Using Temporal Logics to Express Search Control Knowledge for Planning. Artificial Intelligence, 16, 123-191.
3. Bacchus, F., & Yang, Q. (1994). Downward Refinement and the Efficiency of Hierarchical Problem Solving. Artificial Intelligence, 71(1), 43-100.
4. Botea, A., Müller, M., & Schaeffer, J. (2002). Using Abstraction for Planning in Sokoban. In Schaeffer, J., Müller, M., & Björnsson, Y. (Eds.), 3rd International Conference on Computers and Games (CG'2002), Vol. 2883 of Lecture Notes in Artificial Intelligence, pp. 360-375, Edmonton, Canada. Springer.
5. Botea, A., Müller, M., & Schaeffer, J. (2004a). Near Optimal Hierarchical Path-Finding. Journal of Game Development, 1(1), 7-28.
6. Botea, A., Müller, M., & Schaeffer, J. (2004b). Using Component Abstraction for Automatic Generation of Macro-Actions. In Fourteenth International Conference on Automated Planning and Scheduling ICAPS-04, pp. 181-190, Whistler, Canada. AAAI Press.
7. Coles, A., & Smith, A. (2004). Marvin: Macro Actions from Reduced Versions of the Instance. In Booklet of the Fourth International Planning Competition, pp. 24-26.
8. Fikes, R. E., & 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. (2004). A Planning Heuristic Based on Causal Graph Analysis. In Fourteenth International Conference on Automated Planning and Scheduling ICAPS-04, pp. 161-170, Whistler, Canada.
10. Hernádvölgyi, I. (2001). Searching for Macro-operators with Automatically Generated Heuristics. In Fourteenth Canadian Conference on Artificial Intelligence, pp. 194-203.
11. Hoffmann, J., Edelkamp, S., Englert, R., Liporace, F., Thiébaux, S., & Trüg, S. (2004). Towards Realistic Benchmarks for Planning: the Domains Used in the Classical Part of IPC-4. In Booklet of the Fourth International Planning Competition, pp. 7-14.
12. Hoffmann, J., & Nebel, B. (2001). The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research, 14, 253-302.
13. Iba, G. A. (1989). A Heuristic Approach to the Discovery of Macro-Operators. Machine Learning, 5(4), 285-317.
14. Junghanns, A., & Schaeffer, J. (2001). Sokoban: Enhancing Single-Agent Search Using Domain Knowledge. Artificial Intelligence, 129(1-2), 219-251.
15. Kambhampati, S. (1993). Machine Learning Methods for Planning, chap. Supporting Flexible Plan Reuse, pp. 397-434. Morgan Kaufmann.
16. Knoblock, C. A. (1994). Automatically Generating Abstractions for Planning. Artificial Intelligence, 68(2), 243-302.
17. Korf, R. (1985). Macro-Operators: A Weak Method for Learning. Artificial Intelligence, 26(1), 35-77.
18. Kvarnström, J., & Doherty, P. (2001). TALplanner: Temporal Logic Based Forward Chaining Planner. Annals of Mathematics and Artificial Intelligence, 30, 119-169.
19. Long, D., & Fox, M. (2003). The 3rd International Planning Competition: Results and Analysis. Journal of Artificial Intelligence Research, 20, 1-59. Special Issue on the 3rd International Planning Competition.
20. Marsland, T. A. (1986). A Review of Game-Tree Pruning. International Computer Chess Association Journal, 9(1), 3-19.
21. McCluskey, T. L., & Porteous, J. M. (1997). Engineering and Compiling Planning Domain Models to Promote Validity and Efficiency. Artificial Intelligence, 95, 1-65.
22. McDermott, D. (2000). The 1998 AI Planning Systems Competition. AI Magazine, 21(2), 35-55.
23. Minton, S. (1985). Selectively Generalizing Plans for Problem-Solving. In IJCAI-85, pp. 596-599.
24. Minton, S. (1988). Learning Search Control Knowledge: An Explanation-Based Approach.. Hingham, MA. Kluwer Academic Publishers.
25. Mooney, R. (1988). Generalizing the Order of Operators in Macro-Operators. In Fifth International Conference on Machine Learning ICML-88, pp. 270-283.
26. Nau, D., Au, T., Ilghami, O., Kuter, U., Murdock, J., Wu, D., & Yaman, F. (2003). SHOP2: An HTN Planning System. Journal of Artificial Intelligence Research, 20, 379-404.
27. Sacerdoti, E. (1975). The Nonlinear Nature of Plans. In Proceedings IJCAI-75, pp. 206-214.
28. Tate, A. (1977). Generating Project Networks. In Proceedings of IJCAI-77, pp. 888-893.
29. Veloso, M., & Carbonell, J. (1993). Machine Learning Methods for Planning, chap. Toward Scaling Up Machine Learning: A Case Study with Derivational Analogy, pp. 233-272. Morgan Kaufmann.
30. Vidal, V. (2004). A Lookahead Strategy for Heuristic Search Planning. In Fourteenth International Conference on Automated Planning and Scheduling ICAPS-04, pp. ISO-159, Whistler, Canada.
31. Wilkins, D., & desJardins, M. (2001). A Call for Knowledge-Based Planning. AI Magazine, 22(1), 99-115.