Pith. sign in

REVIEW 10 cited by

FlowPolicy: Enabling Fast and Robust 3D Flow-based Policy via Consistency Flow Matching for Robot Manipulation

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 2412.04987 v2 pith:HDGH2BZ6 submitted 2024-12-06 cs.RO

FlowPolicy: Enabling Fast and Robust 3D Flow-based Policy via Consistency Flow Matching for Robot Manipulation

classification cs.RO
keywords flowflowpolicyinferencematchingconsistencymanipulationpoliciespolicy
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Robots can acquire complex manipulation skills by learning policies from expert demonstrations, which is often known as vision-based imitation learning. Generating policies based on diffusion and flow matching models has been shown to be effective, particularly in robotic manipulation tasks. However, recursion-based approaches are inference inefficient in working from noise distributions to policy distributions, posing a challenging trade-off between efficiency and quality. This motivates us to propose FlowPolicy, a novel framework for fast policy generation based on consistency flow matching and 3D vision. Our approach refines the flow dynamics by normalizing the self-consistency of the velocity field, enabling the model to derive task execution policies in a single inference step. Specifically, FlowPolicy conditions on the observed 3D point cloud, where consistency flow matching directly defines straight-line flows from different time states to the same action space, while simultaneously constraining their velocity values, that is, we approximate the trajectories from noise to robot actions by normalizing the self-consistency of the velocity field within the action space, thus improving the inference efficiency. We validate the effectiveness of FlowPolicy in Adroit and Metaworld, demonstrating a 7$\times$ increase in inference speed while maintaining competitive average success rates compared to state-of-the-art methods. Code is available at https://github.com/zql-kk/FlowPolicy.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 10 Pith papers

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

  1. Test-time Adversarial Takeover: A Real-time Hijacking Interface against Robotic Diffusion Policies

    cs.RO 2026-06 unverdicted novelty 8.0

    TAKO demonstrates real-time adversarial takeover of robotic diffusion policies via reusable universal patches on visual inputs, achieving 100% success in steering attacker-chosen trajectories across multiple tasks, en...

  2. Genuine pair density wave order on the kagome lattice

    cond-mat.supr-con 2026-04 unverdicted novelty 7.0

    A genuine primary pair-density-wave phase emerges as a competing ground state in a two-orbital kagome Hubbard model over a wide parameter range, driven by sublattice- and orbital-polarized Fermi pockets.

  3. $\pi\mathbf{R}^2$: Reactive Real-time Flow Policies

    cs.RO 2026-07 conditional novelty 6.0

    πR² makes flow-matching VLA policies reactive by splitting conditioning into fresh proprioception and stale vision-language features and using a one-step-per-call staircase noise schedule, reaching ~25 Hz closed-loop ...

  4. Chronos: A Physics-Informed Full-History Framework for Non-Markovian Long-Horizon Manipulation

    cs.RO 2026-06 unverdicted novelty 6.0

    Chronos elevates full observation history to the policy's latent state via selective SSM tokens and a Schrödinger-inspired acceleration bridge, achieving large gains on memory-dependent robot tasks with fewer parameters.

  5. Implicit Drifting Policy: One-Step Action Generation via Conditional Expert Geometry

    cs.RO 2026-05 unverdicted novelty 6.0

    IDP generates one-step robot actions by adaptively weighting a scalar potential objective using conditional expert geometry derived from local variations of observation-similar expert actions, combined with expert-pro...

  6. SID: Sliding into Distribution for Robust Few-Demonstration Manipulation

    cs.RO 2026-05 unverdicted novelty 6.0

    SID achieves approximately 90% success on six real-world manipulation tasks with only two demonstrations under out-of-distribution initializations, with less than 10% performance drop under distractors and disturbances.

  7. SeedPolicy: Horizon Scaling via Self-Evolving Diffusion Policy for Robot Manipulation

    cs.RO 2026-03 conditional novelty 6.0

    Adding a recurrent, gated cross-attention memory to Diffusion Policy improves long-horizon robot manipulation success by keeping a compact evolving state instead of stacking more observation frames.

  8. SeedPolicy: Horizon Scaling via Self-Evolving Diffusion Policy for Robot Manipulation

    cs.RO 2026-03 conditional novelty 6.0

    SeedPolicy introduces self-evolving gated attention to extend the temporal horizon of diffusion policies, yielding 36.8% and 169% relative gains over standard DP on clean and randomized RoboTwin 2.0 tasks.

  9. AsyncVLA: Asynchronous Flow Matching for Vision-Language-Action Models

    cs.RO 2025-11 unverdicted novelty 6.0

    AsyncVLA adds asynchronous flow matching and a confidence rater to VLA models so they can generate actions on flexible schedules and selectively refine low-confidence tokens before execution.

  10. NavCMPO: Critic-Guided MeanFlow Policy Optimization for Adaptive Navigation

    cs.RO 2026-07 conditional novelty 5.0

    A two-stage navigation policy using five-step MeanFlow generation, critic-guided trajectory refinement, and PPO fine-tuning reports higher success and lower latency than a matched NavDP baseline.