通过不受管制的交叉口调度自动驾驶车辆队列
Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection
摘要：
我们研究了各种版本的调度排的自动驾驶车辆通过一个不受管制的交叉口，其中一个算法必须安排哪些排应该等待，以便其他人可以通过，以尽量减少任何车辆的最大延迟的问题。我们提供多项式时间算法构建这样的时间表为$k$的方式合并交叉口，为常数$k$，并为交叉路口涉及双向交通。我们还表明，更一般的问题，调度自主排通过一个路口，包括一个$k$的方式合并，非常数$k$，和交叉的双向交通是NP完全的。
英文摘要：
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 $k$-way merge intersection, for constant $k$, 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 $k$-way merge, for non-constant $k$, and a crossing of two-way traffic is NP-complete.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
