Abstract
A* is a widely used algorithm for path-finding in the area of Artificial Intelligence for video games. Even though this algorithm guarantees optimality, it tends to bring forth similar behaviors in agents that are spatially close to each other. On the other hand, when the agents are sparsely distributed, the algorithm doesn’t ensure an attack that comes from different places. We propose four variations of A* that produce ambush behaviors and diversity of paths: A*mbush, P-A*mbush, R-A*mbush and SAR-A*mbush. They are modifications of A* that take into account the number of agents that have a specific node (or edge) in their calculated path in order to vary the cost function of the graph. P-A*mbush, R-A*mbush and SAR-A*mbush are variations of A*mbush that improve the paths generated by the proposed A*mbush algorithm.
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
Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press (2009)
Hart, P., Nilsson, N., Raphael, B.: Correction to a formal basis for the heuristic determination of minimum cost paths. SIGART Newsletter 37, 28–29 (1972)
Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 2nd edn. Prentice-Hall, Englewood Cliffs (1993)
Millington, I., Funge, J.: Artificial Intelligence for Games, 2nd edn. Morgan Kaufmann Publishers (2009)
Silver, D.: Cooperative pathfinding. AI Game Programming Wisdom 3, 99–111 (2006)
Abd Latiff, M.S., Cavazza, M.: Synchronous Path Multi-Agent Co-ordination. In: Proceedings of the VSMM 2000 Conference, Gifu, Japan (2000)
Abd Latiff, M.S., Widyarto, S.: The crowd simulator for interactive virtual environments. In: Proceedings of the 2004 ACM SIGGRAPH International Conference on Virtual Reality Continuum and its Applications in Industry, pp. 278–281 (2004)
Ruckle, W., Fennell, R., Holmes, P., Fennemore, C.: Ambushing Random Walks I: Finite Models. Operations Research 24(2) (1976)
Ruckle, W.: Ambushing Random Walks II: Continuous Models. Operations Research 29(1) (1981)
Woodward, I.: Discretization of the Continuous Ambush Game. Naval Research Logistics 50 (2003)
Kneidl, A., Borrmann, A.: How Do Pedestrians find their Way? Results of an experimental study with students compared to simulation results. In: Emergency Evacuation of People from Buildings (2001)
Höcker, M., Berkhahn, V., Kneidl, A., Borrmann, A., Klein, W.: Graph-based approaches for simulating pedestrian dynamics in building models. In: eWork and eBusiness in Architecture, Engineering and Construction, pp. 389–394 (2010)
van Toll, W.G., Cook, A.F., Gerearts, R.: Real-time density-based crowd simulation. Computer Animation and Virtual Worlds 23, 59–69 (2012)
Cui, X., Shii, H.: Direction oriented pathfinding in video games. International Journal of Artificial Intelligence & Applications 2 (2011)
Gendreau, M., Potvin, J.: Handbook of Metaheuristics, 2nd edn. Springer (2010)
Haines, E.: Point in Polygon Strategies (2001), http://erich.realtimerendering.com/ptinpoly/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernández, K., González, G., Chang, C. (2012). A*mbush Family: A* Variations for Ambush Behavior and Path Diversity Generation. In: Kallmann, M., Bekris, K. (eds) Motion in Games. MIG 2012. Lecture Notes in Computer Science, vol 7660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34710-8_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-34710-8_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34709-2
Online ISBN: 978-3-642-34710-8
eBook Packages: Computer ScienceComputer Science (R0)