Computing Safe Stop Trajectories for Autonomous Driving Utilizing Clustering and Parametric Optimization

Vehicles Pub Date : 2024-03-24 DOI:10.3390/vehicles6020027
Johannes Langhorst, Kai Wah Chan, Christian Meerpohl, Christof Büskens
{"title":"Computing Safe Stop Trajectories for Autonomous Driving Utilizing Clustering and Parametric Optimization","authors":"Johannes Langhorst, Kai Wah Chan, Christian Meerpohl, Christof Büskens","doi":"10.3390/vehicles6020027","DOIUrl":null,"url":null,"abstract":"In the realm of autonomous driving, ensuring a secure halt is imperative across diverse scenarios, ranging from routine stops at traffic lights to critical situations involving detected system boundaries of crucial modules. This article presents a novel methodology for swiftly calculating safe stop trajectories. We utilize a clustering method to categorize lane shapes to assign encountered traffic situations at runtime to a set of precomputed resources. Among these resources, there are precalculated halt trajectories along representative lane centers that serve as parametrizations of the optimal control problem. At runtime, the current road settings are identified, and the respective precomputed trajectory is selected and then adjusted to fit the present situation. Here, the perceived lane center is considered a change in the parameters of the optimal control problem. Thus, techniques based on parametric sensitivity analysis can be employed, such as the low-cost feasibility correction. This approach covers a substantial number of lane shapes and exhibits a similar solution quality as a re-optimization to generate a trajectory while demanding only a fraction of the computation time.","PeriodicalId":509694,"journal":{"name":"Vehicles","volume":" 15","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vehicles","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/vehicles6020027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the realm of autonomous driving, ensuring a secure halt is imperative across diverse scenarios, ranging from routine stops at traffic lights to critical situations involving detected system boundaries of crucial modules. This article presents a novel methodology for swiftly calculating safe stop trajectories. We utilize a clustering method to categorize lane shapes to assign encountered traffic situations at runtime to a set of precomputed resources. Among these resources, there are precalculated halt trajectories along representative lane centers that serve as parametrizations of the optimal control problem. At runtime, the current road settings are identified, and the respective precomputed trajectory is selected and then adjusted to fit the present situation. Here, the perceived lane center is considered a change in the parameters of the optimal control problem. Thus, techniques based on parametric sensitivity analysis can be employed, such as the low-cost feasibility correction. This approach covers a substantial number of lane shapes and exhibits a similar solution quality as a re-optimization to generate a trajectory while demanding only a fraction of the computation time.
利用聚类和参数优化计算自动驾驶的安全停车轨迹
在自动驾驶领域,从交通信号灯前的例行停车到涉及检测到关键模块系统边界的危急情况,确保安全停车在各种场景中都势在必行。本文介绍了一种快速计算安全停车轨迹的新方法。我们利用聚类方法对车道形状进行分类,将运行时遇到的交通状况分配给一组预先计算好的资源。在这些资源中,有沿着代表性车道中心预先计算的停止轨迹,这些轨迹可作为最优控制问题的参数。运行时,识别当前道路设置,选择相应的预计算轨迹,然后进行调整以适应当前情况。在这里,感知到的车道中心被视为最优控制问题参数的变化。因此,可以采用基于参数敏感性分析的技术,如低成本可行性修正。这种方法涵盖了大量的车道形状,并表现出与重新优化生成轨迹类似的解决方案质量,而所需的计算时间仅为原来的一小部分。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
4.10
自引率
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学术官方微信