By 2030, projected UAV operations may exceed one million concurrent flights in urban airspace, yet traditional fixed-distance separation methods fail to accommodate heterogeneous platforms. This paper introduces a three-tier hierarchical dynamic separation framework adapting minima across strategic (30–80 m category-specific baselines), pre-tactical (0.7–1.8× encounter-dependent scaling), and tactical (real-time 3D decomposition) timescales. Monte Carlo simulation across 100,000+ flight hours demonstrates 47% collision rate reduction versus fixed 30 m separation (0.008 vs. 0.015 per 1000 h, p < 0.001), 50% airspace utilization increase (18.4 vs. 12.3 UAVs/km³), 44% flight time penalty decrease (8.5% vs. 15.2%), and 99.97% ICAO-compliant TLS achievement (≤10⁻⁷ per flight hour) with real-time performance (78.5 ms for 20 UAVs). The framework provides an immediately deployable foundation for heterogeneous UAV traffic management.

Cooperative localization for multi-Unmanned Aerial Vehicle (UAV) systems in GPS-degraded environments is often compromised by ideal-communication or uniform-quality assumptions. This paper proposes Quality-Aware Distributed State Estimation (QA-DSE), which combines three operational quality factors—freshness (Age of Information), accuracy (covariance trace), and link reliability (packet loss and channel noise)—into a single multiplicative score $q_{ij}$, modulated by a bounded history-consistency factor based on velocity-propagated self-trajectory continuity. A dual-constraint AND-gate on AoI and covariance trace excludes jointly degraded neighbors, while admitted neighbors are fused through a quality-squared information-matrix update under a stated bounded residual cross-correlation assumption, with an adaptive Covariance-Intersection fallback when the assumption is stressed. Under explicit observability, bounded-noise, bounded-quality, joint-connectivity, and bounded residual cross-correlation assumptions, we establish mean-square bounded error, exponential convergence at a rate inherited from the Kalman update operator, $O\left(n^3+nm\right)$ per-step complexity, Bounded-Input Bounded-Output (BIBO) stability, soft attenuation of single-axis faults (Theorem 4), and hard exclusion under joint AoI–covariance violation (Theorem 5). Under a Ultra-Wideband (UWB)-style cooperative-observation model, Monte Carlo experiments across five scenarios show 74.08–74.24% position- Root Mean Square Error (RMSE) reductions over Covariance Intersection, with the relative advantage held within 73.04–74.24% as the fleet scales from 3 to 50 UAVs; QA-DSE remains within 8.1% of an idealized no-cooperation single-vehicle Kalman filter, demonstrating graceful degradation rather than improvement above that floor. Per-step Central Processing Unit (CPU) time scales from 0.09 ms (5 UAVs) to 0.31 ms (50 UAVs); embedded validation is left to future work.

Multi-runway sequencing of unmanned aerial vehicles (UAVs) at temporary disaster relief aerodromes presents a priority-heterogeneous scheduling problem under class-asymmetric wake turbulence constraints. We formulate this as a priority-weighted Markov decision process with a deliberately minimalist reward—per-step class weights for completed landings, with no shaping or hand-crafted safety logic—and extend it with per-UAV operational deadlines (encoding en-route endurance consumption) and per-runway queue capacity constraints that produce a non-trivial action mask. We train a Proximal Policy Optimisation (PPO) agent and benchmark it against six baselines spanning deterministic optimisation (Joint-LA-1), stochastic lookahead (Stochastic-LA), and online tree search (MCTS). Across 100 paired evaluation episodes, PPO matches the operational standard Priority-FCFS within 2.7% (p = 0.124, not significant); Joint-LA-1, the strongest non-learned baseline, outperforms PPO by 3.2% (p = 0.043). Despite near-identical aggregate throughput, PPO autonomously develops a runway specialisation pattern—concentrating 60% of high-priority landings on a single strip while routing 93% of emergency arrivals to the remaining strips—that emerges entirely from the reward signal. Under looser deadlines, the PPO–PFCFS gap narrows to −0.5%, and wake symmetry ablation reveals that PPO outperforms Priority-FCFS by 46.5% when the asymmetric wake structure is removed. These results demonstrate that priority-aware capacity reservation can emerge without embedded domain knowledge, and that simple heuristics are near-optimal under tight operational constraints—a finding with direct implications for autonomous scheduling in disaster relief aviation.