Speeding up learning in reel-time search via automatic state abstraction

Proceedings of the National Conference on Artificial Intelligence

Volumn 3, Issue , 2005, Pages 1349-1354

  Bulitko, Vadini ^a   Sturtevant, Nathan ^a   Kazakevich, Maryia ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CONVERGENCE OF NUMERICAL METHODS; FUNCTIONS; HEURISTIC METHODS; LEARNING SYSTEMS; ROBOTICS;

AUTOMATIC STATE ABSTRACTION; HEURISTIC FUNCTIONS; LEARNING REALTIME SEARCH ALGORITHMS (LRTA); REAL-TIME SEARCH;

REAL TIME SYSTEMS;

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

References (20)

1. Barto, A. G., and Mahadevan, S. 2003. Recent advances in hierarchical reinforcement learning. DEDS 13:341-379.
2. Barto, A. G.; Bradtke, S. J.; and Singh, S. P. 1995. Learning to act using real-time dynamic programming. AIJ 72(1):81-138.
3. Bulitko, V. 2004. Learning for adaptive real-time search. Technical Report http://arxiv.org/abs/cs.AI/0407016, Computer Science Research Repository (CoRR).
4. Buro, M. 2002. ORTS: A hack-free RTS game environment. In Proceedings of Int. Computers and Games Conference, 12.
5. Chimura, F., and Tokoro, M. 1994. The Trailblazer search: A new method for searching and capturing moving targets. In Proceedings of the National Conf. on Artificial Intelligence, 1347-1352.
6. Dietterich, T. G. 1998. The MAXQ method for hierarchical reinforcement learning. In Proceedings of the International Conference on Machine Learning, 118-126.
7. Holte, R.; Perez, M.; Zimmer, R.; and MacDonald, A. 1995. Hierarchical A*: Searching abstraction hierarchies efficiently. Technical Report tr-95-18, U. of Ottawa.
8. Holte, R.; Mkadmi, T.; Zimmer, R. M.; and MacDonald, A. J. 1996. Speeding up problem solving by abstraction: A graph oriented approach. Artificial Intelligence 85(1-2):321-361.
9. Ishida, T., and Korf, R. 1991. Moving target search. In Proceedings of the Int. Joint Conf. on Artificial Intelligence, 204-210.
10. Kitano, H.; Tadokoro, S.; Noda, I.; Matsubara, H.; Takahashi, T.; Shinjou, A.; and Shimada, S. 1999. Robocup rescue: Search and rescue in large-scale disasters as a domain for autonomous agents research. In IEEE Conf. on Man, Systems, and Cybernetics.
11. Koenig, S., and Likhachev, M. 2002. D* Lite. In Proceedings of the National Conference on Artificial Intelligence, 476-483.
12. Koenig, S.; Tovey, C.; and Y., S. 2003. Performance bounds for planning in unknown terrain. Artificial Intelligence 147:253-279.
13. Koenig, S. 2004. A comparison of fast search methods for realtime situated agents, In Proceedings of the 3rd Int. Joint Conf. on Autonomous Agents and Multiagent Systems - vol. 2, 864-871.
14. Korf, R. 1990. Real-time heuristic search. AIJ 42(2-3):189-211.
15. Korf, R. 1993. Linear-space best-first search. AIJ 62:41-78.
16. Sasaki, T.; Chimura, F.; and Tokoro, M. 1995. The Trailblazer search with a hierarchical abstract map. In Proceedings of the International Joint Conference on Artificial Intelligence, 259-265.
17. Shimbo, M., and Ishida, T. 2003. Controlling the learning process of real-time heuristic search. AIJ 146(1):1-41.
18. Shue, L.-Y., and Zamani, R. 1993. An admissible heuristic search algorithm. In Proceedings of the 7th Int. Symp. on Methodologies for Intel. Systems (ISMIS-93), volume 689 of LNAI, 69-75.
19. Shue, L.-Y.; Li, S.-T; and Zamani, R. 2001. An intelligent heuristic algorithm for project scheduling problems. In Proceedings of the 32nd Annual Meeting of the Decision Sciences Institute.
20. Stenz, A. 1995. The focussed D* algorithm for real-time replanning. In Proceed, of the Int. Conf. on Artificial Intel., 1652-1659.