Bipartite Consensus of Linear Discrete-time Multi-agent Systems with Encoding-Decoding

In this paper, the consensus problem of general linear discrete-time multi-agent systems with the cooperative-antagonistic interactions and limited communication bandwidth is investigated, and a bipartite consensus con-trol protocol is proposed for each agent, which is given in terms of the state of its dynamic encoder and decod-ers with uniform quantizer. It’s demonstrated that the bipartite consensus can be realized, if the signed undi-rected graph is connected and structurally balanced/unbalanced. Furthermore, the explicit form of the conver-gence rate is given. Numerous simulations are presented to illustrate the feasibility of the control scheme used on this system.