Unmanned Aerial Vehicle (UAV) can perform tasks such as military reconnaissance, monitoring, search and target pointing. When a UAV is used to perform a reconnaissance task on a cruise path planning, and certain set of multi-target point, the optimal cruise path should be well scheduled to ensure that the cruise time is minimal. In this paper, an improved Prim algorithm is studied by introducing constraint condition to improve the effect of UAV path planning. Based on the data provided by GPS module, the weight matrix between the target points is obtained by using coordinate transformation, and the optimal cruise sequence is obtained by using the improved Prim algorithm. Simulation results and success application in cruise path planning of UAV show the efficiency of this improved Prim algorithm.

Improved prim algorithm and its application in unmanned aerial vehicle cruise system

With the help of a model of an associative parallel processor with vertical processing (STAR computer), Prim-Dijkstra and Kraskal algorithms for finding a minimal spanning tree of an undirected graph represented in the form of a list of edges and their weights are compared. A relatively simple representation of the Prim-Dijkstra algorithm is constructed in which the initial node is taken into account. The Kraskal algorithm is also presented and the possibility of eliminating the stage of preliminary sorting of edges by their weights is shown.

A. S. Nepomnyachchaya

Papers

Comparison of the Prim-Dijkstra and kraskal algorithms on an associative parallel processor