Self-Growing Spatial Graph Networks for Pedestrian Trajectory Prediction

Sirin Haddad, Siew-Kei LamWACV 2020 · DOI

Introduction

Predicting pedestrian movement in crowded environments is a fundamental challenge for autonomous systems and social robotics. Humans do not move in isolation; they constantly modulate their speed and direction based on social norms and the proximity of others to avoid collisions. Traditional AI approaches to this problem typically fall into two categories: fixed-radius neighborhoods and dense graphs. Fixed-radius models often fail to account for distant but fast-moving agents, while dense graphs—which treat every agent as interacting with every other agent—are computationally expensive and introduce significant noise from irrelevant interactions.

Researchers have addressed these shortcomings by developing the Self-Growing Spatial Graph Network (SGSGN). This model dynamically learns which pedestrians are interacting in a crowd, allowing the underlying graph structure to "grow" or "shrink" based on the actual social context of the scene. By pruning unnecessary connections, the model achieves state-of-the-art accuracy while maintaining computational efficiency as crowd density increases.

Methodology: The Self-Growing Spatial Graph Network (SGSGN)

The core innovation of the SGSGN is its ability to move beyond static graph structures. The architecture is designed to handle real-time data streams while preserving the "memory" of past motions through stateful learning.

The SGSGN architectural pipeline, integrating spatial graph networks with dual-feature GRU stacks.

Dynamic Adjacency and Graph Growth

Instead of starting with a pre-defined set of edges, the model begins with a "null graph" consisting only of nodes. It calculates a distance matrix between all pedestrians, which is then processed through a Softmax layer to estimate the "potential for adjacency." The model rounds these probabilities to binary values (0 or 1), effectively "growing" an edge only when an interaction is likely. This allows the network to adapt to dynamic scenes where new agents enter or leave the environment.

Dynamic graph evolution: the model 'grows' new edges as agents enter the scene, maintaining relevant social connections while pruning noise.

Dual-Feature Prediction and Stateful Learning

While most models focus solely on location, the SGSGN utilizes a Dual-Feature Prediction mechanism. It simultaneously estimates both future location and velocity ($V^*$) using two dedicated Gated Recurrent Unit (GRU) cells. By explicitly modeling walking velocity as a separate feature and integrating it back into the positional prediction, the model can better adapt to sudden changes in movement and intent. To maintain temporal consistency, the model preserves the hidden states of the GRUs over time, ensuring that the social context is not lost when the graph structure updates between frames.

Evaluation and Results

The authors evaluated the SGSGN (specifically the $M_{SGTV}$ variant) on two major public benchmarks: the Crowds Dataset (ETH & UCY) and the Stanford Drone Dataset (SDD). These datasets provide a variety of social densities and heterogeneous movement types, including pedestrians, bikers, and skaters.

Performance and Accuracy

On the Crowds dataset, the $M_{SGTV}$ model consistently outperformed high-profile baselines such as Social LSTM and Social GAN. It achieved an Average Displacement Error (ADE) of 0.05m and a Final Displacement Error (FDE) of 0.21m. Qualitative analysis showed that the model implicitly learned social norms, such as slowing down predicted trajectories when pedestrians were on a direct collision course.

Computational Efficiency

One of the most significant advantages of the self-growing mechanism is its scalability. In fully connected graphs, the number of edges grows quadratically ($n^2$) with the number of people. The SGSGN allows for more linear growth in edge count, significantly reducing the "message passing load." In scenes with more than 60 pedestrians, the model remained significantly faster than Social GAN, which struggles as it attempts to pool features from every possible pair of agents.

Conclusion and Future Work

The Self-Growing Spatial Graph Network represents a significant step forward in efficient, socially-aware trajectory prediction. By dynamically pruning irrelevant interactions, it balances accuracy with computational feasibility. Currently, the model treats all active interactions as binary (0 or 1). Future research will focus on developing a weighting mechanism to quantify the degree of influence between pedestrians, moving toward a weighted graph that can more finely tune the social "pressure" felt by individuals in complex crowds.

Summary updated

BibTeX
@inproceedings{haddad2020self,
  author = {Sirin Haddad and Siew-Kei Lam},
  title = {{Self-Growing Spatial Graph Networks for Pedestrian Trajectory Prediction}},
  booktitle = {IEEE/CVF Winter Conference on Applications of Computer Vision},
  year = {2020},
  doi = {10.1109/wacv45572.2020.9093456},
}
Figure