A Cooperative Merging Method for Mixed Traffic Based on Enhanced Graph Reinforcement Learning with Vehicle Collaboration Graphs

Achieving cooperative perception and decision-making among connected and autonomous vehicles (CAVs) in mixed-traffic ramp merge scenarios is crucial for building a swarm intelligence-based traffic control system. However, existing cooperative decision-making methods struggle to adequately model and represent the dynamic collaborative interactions among heterogeneous agents in mixed-traffic environments, which can lead to traffic congestion or even severe accidents in ramp merging areas. Therefore, this paper proposes an Enhanced Graph Reinforcement Learning algorithm based on a Vehicle Collaboration Graph (VCG-EGRL) to enable cooperative merging decisions for CAVs in mixed-traffic ramp merging scenarios. First, a vehicle collaboration intensity (VCI) model is designed to effectively model the intensity of collaborative interactions among vehicles. Then, based on the VCI model, the perception-communication relationships between vehicles and the vehicle-to-infrastructure (V2I) communication relationships are jointly constructed to form a local-global cooperative graph, which represents the dynamic collaborative relationships of the vehicle network from macro and micro perspectives and deeply explores the driving behavior of vehicles. Subsequently, a Graph Convolutional Network enhanced with Kolmogorov-Arnold Networks (KANs), referred to as GKAN, is employed to extract and aggregate the driving features of vehicles from the local-global graph. Finally, a graph mutual information maximization method is used to optimize the iterative process of the Graph Reinforcement Learning strategy, ensuring the generation of accurate lane-changing decisions for CAVs. Experimental results in ramp merging scenarios under varying traffic conditions demonstrate that the proposed method outperforms baseline models in terms of merging success rate, efficiency, and robustness.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2026-02-13
DOI
https://doi.org/10.3390/s26041225
Primary Topic
Traffic control and management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Cooperative Merging Method for Mixed Traffic Based on Enhanced Graph Reinforcement Learning with Vehicle Collaboration Graphs

Tongcheng Gu, Da Xu, Haifeng Guo, Hongda Fu et al.
Sensors
Traffic control and management
article

A Cooperative Merging Method for Mixed Traffic Based on Enhanced Graph Reinforcement Learning with Vehicle Collaboration Graphs

Tongcheng Gu, Da Xu, Haifeng Guo, Hongda Fu, Baiyang Ji, Enwen Qiao
article en

Abstract

Achieving cooperative perception and decision-making among connected and autonomous vehicles (CAVs) in mixed-traffic ramp merge scenarios is crucial for building a swarm intelligence-based traffic control system. However, existing cooperative decision-making methods struggle to adequately model and represent the dynamic collaborative interactions among heterogeneous agents in mixed-traffic environments, which can lead to traffic congestion or even severe accidents in ramp merging areas. Therefore, this paper proposes an Enhanced Graph Reinforcement Learning algorithm based on a Vehicle Collaboration Graph (VCG-EGRL) to enable cooperative merging decisions for CAVs in mixed-traffic ramp merging scenarios. First, a vehicle collaboration intensity (VCI) model is designed to effectively model the intensity of collaborative interactions among vehicles. Then, based on the VCI model, the perception-communication relationships between vehicles and the vehicle-to-infrastructure (V2I) communication relationships are jointly constructed to form a local-global cooperative graph, which represents the dynamic collaborative relationships of the vehicle network from macro and micro perspectives and deeply explores the driving behavior of vehicles. Subsequently, a Graph Convolutional Network enhanced with Kolmogorov-Arnold Networks (KANs), referred to as GKAN, is employed to extract and aggregate the driving features of vehicles from the local-global graph. Finally, a graph mutual information maximization method is used to optimize the iterative process of the Graph Reinforcement Learning strategy, ensuring the generation of accurate lane-changing decisions for CAVs. Experimental results in ramp merging scenarios under varying traffic conditions demonstrate that the proposed method outperforms baseline models in terms of merging success rate, efficiency, and robustness.

SensorsVol. 26(4)
Zhejiang University of Technology (CN)
Openalex Percentile: Top 58%
Traffic control and management
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.