We address the question of feasibility of tests to verify highly automated driving functions by optimizing the trade-off between virtual tests for verifying safety properties and physical tests for validating the models used for such verification. We follow a quantitative approach based on a probabilistic treatment of the different quantities in question. That is, we quantify the accuracy of a model in terms of its probabilistic prediction ability. Similarly, we quantify the compliance of a system with its requirements in terms of the probability of satisfying these requirements. Depending on the costs of an individual virtual and physical test we are then able to calculate an optimal trade-off between physical and virtual tests, yet guaranteeing a probability of satisfying all requirements.
CITATION STYLE
Böde, E., Büker, M., Eberle, U., Fränzle, M., Gerwinn, S., & Kramer, B. (2018). Efficient Splitting of Test and Simulation Cases for the Verification of Highly Automated Driving Functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11093 LNCS, pp. 139–153). Springer Verlag. https://doi.org/10.1007/978-3-319-99130-6_10
Mendeley helps you to discover research relevant for your work.