Papers › Dynamic Scenario Representation Learning for Motion Forecasting with Heterogeneous...
Dynamic Scenario Representation Learning for Motion Forecasting with Heterogeneous Graph Convolutional Recurrent Networks
Xing Gao, Xiaogang Jia, Yikang Li, Hongkai Xiong
Due to the complex and changing interactions in dynamic scenarios, motion forecasting is a challenging problem in autonomous driving. Most existing works exploit static road graphs to characterize scenarios and are limited in modeling evolving spatio-temporal dependencies in dynamic scenarios. In this paper, we resort to dynamic heterogeneous graphs to model the scenario. Various scenario components including vehicles (agents) and lanes, multi-type interactions, and their changes over time are jointly encoded. Furthermore, we design a novel heterogeneous graph convolutional recurrent network, aggregating diverse interaction information and capturing their evolution, to learn to exploit intrinsic spatio-temporal dependencies in dynamic graphs and obtain effective representations of dynamic scenarios. Finally, with a motion forecasting decoder, our model predicts realistic and multi-modal future trajectories of agents and outperforms state-of-the-art published works on several motion forecasting benchmarks.
In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.
Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
For agents, on Syntology's MCP service (how to connect):
get_citation_path(paper_1="2303.04364", paper_2="…")with another paper's arXiv id or titleget_concepts_for_paper(arxiv_id="2303.04364")
Code
No code repository is listed for this paper in the archive or in Syntology's graph.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
| Task | Dataset | Model | Metric | Value | Rank at snapshot | Leaderboard | Report |
|---|---|---|---|---|---|---|---|
| Trajectory Prediction | Argoverse | HeteroGCN | MR (K=6) | 0.12 | #1 of 1 | Archive leaderboard | report |
| Trajectory Prediction | Argoverse | HeteroGCN | brier-minFDE (K=6) | 1.75 | #1 of 1 | Archive leaderboard | report |
| Trajectory Prediction | Argoverse | HeteroGCN | minADE (K=6) | 0.79 | #1 of 1 | Archive leaderboard | report |
| Trajectory Prediction | Argoverse | HeteroGCN | minFDE (K=6) | 1.16 | #1 of 1 | Archive leaderboard | report |
| Trajectory Prediction | Argoverse2 | HeteroGCN | MR (K=6) | 0.18 | #1 of 1 | Archive leaderboard | report |
| Trajectory Prediction | Argoverse2 | HeteroGCN | brier-minFDE (K=6) | 1.90 | #1 of 1 | Archive leaderboard | report |
| Trajectory Prediction | Argoverse2 | HeteroGCN | minADE (K=6) | 0.69 | #1 of 1 | Archive leaderboard | report |
| Trajectory Prediction | Argoverse2 | HeteroGCN | minFDE (K=6) | 1.34 | #1 of 1 | Archive leaderboard | report |
Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections