HeGA: Heterogeneous Graph Aggregation Network for Trajectory Prediction in High-Density Traffic

12Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Trajectory prediction enables the fast and accurate response of autonomous driving navigation in complex and dense traffics. In this paper, we present a novel trajectory prediction network called He terogeneous G raph A ggregation (HeGA) for high-density heterogeneous traffic, where the traffic agents of various categories interact densely with each other. To predict the trajectory of a target agent, HeGA first automatically selects neighbors that interact with it by our proposed adaptive neighbor selector, and then aggregates their interactions based on a novel two-phase aggregation transformer block. At last, the historical residual connection LSTM enhances the historical information awareness and decodes the spatial coordinates as the prediction results. Extensive experiments on real data demonstrate that the proposed network significantly outperforms the existing state-of-the-art competitors by over 27% on average displacement error (ADE) and over 31% on final displacement error (FDE). We also deploy HeGA in a state-of-the-art framework for autonomous driving, demonstrating its superior applicability based on three simulated environments with different densities and complexities.

Cite

CITATION STYLE

APA

Liu, S., Chen, X., Wu, Z., Deng, L., Su, H., & Zheng, K. (2022). HeGA: Heterogeneous Graph Aggregation Network for Trajectory Prediction in High-Density Traffic. In International Conference on Information and Knowledge Management, Proceedings (pp. 1319–1328). Association for Computing Machinery. https://doi.org/10.1145/3511808.3557345

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free