Vehicle Trajectory Prediction with Gaussian Process Regression in Connected Vehicle Environment$\star$
Bibliographic record
Abstract
This paper addresses the problem of long term location prediction for collision avoidance in Connected Vehicle (CV) environment where more information about the road and traffic data is available through vehicle-to-vehicle and vehicle-to-infrastructure communications. Gaussian Process Regression (GPR) is used to learn motion patterns from historical trajectory data collected with static sensors on the road. Trained models are then shared among the vehicles through connected vehicle cloud. A vehicle receives information, such as Global Positioning System coordinates, about nearby vehicles on the road using inter-vehicular communication. The collected data from vehicles together with GPR models received from infrastructure are then used to predict the future trajectories of vehicles in the scene. The contributions of this work are twofold. First, we propose the use of GPR in CV environment as a framework for long term location prediction. Second, we evaluate the effect of pre-analysis of training data via clustering in improving the trajectory pattern learning performance. Experiments using real-world traffic data collected in Los Angeles, California, US show that our proposed method improves prediction accuracy compared to the baseline kinematic models.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".