Abstract
This paper deals with the problem of pathfinding in real-time strategy games. We have introduced a new algorithm: Demand Sensitive Map Abstraction (DSMA) to overcome some of the challenges faced by the benchmark hierarchical pathfinding algorithm: Hierarchical Pathfinding A* (HPA*). DSMA is a type of hierarchical pathfinding algorithm in which we vary the granularity of the abstract map based on pathfinding request demand associated with various regions in the abstract map and the time taken by DSMA to find the previous path. Results from experiments show that dynamically varying the granularity of abstraction helps in maintaining a balance between path quality and search time.
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
Holte, R.C., Perez, M.B., Zimmer, R.M., MacDonald, A.J.: Hierarchical A*: searching abstraction hierarchies effiiently. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, vol. 1, pp. 530–535. AAAI Press (1996)
Botea, A., Muller, M., Schaeffer, J.: Near optimal hierarchical pathfinding. Journal of Game Development 1(1), 7–28 (2004)
Jansen, M.R., Buro, M.: HPA* enhancements. In: Proceedings of the Third Artificial Intelligence and Interactive Digital Entertainment Conference, Stanford, California, USA, pp. 84–87 (2007)
Samet, H.: The design and analysis of spatial data structures, vol. 85, p. 87. Addison-Wesley, Reading (1990)
Duchaineau, M., Wolinsky, M., Sigeti, D.E., Miller, M.C., Aldrich, C., Mineev-Weinstein, M.B.: ROAMing terrain: real-time optimally adapting meshes. In: Proceedings of the IEEE Visualization 1997, pp. 81–88 (1997)
Demyen, D.J., Buro, M.: Efficient triangulation-based pathfinding. Masters Abstracts International 45(03) (2006)
Dalmau, D.S.C.: Core techniques and algorithms in game programming. New Riders Pub. (2004)
Bulitko, V., Sturtevant, N., Lu, J., Yau, T.: Graph abstraction in real-time heuristic search. JAIR 30, 51–100 (2007)
Lindstrom, P., Koller, D., Ribarsky, W., Hodges, L.F., Faust, N., Turner, G.A.: Real-time, continuous level of detail rendering of height fields. In: Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, pp. 109–118. ACM (1996)
Hart, P.E., Nilsson, N.J., 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)
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
Bhattacharjee, S., Goodwin, S.D. (2013). Pathfinding by Demand Sensitive Map Abstraction. 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_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-38457-8_21
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)