Bipartite Consensus Of Multi-agent Systems Research Articles

Bipartite Consensus for Multiagent Systems via Event-Based Control

This paper studies bipartite consensus for first-order multiagent systems. To improve resource utilization, event-based protocols are considered for bipartite consensus. A new type of control gain is designed in the proposed protocols. By appropriate selection of control gains, the convergence rate of the closed-loop system can be adjusted. Firstly, for structural balance case, necessary and sufficient conditions are given on communication relations and consensus gains to achieve bipartite consensus. Secondly, for structural unbalance case, necessary and sufficient conditions are proposed to ensure the stabilizing of the system. It can be found that the system will not show Zeno behavior. Numerical simulations are used to demonstrate the theoretical results.

Fixed-time bipartite consensus of multi-agent systems with disturbances

This article settles the fixed-time bipartite consensus for multi-agent systems that are subject to disturbances or not. The established protocols are aimed at controlling networked agents to reach agreement bipartitely, which reveals that a final state is the same in quantity but not in sign. By introducing algebraic graph theory, Lyapunov analysis and stability theory of fixed-time, the settling time associated with the design parameters and network connectivity rather than the initial states is explicitly given. The rationality of theoretical analysis is demonstrated via simulations.

Bipartite consensus for multi-agent systems with antagonistic interactions and communication delays

This paper studies the consensus problems over signed digraphs with arbitrary finite communication delays. For the considered system, the information flow is directed and only locally delayed information can be used for each node. We derive that bipartite consensus of this system can be realized when the associated signed digraph is strongly connected. Furthermore, for structurally balanced networks, this paper studies the pinning partite consensus for the considered system. we design a pinning scheme to pin any one agent in the signed network, and obtain that the network achieves pinning bipartite consensus with any initial conditions. Finally, two examples are provided to demonstrate the effectiveness of our main results.

Finite-time and fixed-time bipartite consensus of multi-agent systems under a unified discontinuous control protocol

This paper investigates the issue of finite/fixed-time bipartite consensus (FFTBC) of multi-agent systems with signed graphs. A new unified framework of finite-time and fixed-time bipartite consensus is built via some discontinuous control protocols based on the theory of differential inclusion and set-valued Lie derivative. Under the structurally balanced or unbalanced signed graphs, the goal of FFTBC is reached by a common discontinuous controller with different control gains, which fills the gap in studying FFTBC issues with discontinuous protocols. Some numerical examples with comparisons are given to demonstrate the effectiveness of our designs.

Bipartite consensus of multi-agent systems over signed graphs: State feedback and output feedback control approaches

Summary This paper studies bipartite consensus problems for continuous-time multi-agent system over signed directed graphs. We consider general linear agents and design both state feedback and dynamic output feedback control laws for the agents to achieve bipartite consensus. Via establishing an equivalence between bipartite consensus problems and the conventional consensus problems under both state feedback and output feedback control approaches, we make direct application of existing state feedback and output feedback consensus algorithms to solve bipartite consensus problems. Moreover, we propose a systematical approach to design bipartite consensus control laws. Copyright © 2016 John Wiley & Sons, Ltd.

Bipartite Consensus Control of Multiagent Systems on Coopetition Networks

Cooperation and competition are two typical interactional relationships in natural and engineering networked systems. Some complex behaviors can emerge through local interactions within the networked systems. This paper focuses on the coexistence of competition and cooperation (i.e., coopetition) at the network level and, simultaneously, the collective dynamics on such coopetition networks. The coopetition network is represented by a directed signed graph. The collective dynamics on the coopetition network is described by a multiagent system. We investigate two bipartite consensus strategies for multiagent systems such that all the agents converge to a final state characterized by identical modulus but opposite sign. Under a weak connectivity assumption that the coopetition network has a spanning tree, some sufficient conditions are derived for bipartite consensus of multiagent systems with the help of a structural balance theory. Finally, simulation results are provided to demonstrate the bipartite consensus formation.