Research Of Mobile Path Planning Of Troops In Computer Wargames

Wargame is one of the main methods of warfare simulation, and path planning is the core problem of wargame modeling and simulation. Therefore it is necessary to research wargame theory and its path planning problem. As for it, this paper gives the systematic description of wargame related theory, analyze the environment factors of wargame path planning, and propose the wargame path planning method based on A~* algorithm and the above work.At first, discuss the detail definition and analysis of wargame map, pieces, rules, troop's movement and the influence factors so as to solve the shortage problem of systematic description of wargame. Next superimpose a hexagonal grid on a satellite map to make the wargame map. Then define the wargame pieces according to the combat units and combat filed events. Meanwhile give the wargame rules standardization description of combat result table, combat result modification table, turn, scenario, etc, and analyze the velocity, influence factors and movement rules of troop's movement.Next quantify the troop's movement influence factors. Propose a new wargame path planning method based on A~* algorithm and the former work. After the transformation of wargame environment to hexagonal grid, give the different terrain exhausted value description and calculating method and analyze the influence of fog of war to path planning. Define the weight of heuristic information of A~* algorithms in evaluation functions and add a father pointer to each node to improve it. Based on it give the detail method of the application in wargame path planning.Finally conduct the simulation experiment of improved A~* algorithm with wargame map, and compare the search time, expanded node quantity, and the maximum node number in the memory with Dijkstra algorithm. The experiment result validates the improved A~* algorithm has time efficiency and space efficiency in computer wargame path planning.