Journal
IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS
Volume 51, Issue 6, Pages 3867-3875Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSMC.2019.2938419
Keywords
Protocols; Network topology; Topology; Multi-agent systems; Robot sensing systems; Collective intelligence; Detail-balanced structure; finite-time bipartite consensus (FTBC); pinning control; signed graph
Funding
- National Natural Science Foundation of China [61973078, 61573102, 61833005]
- Natural Science Foundation of Jiangsu Province of China [BK20170019]
- Jiangsu Provincial Key Laboratory of Networked Collective Intelligence [BM2017002]
Ask authors/readers for more resources
The article focuses on the finite-time bipartite consensus problems of multiagent systems with antagonistic interactions and presents two FTBC protocols in a unified form. Theoretical results are provided to ensure that all agents reach agreement in finite time under the proposed protocols, with the effectiveness demonstrated through numerical examples.
Significant attention has been paid to the bipartite consensus (BC) problem of multiagent systems (MASs) with antagonistic interactions. In many practical applications, the convergence speed is very important. In this article, we focus on the finite-time BC (FTBC) problems of MASs with detail-balanced antagonistic interactions. First, two FTBC protocols are designed and expressed in a unified form. Then, by taking advantage of some recent findings on network stability, we obtain theoretical results to guarantee that the states of all agents reach agreement in finite time under our proposed protocols. Finally, the effectiveness and validity of the main theoretical results are demonstrated via two numerical examples.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
