Skip to content

Distributed Collaboration of Connected Autonomous Vehicles at Unsignalized Intersections using Parallel Monte Carlo Tree Search

Notifications You must be signed in to change notification settings

seanfhear/mcts-intersections

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Distributed Collaboration of Connected Autonomous Vehicles at Unsignalized Intersections using Parallel Monte Carlo Tree Search

MCS Dissertation Project

This project uses the Simulated Urban Mobility (SUMO) package to simulate Connected Autonomous Vehicle traversal of Unsignalized Intersections. On approach to the intersection, the vehicles communicate data to each other pertaining to their arrival time to the intersection and their desired trajectory through it. The vehicles then use Root Parallel Monte Carlo Tree Search to find the optimal passing order. If two vehicles are on a collision trajectory, the one which is lower in the passing order will slow down to give way. The optimal passing order is that in which the least amount of adjustments need to be made by vehicles to avoid collisions, thereby minimising traffic delay at the intersection while avoiding collisions.

demo

About

Distributed Collaboration of Connected Autonomous Vehicles at Unsignalized Intersections using Parallel Monte Carlo Tree Search

Topics

Resources

Stars

Watchers

Forks

Languages