Finite-Time Bipartite Consensus For Multiagent Systems Under Detail-Balanced Antagonistic Interactions

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.