Platoon Forming Algorithms for Intelligent Street Intersections

January 02, 2019 Β· Declared Dead Β· πŸ› Transportmetrica A: Transport Science

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors R. W. Timmerman, M. A. A. Boon arXiv ID 1901.04583 Category cs.DS: Data Structures & Algorithms Cross-listed eess.SY, math.PR Citations 31 Venue Transportmetrica A: Transport Science Last Checked 3 months ago
Abstract
We study intersection access control for autonomous vehicles. Platoon forming algorithms, which aim to organize individual vehicles in platoons, are very promising. To create those platoons, we slow down vehicles before the actual arrival at the intersection in such a way that each vehicle can traverse the intersection at high speed. This increases the capacity of the intersection significantly, offering huge potential savings with respect to travel time compared to nowadays traffic. We propose several new platoon forming algorithms and provide an approximate mean delay analysis for our algorithms. A comparison between the current day practice at intersections (through a case study in SUMO) and our proposed algorithms is provided. Simulation results for fairness are obtained as well, showing that platoon forming algorithms with a low mean delay sometimes are relatively unfair, indicating a potential need for balancing mean delay and fairness.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted