2026-07-22T17:55:26Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6529 2024-03-06T10:30:01Z ddc:004 open_access

Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection Besa Vial, Juan José Devanny, William E. Eppstein, David Goodrich, Michael T. autonomous vehicles platoons scheduling 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Juan José Besa Vial and William E. Devanny and David Eppstein and Michael T. Goodrich 2016 Is Part Of OASIcs, Volume 54, 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2016.5 urn:nbn:de:0030-drops-65296 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2016.5 eng https://creativecommons.org/licenses/by/3.0/legalcode