mlsanityData to 7 Oct 2026

Cooperative Driving at Unsignalized Intersections Using Tree Search

arXiv 1902.01024 ↗First posted 4 Feb 2019cs.MAcited by 10

Not on the map. Why?

Abstract (arXiv)

In this paper, we propose a new cooperative driving strategy for connected and automated vehicles (CAVs) at unsignalized intersections. Based on the tree representation of the solution space for the passing order, we combine Monte Carlo tree search (MCTS) and some heuristic rules to find a nearly global-optimal passing order (leaf node) within a very short planning time. Testing results show that this new strategy can keep a good tradeoff between performance and computation flexibility.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Feb 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 1; 2024: 4; 2025: 0; 2026: 2.

10 papers.