This paper shows a new efficient solution method of finding an optimal path for a cruise missile or aircraft to a target which has the maximal survivability and penetration effectiveness against sophisticated defenses and over varied terrain.
We first generate a grid structure over the terrain, to construct a network. We apply the Dijkstra algorithm to find an optimal path. Since our network usually have about 10,000 nodes, the conventional searching process embedded in the Dijkstra algorithm takes too much computational times.
Our method utilized the special structure of our network and the hashing technique to reduce the computational time of the searching process.
Extensive computational results are presented.
