Automated Conflict Resolution of Lane Change Utilizing Probability Collectives

T. C. Santos, D. Wolf
{"title":"Automated Conflict Resolution of Lane Change Utilizing Probability Collectives","authors":"T. C. Santos, D. Wolf","doi":"10.1109/ICAR46387.2019.8981609","DOIUrl":null,"url":null,"abstract":"Lane change is one of the most common maneuvers in traffic. It is a lateral movement which can affect the trajectory of other vehicles, with the possibility of collision. Although the field of autonomous vehicles has been growing and the repertoire of methods used for autonomous navigation is extensive, lane-changing still one of the causes of flow reduction and accidents. Researches usually address the lane change problem from the perspective of a single-agent. On the other hand, multi-agent systems based on interaction among vehicles, equipped with wireless communication technologies, can improve traffic efficiency and safety. This paper presents a multi-agent automated conflict resolution to collision avoidance method based on Probability Collectives to perform coordinated maneuvers in a fully decentralized manner using communication. We used SUMO to simulate lane-changing situations in a two-lane highway scenario, where the vehicles had to do a lane-merging maneuver. We evaluate the time for all vehicles of the platoon complete a lane-merging, vehicle flow per second, maximum string length, and the platoon's average speed. We compared the SUMO centralized lane change method with a fully decentralized PC method. The results show that the PC method closely approximates to the centralized SUMO method which uses all data for its decision making.","PeriodicalId":6606,"journal":{"name":"2019 19th International Conference on Advanced Robotics (ICAR)","volume":"14 1","pages":"623-628"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 19th International Conference on Advanced Robotics (ICAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAR46387.2019.8981609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Lane change is one of the most common maneuvers in traffic. It is a lateral movement which can affect the trajectory of other vehicles, with the possibility of collision. Although the field of autonomous vehicles has been growing and the repertoire of methods used for autonomous navigation is extensive, lane-changing still one of the causes of flow reduction and accidents. Researches usually address the lane change problem from the perspective of a single-agent. On the other hand, multi-agent systems based on interaction among vehicles, equipped with wireless communication technologies, can improve traffic efficiency and safety. This paper presents a multi-agent automated conflict resolution to collision avoidance method based on Probability Collectives to perform coordinated maneuvers in a fully decentralized manner using communication. We used SUMO to simulate lane-changing situations in a two-lane highway scenario, where the vehicles had to do a lane-merging maneuver. We evaluate the time for all vehicles of the platoon complete a lane-merging, vehicle flow per second, maximum string length, and the platoon's average speed. We compared the SUMO centralized lane change method with a fully decentralized PC method. The results show that the PC method closely approximates to the centralized SUMO method which uses all data for its decision making.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于概率集体的变道冲突自动解决
变道是交通中最常见的动作之一。这是一种横向运动,可以影响其他车辆的轨迹,并有可能发生碰撞。尽管自动驾驶汽车的领域一直在发展,用于自动导航的方法也很广泛,但变道仍然是导致流量减少和事故的原因之一。研究通常从单智能体的角度来解决变道问题。另一方面,基于车辆间交互的多智能体系统,配备无线通信技术,可以提高交通效率和安全性。本文提出了一种基于概率集体的多智能体自动冲突解决和避碰方法,利用通信以完全分散的方式进行协调机动。我们使用相扑来模拟双车道高速公路场景中的变道情况,车辆必须进行车道合并操作。我们评估队列中所有车辆完成车道合并的时间、每秒车辆流量、最大队列长度和队列的平均速度。我们比较了相扑集中变道方法和完全分散的PC方法。结果表明,PC方法非常接近于集中的SUMO方法,该方法使用所有数据进行决策。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evaluation of Domain Randomization Techniques for Transfer Learning Robotito: programming robots from preschool to undergraduate school level A Novel Approach for Parameter Extraction of an NMPC-based Visual Follower Model Automated Conflict Resolution of Lane Change Utilizing Probability Collectives Estimating and Localizing External Forces Applied on Flexible Instruments by Shape Sensing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1