On the consensus and bipartite consensus in high-order multi-agent dynamical systems with antagonistic interactions
By Maria Elena Valcher, Pradeep Misra. Systems & control letters (Print), 2014
392 citations recorded by the source corpus.
Abstract The aim of this paper is to address consensus and bipartite consensus for a group of homogeneous agents, under the assumption that their mutual interactions can be described by a weighted, signed, connected and structurally balanced communication graph. This amounts to assuming that the agents can be split into two antagonistic groups such that interactions between agents belonging to the same group are cooperative, and hence represented by nonnegative weights, while interactions between agents belonging to opposite groups are antagonistic, and hence represented by nonpositive weights. In this framework, bipartite consensus can always be reached under the stabilizability assumption on the state-space model describing the dynamics of each agent. On the other hand, (nontrivial) standard consensus may be achieved only under very demanding requirements, both on the Laplacian associated with the communication graph and on the agents’ description. In particular, consensus may be achieved only if there is a sort of “equilibrium” between the two groups, both in terms of cardinality and in terms of the weights of the “conflicting interactions” amongst agents.
Subfields: Computer Networks and Communications, Statistical and Nonlinear Physics
View Paper: https://www.semanticscholar.org/paper/431bdd5e7a7637099d107e97b26bf04f514b05db
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- Anton V. Proskurnikov
- De-yuan Meng
- Alexey S. Matveev
- Yongnan Jia
- Ming Cao
- Amir Hossein Barshooi
- Abdollah Amirkhani
- Mingjun Du
In Statistical and Nonlinear Physics
Citations in the corpus
- Interval Bipartite Consensus of Networked Agents Associated With Signed Digraphs (2016, background): “the existing consensus results require connectivity of undirected graphs and strong connectivity of digraphs ([15], [17]–[21], [24]) or provide only sufficient conditions under digraphs with spanning trees ([16], [22], [23]).”
- Opinion Dynamics in Social Networks With Hostile Camps: Consensus vs. Polarization (2015, background): “So a number of papers have been published recently studying this class of networks [15], [35]–[39].”
- Consensus in multi-agent systems: a review (2021, background): “Also, the problem of bipartite consensus in high-order MASs with directed and undirected communication topologies has been presented in Valcher and Misra (2014).”