Clipping-Based Complexity Reduction in Explicit MPC

DOI10.1109/TAC.2011.2179428zbMath1369.93344OpenAlexW1984740071MaRDI QIDQ5352897

Miroslav Fikar, Michal Kvasnica

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2011.2179428

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55)

Related Items (13)

Robust explicit model predictive control via regular piecewise-affine approximation ⋮ Dealing with infeasibility in multi-parametric programming for application to explicit model predictive control ⋮ Complexity reduction of explicit MPC based on fuzzy reshaped polyhedrons for use in industrial controllers ⋮ Robust region elimination for piecewise affine control laws ⋮ Robust tube-based MPC with piecewise affine control laws ⋮ Complexity reduction in explicit MPC: a reachability approach ⋮ Complexity reduction of explicit model predictive control via separation ⋮ Nearly optimal simple explicit MPC controllers with stability and feasibility guarantees ⋮ Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings ⋮ Implications of Inverse Parametric Optimization in Model Predictive Control ⋮ Large scale model predictive control with neural networks and primal active sets ⋮ Convex-lifting-based robust control design using the tunable robust invariant sets ⋮ Design of reduced complexity controllers for linear systems under constraints using data cluster analysis

This page was built for publication: Clipping-Based Complexity Reduction in Explicit MPC