Real-Time Algorithms for Model Predictive Control of Hybrid Dynamical Systems

Armin Nurkanović; Anton Pozharskiy; Moritz Diehl

Home/Archive/arXiv

arXiv · 2604.18432

Real-Time Algorithms for Model Predictive Control of Hybrid Dynamical Systems

Armin Nurkanović·Anton Pozharskiy·Moritz Diehl

View original source ↗Read source document ↗Export metadata ↓

Abstract

Model predictive control (MPC) of hybrid dynamical systems is challenging because the associated optimization problem is nonsmooth and the resulting feedback law is discontinuous. This paper develops real-time MPC algorithms for nonlinear hybrid systems modeled as dynamical complementarity systems. The resulting optimal control problems are formulated as mathematical programs with complementarity constraints (MPCCs). We show that the solution map of parametric MPCCs is discontinuous, and that standard nonlinear-programming-based approaches may become infeasible when the hybrid system switches. To address this, we introduce three real-time hybrid MPC schemes whose feedback phase solves a quadratic program with complementarity constraints per sample, yielding local discontinuous piecewise affine approximations of the MPC feedback law. Moreover, we derive continuity and differentiability results for parametric MPCCs, and establish conditions under which the approximation error of our new hybrid MPC algorithms remains uniformly bounded despite solution discontinuities. The algorithms are demonstrated on a robotic manipulation example, where contact sequences are discovered online.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Armin Nurkanović, Anton Pozharskiy, Moritz Diehl. 2026-04-20. Real-Time Algorithms for Model Predictive Control of Hybrid Dynamical Systems. https://arxiv.org/abs/2604.18432

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Last-Iterate Performance of Gradient Descent and Relaxed Proximal Point via $s$-Composability

The notion of s-composability was introduced to compose optimized stepsize schedules while preserving sharp guarantees. We show that the same joint potential has a second use: it can serve directly as a certificate of sharp last-iterate performance. We develop this viewpoint for constant and silver schedules. For the constant schedule, we prove the s-composability statement posed as an open question by Grimmer et al. (2025), at every finite horizon, through an explicit nonnegative smooth-convex interpolation certificate. The result identifies the unique constant stepsize minimizing the worst-case final gradient norm of smooth convex gradient descent under an initial-distance bound, thereby proving the optimal stepsize, value, and uniqueness predicted by Conjecture 3 of Taylor et al. (2017) without resolving its full worst-case curve. Through the Moreau envelope, the same constant is also the unique constant relaxation minimizing the worst-case final residual of relaxed proximal point. More generally, for every positive s-composable schedule, we determine the exact worst-case final proximal objective-gap constant and give a matching one-dimensional example. Applying this result to the already s-composable original silver schedule yields its exact last-iterate objective-gap constant, closing a question left open by Wang et al. (2025).

math.OC↗

arXiv2026

Complexity of Output Feedback Stabilization

We show that unless P = NP, there cannot be a polynomial-time (or even pseudo-polynomial-time) algorithm for output feedback stabilization of a linear dynamical system with a linear controller. This settles one of the best-known open problems in control theory. The result holds in both continuous and discrete time. We also present a family of stabilizable linear dynamical systems for which no polynomial-time algorithm can write down a stabilizing controller in its standard representation.

math.OC↗

arXiv2026

On Control of Drawdown: Robust Invariance and Optimality

Mitigating \emph{drawdown}, the decline in wealth from its running peak, presents a canonical problem in path-dependent risk control. In this paper, we develop a finite-horizon control framework that enforces a prescribed maximum percentage drawdown limit in multi-asset stochastic systems. Our first result is an exact robust-invariance theorem characterizing every control action that preserves a prescribed drawdown limit against all supported returns. We show that every robustly safe control admits a \emph{drawdown-modulated} form: the product of the current drawdown \emph{cushion} and a feasible \emph{normalized direction}. This yields a complete parameterization of robustly drawdown-safe policies. Additionally, under stagewise-independent returns, we show that optimizing over all robustly safe causal policies reduces to a one-dimensional Bellman recursion and yields an optimal robustly safe state-feedback policy. Finally, we characterize the linear time-invariant (LTI) gains satisfying a prescribed drawdown limit and prove that optimal drawdown modulation achieves no lower expected return under the same limit. Strict expected-return improvement holds for horizons of at least two stages whenever the LTI policy has positive expected one-stage net return.

math.OC↗