A Graph-Based Optimal On-Ramp Merging of Connected Vehicles on the Highway
Connected and automated vehicles (CAVs) are a very promising alternative for reducing fuel consumption and improving traffic efficiency when vehicles merge at on-ramps. In this study, we propose a graph-based method to coordinate CAVs to merge at the highway ramp. First, the optimized vehicles were...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
MDPI AG
2021
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/ca5cfbbec8d24465b1183f2f4640e98a |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Connected and automated vehicles (CAVs) are a very promising alternative for reducing fuel consumption and improving traffic efficiency when vehicles merge at on-ramps. In this study, we propose a graph-based method to coordinate CAVs to merge at the highway ramp. First, the optimized vehicles were divided into groups to pass the merging point. Then we built a directed graph model for each group of vehicles, where each path of the graph corresponds to one of all possible merging sequences. The improved shortest path algorithm is proposed to find the optimal merging sequence for minimizing total fuel consumption. The results of the simulation showed that the proposed graph-based method reduced fuel consumption and ensured high traffic efficiency; moreover, the vehicles can form a platoon after passing the merge point. |
|---|