Open AccessNode‐to‐node bipartite consensus of multi‐agent systems with disturbances
Author(s) -
Hu Aihua,
Park Ju H.,
Cao Jinde
Publication year - 2020
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2019.0973
Subject(s) - bipartite graph , bounded function , mathematics , signed graph , node (physics) , multi agent system , norm (philosophy) , lyapunov function , gaussian , graph , directed graph , topology (electrical circuits) , graph theory , consensus , computer science , control theory (sociology) , mathematical optimization , discrete mathematics , control (management) , nonlinear system , combinatorics , mathematical analysis , artificial intelligence , physics , structural engineering , quantum mechanics , law , political science , engineering
This study presents a novel concept of consensus for multi‐agent systems with a two‐layer framework, namely, the node‐to‐node bipartite consensus. The agents are divided into the virtual leaders and followers, and the signed graph representing communication channels of followers is supposed to be structurally balanced. Moreover, only a small part of the followers are pinned by their corresponding leaders. In addition, the proposed control is subjected to Gaussian disturbances or norm‐bounded disturbances, and two extended forms of node‐to‐node bipartite consensus are correspondingly defined. By utilising the signed graph theory, the M ‐matrix theory, and the Lyapunov function approach, the consensus error between an arbitrary follower and its leader is proved to converge to zero in the mean square sense or to be ultimately bounded. The proposed conditions for consensus mainly depend on the selection of pinned followers and the coupling strength in each layer. Finally, the theoretical results are illustrated by detailed numerical examples.