Feasibility Recovery for Fixed-Horizon Multi-UAV Cooperative Flight Trajectory Optimization in High-Conflict Regions
This paper addresses cooperative trajectory planning for multiple unmanned aerial vehicles (UAVs) that must reach their assigned goals at a common prescribed time. Where routes cross, the initial flight corridors can leave too little room for the UAVs to pass one another within their speed and acceleration limits. The proposed planner uses trajectory optimization to change where the UAVs pass while keeping the arrival time fixed. It first seeks a joint trajectory within the initial corridors. If this fails, it temporarily relaxes the kinematic and relative-corridor constraints and uses the resulting positions to rebuild the corridors. The planner then corrects the controls to meet the endpoint conditions and checks the integrated trajectories over every time interval. A failed motion or clearance check triggers another solve with tighter kinematic constraints. In a 20-UAV simulation, the planner produced a feasible joint trajectory in 25.7 s; none of the four comparison methods returned one within the 30 s budget. In separate closed-loop simulations under disturbances, the maximum position tracking error was 0.14 m. These results demonstrate that the planner can recover from a local corridor conflict without extending the flight time.
Authors
- Wei Tian (ORCID: https://orcid.org/0000-0001-7963-0619)
- Yangfan Liu
- Biao Qian
- Ziqing Ye
- Zhonghong Wu
Institutions
- Harbin Engineering University (CN)
- Naval University of Engineering (CN)
- Chinese People's Liberation Army (CN)
- East China Normal University (CN)
Publication Details
- Journal
- Electronics
- Published
- 2026-11-19
- DOI
- https://doi.org/10.3390/electronics15225398
- Primary Topic
- Robotic Path Planning Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00