Observer-based consensus in networks of discrete-time switched linear dynamics under a fixed topology

This paper considers the consensus problem of discrete-time switched linear multi-agent systems under a fixed communication topology. An observer-based protocol with sampled data is proposed for solving such a problem. Assume that the digraph has a directed spanning tree and that all switched subsystem of each agent are stabilisable and detectable. It is shown that the proposed protocol solves the consensus problem when the sampling period is sufficiently small and the average dwell time of the switching signal is sufficiently large. Moreover, to reduce the conservatism, a sufficient condition for consensus is obtained to design the feedback gain matrices and the observer gain matrices by linear matrix inequalities, which guarantee that consensus can be achieved when the sampling period and the average dwell time are in the general case. Finally, the effectiveness of the theoretical results is demonstrated through an example.