Abstract
Pathfinding is a core component of many games especially real-time strategy games. The paper proposed a smooth path generation strategy based on the A * algorithm. Firstly, adopted an admissible heuristics function, and a key-point optimization is applied to make the path to be connected by a series of key points. Secondly, the paper applied Catmull-Rom splines to the key points interpolation, through add several interpolation points between the key points, make the whole path look more smooth. Experimental results show that the proposed smooth path generation algorithm improves the path of smoothness, make the pathfinding more realistic, and more suitable for use in games.
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
Tao, Z.H., Hang, C.Y.: Path Finding Using A* Algorithm. Micro Computer Information 23(17), 238–240 (2007)
Lester, P.: A* pathfinding for beginners (2005), http://www.policyalmanac.org/games/aStarTutoria.lhtm
Heping, C., Qianshao, Z.: Applicaion And Implementation of A*Agorithms in the Game Map Pathfinding. Computer Applications and Software 22(12), 118–120 (2005)
Lester, P.: Using Binary Heaps in A* Pathfinding (2003), http://www.policyalmanac.org/games/binaryHeaps.htm
Wei, S., Zhengda, M.: Smooth path design for mobile service robots based on improved A* algorithm. Journal of Southeast University (Natural Science Edition)Â 40sup(I) (September 2010)
Deloura, M.: Game Programming Gems. Charles River Media, Inc., London (2000)
Higgins Daniel, F.: Pathfinding Design Architecture. In: AI Game Programming Wisdom. Charles River Media, London (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, X., Zou, K. (2011). Smooth Path Algorithm Based on A* in Games. In: Lin, S., Huang, X. (eds) Advances in Computer Science, Environment, Ecoinformatics, and Education. CSEE 2011. Communications in Computer and Information Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23321-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-23321-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23320-3
Online ISBN: 978-3-642-23321-0
eBook Packages: Computer ScienceComputer Science (R0)