Cooperative Driving at Unsignalized Intersections Using Tree Search

02/04/2019
by   Huile Xu, et al.
0

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.

READ FULL TEXT
research
12/24/2019

A Bi-Level Cooperative Driving Strategy Allowing Lane Changes

This paper studies the cooperative driving of connected and automated ve...
research
11/10/2022

Coordinating CAV Swarms at Intersections with a Deep Learning Model

Connected and automated vehicles (CAVs) are viewed as a special kind of ...
research
09/26/2013

Monte-Carlo Planning: Theoretically Fast Convergence Meets Practical Efficiency

Popular Monte-Carlo tree search (MCTS) algorithms for online planning, s...
research
04/22/2019

A Right-of-Way Based Strategy to Implement Safe and Efficient Driving at Non-Signalized Intersections for Automated Vehicles

Non-signalized intersection is a typical and common scenario for connect...
research
02/02/2020

Accelerating Cooperative Planning for Automated Vehicles with Learned Heuristics and Monte Carlo Tree Search

Efficient driving in urban traffic scenarios requires foresight. The obs...
research
03/30/2020

Parallelization of Monte Carlo Tree Search in Continuous Domains

Monte Carlo Tree Search (MCTS) has proven to be capable of solving chall...

Please sign up or login with your details

Forgot password? Click here to reset