PAIR: A Hybrid A^* with PPO Path Planner for Multi-UAV Navigation in 2-D Dynamic Urban MEC Environments

Emerging multi-unmanned aerial vehicle (multi-UAV) applications in smart cities must navigate cluttered airspace while meeting tight mobile edge computing (MEC) deadlines. Classical grid planners, including A-star (A*), D-star Lite (D* Lite), and conflict-based search with D-star Lite (CBS-D*) and metaheuristics such asparticle swarm optimization (PSO), either replan too slowly in dynamic scenes or waste energy on long detours. This paper presents PPO-adjusted incremental refinement (PAIR), a decentralized hybrid planner that couples an A* global backbone with a continuous PPO refinement module for multi-UAV navigation on two-dimensional (2-D) urban grids. A* produces feasible waypoint routes, while a shared risk-aware PPO policy applies local offsets from a compact state encoding. MEC tasks are allocated by a separate heterogeneous scheduler; PPO optimizes geometric objectives (path length, risk, and a normalized propulsion-energy surrogate). Across nine benchmark scenarios with static and Markovian dynamic obstacles, PAIR achieves 100% mission success (matching the strongest baselines) while delivering the best energy surrogate (104.9 normalized units) and shortest mean travel time (207.8 s) on a reproducible $100\times 100$ grid at fixed UAV speed. Relative to the strongest non-learning baseline (PSO), PAIR reduces energy by about 4% and travel time by about 3%, and yields roughly 10–20% gains over the remaining planners. An obstacle-density sweep with 5–30 moving obstacles further shows that PAIR maintains shorter paths and the lowest cumulative replanning time, supporting real-time multi-UAV navigation in dynamic urban MEC environments.