Platoon Forming Algorithms for Intelligent Street Intersections
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2019
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929640952561664 |
|---|---|
| author | Timmerman, R. W. Boon, M. A. A. |
| author_facet | Timmerman, R. W. Boon, M. A. A. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1901_04583 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Platoon Forming Algorithms for Intelligent Street Intersections Timmerman, R. W. Boon, M. A. A. Data Structures and Algorithms Systems and Control Probability 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. |
| title | Platoon Forming Algorithms for Intelligent Street Intersections |
| topic | Data Structures and Algorithms Systems and Control Probability |
| url | https://arxiv.org/abs/1901.04583 |