Complexity reduction of explicit model predictive control via separation
From MaRDI portal
Publication:522826
DOI10.1016/j.automatica.2013.02.018zbMath1360.93237OpenAlexW1988555782MaRDI QIDQ522826
Ivana Rauová, Miroslav Fikar, Michal Kvasnica, Juraj Hledík
Publication date: 19 April 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2013.02.018
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Dissipativity-constrained learning of MPC with guaranteeing closed-loop stability ⋮ Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings ⋮ Implications of Inverse Parametric Optimization in Model Predictive Control ⋮ Grid k-d tree approach for point location in polyhedral data sets – application to explicit MPC
Uses Software
Cites Work
- Unnamed Item
- Optimal complexity reduction of polyhedral piecewise affine systems
- Analytical expression of explicit MPC solution via lattice piecewise-affine function
- Evaluation of piecewise affine control via binary search tree
- Support-vector networks
- Polytopic Approximation of Explicit Model Predictive Controllers
- Approximate explicit constrained linear model predictive control via orthogonal search tree
- Hybrid Systems: Computation and Control
- Ultra-Fast Stabilizing Model Predictive Control via Canonical Piecewise Affine Approximations
- Clipping-Based Complexity Reduction in Explicit MPC
- The explicit linear quadratic regulator for constrained systems
This page was built for publication: Complexity reduction of explicit model predictive control via separation