FIMP: Future Interaction Modeling for Multi-Agent Motion Prediction
Sungmin Woo, Minjung Kim, Donghyeong Kim, Sungjun Jang, Sangyoun Lee
TL;DR
The paper tackles uncertain multi-agent interactions in motion forecasting by introducing FIMP, a framework that decouples potential future information from history through a dedicated future decoder. FIMP learns future affinities among agents and applies top-$k$ filtering to identify interacting pairs for targeted message passing, enabling end-to-end, multi-modal predictions with reduced reliance on pre-estimated future cues. The method temporalizes mode embeddings into sparse future time zones and outputs a Laplace-distributed prediction, achieving state-of-the-art minFDE and minADE on Argoverse while maintaining real-time inference. This implicit future interaction modeling offers a practical alternative to explicit future-state conditioning, improving realism and robustness in multi-agent forecasting.
Abstract
Multi-agent motion prediction is a crucial concern in autonomous driving, yet it remains a challenge owing to the ambiguous intentions of dynamic agents and their intricate interactions. Existing studies have attempted to capture interactions between road entities by using the definite data in history timesteps, as future information is not available and involves high uncertainty. However, without sufficient guidance for capturing future states of interacting agents, they frequently produce unrealistic trajectory overlaps. In this work, we propose Future Interaction modeling for Motion Prediction (FIMP), which captures potential future interactions in an end-to-end manner. FIMP adopts a future decoder that implicitly extracts the potential future information in an intermediate feature-level, and identifies the interacting entity pairs through future affinity learning and top-k filtering strategy. Experiments show that our future interaction modeling improves the performance remarkably, leading to superior performance on the Argoverse motion forecasting benchmark.
