Marvin: A heuristic search planner with online macro-action learning

Journal of Artificial Intelligence Research

Volumn 28, Issue , 2007, Pages 119-156

  Coles, Andrew ^a   Smith, Amanda ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; LEARNING SYSTEMS; ONLINE SYSTEMS;

MACRO-ACTION LEARNING; SEARCH BEHAVIOR;

SEARCH ENGINES;

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

References (24)

1. Bacchus, F. (2001). The aips '00 planning competition.. AI Magazine, 22(3), 47-56.
2. Blum, A., & Furst, M. (1995). Fast planning through planning graph analysis. In Proceedings of the Fourteenth International Joint Conference on Artificial Inteligence (IJCAI-95), pp. 1636-1642.
3. Bonet, B., & Geffner, H. (2000). HSP: Heuristic search planner. AI Magazine, 21(2).
4. Botea, A., Enzenberger, M., Muller, M., & Schaeffer, J. (2005). Macro-FF: Improving AI planning with automatically learned macro-operators. Journal of Artificial Intelligence Research, 24, 581-621.
5. Dawson, C., & Siklossy, L. (1977). The role of preprocessing in problem solving systems. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, (IJCAI-77), pp. 465-471.
6. Fikes, R., & Nilsson, N. (1971). STRIPS: A new approach to the application of theorem proving to problem solving. In Proceedings of the 2nd International Joint Conference on Artificial Intelligence (IJCAI-71), pp. 608-620.
7. Gazen, B., & Knoblock, C. (1997). Combining the expressivity of UCPOP with the efficiency of Graphplan. In Proceedings of the Fourth European Conference on Planning (ECP-97), pp. 221-233.
8. Helmert, M. (2004). A planning heuristic based on causal graph analysis. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), pp. 161-170.
9. Helmert, M. (2006). The fast downward planning system. Journal of Artificial Intelligence Research, 26, 191-246.
10. Hoffmann, J., & Edelkamp, S. (2005). The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research, 24, 519-579.
11. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14, 253-302.
12. Hoffmann, J. (2001). Local search topology in planning benchmarks: An empirical analysis. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-01), pp. 453-458.
13. Hoffmann, J. (2005). Where 'ignoring delete lists' works: Local search topology in planning bench-marks. Journal of Artificial Intelligence Research, 24, 685-758.
14. Koehler, J., Nebel, B., Hoffmann, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL sub-set. In Proceedings of the Fourth European Conference on Planning (ECP-97), pp. 275-287.
15. Long, D., & Fox, M. (2003). The 3rd International Planning Competition: Results and Analysis. Journal of Artificial Intelligence Research, 20, 1-59.
16. Long, D., & Fox, M. (1999). Efficient implementation of the plan graph in STAN. Journal of Artificial Intelligence Research, 10, 87-115.
17. Long, D., & Fox, M. (2003). The third international planning competition: Results and analysis. Journal of Artificial Intelligence Research, 20, 1-59.
18. McDermott, D. (1996). A heuristic estimator for means ends analysis in planning. In Drabble, B. (Ed.), Proceedings of the Third International Conference on Artificial Intelligence Planning Systems (AIPS-96), pp. 142-149. AAAI Press.
19. McDermott, D. (2000). The 1998 AI planning systems competition. AI Magazine, 27(2), 35-55.
20. Minton, S. (1985). Selectively generalizing plans for problem-solving. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence (IJCAI-85).
21. Nebel, B., Hoffmann, J., & Thiebaux, S. (2003). In defense of PDDL axioms. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 961-966.
22. Newton, M., Levine, J., & Fox, M. (2005). Genetically evolved macro-actions in A.I. planning problems. In Tuson, A. (Ed.), Proceedings of the 24th UK Planning and Scheduling SIG, pp. 163-172.
23. Pednault, E. (1989). ADL: Exploring the middle ground between STRIPS and the situation calculus. In Proceedings of the First International Conference on Principles of Knowledge Representation and Reasoning, pp. 324-332.
24. Vidal, V. (2004). A lookahead strategy for heuristic search planning. In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS-04), pp. 150-160.