A Cooperative Conflict-Free Algorithm for Autonomous Vehicles at Unsignalized Intersections Based on Incremental Learning Monte Carlo Tree Search

2025-99-0434

12/10/2025

Authors
Abstract
Content
The paper examines how connected automated vehicles (CAVs) can navigate unsignalized intersections—especially those where major roads differ significantly from minor roads. The proposed method uses an improved incremental learning Monte Carlo Tree Search to quickly determine an optimal passing order for vehicles, adjusting in real time based on road conditions and vehicle states. Numerical experiments demonstrate that this approach achieves conflict-free, real-time cooperative, reducing average delays significantly compared to traditional traffic signal control. Compared to fully-actuated signal control, the proposed method achieves average delay reductions of 19.92s, 16.46s, and 15.47s for CAVs across varying demand patterns. The practical application of this research lies in its potential to enhance traffic efficiency in urban areas by replacing traditional signal-based control with intelligent, autonomous intersection management. This could lead to reduced congestion, lower fuel consumption, and improved traffic safety, making it particularly valuable for smart city initiatives and future CAV-dominated transportation systems.
Meta TagsDetails
Pages
7
Citation
Xue, Yongjie, Feng Gao, Qiang Feng, and Shaohua Cui, "A Cooperative Conflict-Free Algorithm for Autonomous Vehicles at Unsignalized Intersections Based on Incremental Learning Monte Carlo Tree Search," SAE Technical Paper 2025-99-0434, 2025-, https://doi.org/10.4271/2025-99-0434.
Additional Details
Publisher
Published
Dec 10, 2025
Product Code
2025-99-0434
Content Type
Technical Paper
Language
English