The Research On Route Optimization Of Military Power Maneuvering In Computer Wargame

Maneuvering has a widespread distribution not only in war military action of amy but also in non-war military action. Under the condition of relatively stable maneuvering speed, the chioce of maneuvering route will directly determine whether the amy can arrive at the destination in scheduled time. From this, the importance of route to amy maneuvering can be seen.Firstly, this thesis has simply compared Wargame Map with military map, at the same time, it has analyzesd the inaccuracy problem of Wargame Map. Secondly, it has theoretically studied the wargame maneuvering rule, listed the influential factors of military strength maneuvering and the quantitative descriptions of the influences it had on maneuvering speed. On the basis of all these, it has illustrated the calculating process of Movement Points.Then, this thesis has made a model which was based on military strength maneuvering route problem, emphasizing on the research of the influences that terrain, roads, bridges and rivers have on maneuvering. On this basis, it has concluded and summarized all kinds of maneuvering circumstances in war military action of amy and in non-war military action. And it has put forword the route optimization problem under four conditions, they were enemy existence and enemy inexistence, crossing the designated points and undesignated points, it has also proposed the route optimization algorithm based on Dijkstra algorithm. Finally, by taking the XinXingLi combat wargame as an example, it has verified and analysized the designated algorithm, and has proved that the algorithm is feasible.Studying the route optimization problem and choosing reasonable maneuvering route will shorten the maneuvering time effectively and improve the maneuvering speed disguisedly, thus obtaining the initiative of actions.