LAUSR

When discrete-time Markov jump linear systems are prone to the damaging effects of polytopic uncertainties, it is necessary to address all the vertices of each Markov mode in order to properly design robust controllers. To this end, we propose a robust recursive linear–quadratic regulator for this class of systems. We define a quadratic min–max optimization problem by combining least-squares and penalty functions in a unified framework. We design a one-step cost function to encompass the entire set of vertices of each mode altogether, while maintaining its quadratic structure and the convexity of the problem. The solution is then obtained recursively and does not require numerical optimization packages. We establish conditions for convergence and stability by extending the matrix structure of the recursive solution. In addition, we provide numerical and real-world application examples to validate our method and to emphasize recursiveness and diminished computational effort.