Abstract

Connected and automated vehicles (CAVs) have the potential to significantly improve the safety and efficiency of traffic. One revolutionary CAV’s impact on transportation system is cooperative driving that turns signalized intersections to be signal-free and boosts traffic efficiency by better organizing the passing order of CAVs. However, how to get the optimal passing order is an NP-hard problem (specifically, enumerating based algorithm takes days to find the optimal solution to a 20-CAV scenario). Here, we introduce a novel cooperative driving algorithm (AlphaOrder) that combines offline deep learning and online tree searching to find a near-optimal passing order in real-time. AlphaOrder builds a pointer network model from solved scenarios and generates near-optimal passing orders instantaneously for new scenarios. For the scenarios with 40 CAVs, AlphaOrder reduces the travel delay by more than <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$20\%$</tex-math> </inline-formula> on average compared to the best-so-far MCTS based algorithm. Moreover, our algorithm provides a general approach to managing preemptive resource sharing between multi-agents (e.g., scheduling multiple automated guided vehicles (AGVs) and unmanned aerial vehicles (UAVs) at conflicting areas).

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call