Multi-Agent Reinforcement Learning-Based UAV Pathfinding for Obstacle Avoidance in Stochastic Environment
Authors: Qizhen Wu, Kexin Liu, Lei Chen, Jinhu Lü
Organizations: School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, China. · Advanced Research Institute of Multidisciplinary Sciences and State Key Laboratory of CNS/ATM, Beijing Institute of Technology, Beijing 100081, China.
Traditional methods plan feasible paths for multiple agents in the stochastic environment. However, the methods' iterations with the changes in the environment result in computation complexities, especially for the decentralized agents without a centralized planner. Although reinforcement learning provides a plausible solution because of the generalization for different environments, it struggles with enormous agent-environment interactions in training. Here, we propose a novel centralized training with decentralized execution method based on multi-agent reinforcement learning, which is improved based on the idea of model predictive control. In our approach, agents communicate only with the centralized planner to make decentralized decisions online in the stochastic environment. Furthermore, considering the communication constraint with the centralized planner, each agent plans feasible paths through the extended observation, which combines information on neighboring agents based on the distance-weighted mean field approach. Inspired by the rolling optimization approach of model predictive control, we conduct multi-step value convergence in multi-agent reinforcement learning to enhance the training efficiency, which reduces the expensive interactions in convergence. Experiment results in both comparison, ablation, and real-robot studies validate the effectiveness and generalization performance of our method.
Figures & tables
Figure 1: Overview of the proposed method. (a) Framework of RL-based decision-making for UAV pathfinding. (b) Illustration of model-based uncertainty mitigation during policy learning. (c) Comparison of unweighted mean-field and proximity-weighted mean-field in extended observations.
Figure 2: Experiment and implementation setup. (a) Simulations. (b) Indoor experiments. (c) Outdoor experiments. (d) Long-exposure photo of a flight with multiple UAVs.
Parameters
Values
Episode number Ek
60
Episode length K
500
Time interval τ
0.1 s
UAV radius ρu,i
0.5 m
Hazard sphere radius ρj,m
[0.5, 1.5] m
Hazards number, Sphere number Mj
10, 5
Table I: Parameter Settings.
Network
Input Shape
Hidden Layers
Output Shape
Policy
mo
4 layers, 128 units each
ma
Critic
mo+ma
4 layers, 256 units each
1
PNN
mo+ma
4 layers, 256 units each
2 mo
Table II: Network Architectures
Figure 3: Learning curves of baselines and our Method. The figures plot episode returns versus the number of training episodes. Solid curves represent the mean values across all instances, and the shaded regions indicate the standard deviation.
Hazard Frequency
Method
U3
U6
U9
Ti.( ×10−3 s)
Re.
Ra.( % )
Ti.( ×10−3 s)
Re.
Ra.( % )
Ti.( ×10−3 s)
Re.
Ra.( % )
0.05 Hz
RRT*
3.37 ± 0.31
-365 ± 43
100 ± 0
6.57 ± 0.62
-812 ± 87
95 ± 2
13.40 ± 1.23
-1583 ± 152
85 ± 4
ACO
5.23 ± 0.48
-355 ± 39
100 ± 0
12.93 ± 1.15
-788 ± 82
96 ± 2
31.30 ± 2.54
-1418 ± 146
87 ± 3
Dec-DDPG
1.63 ± 0.18
-930 ± 97
74 ± 6
3.13 ± 0.31
-2241 ± 213
67 ± 8
6.93 ± 0.55
-4383 ± 418
35 ± 9
MAPPO
-728 ± 76
85 ± 4
-1275 ± 134
83 ± 5
-2331 ± 224
74 ± 6
MADDPG
-607 ± 64
90 ± 3
-1272 ± 127
83 ± 4
-2059 ± 203
78 ± 5
Table III: Performance Comparison of Algorithms Across Varying Swarm Sizes and Hazard Frequencies.
Figure 4: Ablation study results of our method.
Figure 5: Scalability analysis with varying hazard frequencies. The figures illustrate success rates across scales U10 to U30 for F0.05, F0.1, and F0.2 scenarios, comparing our method against several baselines.
Figure 6: Testing instance of pathfinding in the U12 & F0.1 scenario.
Figure 7: Robustness to communication uncertainty. The figures plot success rate versus message loss rate, with the legend denoting different levels of Gaussian sensor noise.
Figure 8: Pathfinding process for UAVs in the indoor real-robot system.
Figure 9: Pathfinding process for UAVs in the outdoor real-robot system.
Figure 10: Diagram of the UAVs and hazardous areas.
Decentralized cooperative pursuit in cluttered environments is challenging for autonomous aerial swarms, especially under partial and noisy perception. Existing methods often rely on abstracted geometric features or privileged ground-truth states, and therefore sidestep perceptual uncertainty in real-world settings. We propose a decentralized end-to-end multi-agent reinforcement learning (MARL) framework that maps raw LiDAR observations directly to continuous control commands. Central to the framework is the Predictive Spatio-Temporal Observation (PSTO), an egocentric grid representation that aligns obstacle geometry with predictive adversarial intent and teammate motion in a unified, fixed-resolution projection. Built on PSTO, a single decentralized policy enables agents to navigate static obstacles, intercept dynamic targets, and maintain cooperative encirclement. Simulations demonstrate that the proposed method achieves superior capture efficiency and competitive success rates compared to state-of-the-art learning-based approaches relying on privileged obstacle information. Furthermore, the unified policy scales seamlessly across different team sizes without retraining. Finally, fully autonomous outdoor experiments validate the framework on a quadrotor swarm relying on only onboard sensing and computing.
Yude Li, Zhexuan Zhou, Huizhe Li +6
The authors are with the School of Intelligence Science and Engineering, the Guangdong Key Laboratory of Intelligent Morphing Mechanisms and Adaptive Robotics, and the Shenzhen Key Lab for Advanced Motion Control and Modern Automation Equipments, Harbin Institute of Technology, Shenzhen, Guangdong 518055, China
Cooperative navigation of multi-agent UAVs in complex environments faces key challenges including local optima traps, sparse rewards, learning imbalance among agents, and insufficient cross-scenario generalisation. This paper proposes a multi-agent deep reinforcement learning framework that addresses these issues through coordinated exploration, demonstration exploitation, safe curriculum scheduling, and structure-aware generalisation. First, a perception mechanism combining memory of visited states, directional novelty estimates, and penalty backpropagation enables agents to proactively detect and escape local optima. Second, a hierarchical collaborative demonstration buffer with tiered behaviour cloning manages trajectories by degree of team collaboration and applies differential supervision to the actor network, improving demonstration utilisation under sparse collaborative signals. Third, a safety-aware dual-condition curriculum scheduling mechanism reviews mastered scenarios through back-testing and experience pre-filling during training, suppressing catastrophic forgetting while ensuring both task performance and flight safety. For generalisation, local geometric features computed from sensor readings are abstracted into a domain parameter, through which a structure-aware gating network and mixture-of-experts mechanism condition the policy on local structural patterns rather than scenario-specific coordinates, enabling cross-scenario transfer without exposure to the target environment. The framework is further validated under mixed static-dynamic obstacle settings, showing robust adaptability to dynamic disturbances. Simulation results confirm strong performance in collaboration success rate, navigation robustness, zero-shot cross-scenario generalisation, and dynamic environment adaptability.
Yu Su, Nabil Aouf
School of Science and Technology, City St George’s University of London, London, United Kingdom
Autonomous Unmanned Aerial Vehicle (UAV) swarms are increasingly used as rapidly deployable aerial relays and sensing platforms, yet practical deployments must operate under partial observability and intermittent peer-to-peer connectivity. We present a graph-based multi-agent reinforcement learning framework trained under centralized training with decentralized execution (CTDE): a centralized critic and global state are available only during training, while each UAV executes a shared policy using local observations and messages from nearby neighbors. Under restricted communication, neighbor relations are induced by an SNR-threshold connectivity graph. Our architecture encodes local agent state and nearby entities with an agent-entity attention module and aggregates inter-UAV messages with neighbor self-attention over a signal-quality-limited communication graph defined by a channel model. We evaluate the framework on a cooperative relay-deployment task, DroneConnect. Experimental results show that the proposed method achieves an approximately 12% increase in target coverage over MAPPO under restricted communication and partial observability, while remaining competitive with a mixed-integer linear programming (MILP)-based offline upper bound with full node observability.
Enguang Fan, Yifan Chen, Zihan Shan +3
University of Illinois at Urbana-Champaign · Boeing Research and Technology