Fixed-bundle simulations show that the proposed planner can preserve scheduled executability while reducing threat exposure relative to a spatiotemporal-priority baseline and quantitative feedback lowers risk per completed task in both suites after correction for multiple comparisons.
Abstract
This paper addresses low-altitude navigation of multiple UAVs through a shared two-dimensional environment with narrow passages, blocked cells, and predicted moving obstacles while preserving an assigned task order. The planner receives ordered task bundles from an allocator and checks static obstacles, moving-obstacle timing, sampled minimum inter-UAV separation, deadlines, risk budgets, and an energy proxy. It generates risk-weighted candidate path segments, repairs timing conflicts with waits and local detours, verifies service and terminal occupancy, and returns a certificate that records whether a segment is executable, its total travel cost, risk exposure, and energy proxy, or the reason for failure. We compare no feedback, context no-good, typed-failure, quantitative, and combined feedback under medium-load and high-stress test suites. Quantitative feedback lowers risk per completed task in both suites after correction for multiple comparisons. Failure-type feedback adds no detectable benefit, and completion-rate differences do not remain significant after the same correction. Fixed-bundle simulations show that the proposed planner can preserve scheduled executability while reducing threat exposure relative to a spatiotemporal-priority baseline. Single-UAV flights demonstrate waypoint execution, reference tracking, and avoidance of designated regions.
Hierarchical multi-UAV planning can produce scheduled paths that become unsafe during execution because tracking dynamics, actuator limits, sampling, and communication are not fully represented upstream. We introduce a certificate-guided safe-tracking framework that treats each planned path as a versioned execution con...
Yu-Hua Cong, Xian Zhu, Zhisheng Wang et al.· Drones· 0 citations
Constrained-aware hierarchical assignment and routing (C-HAR), a deterministic constructive heuristic, is evaluated in a static simulator and obtained a feasible completed value of 0.941 ± 0.014, with no audited time-window or resource violations among 542 serviced targets.
Chen Qian, Bin Fu, Zhen-Hao Wang et al.· Drones· 0 citations
Offline Multi-Agent Path Finding plans for multiple Unmanned Aerial Vehicles (UAVs) Unmanned Traffic Management (UTM) can fail during disturbed execution because stochastic delays break the joint timing assumptions that make nominal plans conflict-free. We present a closed-loop discrete UTM method that couples UTM-awar...
PL-RiskPlanner is proposed, a constraint-consistent framework that applies asset- and obstacle-specific checks before admitting grid edges, ranks the admitted edges using a power-line risk field, predicts moving-object positions at estimated UAV arrival times, and applies the same sampled verifier during smoothing.
Cong Li, Yonggang Li, Lei Tan et al.· Electronics· 1 citation
This study addresses dynamic multi-UAV task allocation under online task release, static obstacles, deadlines, limited energy, and vehicle failures. We propose an event-triggered path-based bid assignment method (ET-PBBA). At each mission event, an A-star module estimates the static-obstacle travel cost of feasible UAV...
The results support RA-ALA as a simulation-tested route-generation framework under the modeled constraints, without establishing isolated-operator superiority or real-flight readiness.
Kai-Jun Xu, Yi-Lin Hong, Hong-Da Luo et al.· Drones· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.