Efficient active set optimization in triple mode MPC
DOI10.1109/9.940940zbMATH Open1010.93045OpenAlexW2135522806MaRDI QIDQ4540470FDOQ4540470
Authors: Mark Cannon, J. Rossiter, Basil Kouvaritakis
Publication date: 21 July 2002
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/9.940940
Recommendations
- A fast MPC algorithm using nonfeasible active set methods
- An online active set strategy to overcome the limitations of explicit MPC
- Computationally efficient algorithms for constraint handling with guaranteed stability and near optimality
- Robust triple mode MPC
- An active set quadratic programming algorithm for real-time model predictive control
model predictive controlleast squares problemNewton-Raphson methodquadratic programsequality problemactive linear constraintsconstrained QP
Quadratic programming (90C20) Newton-type methods (49M15) Design techniques (robust design, computer-aided design, etc.) (93B51)
Cited In (13)
- New formulation of robust MPC by incorporating off-line approach with on-line optimization
- Power-constrained intermittent control
- Title not available (Why is that?)
- Robust triple mode MPC
- Dominant speed factors of active set methods for fast MPC
- An online active set strategy to overcome the limitations of explicit MPC
- Control of constrained linear systems using fast sampling rates
- Fast, large-scale model predictive control by partial enumeration
- An active set quadratic programming algorithm for real-time model predictive control
- More efficient predictive control
- Computationally efficient algorithms for constraint handling with guaranteed stability and near optimality
- Squaring the circle: an algorithm for generating polyhedral invariant sets from ellipsoidal ones
- Title not available (Why is that?)
This page was built for publication: Efficient active set optimization in triple mode MPC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540470)