Pith. sign in

REVIEW 3 cited by

Efficient Trajectory Forecasting and Generation with Conditional Flow Matching

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.10809 v2 pith:R67QQY5N submitted 2024-03-16 cs.RO

classification cs.RO
keywords trajectorygenerationflowmatchingt-cfmaccuracyapproachconditional
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Trajectory prediction and generation are crucial for autonomous robots in dynamic environments. While prior research has typically focused on either prediction or generation, our approach unifies these tasks to provide a versatile framework and achieve state-of-the-art performance. While diffusion models excel in trajectory generation, their iterative sampling process is computationally intensive, hindering robotic systems' dynamic capabilities. We introduce Trajectory Conditional Flow Matching (T-CFM), a novel approach using flow matching techniques to learn a solver time-varying vector field for efficient, fast trajectory generation. T-CFM demonstrates effectiveness in adversarial tracking, real-world aircraft trajectory forecasting, and long-horizon planning, outperforming state-of-the-art baselines with 35% higher predictive accuracy and 142% improved planning performance. Crucially, T-CFM achieves up to 100$\times$ speed-up compared to diffusion models without sacrificing accuracy, enabling real-time decision making in robotics. Codebase: https://github.com/CORE-Robotics-Lab/TCFM

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Inference-Time Policy Steering through Human Interactions

    cs.RO 2024-11 conditional novelty 6.0 of 10

    A stochastic MCMC sampling method, applied to frozen diffusion policies, best aligns generated robot trajectories with human interaction inputs while minimizing distribution shift.

  2. Pairwise Spatiotemporal Partial Trajectory Matching for Co-movement Analysis

    cs.CV 2024-12 reject novelty 5.0 of 10

    A GPS-to-image pipeline with a Siamese network is proposed for detecting partial co-walking events, reporting F1 up to 0.73 on a private dataset.

  3. Steering Robots with Inference-Time Interactions

    cs.RO 2025-06 conditional novelty 4.0 of 10

    Frozen imitation policies can be steered at inference time via user interactions, with a diffusion-sampling method and a constraint-enforcing framework that provides formal task guarantees.

Pith tools