Computationally efficient stochastic MPC: a probabilistic scaling approach
Martina Mammarella, Teodoro Alamo, Fabrizio Dabbene, Matthias, Lorenzen

TL;DR
This paper introduces a probabilistic scaling method to create low-complexity inner approximations of chance-constrained sets in stochastic MPC, significantly reducing computational costs while maintaining probabilistic guarantees.
Contribution
It extends the probabilistic scaling approach to develop computationally efficient inner approximations for chance-constrained sets in SMPC, using fixed-complexity polytopes and $_p$-norm based sets.
Findings
The proposed method reduces computational complexity compared to scenario-based approaches.
Simulations demonstrate effective control of a UAV with lower computational demands.
Probabilistic guarantees are maintained despite the approximation.
Abstract
In recent years, the increasing interest in Stochastic model predictive control (SMPC) schemes has highlighted the limitation arising from their inherent computational demand, which has restricted their applicability to slow-dynamics and high-performing systems. To reduce the computational burden, in this paper we extend the probabilistic scaling approach to obtain low-complexity inner approximation of chance-constrained sets. This approach provides probabilistic guarantees at a lower computational cost than other schemes for which the sample complexity depends on the design space dimension. To design candidate simple approximating sets, which approximate the shape of the probabilistic set, we introduce two possibilities: i) fixed-complexity polytopes, and ii) -norm based sets. Once the candidate approximating set is obtained, it is scaled around its center so to enforce the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
