文章基本信息

标题：Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection
本地全文：下载
作者：Juan Jos{\'e} Besa Vial ; William E. Devanny ; David Eppstein 等
期刊名称：OASIcs : OpenAccess Series in Informatics
电子版ISSN：2190-6807
出版年度：2016
卷号：54
页码：1-14
DOI：10.4230/OASIcs.ATMOS.2016.5
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：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.
关键词：autonomous vehicles; platoons; scheduling