Aug 2026· International Journal of Wireless and Microwave Technologies· 0 citations
TL;DR
A Multi-UAV Planning Framework for Task Allocation, Route Optimization and Trajectory Smoothing for static environments with known obstacle geometry is presented and results demonstrate that the proposed hierarchical formulation is computationally effective, physically consistent, and well suited to multi-UAV mission planning.
Abstract
Coordinated mission planning for multiple unmanned aerial vehicles in cluttered static three-dimensional environments requires consistent treatment of obstacle-aware motion, fleet-level task allocation, route sequencing, and executable trajectory generation. In many existing approaches, these elements are optimized separately, or fleet-level decisions are made using simplified geometric distances that do not accurately reflect UAV-specific motion feasibility in obstacle-constrained space. This paper presents a Multi-UAV Planning Framework for Task Allocation, Route Optimization and Trajectory Smoothing for static environments with known obstacle geometry. In the first stage, an offline single-UAV planner based on a hybrid Differential Evolution and Enhanced Whale Optimization Algorithm computes feasible raw paths for all relevant ordered node pairs and constructs a UAV-specific directed travel-cost matrix. In the second stage, these planner-derived matrices are used for feasibility-aware balanced task distribution and route optimization with exchange-based refinement under a composite total-cost–makespan objective. In the third stage, the raw paths corresponding to the final selected routes are reconstructed and transformed into executable trajectories by adaptive cubic B-spline smoothing. Experimental evaluation was conducted at the local-planning, fleet-planning, and smoothing levels in known static environments. The hybrid planner generated high-quality pairwise obstacle-avoiding paths and exhibited favorable convergence behavior relative to standard WOA, PSO, DE, SOS, and GWO in the tested scenarios. At the fleet level, the full framework reduced makespan by 2.1–3.4% and the composite objective by 0.9–1.4% relative to balanced partitioning without exchange refinement on benchmark instances. In the smoothing stage, the adaptive cubic B-spline reduced path length by 8.5% and maximum curvature by 41.5% relative to the unsmoothed polyline representation. These results demonstrate that the proposed hierarchical formulation is computationally effective, physically consistent, and well suited to multi-UAV mission planning.
Traditional target-oriented task allocation and path planning methods often struggle to balance real-time responsiveness to dynamic task alterations with multi-UAV cooperative operations in complex urban environments under meteorological disturbances. To address these challenges, this paper proposes a dynamic path planning method for low-altitude Unmanned Aerial Vehicles (UAVs) tailored for urban inspection missions. Integrating an improved Discrete Particle Swarm Optimization (DPSO) algorithm with a decoupled Soft Actor–Critic (SAC) and B-spline smoothing framework, the proposed approach optimizes upper-level task allocation and lower-level trajectory planning within a 3D joint meteorological-obstacle feasible region. For task scheduling, an improved DPSO algorithm embedded with a spatial topology guidance mechanism dynamically coordinates task flows governed by Poisson processes. effectively addressing the spatial blindness and fragmented route assignments typical of conventional discrete optimization. Concurrently, local trajectory replanning executes receding-horizon spatial exploration via SAC deep reinforcement learning, followed by B-spline refinement to strictly enforce UAV kinematic limits, systematically bridging continuous-space exploration with low-level flight compliance to overcome the kinematic infeasibility common in pure learning-based models. Validated through extensive Monte Carlo comparative simulations (N=50) and further verified by a high-fidelity AirSim dynamic physics engine, the results demonstrate that: (1) The improved DPSO constrains the average response latency for high-priority emergency tasks to within 40 s even under 50 concurrent dynamic tasks. (2) The lower-level replanning achieves an average execution time of 3.60±0.18 s and a path success rate of 95.8±1.2%, in numerical tests, while maintaining a 96.2% kinematic feasibility rate under realistic rigid-body inertia and aerodynamic drag. While the current 3.60 s latency presents a potential bottleneck for millisecond-level dynamic emergency reactions, the developed framework offers a highly effective and safe closed-loop dynamic scheduling solution that lays a rigorous computational foundation for low-altitude urban inspections.
Changqi Yang, Hongjie Hu, Yi Ai· Drones· 0 citations
TeCoR-UAV achieves better bi-objective trade-offs in most medium- and large-scale scenarios, as well as in topologically constrained scenarios, and improves service quality by an average of 18.5 percentage points, indicating its scenario adaptability and potential for practical application.
Buyang Ding, Weijun Ni, Yixing Luo et al.· Electronics· 0 citations
To address the challenges of collaborative task allocation and path planning for multiple logistics unmanned aerial vehicles (UAVs) in urban low-altitude environments, this paper proposes a bilevel nested joint optimization method based on reinforcement learning and a graph search algorithm to enhance the efficiency of collaborative last-mile delivery by multiple logistics UAVs while reducing flight risks. The proposed method constructs a bilevel architecture system based on a task allocation and decision-making model and a path planning model. The upper-level model holistically considers the demands of three stakeholders—government (safety), customers (timeliness), and UAV enterprises (economy)—at the macro level. Then, based on real-time order information and UAV status, a multi-objective optimization and constraint model is constructed under complex dynamic environments. A multi-agent proximal policy optimization algorithm is employed to achieve rapid dynamic task allocation and decision-making. The lower-layer model utilizes the upper-level allocation results combined with detailed environmental information to plan safe and efficient flight paths for each UAV at the micro level. It employs an improved jumping-point search algorithm for refined path optimization. A loop feedback mechanism is designed to facilitate information exchange between layers, thereby coupling the task allocation and path planning processes to achieve collaborative optimization of upper- and lower-level task allocation and decision-making. This method effectively addresses complex logistics delivery scenarios, enhancing the overall efficiency and robustness of the delivery system. Simulation experiments comprehensively consider path influences from flexible open-area delivery, varying numbers of distribution centers and UAVs, and on-demand rush orders. Tests conducted in medium- and high-density environments demonstrate the proposed model and algorithm’s significant superiority in dynamic complex scenarios. Even when confronted with complex environments and dynamic order scenarios, it consistently generates highly applicable UAV flight paths.
Zongwei Li, Guang Zhang, Heyun Gao· Journal of Vibration and Con...· 0 citations
A three-role dynamic multi-swarm crow search algorithm (3R-DMCSA) is proposed, in which exploiter, explorer, and diversifier role-based swarms share a crow search-based update structure, feasibility-aware comparison, and leader-selection structure but use TA- and PP-specific encodings, objective preferences, initialization, and dynamic responses.
Gengsong Li, Yi Liu, Qibin Zheng et al.· Drones· 0 citations
Simulation results show that the proposed hierarchical task planning framework significantly outperforms traditional approaches in efficiency, robustness, and scalability, highlighting its strong potential for UAV swarm mission planning in complex environments.
Yalan Peng, Haibin Duan, Ming Li et al.· Science China Technological...· 0 citations