Study on Cruise Missile Route Planning Based on Dijkstra Algorithm
Lü Yi
Abstract
Lü Yi
Abstract
The route planning of for the cruise missile generates a route from start point to target that can maximize survival probability and minimize distance according to terrain and enemy's situation and some other limits,This paper presents a simple method to establish danger model and a optimal route algorithm based on Dijkatra algorithm. The result of simulation shows that the optimal route is effective and easier to be realized in engineering.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The route planning of for the cruise missile generates a route from start point to target that can maximize survival probability and minimize distance according to terrain and enemy's situation and some other limits,This paper presents a simple method to establish danger model and a optimal route algorithm based on Dijkatra algorithm. The result of simulation shows that the optimal route is effective and easier to be realized in engineering.
Key concepts: Cruise missile, Dijkstra's algorithm, Route planning, Cruise, Terrain, Computer science, Missile guidance, Simple (philosophy)