Forecasting Trajectory and Behavior of Road-Agents Using Spectral Clustering in Graph-LSTMs
Rohan Chandra, Tianrui Guan, Srujan Panuganti, Trisha Mittal, Uttaran, Bhattacharya, Aniket Bera, Dinesh Manocha

TL;DR
This paper introduces a novel spectral clustering and graph-LSTM based method for urban traffic forecasting, predicting both trajectories and behaviors of road-agents with significantly improved accuracy and long-term prediction performance.
Contribution
It combines spectral graph analysis with deep learning to enhance trajectory and behavior prediction accuracy in traffic scenarios, introducing a spectral regularization technique and theoretical error bounds.
Findings
Reduces average prediction error by ~75%
Achieves 91.2% accuracy in behavior prediction
Improves long-term prediction by up to 70%
Abstract
We present a novel approach for traffic forecasting in urban traffic scenarios using a combination of spectral graph analysis and deep learning. We predict both the low-level information (future trajectories) as well as the high-level information (road-agent behavior) from the extracted trajectory of each road-agent. Our formulation represents the proximity between the road agents using a weighted dynamic geometric graph (DGG). We use a two-stream graph-LSTM network to perform traffic forecasting using these weighted DGGs. The first stream predicts the spatial coordinates of road-agents, while the second stream predicts whether a road-agent is going to exhibit overspeeding, underspeeding, or neutral behavior by modeling spatial interactions between road-agents. Additionally, we propose a new regularization algorithm based on spectral clustering to reduce the error margin in long-term…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
