IEEE Transactions on Automatic Control· 2012Q1
Consensus Problems on Networks With Antagonistic Interactions
- 2,079citations
- Q1SCImago
- 2012year
Short summary
Agents on signed networks can reach consensus, differing only by sign, even with antagonistic (negative weight) interactions.
AI-generated from the title and abstract; the full text is not read.
Key points
- Agents on signed networks can achieve consensus where values differ only by sign.
- Negative weights (antagonistic interactions) do not preclude consensus.
- Conditions for signed consensus are analogous to monotone systems theory.
- Linear and nonlinear Laplacian feedback designs are presented.
AI-generated from the title and abstract; the full text is not read.
Abstract
In a consensus protocol an agreement among agents is achieved thanks to the collaborative efforts of all agents, expresses by a communication graph with nonnegative weights. The question we ask in this paper is the following: is it possible to achieve a form of agreement also in presence of antagonistic interactions, modeled as negative weights on the communication graph? The answer to this question is affirmative: on signed networks all agents can converge to a consensus value which is the same for all agents except for the sign. Necessary and sufficient conditions are obtained to describe cases in which this is possible. These conditions have strong analogies with the theory of monotone systems. Linear and nonlinear Laplacian feedback designs are proposed.
The authors' abstract, as published at the source. IEEE Transactions on Automatic Control, 2012 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computer Networks and Communications
Computer Networks and CommunicationsComputer Science