2020
DOI: 10.1109/tits.2019.2938728
|View full text |Cite
|
Sign up to set email alerts
|

A Dynamic Adaptive Algorithm for Merging Into Platoons in Connected Automated Environments

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
16
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 35 publications
(18 citation statements)
references
References 21 publications
2
16
0
Order By: Relevance
“…However, as this strategy prioritizes the mainline traffic flow, the ramp vehicles might get heavily congested due to the traffic signal queue. Utilizing vehicle connectivity to process merging requests in S8 generally outperforms other strategies at LOS D and E in terms of travel time of freeway vehicles, which is comparable with previous studies (Park et al 2011;Scarinci et al 2017;Karbalaieali et al 2019). D r a f t assumed based on a freeway operating speed of 100 km/h.…”
Section: Discussionsupporting
confidence: 84%
See 1 more Smart Citation
“…However, as this strategy prioritizes the mainline traffic flow, the ramp vehicles might get heavily congested due to the traffic signal queue. Utilizing vehicle connectivity to process merging requests in S8 generally outperforms other strategies at LOS D and E in terms of travel time of freeway vehicles, which is comparable with previous studies (Park et al 2011;Scarinci et al 2017;Karbalaieali et al 2019). D r a f t assumed based on a freeway operating speed of 100 km/h.…”
Section: Discussionsupporting
confidence: 84%
“…Simulation results indicated that this strategy could reduce traffic congestion on the mainline and reduce the average travel time for merging vehicles. Similarly, Karbalaieali et al (2019) developed an adaptive algorithm in a fully CAV environment where merging vehicles can communicate with the upstream FRL CAVs to provide merging gaps by encouraging these vehicles to speed up, slow down, or change lane. The simulation results showed that using this algorithm can reduce delay for ramp vehicles and increase the travel time reliability index for the mainline.…”
Section: Introductionmentioning
confidence: 99%
“…In practice, for each CAV j ∈ N (t) the coordinator stores the optimal exit time t f j and the corresponding coefficients a j , b j , c j , d j . It has been shown [48] that there is no duality gap in (15), thus the solution can be derived in real time.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Each time a CAV i enters the control zone, then it first requests the time trajectories of all other CAVs already in the control zone to find its optimal exit time t f i from (15). Then, CAV i transmits its four coefficients and t f i back to the coordinator.…”
Section: Problem Formulationmentioning
confidence: 99%
See 1 more Smart Citation