Cooperative trajectory planning for multiple CAVs via multi-agent reinforcement learning

Abstract Multi-Agent Reinforcement Learning (MARL) has demonstrated significant potential in cooperative trajectory planning for connected and automated vehicles (CAVs), effectively addressing multi-vehicle coordination challenges in complex dynamic environments. However, handling environmental uncertainties and planning safe and efficient trajectories remain critical challenges in this field, particularly when facing unpredictable or rapidly changing traffic scenarios where existing algorithms often exhibit poor generalization and insufficient safety guarantees. Therefore, this paper proposes a TD3-based MARL framework with the following key contributions: First, it models environmental uncertainties as time-varying Gaussian distributions and incorporates them into the reward function design, enabling agents to better quantify risk and uncertainty in their decision-making process. Second, employing dual critic networks, delayed policy updates, and target policy smoothing to enhance system stability and robustness. Experimental results demonstrate that the proposed framework significantly outperforms conventional DDPG approaches in terms of convergence speed, collision avoidance success rate, and adaptability to environmental variations, achieving safe and reliable cooperative trajectory planning in dynamic scenarios with multiple moving obstacles.

Authors

Institutions

Publication Details

Journal
Journal of Physics Conference Series
Published
2025-09-01
DOI
https://doi.org/10.1088/1742-6596/3097/1/012023
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

Cooperative trajectory planning for multiple CAVs via multi-agent reinforcement learning

Fan Bu, Xu Ji
Journal of Physics Conference Series
Robotic Path Planning Algorithms
article

Cooperative trajectory planning for multiple CAVs via multi-agent reinforcement learning

Fan Bu, Xu Ji
article en

Abstract

Abstract Multi-Agent Reinforcement Learning (MARL) has demonstrated significant potential in cooperative trajectory planning for connected and automated vehicles (CAVs), effectively addressing multi-vehicle coordination challenges in complex dynamic environments. However, handling environmental uncertainties and planning safe and efficient trajectories remain critical challenges in this field, particularly when facing unpredictable or rapidly changing traffic scenarios where existing algorithms often exhibit poor generalization and insufficient safety guarantees. Therefore, this paper proposes a TD3-based MARL framework with the following key contributions: First, it models environmental uncertainties as time-varying Gaussian distributions and incorporates them into the reward function design, enabling agents to better quantify risk and uncertainty in their decision-making process. Second, employing dual critic networks, delayed policy updates, and target policy smoothing to enhance system stability and robustness. Experimental results demonstrate that the proposed framework significantly outperforms conventional DDPG approaches in terms of convergence speed, collision avoidance success rate, and adaptability to environmental variations, achieving safe and reliable cooperative trajectory planning in dynamic scenarios with multiple moving obstacles.

Journal of Physics Conference SeriesVol. 3097(1)
Harbin Institute of Technology (CN), Beihang University (CN)
Openalex Percentile: Top 77%
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.