Quantitative global analysis of a lane merging strategy for collaborative autonomous vehicles

Abstract In this paper we suggest a simple algorithm for merging the traffic of a main road with on-ramp traffic for collaborative Connected and Autonomous Vehicles (CAVs). The main asset of the algorithm being that most values can be formally computed, we quantitatively express the global impact of the merging strategy on the input and output flows of the merging area. For instance, how platoons emerge, their lengths, the space between them and their traffic patterns. We refer to the literature for all local aspects of synchronisation of cars. Here we simply assume that cars can execute the merging algorithm which requires that the cars are aware of a sequence number and operates following the sequence. Our analysis focuses on saturated flows and the control of collective behavior.

Authors

Institutions

Publication Details

Journal
Natural Computing
Published
2025-08-19
DOI
https://doi.org/10.1007/s11047-025-10049-2
Primary Topic
Traffic control and management
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantitative global analysis of a lane merging strategy for collaborative autonomous vehicles

Bastien Chopard, Pierre Leone, Luka Lukic
Natural Computing
Traffic control and management
article

Quantitative global analysis of a lane merging strategy for collaborative autonomous vehicles

Bastien Chopard, Pierre Leone, Luka Lukic
article en

Abstract

Abstract In this paper we suggest a simple algorithm for merging the traffic of a main road with on-ramp traffic for collaborative Connected and Autonomous Vehicles (CAVs). The main asset of the algorithm being that most values can be formally computed, we quantitatively express the global impact of the merging strategy on the input and output flows of the merging area. For instance, how platoons emerge, their lengths, the space between them and their traffic patterns. We refer to the literature for all local aspects of synchronisation of cars. Here we simply assume that cars can execute the merging algorithm which requires that the cars are aware of a sequence number and operates following the sequence. Our analysis focuses on saturated flows and the control of collective behavior.

Natural ComputingVol. 24(4)
University of Geneva (CH)
Université de Genève
Openalex Percentile: Top 75%
Traffic control and management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.