Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection
Data Structures and Algorithms
2016-09-16 v1
Abstract
We study various versions of the problem of scheduling platoons of autonomous vehicles through an unregulated intersection, where an algorithm must schedule which platoons should wait so that others can go through, so as to minimize the maximum delay for any vehicle. We provide polynomial-time algorithms for constructing such schedules for a -way merge intersection, for constant , and for a crossing intersection involving two-way traffic. We also show that the more general problem of scheduling autonomous platoons through an intersection that includes both a -way merge, for non-constant , and a crossing of two-way traffic is NP-complete.
Cite
@article{arxiv.1609.04512,
title = {Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection},
author = {Juan José Besa Vial and William E. Devanny and David Eppstein and Michael T. Goodrich},
journal= {arXiv preprint arXiv:1609.04512},
year = {2016}
}