Optimizing coverage of simulated driving scenarios for the autonomous vehicle

M. Nabhan, Marc Schoenauer, Y. Tourbier, H. Hage
{"title":"Optimizing coverage of simulated driving scenarios for the autonomous vehicle","authors":"M. Nabhan, Marc Schoenauer, Y. Tourbier, H. Hage","doi":"10.1109/ICCVE45908.2019.8965211","DOIUrl":null,"url":null,"abstract":"Self-driving cars and advanced driver-assistance systems are perceived as a game-changer in the future of road transportation. However, their validation is mandatory before industrialization; testing every component should be assessed intensively in order to mitigate potential failures and avoid unwanted problems on the road. In order to cover all possible scenarios, virtual simulations are used to complement real-test driving and aid in the validation process. This paper focuses on the validation of the command law during realistic virtual simulations. Its aim is to detect the maximum amount of failures while exploring the input search space of the scenarios. A key industrial restriction, however, is to launch simulations as little as possible in order to minimize computing power needed. Thus, a reduced model based on a random forest model helps in decreasing the number of simulations launched. It accompanies the algorithm in detecting the maximum amount of faulty scenarios everywhere in the search space. The methodology is tested on a tracking vehicle use case, which produces highly effective results.","PeriodicalId":384049,"journal":{"name":"2019 IEEE International Conference on Connected Vehicles and Expo (ICCVE)","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Connected Vehicles and Expo (ICCVE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCVE45908.2019.8965211","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Self-driving cars and advanced driver-assistance systems are perceived as a game-changer in the future of road transportation. However, their validation is mandatory before industrialization; testing every component should be assessed intensively in order to mitigate potential failures and avoid unwanted problems on the road. In order to cover all possible scenarios, virtual simulations are used to complement real-test driving and aid in the validation process. This paper focuses on the validation of the command law during realistic virtual simulations. Its aim is to detect the maximum amount of failures while exploring the input search space of the scenarios. A key industrial restriction, however, is to launch simulations as little as possible in order to minimize computing power needed. Thus, a reduced model based on a random forest model helps in decreasing the number of simulations launched. It accompanies the algorithm in detecting the maximum amount of faulty scenarios everywhere in the search space. The methodology is tested on a tracking vehicle use case, which produces highly effective results.
优化自动驾驶汽车模拟驾驶场景的覆盖范围
自动驾驶汽车和先进的驾驶员辅助系统被认为是未来道路交通的游戏规则改变者。然而,在工业化之前,它们的验证是强制性的;为了减少潜在的故障,避免在道路上出现不必要的问题,应该对每个组件进行密集的测试。为了涵盖所有可能的场景,虚拟仿真被用来补充真实测试驾驶,并在验证过程中提供帮助。本文重点研究了在现实虚拟仿真中指挥律的验证问题。其目的是在探索场景的输入搜索空间时检测最大故障量。然而,一个关键的工业限制是尽可能少地启动模拟,以最小化所需的计算能力。因此,基于随机森林模型的简化模型有助于减少启动的模拟次数。它伴随着算法在搜索空间中检测到最大数量的错误场景。该方法在跟踪车辆用例中进行了测试,产生了高效的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信