Adaptive cooperative maneuver planning algorithm for conflict resolution in diverse traffic situations

Michael During, Kai Franke, Reza Balaghiasefi, M. Gonter, Markus Belkner, K. Lemmer
{"title":"Adaptive cooperative maneuver planning algorithm for conflict resolution in diverse traffic situations","authors":"Michael During, Kai Franke, Reza Balaghiasefi, M. Gonter, Markus Belkner, K. Lemmer","doi":"10.1109/ICCVE.2014.7297550","DOIUrl":null,"url":null,"abstract":"Growing interest in Cooperative Driving within the field of Intelligent Transport Systems (ITS) put forth novel concepts for both enhanced sensing and advanced solution making. Although various approaches deal with advanced solution making, none of the concepts consider the conflict situation as a holistic situation comprising defined end states and trajectories towards them. We propose a novel algorithm for cooperative maneuver planning that is not meant to optimize a high level strategy but shall solve a conflict in the following five steps: target point generation, risk assessment, trajectory generation, combination including assessment, and execution of the maneuvers. The proposed cooperative maneuver planning algorithm is applicable to all kinds of road users' interferences (safety, comfort, time efficiency, and consumption efficiency), highly adaptive in terms of complexity and scalability, individually parameterizable, and applicable in diverse and mixed traffic situations. Simulations indicate the wide usability and performance of this approach in two different scenarios. The algorithm solves a critical overtaking maneuver on a country road and a merging maneuver onto a highway. Modifications of the initial situation lead to different solutions and thus show the adaptive nature of the algorithm.","PeriodicalId":171304,"journal":{"name":"2014 International Conference on Connected Vehicles and Expo (ICCVE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Connected Vehicles and Expo (ICCVE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCVE.2014.7297550","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 19

Abstract

Growing interest in Cooperative Driving within the field of Intelligent Transport Systems (ITS) put forth novel concepts for both enhanced sensing and advanced solution making. Although various approaches deal with advanced solution making, none of the concepts consider the conflict situation as a holistic situation comprising defined end states and trajectories towards them. We propose a novel algorithm for cooperative maneuver planning that is not meant to optimize a high level strategy but shall solve a conflict in the following five steps: target point generation, risk assessment, trajectory generation, combination including assessment, and execution of the maneuvers. The proposed cooperative maneuver planning algorithm is applicable to all kinds of road users' interferences (safety, comfort, time efficiency, and consumption efficiency), highly adaptive in terms of complexity and scalability, individually parameterizable, and applicable in diverse and mixed traffic situations. Simulations indicate the wide usability and performance of this approach in two different scenarios. The algorithm solves a critical overtaking maneuver on a country road and a merging maneuver onto a highway. Modifications of the initial situation lead to different solutions and thus show the adaptive nature of the algorithm.
基于自适应协同机动规划的交通冲突解决算法
智能交通系统(ITS)领域对协同驾驶的兴趣日益浓厚,为增强传感和先进的解决方案制定提出了新的概念。虽然各种方法处理高级解决方案制定,但没有一个概念将冲突局势视为一个整体局势,包括确定的最终状态和走向它们的轨迹。本文提出了一种新的协同机动规划算法,该算法不是为了优化高级策略,而是通过目标点生成、风险评估、轨迹生成、组合包括评估和机动执行五个步骤来解决冲突。本文提出的协同机动规划算法适用于各种道路使用者干扰(安全性、舒适性、时间效率和消耗效率),具有高度的复杂性和可扩展性,可单独参数化,适用于多种混合交通情况。仿真结果表明,该方法在两种不同场景下具有广泛的可用性和性能。该算法解决了乡村道路上的关键超车机动和高速公路上的归并机动。对初始情况的修改导致不同的解,从而显示了算法的自适应性质。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信