Key points are not available for this paper at this time.
This paper investigates the distributed event-based consensus problem of switching networks satisfying the jointly connected condition. Both the state consensus of homogeneous linear networks and the output consensus of heterogeneous networks are studied. Two kinds of event-based protocols based on local sampled information are designed, without the need to solve any matrix equation or inequality. Theoretical analysis indicates that the proposed event-based protocols guarantee the achievement of consensus and the exclusion of Zeno behaviors for jointly connected undirected switching graphs. These protocols, relying on no global knowledge of the network topology and independent of switching rules, can be devised and utilized in a completely distributed manner. They are able to avoid continuous information exchanges for either controllers' updating or triggering functions' monitoring, which ensures the feasibility of the presented protocols.
Cheng et al. (Mon,) studied this question.