Vehicle Trajectory Prediction in Highway Merging Area Using Interactive Graph Attention Mechanism
Bibliographic record
Abstract
Accurately predicting the future trajectories of surrounding traffic agents is important for ensuring the safety of autonomous vehicles. To address the scenario of frequent interactions among traffic agents in the highway merging area, this paper proposes a trajectory prediction method based on interactive graph attention mechanism. Our approach integrates an interactive graph model to capture the complex interactions among traffic agents as well as the interactions between these agents and the contextual map of the highway merging area. By leveraging this interactive graph model, we establish an agent-agent interactive graph and an agent-map interactive graph. Moreover, we employ Graph Attention Network (GAT) to extract spatial interactions among trajectories, enhancing our predictions. To capture temporal dependencies within trajectories, we employ a Transformer-based multi-head self-attention mechanism. Additionally, GAT are utilized to model the interactions between traffic agents and the map. The method we propose comprehensively incorporates the influences of time, space, and the map on trajectories. The interactive graph models can serve as effective prior knowledge for learning-based approaches, thereby enhancing the acquisition of interaction patterns among traffic scenarios and facilitating the interpretability of the method. We evaluate the performances of our method using real-world trajectory datasets from the highway merging area, i.e., the Exits and Entries Drone Dataset (exiD). Comparative analysis against classical algorithms demonstrates a reduced trajectory prediction error for prediction horizons of both 3s and 4s.
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.001 | 0.001 |
| Bibliometrics | 0.002 | 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.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".