Multi-unmanned plane formation flight path planning method based on hungarian algorithm
A Hungarian algorithm and multi-UAV technology, applied in the field of multi-UAV formation track planning based on the Hungarian algorithm, can solve the problems of long planning time, long design cycle, and easy stagnation
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Examples
Embodiment Construction
[0035] The present invention will be described in detail below in combination with specific embodiments.
[0036] The steps of the multi-UAV formation track planning method based on the Hungarian algorithm of the present invention are as follows:
[0037] Step 1: Input the number of UAVs in the formation, the relative initial coordinates of the UAVs, and the final coordinates of the final UAVs to form the formation in the matlab software;
[0038] Step 2: Calculate the distance between the initial position of n drones and n target points to form an n*n distance matrix A;
[0039] In the UAV allocation problem, the row or column of the distance matrix is changed so that there are zero elements in each row and column, and a zero-element matrix containing n different rows and different columns is finally obtained through the corresponding adjustment strategy. This results in full distribution with the shortest total distance the drone flies.
[0040] Step 3: Transform the dis...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More