A Novel Multimodal Vehicle Path Prediction Method Based on Temporal Convolutional Networks
Bibliographic record
Abstract
Accurate and reliable prediction of future motions of the nearby agents and effective environment understanding will contribute to high-quality and meticulous path planning for the automated vehicles under uncertainty and guarantee traffic safety for future real-world deployments. This task becomes more challenging in highly dynamic and complex scenarios such as unsignalized intersections where no lights exist to control vehicles behavior, or there are not multiple lines for the vehicles to anticipate drivers’ future intentions based on the lane in which they are driving. In this study, we introduce a novel deep learning-based methodology to anticipate vehicles path at unsignalized intersections. The method provides multimodal outputs to take into account the inherited uncertainty and multimodality nature of vehicles behavior. Our proposed model works based on dilated convolutional networks in combination with a mixture density layer. We then cluster various existing mixes into possible paths that are ranked based on probability. We assess the performance and generalization capability of our vehicle path prediction model using several metrics over a large naturalistic dataset containing more than 23800 vehicle trajectories. The obtained results reveal the higher performance of our path prediction approach compared with several baselines and benchmarks.
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.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".