Using component abstraction for automatic generation of macro-actions

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 181-190

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

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MAPPING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS;

AUTOMATIC GENERATION; COMPONENT ABSTRACTION; DOMAIN FORMULATION;

SEMANTICS;

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

References (14)

1. Bacchus, F., and Yang, Q. 1994. Downward Refinement and the Efficiency of Hierarchical Problem Solving. Artificial Intelligence 71(1):43-100.
2. Bacchus, F. 2001. AIPS'00 Planning Competition. AI Magazine 22(3):47-56.
3. Botea, A.; Müller, M.; and Schaeffer, J. 2003. Extending PDDL for Hierarchical Planning and Topological Abstraction. In Proceedings of the ICAPS-03 Workshop on PDDL, 25-32.
4. Hemádvölgyi, I. 2001. Searching for Macro-operators with Automatically Generated Heuristics. In 14th Canadian Conference on Artificial Intelligence, AI 2001, 194-203.
5. Hoffmann, J., and Nebel, B. 2001. The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research 14:253-302.
6. Hoffmann, J. 2001. Local search topology in planning benchmarks: An empirical analysis. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), 453-458.
7. Hoffmann, J. 2002. Local search topology in planning benchmarks: A theoretical analysis. In Proceedings of the 6th International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02). 379-387.
8. Junghanns, A. 1999. Pushing the Limits: New Developments in Single-Agent Search. Ph.D. Dissertation, University of Alberta.
9. Knoblock, C. A. 1994. Automatically Generating Abstractions for Planning. Artificial Intelligence 68(2):243-302.
10. Korf, R. E. 1985. Macro-operators: A weak method for learning. Artificial Intelligence 26(1):35-77.
11. Long, D., and 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.
12. Long, D.; Fox, M.; and Hamdi, M. 2002. Reformulation in Planning. In Koenig, S., and Holte, R., eds., Proceedings of the 5th International Symposium on Abstraction, Reformulation, and Approximation, volume 2371 of Lecture Notes in Artificial Intelligence, 18-32.
13. McDermott, D. 2000. The 1998 AI Planning Systems Competition. AI Magazine 21(2):35-55.
14. Precup, D.; Sutton, R.; and Singh, S. 1997. Planning with Closed-loop Macro Actions. In Working notes of the 1997 AAAI Fall Symposium on Model-directed Autonomous Systems, 1997.