Metraipolis › archive › dc_ffa0f7fa6114
On the suboptimality of stochastic MPC with varying constraint horizon — arXiv:2608.30017
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30017
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T09:02:54.141Z
- SHA-256 of the archived text
061eff3e443e59fcb9432dbcb9ee23790fc773f3b3fca93b44e9245fae25dbcf- Stable URL of this page
https://metraipolis.com/documento/dc_ffa0f7fa6114
How to cite
On the suboptimality of stochastic MPC with varying constraint horizon — arXiv:2608.30017 — arXiv (en), https://arxiv.org/abs/2608.30017 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ffa0f7fa6114 (Metraipolis archive dc_ffa0f7fa6114, sha256 061eff3e443e59fcb9432dbcb9ee23790fc773f3b3fca93b44e9245fae25dbcf)
BibTeX
@misc{dcffa0f7fa6114,
title = {On the suboptimality of stochastic MPC with varying constraint horizon — arXiv:2608.30017},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30017},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ffa0f7fa6114; sha256 061eff3e443e59fcb9432dbcb9ee23790fc773f3b3fca93b44e9245fae25dbcf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30017. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Enforcing stochastic state constraints over the full prediction horizon in Model Predictive Control (MPC) can be computationally demanding. Here we study stochastic MPC without terminal ingredients in which chance constraints are enforced only over a shorter constraint horizon. Using stochastic relaxed dynamic programming, we derive an explicit upper bound on the average expected closed-loop cost that depends on both prediction and constraint horizons. For linear quadratic problems with affine chance constraints and bounded uniform disturbances, we provide a deterministic reformulation via coordinate transformation and constraint tightening. Simulations illustrate the trade-off between computational effort and performance. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in math.OC). Categorie arXiv: Optimization and Control (math.OC) ; Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2608.30017 — 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-17T08:40:19.751Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).