Generative Models From and For Sampling-Based MPC: A Bootstrapped Approach For Adaptive Contact-Rich Manipulation
Lara Brudermüller, Brandon Hung, Xinghao Zhu, Jiuguang Wang, Nick Hawes, Preston Culbertson, Simon Le Cleac'h
TL;DR
The paper tackles the challenge of real-time, high-dimensional control for contact-rich loco-manipulation with sampling-based MPC by introducing Generative Predictive Control (GPC). GPC bootstraps online SPC with offline-trained conditional flow-matching models that produce a learned proposal distribution $p_\theta(U|\mathbf{x},\mathbf{h})$, which is used to guide or augment the SPC sampling process. This approach enables non-myopic planning with improved sample efficiency and generalization, demonstrated through both simulated tasks and real hardware on a Spot-based loco-manipulation system. Key findings show that GPC-CEM achieves higher success rates under constrained computational budgets, generalizes to task variations, and reduces planning horizons without sacrificing performance, highlighting the practical impact of integrating learned generative priors into online optimization for robotics.
Abstract
We present a generative predictive control (GPC) framework that amortizes sampling-based Model Predictive Control (SPC) by bootstrapping it with conditional flow-matching models trained on SPC control sequences collected in simulation. Unlike prior work relying on iterative refinement or gradient-based solvers, we show that meaningful proposal distributions can be learned directly from noisy SPC data, enabling more efficient and informed sampling during online planning. We further demonstrate, for the first time, the application of this approach to real-world contact-rich loco-manipulation with a quadruped robot. Extensive experiments in simulation and on hardware show that our method improves sample efficiency, reduces planning horizon requirements, and generalizes robustly across task variations.
