Proposal of a new virtual evaluation approach of preventive safety applications and advanced driver assistance functions – application: AEB system
Bibliographic record
Abstract
This study presents a new virtual evaluation approach of preventive safety applications and advanced driver assistance functions. The approach identifies the worst‐case scenarios for a given advanced driver assistance function, AEB system in this study, based on field operational tests (FOT) [safety pilot model deployment (SPMD), in this study]. The authors begin with a description of the studied AEB system and a synthesis of the most relevant tests scenarios. Then, they model the distribution of each test parameter retrieved from the SPMD database by applying two estimation methods (kernel method and expectation‐maximisation algorithm). A comparison was made between the two methods to choose the best one. These distributions are then sampled using the proposed sampling strategy based on Metropolis‐Hastings algorithm. Then, the idea is to take the samples of each parameter retrieved with this sampler, simulate them on a vehicular software simulator (PreScan) and to get their simulation results. For each test and in case of impact, a proportional score to the speed of impact reduction is attributed. Finally, a risk classification is done based on the scoring results which allows to recover high and very high‐risk cases to build a set of worst‐case scenarios.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".