A Multi-Agent Path Planning Method based on Improved MADDPG

To effectively address the multi-agent path planning problem in complicated environments, this study proposes an improved Multi-Agent Deep Deterministic Policy Gradient (MADDPG) method for multi-agent path planning, with multi-unmanned aerial vehicles (MUAVs) as the research subject. The proposed method incorporates a directional reward function that considers the dynamic changes in the UAVs' actions over two consecutive steps. This ensures stable flight direction and smooth trajectory adjustments based on the surrounding environment. Additionally, the method includes reward functions related to coverage range and movement cost, aiming to overcome challenges such as path instability and long planning times in multi-agent path planning. Experimental results show that compared to traditional methods, the proposed approach significantly reduces the time required for MUAVs to complete tasks, increases path smoothness by nearly 96%, and improves the cumulative reward value.

Authors

Institutions

Publication Details

Published
2025-03-07
DOI
https://doi.org/10.1109/icrca64997.2025.11011086
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
1.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Multi-Agent Path Planning Method based on Improved MADDPG

Xiaoli Li, Cong Ye
1 citations
Robotic Path Planning Algorithms
1.28
article

A Multi-Agent Path Planning Method based on Improved MADDPG

Xiaoli Li, Cong Ye
article en
1 citations

Abstract

To effectively address the multi-agent path planning problem in complicated environments, this study proposes an improved Multi-Agent Deep Deterministic Policy Gradient (MADDPG) method for multi-agent path planning, with multi-unmanned aerial vehicles (MUAVs) as the research subject. The proposed method incorporates a directional reward function that considers the dynamic changes in the UAVs' actions over two consecutive steps. This ensures stable flight direction and smooth trajectory adjustments based on the surrounding environment. Additionally, the method includes reward functions related to coverage range and movement cost, aiming to overcome challenges such as path instability and long planning times in multi-agent path planning. Experimental results show that compared to traditional methods, the proposed approach significantly reduces the time required for MUAVs to complete tasks, increases path smoothness by nearly 96%, and improves the cumulative reward value.

Donghua University (CN)
Sustainable cities and communities
Openalex Percentile: Top 20%
Robotic Path Planning Algorithms
1.28
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.