Search arXivSearch

arXiv · 2607.25658

Bilinear Koopman-Based Robust Model Predictive Control for Unknown Nonlinear Systems via Contraction Metrics

Abstract

Data-driven model predictive control (MPC) using Koopman operator theory is a promising approach for constrained control of unknown nonlinear systems. While linear Koopman realizations are commonly used due to their simplicity, bilinear Koopman realizations can provide significantly higher approximation accuracy for nonlinear control systems. However, robust MPC (RMPC) formulations that account for modeling errors in bilinear Koopman realizations remain limited. This paper proposes a RMPC framework for unknown nonlinear systems with general nonlinear constraints based on data-driven bilinear Koopman realizations. A central difficulty is that finite-dimensional Koopman predictors need not preserve the manifold of valid lifted states, so multi-step prediction in lifted coordinates may leave the region where one-step error certificates apply. We address this issue by reprojecting each predicted lifted state back onto the manifold, thereby obtaining an error-aware discrete-time control-affine predictor in the original state space without impractical assumptions. For this predictor, we develop a discrete-time robust control contraction metric based homothetic tube construction, and then formulate a tube-based RMPC problem with terminal ingredients. Under the proposed formulation, we prove robust satisfaction of the original nonlinear constraints by the true closed-loop trajectory, recursive feasibility, and convergence to a neighborhood of the target state. Numerical experiments demonstrate robust stabilization of nonlinear systems and the advantages of the proposed method over existing Koopman-based RMPC approaches in terms of performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuki Higuchi, Kazuhiro Sato. 2026-07-28. Bilinear Koopman-Based Robust Model Predictive Control for Unknown Nonlinear Systems via Contraction Metrics. https://arxiv.org/abs/2607.25658

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

KEEP EXPLORING

Related papers

AdGT: Decentralized Gradient Tracking with Adaptive Per-Agent Stepsizes

In decentralized optimization, gradient-tracking methods typically rely on a single global stepsize. This choice can be conservative when agents have local objectives with different smoothness constants, since the stepsize must remain stable for the agent with the largest smoothness constant. This paper proposes AdGT, a decentralized gradient-tracking method in which each agent adapts its own stepsize using local gradient variation and a single global safety factor. The method reduces fixed-stepsize tuning effort and allows agents to exploit local smoothness information during the iterations. For smooth and strongly convex local objectives over undirected networks, we prove that the analyzed AdGT update converges linearly to the exact consensus optimizer. We also study two adaptive stepsize updates that use changes in the gradient-tracking direction. We characterize when the corresponding candidate determines the stepsize and prove conditional lower and upper stepsize bounds and linear convergence under an additional relative tracking-disagreement condition. Experiments on logistic regression, ridge regression, synthetic quadratic problems, and a linear-regression benchmark against state-of-the-art decentralized solvers show that AdGT often reaches a given accuracy in fewer iterations or gradient evaluations than tuned fixed-stepsize GT and the tested baselines, especially under heterogeneous local smoothness. In the topology experiments, each tested AdGT update uses one common safety factor across all graphs, whereas the fixed GT stepsize is tuned separately for each graph and seed.

math.OC

Brockett cost function for symplectic eigenvalues

The sum of symplectic eigenvalues and corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem can be computed via minimization of a trace cost function under the symplecticity constraint. Optimal solutions to this problem only offer a symplectic basis for the symplectic eigenspace corresponding to the sought symplectic eigenvalues. In this note, we introduce a Brockett cost function and investigate its properties and the connection with the symplectic eigenvalues and eigenvectors of the considered matrix. Specifically, we prove that any stationary point consists of symplectic eigenvectors, characterize the saddle points and global minimizers based on which the trace minimization theorem for the symplectic eigenvalues is re-established, and the nonexistence of local nonglobal minimizers is justified.

math.OC

Riemannian Bilevel Optimization with Gradient Aggregation

We study bilevel optimization on Riemannian manifolds when the lower-level solution set is a positive-dimensional submanifold, so that implicit differentiation fails. We propose Riemannian Bilevel Descent Aggregation (RBDA), which extends bilevel descent aggregation to manifolds. Its inner loop aggregates the lower-level descent direction with the upper-level gradient under a decaying multiplier, and its hypergradient is the reverse-mode derivative of the unrolled loop. Under geodesic convexity and quadratic growth of the lower level, the inner iterates converge to a point of the optimistic solution set at a polynomial rate. Approximate minimizers of the objective with a finite number of inner iterations converge to minimizers of the optimistic value. In the experiments RBDA selects the optimistic solution where the implicit and unrolled estimators remain at the initial point or stop at a larger query loss. While each of its outer steps costs more than that of the unrolled estimator, it attains the highest test accuracy in data hyper-cleaning.

math.OC