Real-Time Vehicle Trajectory Prediction for Traffic Conflict Detection at Unsignalized Intersections
Bibliographic record
Abstract
Real-time prediction of vehicle trajectory at unsignalized intersections is important for real-time traffic conflict detection and early warning to improve traffic safety at unsignalized intersections. In this study, we propose a robust real-time prediction method for turning movements and vehicle trajectories using deep neural networks. Firstly, a vision-based vehicle trajectory extraction system is developed to collect vehicle trajectories and their left-turn, go straight, and right-turn labels to train turning recognition models and multilayer LSTM deep neural networks for the prediction task. Then, when performing vehicle trajectory prediction, we propose the vehicle heading angle change trend method to recognize the future move of the target vehicle to turn left, go straight, and turn right based on the trajectory data characteristics of the target vehicle before passing the stop line. Finally, we use the trained multilayer LSTM models of turning left, going straight, and turning right to predict the trajectory of the target vehicle through the intersection. Based on the TensorFlow-GPU platform, we use Yolov5-DeepSort to automatically extract vehicle trajectory data at unsignalized intersections. The experimental results show that the proposed method performs well and has a good performance in both speed and accuracy evaluation.
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.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".