Abstract
Pathfinding is core component in many games especially RTS(real-time strategy) games, the paper proposed an improvement algorithm to solve the pathfinding problem between multi-entrances and multi-exports buildings. Firstly, the paper studied the A* algorithm, aiming at the buildings with multiple entry and exit characteristic in games, improved the algorithm and make it can find a shortest path by only one traverse between multiple start nodes and multiple stop nodes, avoided frequent call for the algorithm. Secondly the algorithm had given the solution to the actual terrain cost problem, and calculated actual path cost according to the different terrain influence factor. Finally, introduced collision detection to the dynamic path change state space, solved effectively the influence of dynamic path changes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
