TY - JOUR
T1 - SDAGCN
T2 - Sparse Directed Attention Graph Convolutional Network for Spatial Interaction in Pedestrian Trajectory Prediction
AU - Sun, Chao
AU - Wang, Bo
AU - Leng, Jianghao
AU - Zhang, Xiangchao
AU - Wang, Bo
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2024
Y1 - 2024
N2 - Pedestrian trajectory prediction is crucial across various domains, but remains challenging due to complex spatial interactions. Existing graph convolutional network (GCN) methods show promise but often fail to capture these dynamics effectively. To address this limitation, a sparse directed attention GCN (SDAGCN) is proposed to handle both social interactions among pedestrians and self-interactions within individuals. Traditional GCN-based methods often model social interactions as undirected or dense graphs. However, due to the field of view and awareness of collision avoidance of pedestrians, they tend to focus unilaterally on specific neighbors. To reflect this, SDAGCN constructs a sparse and directed spatial graph that considers these attributes innovatively. Furthermore, the attention weights of pedestrians toward their neighbors are closely tied to spatial conflicts. The conflicts are deeply influenced by relative velocity and distance. Therefore, these attributes are leveraged to calculate the attention weights. These two components form the sparse directed attention (SDA) mechanism, which effectively discerns the influence of neighbors on a target pedestrian in various situations. Additionally, the self-interaction of each pedestrian is significantly influenced by their speed. To capture variations in self-interaction across different states, SDAGCN employs a single-layer perceptron with the square of pedestrian speed as input. Experiments conducted on the ETH and UCY data sets demonstrate that our method outperforms other GCN-based spatial interaction methods, showcasing its potential in accurately predicting pedestrian trajectories by effectively handling complex social and self-interactions.
AB - Pedestrian trajectory prediction is crucial across various domains, but remains challenging due to complex spatial interactions. Existing graph convolutional network (GCN) methods show promise but often fail to capture these dynamics effectively. To address this limitation, a sparse directed attention GCN (SDAGCN) is proposed to handle both social interactions among pedestrians and self-interactions within individuals. Traditional GCN-based methods often model social interactions as undirected or dense graphs. However, due to the field of view and awareness of collision avoidance of pedestrians, they tend to focus unilaterally on specific neighbors. To reflect this, SDAGCN constructs a sparse and directed spatial graph that considers these attributes innovatively. Furthermore, the attention weights of pedestrians toward their neighbors are closely tied to spatial conflicts. The conflicts are deeply influenced by relative velocity and distance. Therefore, these attributes are leveraged to calculate the attention weights. These two components form the sparse directed attention (SDA) mechanism, which effectively discerns the influence of neighbors on a target pedestrian in various situations. Additionally, the self-interaction of each pedestrian is significantly influenced by their speed. To capture variations in self-interaction across different states, SDAGCN employs a single-layer perceptron with the square of pedestrian speed as input. Experiments conducted on the ETH and UCY data sets demonstrate that our method outperforms other GCN-based spatial interaction methods, showcasing its potential in accurately predicting pedestrian trajectories by effectively handling complex social and self-interactions.
KW - Graph convolutional network (GCN)
KW - pedestrian trajectory prediction
KW - sparse directed attention (SDA)
KW - spatial interaction
UR - http://www.scopus.com/inward/record.url?scp=85195383744&partnerID=8YFLogxK
U2 - 10.1109/JIOT.2024.3409174
DO - 10.1109/JIOT.2024.3409174
M3 - Article
AN - SCOPUS:85195383744
SN - 2327-4662
VL - 11
SP - 39225
EP - 39235
JO - IEEE Internet of Things Journal
JF - IEEE Internet of Things Journal
IS - 24
ER -