Sven Koenig
ABSTRACT
Characters in real-time computer games need to move smoothly and thus need to search in real time. In this paper, we describe a simple but powerful way of speeding up repeated A* searches with the same goal states, namely by updating the heuristics between A* searches. We then use this technique to develop a novel real-time heuristic search method, called Real-Time Adaptive A*, which is able to choose its local search spaces in a fine-grained way. It updates the values of all states in its local search spaces and can do so very quickly. Our experimental results for characters in real-time computer games that need to move to given goal coordinates in unknown terrain demonstrate that this property allows Real-Time Adaptive A* to follow trajectories of smaller cost for given time limits per search episode than a recently proposed real-time heuristic search method [5] that is more difficult to implement.
- M. Bjornsson, M. Enzenberger, R. Holte, J. Schaeffer, and P. Yap. Comparison of different abstractions for pathfinding on maps. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1511--1512, 2003. Google Scholar
Digital Library
- V. Bulitko and G. Lee. Learning in real-time search: A unifying framework. Journal of Artificial Intelligence Research, page (in press), 2005. Google ScholarDigital Library
- P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 2:100--107, 1968.Google ScholarCross Ref
- T. Ishida. Real-Time Search for Learning Autonomous Agents. Kluwer Academic Publishers, 1997. Google ScholarDigital Library
- S. Koenig. A comparison of fast search methods for real-time situated agents. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems, pages 864--871, 2004. Google ScholarDigital Library
- S. Koenig and M. Likhachev. D* Lite. In Proceedings of the National Conference on Artificial Intelligence, pages 476--483, 2002. Google ScholarDigital Library
- S. Koenig and M. Likhachev. Adaptive A* {poster abstract}. In Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems, pages 1311--1312, 2005. Google ScholarDigital Library
- S. Koenig, C. Tovey, and Y. Smirnov. Performance bounds for planning in unknown terrain. Artificial Intelligence, 147:253--279, 2003. Google ScholarDigital Library
- R. Korf. Real-time heuristic search. Artificial Intelligence, 42(2--3):189--211, 1990. Google ScholarDigital Library
- J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1985. Google ScholarDigital Library
- A. Stentz. The focussed D* algorithm for real-time replanning. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 1652--1659, 1995. Google ScholarDigital Library
- S. Zilberstein. Operational Rationality through Compilation of Anytime Algorithms. PhD thesis, Computer Science Department, University of California at Berkeley, Berkeley (California), 1993. Google ScholarDigital Library
Recommendations
Adaptive A
AAMAS '05: Proceedings of the fourth international joint conference on Autonomous agents and multiagent systemsAgents often have to perform repeated on-line searches as they gain additional knowledge about their environment. We describe an incremental version of A*, called Adaptive A*, that solves series of similar search problems faster than running A* ...
D*lite
Eighteenth national conference on Artificial intelligenceIncremental heuristic search methods use heuristics to focus their search and reuse information from previous searches to find solutions to series of similar search tasks much faster than is possible by solving each search task from scratch. In this ...
Generalized Adaptive A*
AAMAS '08: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1Agents often have to solve series of similar search problems. Adaptive A* is a recent incremental heuristic search algorithm that solves series of similar search problems faster than A* because it updates the h-values using information from previous ...
Comments