ntao Hu, Yingmin Jia, Yaxin Li
The Seventh Research Division and the Center for Information and Control, School of Automation Science and Electrical Engineering, Beihang University (BUAA), 37 Xueyuan Road, Haidian District, Beijing, 100191, China
pp. 72–76
ABSTRACT
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
Keywords:Multi-agent systems, signed undirected graph, bipartite consensus, structural balance/unbalance, encoding and decoding

ARTICLE INFO
Article History
Received 20 November 2020
Received 20 November 2020

Download article (PDF)