Papers › Latent Variable Sequential Set Transformers For Joint Multi-Agent Motion Prediction

Latent Variable Sequential Set Transformers For Joint Multi-Agent Motion Prediction

19 Feb 2021ICLR 2022 4arXiv:2104.00563archive 2025-07-28

Roger Girgis, Florian Golemo, Felipe Codevilla, Martin Weiss, Jim Aldon D'Souza, Samira Ebrahimi Kahou, Felix Heide, Christopher Pal

Robust multi-agent trajectory prediction is essential for the safe control of robotic systems. A major challenge is to efficiently learn a representation that approximates the true joint distribution of contextual, social, and temporal information to enable planning. We propose Latent Variable Sequential Set Transformers which are encoder-decoder architectures that generate scene-consistent multi-agent trajectories. We refer to these architectures as "AutoBots". The encoder is a stack of interleaved temporal and social multi-head self-attention (MHSA) modules which alternately perform equivariant processing across the temporal and social dimensions. The decoder employs learnable seed parameters in combination with temporal and social MHSA modules allowing it to perform inference over the entire future scene in a single forward pass efficiently. AutoBots can produce either the trajectory of one ego-agent or a distribution over the future trajectories for all agents in the scene. For the single-agent prediction case, our model achieves top results on the global nuScenes vehicle motion prediction leaderboard, and produces strong results on the Argoverse vehicle prediction challenge. In the multi-agent setting, we evaluate on the synthetic partition of TrajNet++ dataset to showcase the model's socially-consistent predictions. We also demonstrate our model on general sequences of sets and provide illustrative experiments modelling the sequential structure of the multiple strokes that make up symbols in the Omniglot data. A distinguishing feature of AutoBots is that all models are trainable on a single desktop GPU (1080 Ti) in under 48h.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2104.00563")

Code

Syntology Ran 2 of 17 code samples harvested from 1 repository linked to this paper; 15 have no recorded run. Of those that ran: 1 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 17 samples from 1 repository, 2 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

roggirg/AutoBots officialmentioned on GitHubpytorchBSD-3-Clause report
vita-epfl/unitraj pytorchNOASSERTION report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

17 samples harvested; 2 ran; 0 honoured the contract we drafted; 15 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · our draft was wrong
1ran
15unverified

Licence: 0 of the 17 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from roggirg/AutoBots. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

init roggirg/AutoBots/models/autobot_joint.py official repository ran · our draft was wrong BSD-3-Clause (permissive) · 9de355e93051e4ad · report
init roggirg/AutoBots/models/autobot_ego.py official repository ran BSD-3-Clause (permissive) · d7a51202f8456490 · report
angle_of_rotation roggirg/AutoBots/datasets/argoverse/create_h5_argo.py official repository unverified BSD-3-Clause (permissive) · db4fd23bb7142d4b · report
convert_global_coords_to_local roggirg/AutoBots/datasets/argoverse/create_h5_argo.py official repository unverified BSD-3-Clause (permissive) · 4efe4a6acb3051fb · report
create_results_folder roggirg/AutoBots/process_args.py official repository unverified BSD-3-Clause (permissive) · b61e662d9f8a3be9 · report
drop_distant roggirg/AutoBots/datasets/trajnetpp/create_data_npys.py official repository unverified BSD-3-Clause (permissive) · 3dba06ecf04eff9a · report
drop_inactive roggirg/AutoBots/datasets/trajnetpp/create_data_npys.py official repository unverified BSD-3-Clause (permissive) · 577c3685905bbabc · report
get_BVG_distributions roggirg/AutoBots/utils/train_helpers.py official repository unverified BSD-3-Clause (permissive) · 519ae373e4e4d7cd · report
get_Laplace_dist roggirg/AutoBots/utils/train_helpers.py official repository unverified BSD-3-Clause (permissive) · 5112337a26b088f3 · report
interpolate_trajectories roggirg/AutoBots/utils/metric_helpers.py official repository unverified BSD-3-Clause (permissive) · 4e0c5fccd80c3976 · report
load_config roggirg/AutoBots/process_args.py official repository unverified BSD-3-Clause (permissive) · 3eb3d4a61fbb224d · report
make_2d_rotation_matrix roggirg/AutoBots/datasets/argoverse/create_h5_argo.py official repository unverified BSD-3-Clause (permissive) · cd4282007f2ad836 · report
min_xde_K roggirg/AutoBots/utils/metric_helpers.py official repository unverified BSD-3-Clause (permissive) · b10ff2bd7a695f93 · report
nll_pytorch_dist roggirg/AutoBots/utils/train_helpers.py official repository unverified BSD-3-Clause (permissive) · 2e9627477244b6e9 · report
recompute_probs roggirg/AutoBots/useful_scripts/generate_nuscene_results.py official repository unverified BSD-3-Clause (permissive) · 29e4fbe72133e718 · report
shift roggirg/AutoBots/datasets/trajnetpp/create_data_npys.py official repository unverified BSD-3-Clause (permissive) · 1761d9ef84caa582 · report
yaw_from_predictions roggirg/AutoBots/utils/metric_helpers.py official repository unverified BSD-3-Clause (permissive) · 21100d7d06393031 · report

Tasks

Autonomous DrivingDecoderPredictionTrajectory ModelingTrajectory Predictionmotion prediction

1 archive task tag without a task page not shown.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Absolute Position EncodingsAdamAttentionBPEDense ConnectionsDropoutLabel SmoothingLayer NormalizationLinear LayerMulti-Head AttentionPosition-Wise Feed-Forward LayerResidual ConnectionSet TransformerSoftmaxTransformer

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections