Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of large n thereby increasing the on-line computation, rendering the approach impracticable in the case of fast sampling. Here...
Main Authors: | Kouvaritakis, B, Cannon, M, Rossiter, J |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2002
|
Similar Items
-
Improvements in the efficiency of linear MPC
by: Li, S, et al.
Published: (2010) -
Improvements in the efficiency of linear MPC
by: Li, S, et al.
Published: (2010) -
Improvements on the efficiency of linear MPC
by: Li, S, et al.
Published: (2009) -
Efficient active set optimization in triple mode MPC
by: Cannon, M, et al.
Published: (2001) -
Triple mode control in MPC
by: Rossiter, J, et al.
Published: (2000)