Predictive control with particular modifications in quadratic programming problem

Abstract

Various kinds of processes can be controlled using predictive control. In certain cases of predictive control of fast-dynamics processes, a predictive control algorithm may not be feasible within the sampling-period time. These situations occur when requirements on control are more complex. For higher horizons and many constraints on control variables, the overloading of the sampling period can occur. In this contribution, the original algorithm of the quadratic programming is modified and verified by simulation and time analysis. For purposes of reducing of the algorithm complexity, a method based on the particular modifications in a solution of the quadratic programming problem is presented.