Distributed cooperative trajectory and lane changing optimization of connected automated vehicles: Freeway segments with lane drop

下降(电信) 计算机科学 弹道 模拟 运输工程 海洋工程 工程类 天文 电信 物理
作者
Mehrdad Tajalli,Ramin Niroumand,Ali Hajbabaie
出处
期刊:Transportation Research Part C-emerging Technologies [Elsevier]
卷期号:143: 103761-103761 被引量:15
标识
DOI:10.1016/j.trc.2022.103761
摘要

• Developing a formulation to couple the discrete lane changing decisions with the polynomial longitudinal and lateral equations of motion without assuming a predefined function for the lateral movement of vehicles. • Establishing cooperation among all vehicles on the road to promote system-level operational optimality while maintaining safety. • Introducing a vehicle-level distributed algorithm to reduce the cooperative problem’s complexity so that the algorithm can work with traffic demand flow rates as high as 2400 vehicles per hour per lane. • Improving mobility on freeway facilities by reducing the average travel time by up to 86.4% and increasing the throughput by at most 134.3% depending on traffic demand and lane configuration. This study presents a methodology for optimal control of connected automated vehicles (CAVs) in freeway segments with a lane drop. Lane drops can create bottlenecks with a considerable number of mandatory and discretionary lane-changing maneuvers when traffic volume is high, which can eventually lead to stop-and-go conditions. Proper motion planning aligned with optimal lane changing upstream of a lane drop can increase capacity and reduce the number of stops and the risk of collision. This paper introduces a vehicle-level mixed-integer program to control longitudinal and lateral movement of CAVs, provide a smooth flow of traffic, and avoid congestion in freeway segments with lane drops. To ensure the feasibility of vehicle-level decisions and promote system-level optimality, a cooperative distributed algorithm is established, where CAVs coordinate their decisions to find the optimal longitudinal and lateral maneuvers that avoid collisions among all vehicles. The proposed coordination scheme lets CAVs find their optimal trajectories based on predictive information from surrounding vehicles (i.e., future locations and speeds) and coordinate their lane-changing decisions to avoid collisions. The results show that optimal lane changing of CAVs smoothens the traffic flow and increases freeway capacity in congested traffic conditions. Compared with all-knowing CAVs simulated in Vissim, the proposed methodology reduced the average travel time by up to 86.4%. It increased the number of completed trips by up to 134.3% based on various traffic demands and lane drop layout combinations.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
左丘冥完成签到,获得积分10
2秒前
缓慢思枫完成签到,获得积分10
2秒前
chunying完成签到,获得积分10
3秒前
充电宝应助侯田华采纳,获得10
5秒前
00gi完成签到,获得积分10
6秒前
7秒前
9秒前
11秒前
乐观的涵菱完成签到,获得积分10
11秒前
11秒前
wg发布了新的文献求助10
12秒前
Summer完成签到,获得积分10
14秒前
LeafJin完成签到 ,获得积分10
15秒前
surain发布了新的文献求助10
17秒前
roy完成签到,获得积分10
18秒前
上官若男应助zzz采纳,获得10
19秒前
胆XIAOXING完成签到 ,获得积分10
21秒前
21秒前
23秒前
Orange应助洁净的山河采纳,获得10
23秒前
SciGPT应助十六月亮采纳,获得10
25秒前
zz完成签到,获得积分10
25秒前
28秒前
28秒前
zzz发布了新的文献求助10
32秒前
aq发布了新的文献求助10
32秒前
jiang发布了新的文献求助10
32秒前
ma完成签到 ,获得积分10
33秒前
不配.应助木染采纳,获得10
34秒前
34秒前
厚礼蟹完成签到 ,获得积分10
36秒前
littleE发布了新的文献求助20
37秒前
poohpooh完成签到,获得积分10
37秒前
38秒前
A,w携念e行ོ完成签到,获得积分10
38秒前
aq完成签到,获得积分10
42秒前
BEN完成签到,获得积分10
42秒前
星辰大海应助Lazarus_x采纳,获得10
42秒前
44秒前
许大脚发布了新的文献求助10
44秒前
高分求助中
Sustainability in Tides Chemistry 2800
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
юрские динозавры восточного забайкалья 800
English Wealden Fossils 700
Foreign Policy of the French Second Empire: A Bibliography 500
Chen Hansheng: China’s Last Romantic Revolutionary 500
XAFS for Everyone 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3143731
求助须知:如何正确求助?哪些是违规求助? 2795219
关于积分的说明 7813671
捐赠科研通 2451210
什么是DOI,文献DOI怎么找? 1304353
科研通“疑难数据库(出版商)”最低求助积分说明 627221
版权声明 601400