Abstract
Grid-based path finding is required in many video games and virtual worlds to move agents. With both map sizes and the number of agents increasing, it is important to develop path finding algorithms that are efficient in memory and time. In this work, we present an algorithm called DBA* that uses a database of pre-computed paths to reduce the time to solve search problems. When evaluated using benchmark maps from Dragon AgeTM, DBA* requires less memory and time for search, and performs less pre-computation than comparable real-time search algorithms. Further, its suboptimality is less than 3%, which is better than the PRA* implementation used in Dragon AgeTM.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Björnsson, Y., Bulitko, V., Sturtevant, N.: TBA*: Time-bounded A*. In: Proceedings of the International Joint Conferences on Artificial Intelligence (IJCAI), pp. 431–436 (2009)
Botea, A.: Ultra-fast optimal pathfinding without runtime search. In: Proceedings of the Second Artificial Intelligence and Interactive Digital Entertainment Conference (AIIDE), pp. 122–127 (2011)
Bulitko, V., Björnsson, Y., Lawrence, R.: Case-based subgoaling in real-time heuristic search for video game pathfinding. Journal of Artificial Intelligence Research 39, 269–300 (2010)
Bulitko, V., Luštrek, M., Schaeffer, J., Björnsson, Y., Sigmundarson, S.: Dynamic control in real-time heuristic search. Journal of Artificial Intelligence Research 32, 419–452 (2008)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)
Hernández, C., Baier, J.A.: Fast subgoaling for pathfinding via real-time search. In: Bacchus, F., Domshlak, C., Edelkamp, S., Helmert, M. (eds.) Proceedings of the International Conference on Artificial Intelligence Planning Systems (ICAPS), pp. 327–330. AAAI (2011)
Hernández, C., Baier, J.A.: Real-time heuristic search with depression avoidance. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 578–583 (2011)
Lawrence, R., Bulitko, V.: Database-driven real-time heuristic search in video-game pathfinding. IEEE Transactions on Computer Intelligence and AI in Games PP(99) (2013)
Sturtevant, N.: Memory-efficient abstractions for pathfinding. In: Proceedings of Artificial Intelligence and Interactive Digital Entertainment (AIIDE), pp. 31–36 (2007)
Sturtevant, N.R.: Benchmarks for grid-based pathfinding. IEEE Transactions on Computer Intelligence and AI in Games 4(2), 144–148 (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, W., Lawrence, R. (2013). Fast Grid-Based Path Finding for Video Games. In: Zaïane, O.R., Zilles, S. (eds) Advances in Artificial Intelligence. Canadian AI 2013. Lecture Notes in Computer Science(), vol 7884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38457-8_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-38457-8_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38456-1
Online ISBN: 978-3-642-38457-8
eBook Packages: Computer ScienceComputer Science (R0)