Driver Route Planning Method Based on Accident Risk Cost Prediction
Bibliographic record
Abstract
The number of cars on roadways around the world continues to increase year over year. However, the imbalance between traffic supply and demand has not only brought traffic congestion but also caused serious safety problems. To reduce travel risk, this study proposes a driver route planning method based on accident risk cost prediction for connected and automated vehicles. According to the entropy weight method and an improved algorithm of K shortest paths, a route planning model with accident risk as the main optimization objective was established. Firstly, an accident risk evaluation system was built based on traffic accident data, and a quantitative prediction model of accident risk cost based on driver-, vehicle-, road-, and environment-related factors was constructed. Secondly, the entropy weight method was used to calculate the weights of each indicator to determine accident risk considering the aforementioned factors. Then, the route planning model was established, and the solution algorithm based on K shortest paths was designed to solve the optimal route by comprehensively considering accident risk cost and travel time. The accident risk index of each road section in the example road network was assigned, and the risk of the road section was quantified according to the accident risk cost model. Three candidate paths were calculated by using the path planning algorithm proposed in this study; the total risk cost is 6.19, 6.26, and 6.39, respectively; and the total travel time is 29, 29, and 31, respectively. After comparison, the optimal path and two alternative paths are obtained. The results show that the accident risk cost prediction model based on historical accident data can be used to quantify driving risk. The proposed method can help drivers in the connected and automated environment choose the optimal travel route with the lowest risk and shortest travel time and improve overall traffic safety and efficiency.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".