Learning partial-order macros from solutions

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 231-240

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

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED METHODS; DOMAIN STRUCTURE; HEURISTIC TECHNIQUES; PROBLEM INSTANCES; PROBLEM SOLUTIONS; RANKING PROCEDURES; STRUCTURE INFORMATION; TRAINING PROCESS;

AUTOMATION; HEURISTIC METHODS; PERSONNEL TRAINING;

PROBLEM SOLVING;

EID: 31144460882     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Botea, A.; Enzenberger, M.; Miiller, M. and Schaeffer, J. 2004. Macro-FF. In 4th International Planning Competi- Tion, 15-17.
2. Botea, A.; Miiller, M.; and Schaeffer, J. 2002. Using Abstraction for Planning in Sokoban. In 3rd International Conference on Computers and Games (CG'2002).
3. Botea, A.; Miiller, M.; and Schaeffer, J. 2004a. Near Optimal Hierarchical Path-Finding. Journal of Game Development l(l):7-28.
4. Botea, A.; Miiller, M.; and Schaeffer, J. 2004b. Using Component Abstraction for Automatic Generation of Macro-Actions. In ICAPS-04, 181-190.
5. Coles, A. and Smith, A. 2004. Marvin: Macro Actions from Reduced Versions of the Instance. In 4th International Planning Competition, 24-26.
6. Fikes, R. E. and Nilsson, N. 1971. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving. Artificial Intelligence 5(2): 189-208.
7. Hernadvolgyi, I. 2001. Searching for Macro-operators with Automatically Generated Heuristics. In 14th Canadian Conference on Artificial Intelligence, 194-203.
8. Hoffmann, J., and Nebel, B. 2001. The FF Planning System: Fast Plan Generation Through Heuristic Search. JAIR 14:253-302.
9. Hoffmann, J.; Edelkamp, S.; Englert, R.; Liporace, F.; Thiebaux, S.; and Triig, S. 2004. Towards Realistic Benchmarks for Planning: The Domains Used in the Classical Part ofIPC-4. In 4th International Planning Competition, 7-14.
10. Iba, G. A. 1989. A Heuristic Approach to the Discovery of Macro-Operators. Machine Learning 3(4):285-317.
11. Junghanns, A. and Schaeffer, J. 2001. Sokoban: Enhancing Single-Agent Search Using Domain Knowledge. Artificial Intelligence 129( 1-2): 219-251.
12. Kambhampati, S. 1993. Machine Learning Methods for Planning. Morgan Kaufmann. chapter Supporting Flexible Plan Reuse, 397-434.
13. Korf, R. E. 1985. Macro-operators: A weak method for learning. Artificial Intelligence 26(1):35-77.
14. Mc Cluskey, T. L. and Porteous, J. M. 1997. Engineering and Compiling Planning Domain Models to Promote Validity and Efficiency. Artificial Intelligence 95:1-65.
15. Minton, S. 1985. Selectively Generalizing Plans for Problem-Solving. In IJCAI-85, 596-599.
16. Mooney, R. 1988. Generalizing the Order of Operators in Macro-Operators. In Fifth International Converence on Machine Learning ICML-88, 270-283.
17. Nguyen, X. and Kambhampati, S. 2001. Reviving Partial Order Planning. In Nebel, B ed IJCA1-01, 459-466.
18. Veloso, M., and Carbonell, J. 1993. Machine Learning Methods for Planning. Morgan Kaufmann. chapter Toward Scaling Up Machine Learning: A Case Stydy with Derivational Analogy, 233-272.
19. Vidal, V. 2004a. A Lookahead Strategy for Heuristic Search Planning. In ICAPS-04, 150-159.
20. Vidal, V. 2004b. The YAHSP Planning System: Forward Heuristic Search with Lookahead Plans Analysis. In 4th International Planning Competition, 56-58.