Semi-explicit MPC based on subspace clustering
From MaRDI portal
Publication:1679122
DOI10.1016/j.automatica.2017.06.036zbMath1373.93115OpenAlexW2734169062MaRDI QIDQ1679122
Publication date: 8 November 2017
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2017.06.036
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Complexity reduction of explicit MPC based on fuzzy reshaped polyhedrons for use in industrial controllers ⋮ Minimax strategy in approximate model predictive control
Uses Software
Cites Work
- Unnamed Item
- Optimal move blocking strategies for model predictive control
- On the computation of linear model predictive control laws
- Least-restrictive move-blocking model predictive control
- \(k\)-plane clustering
- An algorithm for multi-parametric quadratic programming and explicit MPC solutions
- Constrained model predictive control: Stability and optimality
- An improved design of aggregation-based model predictive control
- Long horizon input parameterisations to enlarge the region of attraction of MPC
- The quickhull algorithm for convex hulls
- Suboptimal model predictive control (feasibility implies stability)
- Approximate explicit constrained linear model predictive control via orthogonal search tree
- Real-Time Suboptimal Model Predictive Control Using a Combination of Explicit MPC and Online Optimization
- A Multiresolution Approximation Method for Fast Explicit Model Predictive Control
- An online active set strategy to overcome the limitations of explicit MPC
- The explicit linear quadratic regulator for constrained systems
This page was built for publication: Semi-explicit MPC based on subspace clustering
