Optimal coordinated platoon lane change in highways with mixed traffic

IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS
Fernando V. Monteiro , Ketan Savla , Petros Ioannou
{"title":"Optimal coordinated platoon lane change in highways with mixed traffic","authors":"Fernando V. Monteiro ,&nbsp;Ketan Savla ,&nbsp;Petros Ioannou","doi":"10.1016/j.vehcom.2025.100924","DOIUrl":null,"url":null,"abstract":"<div><div>In the field of connected autonomous vehicles, platoons - where vehicles closely follow one another - have shown promising results in enhancing safety, traffic flow, and fuel efficiency. This study addresses the unique challenges of platoon lane changes, where multiple platoon vehicles have lane change intention and must remain together after the maneuver is completed. We focus on highway environments because many studies have highlighted the advantages of platooning in these settings. We leverage an offline controller synthesis approach to deal with the combinatorial problem of choosing a strategy. Building on concepts from symbolic optimal control, we represent the problem using a weighted directed acyclic graph where nodes are quantized state vectors, edge weights are costs to transition between nodes, and the shortest path solutions represent the optimal platoon lane change strategies. We use a Cached Branch-and-Bound Depth-First Search algorithm to solve the offline control problem due to its anytime capability and low memory requirements. This approach provides real-time decision making and guarantees maneuver success while minimizing completion time or control effort. Previous works either required control of all vehicles on the road, making them inadequate for mixed-traffic scenarios, or fixed the order in which platoon vehicles change lanes, disregarding the current state of surrounding vehicles and maneuver costs. Our framework can describe all previously proposed methods, relies only on cooperation between platoon vehicles, allows for optimization, and produces solutions whose costs decrease as the allowed computational time increases. We employ the VISSIM traffic simulator to compare our approach to the state of the art. The experiments show that we obtain an increase of 13% in the maneuver completion rate along with a decrease of around 15% to 20% in the maneuver completion time and distance traveled to complete the lane change at the cost of an average increase of 2% to 17% in the longitudinal control effort. This trade-off is a direct consequence of having the platoon occupy suitable lane-changing spaces as soon as possible, and this myopic behavior is necessary when there is no information about the future movements of human-driven vehicles. Moreover, the experiments indicate that our approach yields a sharp decrease in cost in relatively short computational times. These results emphasize the potential for deployment of the proposed method in mixed-traffic highway scenarios.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"54 ","pages":"Article 100924"},"PeriodicalIF":5.8000,"publicationDate":"2025-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vehicular Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2214209625000518","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

In the field of connected autonomous vehicles, platoons - where vehicles closely follow one another - have shown promising results in enhancing safety, traffic flow, and fuel efficiency. This study addresses the unique challenges of platoon lane changes, where multiple platoon vehicles have lane change intention and must remain together after the maneuver is completed. We focus on highway environments because many studies have highlighted the advantages of platooning in these settings. We leverage an offline controller synthesis approach to deal with the combinatorial problem of choosing a strategy. Building on concepts from symbolic optimal control, we represent the problem using a weighted directed acyclic graph where nodes are quantized state vectors, edge weights are costs to transition between nodes, and the shortest path solutions represent the optimal platoon lane change strategies. We use a Cached Branch-and-Bound Depth-First Search algorithm to solve the offline control problem due to its anytime capability and low memory requirements. This approach provides real-time decision making and guarantees maneuver success while minimizing completion time or control effort. Previous works either required control of all vehicles on the road, making them inadequate for mixed-traffic scenarios, or fixed the order in which platoon vehicles change lanes, disregarding the current state of surrounding vehicles and maneuver costs. Our framework can describe all previously proposed methods, relies only on cooperation between platoon vehicles, allows for optimization, and produces solutions whose costs decrease as the allowed computational time increases. We employ the VISSIM traffic simulator to compare our approach to the state of the art. The experiments show that we obtain an increase of 13% in the maneuver completion rate along with a decrease of around 15% to 20% in the maneuver completion time and distance traveled to complete the lane change at the cost of an average increase of 2% to 17% in the longitudinal control effort. This trade-off is a direct consequence of having the platoon occupy suitable lane-changing spaces as soon as possible, and this myopic behavior is necessary when there is no information about the future movements of human-driven vehicles. Moreover, the experiments indicate that our approach yields a sharp decrease in cost in relatively short computational times. These results emphasize the potential for deployment of the proposed method in mixed-traffic highway scenarios.
求助全文
约1分钟内获得全文 求助全文
来源期刊
Vehicular Communications
Vehicular Communications Engineering-Electrical and Electronic Engineering
CiteScore
12.70
自引率
10.40%
发文量
88
审稿时长
62 days
期刊介绍: Vehicular communications is a growing area of communications between vehicles and including roadside communication infrastructure. Advances in wireless communications are making possible sharing of information through real time communications between vehicles and infrastructure. This has led to applications to increase safety of vehicles and communication between passengers and the Internet. Standardization efforts on vehicular communication are also underway to make vehicular transportation safer, greener and easier. The aim of the journal is to publish high quality peer–reviewed papers in the area of vehicular communications. The scope encompasses all types of communications involving vehicles, including vehicle–to–vehicle and vehicle–to–infrastructure. The scope includes (but not limited to) the following topics related to vehicular communications: Vehicle to vehicle and vehicle to infrastructure communications Channel modelling, modulating and coding Congestion Control and scalability issues Protocol design, testing and verification Routing in vehicular networks Security issues and countermeasures Deployment and field testing Reducing energy consumption and enhancing safety of vehicles Wireless in–car networks Data collection and dissemination methods Mobility and handover issues Safety and driver assistance applications UAV Underwater communications Autonomous cooperative driving Social networks Internet of vehicles Standardization of protocols.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信