Metraipolis › archive › dc_0dfded2a314b
Iterative State- and Control-Dependent Model Predictive Control: A Jacobian-Free Formulation for Constrained Nonlinear Systems — arXiv:2608.15322
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.15322
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T20:16:34.369Z
- SHA-256 of the archived text
718d4be71124747fd9444b6d108c541665a1800efddfc12703b71da140eb1b29- Stable URL of this page
https://metraipolis.com/documento/dc_0dfded2a314b
How to cite
Iterative State- and Control-Dependent Model Predictive Control: A Jacobian-Free Formulation for Constrained Nonlinear Systems — arXiv:2608.15322 — arXiv (en), https://arxiv.org/abs/2608.15322 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0dfded2a314b (Metraipolis archive dc_0dfded2a314b, sha256 718d4be71124747fd9444b6d108c541665a1800efddfc12703b71da140eb1b29)
BibTeX
@misc{dc0dfded2a314b,
title = {Iterative State- and Control-Dependent Model Predictive Control: A Jacobian-Free Formulation for Constrained Nonlinear Systems — arXiv:2608.15322},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.15322},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0dfded2a314b; sha256 718d4be71124747fd9444b6d108c541665a1800efddfc12703b71da140eb1b29},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15322. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper presents an iterative model predictive control algorithm that stabilizes constrained nonlinear systems without evaluating a single plant derivative. By factoring the exact nonlinear dynamics into a pseudo-linear form using state- and control-dependent coefficients (SCDCs), we replace the standard nonconvex optimization with a sequence of constrained linear-quadratic programs. Refreezing the coefficient matrices along the previously predicted trajectory drives the iteration. Near the origin, we prove this sequence contracts to a unique fixed point. We explicitly bound the number of iterations required to reach any stopping tolerance, and we quantify the distance from the fixed point to a true Karush-Kuhn-Tucker point, showing this optimality gap vanishes quadratically as the state approaches the origin. Inflating the discrete algebraic Riccati equation generates terminal ingredients that guarantee recursive feasibility and asymptotic stability, even when the solver terminates early. We adapt the terminal penalty online, proving it remains uniformly bounded, and we secure output feedback through the block-observable canonical form, which extracts the exact system state directly from past inputs and outputs. Retaining the block-banded structure of the subproblem forces the computational cost to scale linearly with the horizon length $\ell$. This $O(\ell)$ complexity matches the iterative linear quadratic regulator (iLQR) but sharply undercuts the $O(\ell^3)$ scaling of dense sequential quadratic programming (SQP). Numerical studies on a saturated quadrotor, a nonholonomic integrator, and a nonminimum-phase plant illustrate the theoretical bounds and map how the algorithm compares with iLQR, SQP, and linear-parameter-varying MPC. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in math.OC). Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2608.15322 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T19:45:07.842Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).