Prediction of instantaneous driving safety in emergency scenarios based on connected vehicle basic safety messages
Bibliographic record
Abstract
Purpose Basic safety message (BSM) is a core subset of standard protocols for connected vehicle system to transmit related safety information via vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I). Although some safety prototypes of connected vehicle have been proposed with effective strategies, few of them are fully evaluated in terms of the significance of BSM messages on performance of safety applications when in emergency. Design/methodology/approach To address this problem, a data fusion method is proposed to capture the vehicle crash risk by extracting critical information from raw BSMs data, such as driver volition, vehicle speed, hard accelerations and braking. Thereafter, a classification model based on information-entropy and variable precision rough set (VPRS) is used for assessing the instantaneous driving safety by fusing the BSMs data from field test, and predicting the vehicle crash risk level with the driver emergency maneuvers in the next short term. Findings The findings and implications are discussed for developing an improved warning and driving assistant system by using BSMs messages. Originality/value The findings of this study are relevant to incorporation of alerts, warnings and control assists in V2V applications of connected vehicles. Such applications can help drivers identify situations where surrounding drivers are volatile, and they may avoid dangers by taking defensive actions.
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.000 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".