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.
Cooperative Driving at Unsignalized Intersections Using Tree Search
IEEE Transactions on Intelligent Transportation Systems ; 21 , 11 ; 4563-4571
01.11.2020
1606470 byte
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Springer Verlag | 2020
|Springer Verlag | 2013
|Unsignalized Intersections: Roundabouts
Springer Verlag | 2020
|Delay at Unsignalized Intersections
Online Contents | 2008
|