Accident Detection and Flow Prediction for Connected and Automated Transport Systems
Bibliographic record
Abstract
Effective accident detection and traffic flow forecasting are of great importance for quick respond, impact elimination and intelligent control of the traffic flow consisting of autonomous vehicles. This paper proposes a traffic accident detection method for connected and automated transport systems by conducting a grid-based parameter extracting and SVC-based traffic state classification. Allowing for the dynamic spread of traffic flow over time, from upstream to downstream and from accident lanes to other lanes, a spatiotemporal Markov model is established to predict the evolution of traffic flow after accident by introducing the grid as state detection unit and fitting the spatiotemporal evolution with the parameter space mean speed to match the need of both detection accuracy and monitoring scope. Compared with actual accident data, the validation results indicate that the proposed methods present a good performance in accident detection with the accident detection rate as 87.72% and a higher precision rate than both SVM (support vector machine) and ANN (artificial neural network) models in traffic flow prediction. With the active traffic accident identification and dynamic traffic flow prediction, it is beneficial to shorten detection time, reduce possible impacts of traffic accidents and carbon emissions from congestion. The methods can be implied to traffic state recognition and traffic flow prediction, which is one of the significant sections of connected and automated transport systems, and serve as references for accident handling and urban traffic management.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".