A Deep Reinforcement Learning-Based Multi-UAV Global Path Planning

To address the problem of global path planning for multiple unmanned aerial vehicles (UAVs), the Hindsight Prioritized Experience Replay-Multi-Agent Deep Deterministic Policy Gradient (HPER-MADDPG) algorithm is proposed. Firstly, the kinematic model of UAVs and the three-dimensional environment model are established and transformed into a partially observable Markov game problem. Secondly, to address the issue of low training efficiency of random experience replay, the HPER mechanism is designed based on MADDPG. After the UAVs complete the interaction with the environment, all experience tuples are stored in the experience buffer pool as trajectory sequences, and the sampling priorities are calculated. If a sampled experience is unsuccessful, it is mapped into a new experience for training. Experimental results show that this algorithm achieves the global path planning of multiple UAVs under multiple constraints, and the maximum time difference in arrival among the UAVs is less than 0.2 seconds.

Authors

Institutions

Publication Details

Published
2025-07-04
DOI
https://doi.org/10.1109/fasta65681.2025.11138588
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Deep Reinforcement Learning-Based Multi-UAV Global Path Planning

Sixing Zhang, Junfang Fan, Qianqian Li, Xu Wang et al.
Robotic Path Planning Algorithms
article

A Deep Reinforcement Learning-Based Multi-UAV Global Path Planning

Sixing Zhang, Junfang Fan, Qianqian Li, Xu Wang, Xinru Li
article en

Abstract

To address the problem of global path planning for multiple unmanned aerial vehicles (UAVs), the Hindsight Prioritized Experience Replay-Multi-Agent Deep Deterministic Policy Gradient (HPER-MADDPG) algorithm is proposed. Firstly, the kinematic model of UAVs and the three-dimensional environment model are established and transformed into a partially observable Markov game problem. Secondly, to address the issue of low training efficiency of random experience replay, the HPER mechanism is designed based on MADDPG. After the UAVs complete the interaction with the environment, all experience tuples are stored in the experience buffer pool as trajectory sequences, and the sampling priorities are calculated. If a sampled experience is unsuccessful, it is mapped into a new experience for training. Experimental results show that this algorithm achieves the global path planning of multiple UAVs under multiple constraints, and the maximum time difference in arrival among the UAVs is less than 0.2 seconds.

Beijing Information Science & Technology University (CN)
Openalex Percentile: Top 76%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Deep Reinforcement Learning-Based Multi-UAV Global Path Planning — Sixing Zhang, Junfang Fan, et al. · (2025) | TGRS Research Map | TGRS