Scheduling autonomous vehicle platoons through an unregulated intersection
From MaRDI portal
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.
Recommendations
- On the complexity of an unregulated traffic crossing
- Contention-resolving model predictive control for an intelligent intersection traffic model
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Efficient algorithms for collision avoidance at intersections
- Semi-autonomous intersection collision avoidance through job-shop scheduling
Cites work
Cited in
(7)- Contention-resolving model predictive control for an intelligent intersection traffic model
- An autonomous vehicle sequencing problem at intersections: a genetic algorithm approach
- Least Restrictive Supervisors for Intersection Collision Avoidance: A Scheduling Approach
- Semi-autonomous intersection collision avoidance through job-shop scheduling
- On the complexity of an unregulated traffic crossing
- A repeated route-then-schedule approach to coordinated vehicle platooning: algorithms, valid inequalities and computation
- Modular circulation and applications to traffic management
This page was built for publication: Scheduling autonomous vehicle platoons through an unregulated intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240224)