Search

Computer wargame is a simulation tool that describes war operations. Force maneuver is the foundation of operations, and path planning is the core content. Path planning is simplified as the solution of the shortest path in graph theory. However, the tactical path is not equivalent to the shortest path. Considering the complexity of battlefield maneuvering, information diversity, dynamics and other characteristics, the use of a decisionmaking method that separates battlefield situation and path planning can lead to operational failure. This article provides a tactical path planning method that effectively integrates battlefield situation and map information. This method, based on traditional A* algorithm, combines influence map to digitize battlefield situation factors, and uses digitized situation factors combined with terrain factors as the objective function of the improved A* algorithm. Thus, under the same algorithm complexity conditions, the A* algorithm converges to the tactically optimal path. Simulation experiments effectively verify that this method can support more complex and diverse tactical path planning compared to traditional A* algorithm. Battlefield situation information can guide path planning to effectively reduce the damage suffered by one party during maneuvering and improve our offensive capabilities, shaping a generally advantageous situation. [ABSTRACT FROM AUTHOR]