Almost sure and mean square convergence of iterative learning control system with state feedback under random packet dropouts

This paper investigates the almost sure and mean square convergence of a state feedback-based iterative learning control scheme for a class of discrete-time multi-input–multi-output linear systems with a direct feedback term in the presence of random data dropouts. Firstly, the realisability of the control system is considered. It is shown that the realisability of the control system is only determined by the direct feedback matrix, which has nothing to do with the input–output coupling matrix, and the direct feedback matrix to be full-row rank is enough to guarantee the system realisable. Secondly, the convergence of output tracking errors is analysed in both the almost sure and mean square senses, respectively. By the contraction mapping method combined with matrix decomposition and transformation techniques, it is strictly proved that the output sequence can converge to any given desired trajectory in the sense of almost sure and mean square, respectively, if and only if the general spectral radius condition is satisfied. Finally, an example is given to show the correctness of the theoretical analysis.