Clipping-Based Complexity Reduction in Explicit MPC

DOI10.1109/TAC.2011.2179428MaRDI QIDQ5352897zbMATH OpenOpenAlexFDO

Authors Michal Kvasnica, Miroslav Fikar

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)

Cited in

(13)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5352897)