A new connection protocol for multi-consensus of discrete-time systems

In this paper, a new connection protocol for consensus of multi-agent discrete-time systems under a general communication graph is proposed. In particular, the coupling is realized based on the outputs making each agent passive in the u-average sense so guaranteeing convergence to the agreement steady-state, with no need of mitigating the coupling gain, as typically done in concerned literature. The proposed connection rule is shown to apply for network dynamics under aperiodic sampling when the sampling sequence is known to all agents.