Pith. sign in

REVIEW 18 cited by

Deep Generative Models in Robotics: A Survey on Learning from Multimodal Demonstrations

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 2408.04380 v3 pith:7ECBK2BA submitted 2024-08-08 cs.RO cs.LG

classification cs.ROcs.LG
keywords modelsgenerativelearningdeepcommunitydemonstrationsdifferentrobotics
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Learning from Demonstrations, the field that proposes to learn robot behavior models from data, is gaining popularity with the emergence of deep generative models. Although the problem has been studied for years under names such as Imitation Learning, Behavioral Cloning, or Inverse Reinforcement Learning, classical methods have relied on models that don't capture complex data distributions well or don't scale well to large numbers of demonstrations. In recent years, the robot learning community has shown increasing interest in using deep generative models to capture the complexity of large datasets. In this survey, we aim to provide a unified and comprehensive review of the last year's progress in the use of deep generative models in robotics. We present the different types of models that the community has explored, such as energy-based models, diffusion models, action value maps, or generative adversarial networks. We also present the different types of applications in which deep generative models have been used, from grasp generation to trajectory generation or cost learning. One of the most important elements of generative models is the generalization out of distributions. In our survey, we review the different decisions the community has made to improve the generalization of the learned models. Finally, we highlight the research challenges and propose a number of future directions for learning deep generative models in robotics.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 18 Pith papers

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

  1. Optimal Transport Q-Learning for Flow Policy Steering and Acceleration

    cs.RO 2026-07 conditional novelty 6.0 of 10

    Advantage-weighted conditional optimal transport flow matching simultaneously steers flow policies toward high-value actions and straightens their integration paths, enabling 2-3 step inference while improving task success.

  2. EVE: A Generator-Verifier System for Generative Policies

    cs.RO 2025-12 conditional novelty 6.0 of 10

    Zero-shot VLM verifiers, ensembled and fused via guided diffusion, improve frozen generative robot policies' success rates by 1-2 percentage points on simulated manipulation tasks.

  3. Learning Semantic Atomic Skills for Multi-Task Robotic Manipulation

    cs.RO 2025-12 conditional novelty 6.0 of 10

    An imitation-learning system that segments demonstrations into VLM-labeled atomic skills, aligns them with contrastive learning, and uses keypose prediction to chain skills, outperforming prior baselines in multi-task...

  4. FlowRAM: Grounding Flow Matching Policy with Region-Aware Mamba Framework for Robotic Manipulation

    cs.RO 2025-06 conditional novelty 6.0 of 10

    FlowRAM pairs a shrinking 3D attention region with flow-matching action generation and a Mamba fusion model, setting new RLBench state-of-the-art results.

  5. Fast Flow-based Visuomotor Policies via Conditional Optimal Transport Couplings

    cs.RO 2025-05 conditional novelty 6.0 of 10

    COT Policy, a flow-matching visuomotor policy that couples noise to action samples using observation-aware optimal transport, generates effective actions in 1 to 2 integration steps, outperforming CFM, OT-CFM, and Dif...

  6. TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching

    cs.RO 2025-05 conditional novelty 6.0 of 10

    A GNN-encoded flow matching model learns to generate STL-satisfying trajectories across five robot simulation domains, with a 200K-specification dataset, reporting best-of-1024 satisfaction rates.

  7. STDArm: Transferring Visuomotor Policies From Static Data Training to Dynamic Robot Manipulation

    cs.RO 2025-04 conditional novelty 6.0 of 10

    A real-time action correction system, STDArm, transfers visuomotor policies trained on static data to moving platforms, recovering 40 to 93 percent of static success rates in three manipulation tasks without retrainin...

  8. VILP: Imitation Learning with Latent Video Planning

    cs.RO 2025-02 conditional novelty 6.0 of 10

    VILP generates multi-view future videos in a compressed latent space and converts them into robot actions with a lightweight policy, achieving real-time receding horizon control on tested manipulation tasks.

  9. Fast and Robust Visuomotor Riemannian Flow Matching Policy

    cs.RO 2024-12 conditional novelty 6.0 of 10

    A stable Riemannian flow matching policy (SRFMP) that converges to the target action distribution on manifolds, evaluated on ten robotic tasks against diffusion and consistency baselines.

  10. Diffusion Predictive Control with Constraints

    cs.RO 2024-12 conditional novelty 6.0 of 10

    A diffusion policy can satisfy novel state and action constraints by projecting each denoising step onto a dynamics-constrained feasible set and tightening those constraints to account for model mismatch.

  11. 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.

  12. Modulating Reservoir Dynamics via Reinforcement Learning for Efficient Robot Skill Synthesis

    cs.RO 2024-11 conditional novelty 6.0 of 10

    DARC adds a reinforcement learning policy that modulates the context input of a fixed reservoir network, enabling a simulated robot arm to reach out-of-distribution targets and track a circle without retraining the reservoir.

  13. From Words to Workflows: Automating Business Processes

    cs.AI 2024-12 conditional novelty 5.0 of 10

    Text2Workflow is a multi-prompt LLM system with human feedback that generates JSON workflows from natural language, scoring 71.3% average semantic accuracy on the authors' 60-request Process2JSON dataset, versus 64.2%...

  14. 3D-CovDiffusion: 3D-Aware Diffusion Policy for Coverage Path Planning

    cs.RO 2025-10 reject novelty 4.0 of 10

    A diffusion policy generates ordered spray-painting trajectories from point clouds, but its claimed coverage advantage reverses against the paper's own strongest baseline on three of four categories.

  15. Rapid and Safe Trajectory Planning over Diverse Scenes through Diffusion Composition

    cs.RO 2025-07 conditional novelty 4.0 of 10

    Diffusion models trained separately on static and dynamic scenes can be composed at test time to plan collision-free, kinematically feasible trajectories in unseen scenes, with real-time performance on an F1TENTH vehicle.

  16. 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.

  17. A Survey on Imitation Learning for Contact-Rich Tasks in Robotics

    cs.RO 2025-06 conditional novelty 4.0 of 10

    A survey that organizes imitation learning research for contact-rich robot tasks into teaching, learning, sensing, and application categories, and maps current challenges and future directions.

  18. Toward Near-Globally Optimal Nonlinear Model Predictive Control via Diffusion Models

    eess.SY 2024-12 conditional novelty 4.0 of 10

    A diffusion model over locally optimal control sequences with sample-and-rank selection gives near-globally optimal NMPC costs on swing-up benchmarks at lower online cost.

Pith tools