Path Planning Method Research of Cruise Missile Based on Dijkstra Algorithm
Dong Liu
Abstract
Dong Liu
Abstract
The path planning of cruise missile generates an optimum path from start point to target point according to terrain and enemy's situation and some restrictions.An optimal horizontal path of the cruise missile was obtained based on Dijkstra algorithm after considering the restrictions of threat and the length of fly path and comparing various algorithms.The result of simulation shows that this algorithm is effective and easy 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 path planning of cruise missile generates an optimum path from start point to target point according to terrain and enemy's situation and some restrictions.An optimal horizontal path of the cruise missile was obtained based on Dijkstra algorithm after considering the restrictions of threat and the length of fly path and comparing various algorithms.The result of simulation shows that this algorithm is effective and easy to be realized in engineering.
Key concepts: Cruise missile, Dijkstra's algorithm, Cruise, Terrain, Path (computing), Point (geometry), Computer science, Motion planning