Learning Heterogeneous Interaction Strengths by Trajectory Prediction with Graph Neural Network

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 7
  • Download : 0
Dynamical systems with interacting agents are universal in nature, commonly modeled by a graph of relationships between their constituents. Recently, various works have been presented to tackle the problem of inferring those relationships from the system trajectories via deep neural networks, but most of the studies assume binary or discrete types of interactions for simplicity. In the real world, the interaction kernels often involve continuous interaction strengths, which can not be accurately approximated by discrete relations. In this work, we propose the relational attentive inference network (RAIN) to infer continuously weighted interaction graphs without any ground-truth interaction strengths. Our model em ploys a novel pairwise attention (PA) mechanism to refine the trajectory represen tations and a graph transformer to extract heterogeneous interaction weights for each pair of agents. We show that our RAIN model with the PA mechanism ac curately infers continuous interaction strengths for simulated physical systems in an unsupervised manner. Further, RAIN with PA successfully predicts trajectories from motion capture data with an interpretable interaction graph, demonstrating the virtue of modeling unknown dynamics with continuous weights.
Publisher
ICLR
Issue Date
2023-05-03
Citation

ICLR2023, pp.12319 - 12338

URI
http://hdl.handle.net/10203/319860
Appears in Collection
PH-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0