Interventional bipartite consensus on coopetition networks with unknown dynamics

Bipartite tracking consensus of linear multi‐agent systems with a dynamic leader under signed digraph

“…In [33], bipartite consensus, which means that the states of the agents converge to a final state with the same magnitude but opposite sign, was introduced under a structurally balanced signed graph. Then, there has been a surge of attention given to the research of bipartite consensus of multi‐agent systems [34–43], because of its theoretical significance and potential applications. In [35], the interval bipartite consensus was introduced, and it was shown that a multi‐agent system can reach interval bipartite consensus when the signed digraph contains a directed spanning tree.…”

“…In [37], an equivalence relationship between bipartite consensus and traditional consensus was founded, and the bipartite consensus of linear multi‐agent system was investigated by both state and output feedback control. In [38], the interventional bipartite consensus was addressed for a high‐order multi‐agent system with unknown disturbance by using a neural network technique. In [42], by taking into account the dynamic leader with non‐zero control input unavailable to any follower, the bipartite tracking consensus of linear multi‐agent systems was investigated under undirected signed graph.…”

Event-Triggered Bipartite Consensus of Single-Integrator Multi-Agent Systems with Measurement Noise

“…However, it is very natural to see, in many real examples, that in MASs some agents cooperate while others compete, and MASs with competitive interactions can introduce more complex behaviors. To quantitatively model such a scenario, the concept of bipartite consensus, i.e., agents agree on a certain quantity with the equal modulus but different signs, has been proposed [9], and many achievements have been made [9][10][11][12][13][14][15][16][17][18]. In [9], for singleintegrator MASs, a linear feedback protocol is designed and under the assumption that the communication topology G is strongly connected, the MAS is proved to achieve bipartite consensus if and only if G is structurally balanced.…”

Bipartite consensus of integrator multi‐agent systems with measurement noise

“…The fixed communication topology in [8] is extended in [12] to time-varying signed digraphs. Moreover, bipartite consensus for high-order MASs with unknown disturbances is investigated [15][16][17]. In [15], an adaptive consensus protocol is designed for second-order MASs.…”

“…In [15], an adaptive consensus protocol is designed for second‐order MASs. In [16, 17], for high‐order MASs, a leader, whose information is only available to a part of agents, is introduced to intervene a group of agents and a neural network‐based adaptive protocol is proposed. Since a Lyapunov function candidate is usually hard to be constructed for high‐order MASs, a common Lyapunov function method is employed in the convergence analysis [16, 17].…”