Open AccessBipartite tracking consensus of linear multi‐agent systems with a dynamic leader under signed digraph
Author(s) -
Zhang Xuxi,
Han Wenyan,
Liu Xianping
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.2020.0353
Subject(s) - bipartite graph , digraph , multi agent system , bounded function , signed graph , directed graph , control theory (sociology) , graph theory , consensus , computer science , tracking (education) , topology (electrical circuits) , mathematics , strongly connected component , lyapunov function , graph , mathematical optimization , control (management) , theoretical computer science , algorithm , discrete mathematics , artificial intelligence , nonlinear system , combinatorics , psychology , pedagogy , mathematical analysis , physics , quantum mechanics
This study is concerned with the bipartite tracking consensus problem for linear multi‐agent system over signed digraph, in which the leader agent owns a bounded control input that is unavailable to the followers. Compared with existing related works, the communication topology under consideration is allowed to be directed. Two kinds of distributed control protocols are proposed based on the relative states of neighbouring agents. By applying the graph theory, Lyapunov theory and adaptive control, some sufficient conditions for the bipartite tracking consensus are obtained. Finally, two simulation examples are provided to demonstrate the effectiveness of the proposed design methodology.