In recent years, there have been remarkable advancements in automated driving systems. Consumer protection organizations, such as Euro NCAP, play a pivotal role in enhancing the overall safety of these modern vehicles. While previous emphasis has been on passive safety, the significance of active safety systems has surged in recent years. Evaluating the performance of these systems now relies on standardized test scenarios designed to simulate real-world accidents. Addressing this challenge, the future necessitates the incorporation of virtual methods to supplement traditional track tests. Given the complex nature of high-dimensional test cases, an exhaustive grid search is exceedingly time-consuming. In light of this challenge, we present a novel testing method utilizing search-based testing with Bayesian Optimization to efficiently navigate and explore the expansive search space of Euro NCAP CCR scenarios to identify the performance-critical scenarios.
The methodology incorporates the Brake Threat Number as a robust criticality metric within the fitness function, providing a reliable indicator for assessing the inevitability of collisions. Furthermore, the research utilizes a surrogate model derived from the evaluation points used by the optimization algorithm to determine the performance-critical boundary that separates the critical and the non-critical
scenarios. Additionally, this approach leverages the surrogate model for conducting sensitivity analysis, explaining the impact of individual parameters on the system’s output.
Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:92521 |
Date | 08 July 2024 |
Creators | Satyamohan, Sharmila |
Contributors | Hardt, W., Shegupta, Ummay Ubaida, Woerner, Maximilian, Technische Universität Chemnitz |
Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
Language | English |
Detected Language | English |
Type | info:eu-repo/semantics/publishedVersion, doc-type:masterThesis, info:eu-repo/semantics/masterThesis, doc-type:Text |
Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0017 seconds