Containment control of linear multi-agent systems with stochastic sampled-data

The containment control problem for a class of continuous-time linear multi-agent systems is investigated in this paper. A new protocol is introduced that is based on the aperiodic sampled-data collected from the local agent and its neighbors. More specifically, the sampling process is stochastic and it is modelled by a Markovian chain. By the aid of Markovian jump system method and Lyapunov stability theory, the containment control under stochastic sampling is shown to be solvable if some matrix inequalities are satisfied. Meanwhile, the control protocol is designed by solving a set of linear matrix inequalities (LMIs). Finally, a simulation example is given to illustrate the effectiveness of the proposed design.