Complexity reduction in explicit MPC: a reachability approach
From MaRDI portal
Publication:1729125
DOI10.1016/j.sysconle.2018.12.002zbMath1408.93020OpenAlexW2905907802WikidataQ128712193 ScholiaQ128712193MaRDI QIDQ1729125
Michal Kvasnica, Peter Bakaráč, Martin Klaučo
Publication date: 27 February 2019
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2018.12.002
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- On the necessity of the invariance conditions for reach control on polytopes
- Robust variable horizon MPC with move blocking
- Explicit model predictive control: a connected-graph approach
- A novel approach to multiparametric quadratic programming
- Control of systems integrating logic, dynamics, and constraints
- Constrained optimal control of linear and hybrid systems
- Explicit solution of min--max MPC with additive uncertainties and quadratic criterion
- Predictive Control for Linear and Hybrid Systems
- A Survey on Explicit Model Predictive Control
- Polytopic Approximation of Explicit Model Predictive Controllers
- Clipping-Based Complexity Reduction in Explicit MPC
- Model Predictive Control approach for guidance of spacecraft rendezvous and proximity maneuvering
- The explicit linear quadratic regulator for constrained systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complexity reduction in explicit MPC: a reachability approach
