Bipartite consensus for multiple two-time scales agents over the signed digraph

Abstract

The bipartite consensus problem of multiple two-time scales agents over the signed digraph, where both cooperative and competitive interactions exist among the agents, is considered with a new distributed protocol. Sufficient conditions for bipartite consensus is presented in terms of easily checkable algebraic Riccati equation (ARE). Compared with the existing result on consensus of multiple two-time scales agents, the communication topology here is more generic. Moreover, the upper bound of the singular perturbation parameter is also presented. Simulation examples are given to illustrate the effectiveness of the proposed results.