A new method of the shortest path planning for unmanned aerial vehicles

Abstract

In this paper, the optimal route and deployment scheme are designed to ensure the shortest retention time for unmanned aerial vehicles (UAV) in risk area. Firstly, according to the known data and radar scanning range, the regional distribution map of target grope and base are obtained, respectively. Secondly, based on the different scanning bandwidth of loads, target points are classified by using clustering analysis. This makes the target points fall on the scanning bandwidth of UAV as far as possible, accordingly reducing the UAV's scanning times. This problem can be regarded as a travelling salesman problem in radar scanning range. Finally, the deployment result and locally optimal route are obtained by 0–1 programming in LINGO. Furthermore, particle swarm optimization is used to improve the local optimal path and the global optimal route can then be generated.