Multimodal critical-scenarios search method for test of autonomous vehicles

Tianyue Feng;Lihao Liu;Xingyu Xing;Junyi Chen
{"title":"Multimodal critical-scenarios search method for test of autonomous vehicles","authors":"Tianyue Feng;Lihao Liu;Xingyu Xing;Junyi Chen","doi":"10.1108/JICV-04-2022-0016","DOIUrl":null,"url":null,"abstract":"Purpose - The purpose of this paper is to search for the critical-scenarios of autonomous vehicles (AVs) quickly and comprehensively, which is essential for verification and validation (V&V). Design/methodology/approach - The author adopted the index F1 to quantitative critical-scenarios' coverage of the search space and proposed the improved particle swarm optimization (IPSO) to enhance exploration ability for higher coverage. Compared with the particle swarm optimization (PSO), there were three improvements. In the initial phase, the Latin hypercube sampling method was introduced for a uniform distribution of particles. In the iteration phase, the neighborhood operator was adapted to explore more modals with the particles divided into groups. In the convergence phase, the convergence judgment and restart strategy were used to explore the search space by avoiding local convergence. Compared with the Monte Carlo method (MC) and PSO, experiments on the artificial function and critical-scenarios search were carried out to verify the efficiency and the application effect of the method. Findings - Results show that IPSO can search for multimodal critical-scenarios comprehensively, with a stricter threshold and fewer samples in the experiment on critical-scenario search, the coverage of IPSO is 14% higher than PSO and 40% higher than MC. Originality/value - The critical-scenarios' coverage of the search space is firstly quantified by the index F1, and the proposed method has higher search efficiency and coverage for the critical-scenarios search of AVs, which shows application potential for V&V.","PeriodicalId":100793,"journal":{"name":"Journal of Intelligent and Connected Vehicles","volume":"5 3","pages":"167-176"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/iel7/9944931/10004521/10004526.pdf","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Intelligent and Connected Vehicles","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10004526/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Purpose - The purpose of this paper is to search for the critical-scenarios of autonomous vehicles (AVs) quickly and comprehensively, which is essential for verification and validation (V&V). Design/methodology/approach - The author adopted the index F1 to quantitative critical-scenarios' coverage of the search space and proposed the improved particle swarm optimization (IPSO) to enhance exploration ability for higher coverage. Compared with the particle swarm optimization (PSO), there were three improvements. In the initial phase, the Latin hypercube sampling method was introduced for a uniform distribution of particles. In the iteration phase, the neighborhood operator was adapted to explore more modals with the particles divided into groups. In the convergence phase, the convergence judgment and restart strategy were used to explore the search space by avoiding local convergence. Compared with the Monte Carlo method (MC) and PSO, experiments on the artificial function and critical-scenarios search were carried out to verify the efficiency and the application effect of the method. Findings - Results show that IPSO can search for multimodal critical-scenarios comprehensively, with a stricter threshold and fewer samples in the experiment on critical-scenario search, the coverage of IPSO is 14% higher than PSO and 40% higher than MC. Originality/value - The critical-scenarios' coverage of the search space is firstly quantified by the index F1, and the proposed method has higher search efficiency and coverage for the critical-scenarios search of AVs, which shows application potential for V&V.
自动驾驶汽车测试的多模式关键场景搜索方法
目的——本文的目的是快速、全面地搜索自动驾驶汽车的关键场景,这对验证和验证至关重要。设计/方法/方法-作者采用指数F1来量化搜索空间的关键场景覆盖率,并提出了改进的粒子群优化(IPSO)来增强对更高覆盖率的探索能力。与粒子群优化算法相比,有三个方面的改进。在最初阶段,引入了拉丁超立方体采样方法来实现粒子的均匀分布。在迭代阶段,邻域算子适用于探索更多的模态,将粒子分组。在收敛阶段,通过避免局部收敛,使用收敛判断和重启策略来探索搜索空间。与蒙特卡罗方法(MC)和粒子群算法(PSO)进行了比较,对人工函数和关键场景搜索进行了实验,验证了该方法的有效性和应用效果。研究结果-结果表明,IPSO可以全面搜索多模式关键场景,在关键场景搜索实验中,阈值更严格,样本更少,IPSO的覆盖率比PSO高14%,比MC高40%。原创性/价值-关键场景在搜索空间的覆盖率首先用指数F1来量化,该方法在AVs关键场景搜索中具有较高的搜索效率和覆盖率,显示了V&V的应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.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学术官方微信