Prediction-Uncertainty-Aware Decision-Making for Autonomous Vehicles
Bibliographic record
Abstract
Motion prediction is the fundamental input for decision-making in autonomous vehicles. The current motion prediction solutions are designed with a strong reliance on black box predictions based on neural networks (NNs), which is unacceptable for safety-critical applications. Motion prediction with high uncertainty can cause conflicting decisions and even catastrophic results. To address this issue, an uncertainty estimation approach based on the deep ensemble technique is proposed for motion prediction in this paper. Subsequently, the estimated uncertainty is considered in the decision-making module to improve driving safety. Firstly, a motion prediction model based on long short-term memory (LSTM) is built and the deep ensemble technique is utilized to obtain both epistemic and aleatoric uncertainty of the prediction model. Besides, an uncertainty-aware potential field is developed to process the prediction uncertainty. Furthermore, a decision-making framework is proposed based on the model predictive control algorithm that considers the uncertainty-aware potential field, road boundaries, and multiple constraints of vehicle dynamics. Finally, the public availableNGSIM,HighDandINTERACTIONdatasets are used to evaluate the proposed motion prediction model. More importantly, two traffic scenarios are also extracted fromNGSIMandINTERACTIONdatasets to verify the effectiveness of the proposed decision-making method and in particular, its real-time performance is shown by employing a hardware-in-the-loop (HiL) experiment bench.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
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".