Sampling-based model predictive control (MPC) is a powerful approach to trajectory optimization, but its performance depends on an informative cost function that often requires substantial domain knowledge to design. An alternative is to derive objectives directly from the system dynamics. Empowerment, defined as the channel capacity between an agent's inputs and its future state, provides such a goal-agnostic objective and has been shown to produce useful behaviors across a range of domains. However, existing empowerment-based controllers have two key limitations: empowerment is estimated using a virtual probing policy distinct from the executed control policy, obscuring its connection to the resulting behavior; and its computation typically requires second-order derivatives of the dynamics, limiting compatibility with standard MPC methods. We formulate empowerment using a single policy for both probing and acting, directly linking the empowerment objective to the executed behavior. The resulting objective requires only first-order derivatives and can be optimized with standard MPC solvers, either alone or in combination with a task-specific cost. We evaluate the proposed approach on classical control tasks and show that combining empowerment with task costs matches or exceeds the success rate achieved by either objective alone. Our formulation provides a practical bridge between standard MPC and intrinsically motivated control.
Figures & tables
Fig. 1 : Goal-agnostic self-recovery using MPC-based empowerment. (a) The proposed MPC-based empowerment controller recovers from a fallen configuration and stabilizes the hopper without a task-specific recovery objective. (b) The corresponding empowerment values remain stable under MPC-based empowerment, while standard empowerment, which relies on second-order derivatives for control, exhibits large oscillations and fails to stabilize the system.
Task
Random Shooting
Predictive Sampling
CEM
MPPI
Empowerment
Combined
Empowerment
Combined
Empowerment
Combined
Empowerment
Combined
Single Pendulum
50%
95%
49%
78%
59%
100%
23%
93%
Cart Pole
22%
79%
81%
100%
76%
99%
24%
60%
Double Pendulum
0%
0%
0%
86%
3%
46%
0%
0%
TABLE I : Success rate comparison between trajectory optimization guided strictly by task-agnostic empowerment ( Empowerment ) versus combined optimization with empowerment and the sparse task cost ( Combined,β=0.0001 ) across the single pendulum, cart-pole, and double pendulum environments. All systems are initialized in the inverted (downward) equilibrium position. The success rate is defined as the temporal average of the indicator cost in Equation ( 12 ) evaluated after the initial swing-up transient phase, with statistics computed over 10 independent random seeds. A higher success rate reflects increased residence time within the target tolerance region around the upright equilibrium. When optimizing strictly under the sparse task cost ( β=0 ), all sampling algorithms fail to solve the tasks due to the low probability of sampling a swing-up trajectory that hits the target set. Notably, the combined cost formulation consistently outperforms empowerment alone across all environments.
Fig. 2 : Success rate on cart pole during online MPC interaction with the CEM algorithm. Mean and standard error are reported over 10 random seeds. Success rate is determined by the agent’s ability to stay within a π±τ (rad) cone in the upright position. Guided strictly by the sparse task cost ( β=0 ), the controller fails to execute the swing-up maneuver. This is the typical behavior we observed in our experiments across all environments.
Sampling-based model predictive control methods like MPPI and CEM are essential for real-time control of nonlinear robotic systems, particularly where discontinuous dynamics preclude gradient-based optimization. However, these methods derive from information-theoretic objectives that are agnostic to the geometry of the control problem, leading to pathological behaviors such as mode-averaging when the cost landscape is complex. We present OT-MPC, a sampling-based algorithm that overcomes these limitations through an entropy-regularized optimal transport formulation. By computing an optimal coupling between candidate control sequences and low-cost proposals, OT-MPC refines candidates toward nearby promising samples while coordinating updates across the ensemble to maintain coverage of the solution space. We derive closed-form, gradient-free updates via the Sinkhorn algorithm, enabling real-time performance. Experiments on navigation, manipulation, and locomotion tasks demonstrate improved success rates over existing methods.
Vincent Pacelli, Akash Ratheesh, Evangelos A. Theodorou
Autonomous Control and Decision Systems Laboratory Georgia Institute of Technology
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
In many practical reinforcement learning environments, observations are far higher-dimensional than the variables that matter for control. In this work, we ask: can we learn representations that capture only control-relevant features of the environment? We study this question through the empowerment objective, which maximizes an agent's influence over the environment and is widely used for unsupervised skill learning. We show that empowerment agents induce two distinct representations -- forward and backward -- that capture complementary aspects of the state, and both of which are invariant to control-irrelevant features. Thus, empowerment maximization leads agents to learn an implicit, control-centric model of the world. Our analysis highlights the importance of learning representations through interaction rather than from passive datasets: interaction aimed at maximizing control is essential for learning useful invariance properties, a perspective that aligns closely with the causal learning literature.
Mahsa Bastankhah, Sophie Broderick, Benjamin Eysenbach