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.
Swipe to navigate through the chapters of this book
Please log in to get access to this content
To get access to this content you need the following product:
- An Improved Pathfinding Algorithm in RTS Games
- Springer Berlin Heidelberg
- Sequence number
Neuer Inhalt/© ITandMEDIA