Searcharxiv⌕ Search

arXiv · 2609.34844

Contraction-Based Model Predictive Control using Bilinear Koopman Realizations with Proportional Error Bounds

Abstract

Data-driven model predictive control based on Koopman operator theory is a promising approach for constrained control of nonlinear systems with unknown dynamics. This paper proposes a robust model predictive control framework for such systems using bilinear Koopman realizations with state- and input-dependent proportional approximation-error bounds that vanish at the target equilibrium. Since prediction in lifted coordinates with a finite-dimensional Koopman realization need not remain on the manifold of valid lifted states, multi-step prediction may leave the region where one-step error certificates apply. We avoid this difficulty by reprojecting each predicted lifted state onto the original state coordinates and lifting it again, yielding an error-aware discrete-time control-affine predictor in the original state space without assuming invariance of the Koopman dictionary. For this predictor, we develop a homothetic tube construction based on a discrete-time robust control contraction metric whose radius explicitly accounts for the proportional approximation error bounds. The tube tightening handles arbitrary continuously differentiable nonlinear constraints, and the resulting model predictive control problem includes terminal ingredients and a tube-radius penalty that exploits the vanishing uncertainty near the target. We prove robust satisfaction of the original nonlinear constraints, recursive feasibility, and exponential stability of the sampled true closed-loop system with high probability over the training data without requiring a globally optimal solution to the model predictive control problem. Numerical examples, including nonlinear obstacle-avoidance constraints, demonstrate robust stabilization and higher performance of the proposed approach compared to existing Koopman-based model predictive control methods in terms of smaller closed-loop cost and flexibility.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuki Higuchi, Kazuhiro Sato. 2026-09-28. Contraction-Based Model Predictive Control using Bilinear Koopman Realizations with Proportional Error Bounds. https://arxiv.org/abs/2609.34844

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

KEEP EXPLORING

Related papers

Verifiable constraint qualifications for infinite-dimensional optimization problems and their applications to optimal control problems

This paper employs a finite codimensionality condition to establish an enhanced Fritz John condition for general constrained nonlinear infinite-dimensional optimization problems. In applications, this approach provides a new, unified framework for deriving first-order necessary conditions across a broad class of optimal control problems involving both deterministic and stochastic systems. Compared to existing constraint qualifications, our finite codimensionality condition, which is equivalent to the validity of certain \textit{a priori} estimates, yields a direct and analytically tractable verification method for each application. Furthermore, the core ideas of this method can be further extended to investigate the KKT conditions for infinite-dimensional optimization problems.

math.OC↗

Arrival-Intensity Control for A Single-Server Queue in Heavy Traffic

We study a single-server queue control problem (QCP) in a heavy-traffic regime, extending the framework from Lee and Weerasinghe (2011). The state process represents the offered waiting time. Service times and patience times form independent i.i.d. sequences with general distributions. We formulate an infinite-horizon discounted QCP that balances the cost of controlling the arrival intensity against a penalty for server idleness. A distinctive feature of the formulation is the nonstandard decreasing operational running cost arising from the arrival-intensity control mechanism. Under suitable heavy-traffic assumptions, the diffusion-scaled offered waiting-time process converges to a regulated diffusion, leading to an associated diffusion control problem (DCP). We find the optimal control of the associated DCP by incorporating the Legendre-Fenchel transform and a formal Hamilton-Jacobi-Bellman (HJB) equation. We then construct a sequence of intensity controls for the prelimit queueing systems from the DCP-optimal feedback and establish its asymptotic optimality within the specified heavy-traffic admissible control class. Beyond theoretical analysis, numerical experiments further examine whether reinforcement learning can approximate the optimal policy with discounted costs close to the HJB reference. Policies are trained from simulated state transitions and realized costs, and are evaluated against the independently computed HJB feedback.

math.OC↗

Information-Theoretic Upper Bounds for Deterministic Noise in Zeroth-Order Convex Optimization

We study zeroth-order convex optimization on Euclidean balls with function values corrupted by a fixed, uniformly bounded deterministic perturbation. For a query budget $T$, the maximum admissible level of noise (MALN) is the supremum of noise levels for which an $\eps$-accurate solution can be found with probability $1-β$. We construct an explicit hard family: the support function of a spherical belt combined with an affine branch along a hidden random direction. It yields finite-budget upper bounds on the MALN for Lipschitz, strongly convex, uniformly convex, smooth, Hölder, and smooth strongly convex classes. For Lipschitz objectives the bound has order $\eps^2\sqrt\ell/(\sqrt nMR)+\eps\ell/n$, where $\ell=\log(2(T+1)/(1-β))$ and $n-1\ge32\ell$; this is the scale of Li and Risteski with explicit logarithmic factors. A tangential-gradient estimate for the Moreau envelope yields the smooth scale $\eps^{3/2}/(\sqrt n\sqrt L\,R)$ and, for $L-μ\ge5μ$, the smooth strongly convex scale $\eps\sqrt{μ/((L-μ)n)}$. These bounds are tight: on explicit parameter ranges and subclasses, polynomial-query two-point methods tolerate noise of the order of the terms of order $n^{-1/2}$, so that the MALN is determined up to $O(\sqrt\ell)$ and absolute constants whenever these terms dominate. At $L=μ$, simplex interpolation with $n+1$ queries tolerates noise $R\sqrt{2μ\eps/n}$, which is optimal up to $O(\sqrt\ell)$ for $\eps\leμR^2/3$, while with at most $n$ exact queries no randomized algorithm guarantees success probability greater than $1/2$ uniformly over the class. We also quantify noise tolerance near this endpoint and illustrate the hiding mechanism and the breakdown of a two-point method numerically.

math.OC↗