Research Library

open-access-imgOpen AccessAsymmetric bipartite consensus over directed networks with antagonistic interactions
Author(s)
Guo Xing,
Liang Jinling,
Lu Jianquan
Publication year2018
Publication title
iet control theory and applications
Resource typeJournals
PublisherThe Institution of Engineering and Technology
This study deals with the bipartite consensus problem for multi‐agent systems associated with signed digraphs. For structurally balanced signed digraphs, by constructing a new class of general Laplacian matrices, it is found that all agents will converge to two values with different modulus if the signed digraph is strongly connected. Interestingly, these two values completely depend on the left eigenvector of the general Laplacian matrix corresponding to the zero eigenvalue and the initial states of all agents. Furthermore, it is shown that all agents can reach interval asymmetric bipartite consensus if the associated signed digraph contains a spanning tree. In particular, some useful results are also presented for specific signed digraphs with spanning trees. Finally, two numerical examples are provided to demonstrate the effectiveness of the main results.
Subject(s)artificial intelligence , bipartite graph , computer science , consensus , control (management) , control theory (sociology) , graph , mathematics , multi agent system , theoretical computer science
Language(s)English
SCImago Journal Rank1.059
H-Index108
eISSN1751-8652
pISSN1751-8644
DOI10.1049/iet-cta.2018.5060

Seeing content that should not be on Zendy? Contact us.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here