Cost-Matching Model Predictive Control for Efficient Reinforcement Learning in Humanoid Locomotion
Authors: Wenqi Cai, Kyriakos G. Vamvoudakis, Sébastien Gros, Anthony Tzes
Organizations: Electrical Engineering Program, New York University Abu Dhabi (NYUAD), 129188, UAE. · School of Aerospace Engineering, Georgia Institute of Technology, Atlanta, GA 30332, United States. · Department of Engineering Cybernetics, Norwegian University of Science and Technology (NTNU), Trondheim, Norway.
In this paper, we propose a cost-matching approach for optimal humanoid locomotion within a Model Predictive Control (MPC)-based Reinforcement Learning (RL) framework. A parameterized MPC formulation with centroidal dynamics is trained to approximate the action-value function obtained from high-fidelity closed-loop data. Specifically, the MPC cost-to-go is evaluated along recorded state-action trajectories, and the parameters are updated to minimize the discrepancy between MPC-predicted values and measured returns. This formulation enables efficient gradient-based learning while avoiding the computational burden of repeatedly solving the MPC problem during training. The proposed method is validated in simulation using a commercial humanoid platform. Results demonstrate improved locomotion performance and robustness to model mismatch and external disturbances compared with manually tuned baselines.
Figures & tables
Fig. 1 : Cost-Matching MPC-RL framework for humanoids.
Fig. 2 : Closed-loop validation of the value mismatch MSE(QθMPC−Qmeas) across training rounds (shaded region: 10−90 % across seeds). At each training round, 50 trajectories are collected ( 600 steps per trajectory), and the cost-matching objective is optimized using 2000 gradient updates with discount factor γ=0.985 . The inset summarizes the normalized block-wise evolution of θ , illustrating how learning reshapes the MPC objective.
Fig. 3 : Value-matching diagnostics on a fixed evaluation set: density plot of QθMPC versus Qmeas .
Fig. 4 : Simulation snapshots of the humanoid during locomotion under a time-scheduled disturbance benchmark consisting of lateral force pulses fext,y and a yaw-torque pulse mext,z .
Fig. 5 : Representative closed-loop response under the disturbance benchmark. Left: full-horizon signals. Right: zoom around the push interval. The gray bands indicate push windows. The dashed horizontal line indicates the settle threshold computed from pre-disturbance statistics, and the “settled” marker indicates the first time the error remains below this threshold.
Metric
Baseline
CM-MPC
Impr. (%)
Overall Tracking
RMS Error ( ∥e∥2 )
1.022 ± 0.012
1.009 ± 0.016
+1.29
Peak Error ( ∥e∥∞ )
1.620 ± 0.021
1.597 ± 0.045
+1.41
Control Effort & Smoothness
Max Effort ( ∥u∥99% )
472.7 ± 4.3
447.8 ± 7.1
+ 5.26
Max Jitter ( ∥u˙∥99% ) [ 104 ]
5.66 ± 0.00
5.60 ± 0.03
+1.10
TABLE I : Comprehensive Evaluation of Metrics (Mean ± Std) over Six Trials.
In humanoid motion control, model predictive control (MPC) offers physically grounded prediction and constraint handling, while reinforcement learning (RL) enables robust whole-body skills through large-scale simulation. However, using MPC inside RL often requires time-consuming problem construction or excessive training overhead, making such frameworks difficult to justify in practice. This work studies efficient training-time MPC guidance for humanoid locomotion and manipulation, termed MPC-RL. We introduce a centroidal-dynamics MPC reward formulation that leverages guidance from MPC trajectories in training time. To make this practical in massively parallel RL, we develop πnMPC, a parallel-in-horizon and construction-free batched GPU MPC solver that operates directly on time-varying dynamics to avoid high memory usage and pre-compilation. Through a variety of comparative studies and hardware validations, we have found that MPC-RL achieves superior performance in locomotion and manipulation skills. The code base is available at https://github.com/junhengl/mpc-rl.
Junheng Li, Liang Wu, Sergio A. Esteban +3
California Institute of Technology, CA 91106, USA · Johns Hopkins University, MD 21218, USA
We propose a contact-explicit hierarchical architecture coupling Reinforcement Learning (RL) and Model Predictive Control (MPC), where a high-level RL agent provides gait and navigation commands to a low-level locomotion MPC. This offloads the combinatorial burden of contact timing from the MPC by learning acyclic gaits through trial and error in simulation. We show that only a minimal set of rewards and limited tuning are required to obtain effective policies. We validate the architecture in simulation across robotic platforms spanning 50 kg to 120 kg and different MPC implementations, observing the emergence of acyclic gaits and timing adaptations in flat-terrain legged and hybrid locomotion, and further demonstrating extensibility to non-flat terrains. Across all platforms, we achieve zero-shot sim-to-sim transfer without domain randomization, and we further demonstrate zero-shot sim-to-real transfer without domain randomization on Centauro, our 120 kg wheeled-legged humanoid robot. We make our software framework and evaluation results publicly available at https://github.com/AndrePatri/AugMPC.
Andrea Patrizi, Carlo Rizzardo, Arturo Laurenzi +3
All authors are with the Humanoids and Human-Centred Mechatronics (HHCM) lab, Istituto Italiano di Tecnologia (IIT), Via San Quirico 19d, 16163 Genova · Andrea Patrizi is also with the Department of Informatics, Bioengineering, Robotics and Systems Engineering, University of Genova, Via All’Opera Pia 13, 16145 Genova.
Model Predictive Control (MPC) provides a structured and constraint-aware mechanism for decision-making, but its reliance on optimization-friendly analytical dynamics models limits its use in tasks with contacts and other hard-to-model state dependencies. Model-free reinforcement learning avoids explicit modeling assumptions but typically requires large amounts of interaction data. We present a learning-based MPC framework that combines the data efficiency and structure of local model-based planning with learned components that compensate for incomplete dynamics and finite-horizon myopia. The method augments a nominal analytical model with a residual dynamics network that learns missing state-dependent effects from data and combines the resulting planner with a learned action-value critic that injects long-horizon MDP structure into the local iLQR optimization. To make this practical at reinforcement-learning scale, we develop a GPU-accelerated batched iLQR solver that evaluates learned dynamics and critic networks inside the optimal-control loop and solves thousands of trajectory-optimization problems in parallel. The complete system is integrated into a robotics simulator, enabling scalable model-based reinforcement learning under incomplete dynamics. Experiments on biased and incompletely modeled control tasks show that the approach improves closed-loop control performance while preserving the model-based structure needed for efficient constrained trajectory optimization.
Philipp Schoch, Markus Ryll
Autonomous Aerial Systems Lab Technical University of Munich