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 BV]
卷期号:143: 103761-103761 被引量:28
标识
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
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
刚刚
1秒前
1秒前
zhangyimg完成签到,获得积分10
1秒前
2秒前
坐等时光看轻自己完成签到,获得积分10
2秒前
3秒前
3秒前
3秒前
我是老大应助diguohu采纳,获得10
3秒前
感性的手链完成签到,获得积分20
3秒前
英俊的铭应助顺心的翠丝采纳,获得10
4秒前
小马完成签到,获得积分10
4秒前
慕青应助好好学习采纳,获得10
4秒前
pentjy完成签到,获得积分10
5秒前
5秒前
5秒前
6秒前
6秒前
现代柠檬发布了新的文献求助10
6秒前
Lizzy发布了新的文献求助10
6秒前
小年滚球球完成签到,获得积分10
7秒前
winfan完成签到,获得积分10
7秒前
蒋瑞轩发布了新的文献求助10
7秒前
zho发布了新的文献求助10
7秒前
8秒前
8秒前
CodeCraft应助艽野采纳,获得10
8秒前
粗心的安彤完成签到,获得积分10
8秒前
8秒前
鲤鱼羿完成签到,获得积分10
9秒前
9秒前
9秒前
10秒前
木木发布了新的文献求助10
10秒前
曲奇饼干发布了新的文献求助10
10秒前
10秒前
10秒前
10秒前
高分求助中
【提示信息,请勿应助】关于scihub 10000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Social Research Methods (4th Edition) by Maggie Walter (2019) 2390
A new approach to the extrapolation of accelerated life test data 1000
北师大毕业论文 基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 390
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
Robot-supported joining of reinforcement textiles with one-sided sewing heads 360
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4009834
求助须知:如何正确求助?哪些是违规求助? 3549753
关于积分的说明 11303647
捐赠科研通 3284309
什么是DOI,文献DOI怎么找? 1810591
邀请新用户注册赠送积分活动 886367
科研通“疑难数据库(出版商)”最低求助积分说明 811406