Computationally efficient Min-Max MPC

Min-Max MPC (MMMPC) controllers suffer from a great computational burden that is often circumvented by using upper bounds of the worst possible case of a performance index. These upper bounds are usually computed by means of LMI techniques. In this paper a more efficient approach is shown. This paper proposes a computationally efficient MMMPC control strategy in which the worst case cost is approximated by an upper bound which can be easily computed using simple matrix operations. This implies that the algorithm can be coded easily even in non mathematical oriented programming languages such as those found in industrial embedded control hardware. Simulation examples are given in the paper. Copyright C 2005 IFAC