Abstract
Abstract
In the face of a complex battlefield environment, a multi-dimensional dynamic planning algorithm is proposed to solve the trajectory planning problem of the cooperative flight mission process of unmanned aerial vehicles. Under the constraints of aircraft kinematics, the collision between aircraft and space-time cooperation, and under the influence of random wind field, threat area, and other interference factors, the algorithm can make the UAV group pass through the mission points as much as possible, and at the same time, smooth the track points to make the trajectory reach the optimal solution. Finally, the simulation results of the program written in C++ and MATLAB show that the algorithm can meet the global optimization, and can calculate in real-time and online. It has strong engineering application value.
Subject
Computer Science Applications,History,Education
Reference21 articles.
1. Brunese;Kitjacharoenchai;Multiple traveling salesman problem with drones: Mathemati cal model and heuristic approach, Computers & Industrial Engineering,2019
2. A double-layer coding model with a rotation-based particle s warm algorithm for unmanned combat aerial vehicle path planning;Jia;Engineering Applications of Artifi cial Intelligence,2022
3. UAVs cooperative task assignment and trajector y optimization with safety and time constraints;Zheng,2022
4. Improvement of Mathematical Tools for Co ntrolling the Group of Unmanned Aerial Vehicles;Lyabakh;Transportation Research Procedia,2021