Safedrive dreamer: Navigating safety–critical scenarios in autonomous driving with world models
Bibliographic record
Abstract
Achieving stable and reliable autonomous driving in complex traffic environments while ensuring safety under unpredictable conditions is a critical challenge in autonomous driving technology. To address this issue, this study proposes the Safedrive Dreamer navigation framework, which aims to reduce the reliance on trial-and-error learning in real-world scenarios, thereby mitigating the risks associated with dynamic driving conditions and enhancing vehicle foresight. This framework integrates the predictive capabilities of world models with the constrained Markov decision process (CMDP) and safety reinforcement learning to accurately anticipate future environmental changes. This ensures the reliability of autonomous driving routes, thereby improving both safety and efficiency. Furthermore, to reduce trial-and-error costs in real-world applications, this study employs PAC-Bayesian methods to derive generalization error bounds between simulations and reality, enabling a more effective transfer of knowledge and experience from simulations to real-world scenarios. Validation experiments in simulated and real environments showed that Safedrive Dreamer significantly outperformed existing autonomous driving solutions by 3.8% in key safety metrics, excelling in collision avoidance and risk reduction. This study provides new insights into the integration of world models into decision-making processes to enhance decision-making capabilities in safety–critical applications, thereby contributing significantly to the improvement of autonomous driving safety and reliability.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".