Search

Abstract: The mathematical model used in Min–Max MPC (MMMPC) to predict the future trajectory of the system explicitly considers disturbances and uncertainties. Based on the future trajectory, the control sequence is computed minimizing the worst case cost with respect to all possible trajectories of the disturbances and uncertainties. This approach leads to a more robust control performance but also complicates the practical implementation of MMMPC due to the high computational burden required to solve the optimization problem. This computational burden is even worse if a nonlinear prediction model is used. In fact, to the best of the authors’ knowledge, there have not yet been reported any applications of nonlinear MMMPC to real processes. In this paper a nonlinear MMMPC strategy based on a second order Volterra series model is presented. The particular structure of the used prediction model allows to obtain an explicit formulation of the worst case cost and its computation in polynomial time. Real time applications with typical prediction and control horizons are possible because of the reduced complexity of the proposed control strategy. Furthermore, input-to-state practical stability for the proposed control strategy is guaranteed under certain conditions. The MMMPC strategy is implemented and validated in experiments with a continuous stirred tank reactor whose temperature dynamics are approximated by a second order Volterra series model. The control performance of the proposed MMMPC strategy is illustrated by the obtained experimental results. [Copyright &y& Elsevier]

Abstract: The practical implementation of min–max MPC (MMMPC) is limited by the computational burden required to compute the control law. This problem can be circumvented by using approximate solutions or upper bounds of the worst possible case of the performance index. In a previous work, the authors presented a computationally efficient MMMPC control strategy in which a close approximation of the solution of the min–max problem is computed using a quadratic programming problem. In this paper, this approach is validated through its application to a pilot plant in which the temperature of a reactor is controlled. The behavior of the system and the controller are illustrated by means of experimental results. [Copyright &y& Elsevier]

Abstract: Min–max model predictive controllers (MMMPC) suffer from a great computational burden that is often circumvented by using approximate solutions or upper bounds of the worst possible case of a performance index. This paper proposes a computationally efficient MMMPC control strategy in which a close approximation of the solution of the min–max problem is computed using a quadratic programming problem. The overall computational burden is much lower than that of the min–max problem and the resulting control is shown to have a guaranteed stability. A simulation example is given in the paper. [Copyright &y& Elsevier]