The use of linear parameter varying (LPV) prediction models has been proven to be an effective solution to develop modelpredictivecontrol (MPC) algorithms for linear and non-linear systems. However, the computationa...
详细信息
The use of linear parameter varying (LPV) prediction models has been proven to be an effective solution to develop modelpredictivecontrol (MPC) algorithms for linear and non-linear systems. However, the computational effort is a crucial issue for LPV-MPC, which has severely limited its application especially in embedded control. Indeed, for dynamical systems of dimension commonly found in embedded applications, the time needed to form the quadratic programming (QP) problem at each time step, can be substantially higher than the average time to solve it, making the approach infeasible in many control boards. This study presents an algorithm that drastically reduces this computational complexity for a particular class of LPV systems. They show that when the input matrix is right-invertible, the rebuild phase of the QP problem can be accelerated by means of a coordinate transformation which approximates the original formulation. Then they introduce a variant of the algorithm, able to further reduce this time, at the cost of a slightly increased sub-optimality. The presented results on vehicle dynamics and electrical motor control confirm the effectiveness of the two novel methods, especially in those applications where computational load is a key indicator for success.
暂无评论