On the consensus and bipartite consensus in high-order multi-agent dynamical systems with antagonistic interactions

Valcher, Maria Elena; Misra, P. K.

doi:10.1016/j.sysconle.2014.01.006

Cited by 353 publications

(175 citation statements)

References 27 publications

Supporting

Mentioning

175

Contrasting

Order By: Relevance

“…Assume that the subsystem p ∈ P is active. The time derivative of V (t) along the trajectory of the system (18) is given bẏ Invoking the estimation error dynamics (17), one haṡ…”

Section: Convergence Analysismentioning

confidence: 99%

“…Hu and Zheng investigated sufficient conditions for consensus, polarization and fragmentation for multi-agent systems if the associated coopetition networks are heterogeneous or homogeneous, and structurally balanced, structurally unbalanced, or vacuously balanced in [16]. As an extension of the results reported in [14], a bipartite consensus problem was considered in [17] for a high-order multi-agent system described by a linear time-invariant system.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Adaptive bipartite consensus on coopetition networks

Zhu

2015

Physica D: Nonlinear Phenomena

View full text Add to dashboard Cite

“…Assume that the subsystem p ∈ P is active. The time derivative of V (t) along the trajectory of the system (18) is given bẏ Invoking the estimation error dynamics (17), one haṡ…”

Section: Convergence Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Adaptive bipartite consensus on coopetition networks

Zhu

2015

Physica D: Nonlinear Phenomena

View full text Add to dashboard Cite

“…In the past several years, the coordination between several subgroups was also considered. For example, bipartite consensus was discussed in both structurally balanced and unbalanced cases for two separated groups in Altafini (2013), which was then extended to the high-order multi-agent systems in Valcher and Misra (2014). In addition, set surrounding problem was discussed for several groups of agents under switching interconnections to surround a convex set with the same distance in a plane in Lou and Hong (2014).…”

Section: Introductionmentioning

confidence: 99%

“…• The leader escort problem can be viewed as a combination of the leader-following consensus and the leaderless bipartite consensus (Altafini, 2013;Valcher & Misra, 2014), where the agents should keep the same distance symmetrically from the leader/target. Clearly, if there is only one group of agents, then the problem becomes the active leaderfollowing problem.…”

Section: Introductionmentioning

confidence: 99%

Distributed control design for leader escort of multi-agent systems

Zhang

2014

International Journal of Control

View full text Add to dashboard Cite

In this paper, we consider two-group leader escort control for multi-agent systems, where the agents are separated into two groups to escort an active leader with the same distance. To escort the moving leader, we propose different distributed controls for different cases: the bounded-leader case and the schedule-based general leader case (under either known or unknown time-varying parameter rotation-schedule). Because some agents may not get access to the leader directly, we construct the distributed controllers to escort the leader by moving symmetrically around the leader under either fixed or switching topologies, based on a distributed observer for each agent to estimate the leader's state. With the help of graph theory and Lyapunov function technique, we prove that the leader escort can be achieved asymptotically by theoretical analysis. Finally, simulation results demonstrate good performance of the proposed protocols.

show abstract

“…Such networks are a kind of "singed networks" associated with singed graphs that have edges with both positive and negative weights to reflect the cooperative and antagonistic interactions between agents, respectively. In [34], [35], it has extended the idea of consensus to a class of "bipartite consensus" for signed networks, which aims at enabling all agents to reach consensus regarding a certain quantity that is the same in modulus but not in sign.…”

mentioning

confidence: 99%