Consensus protocols achieve an agreement among agents thanks to the collaborativ e efforts of all agents, expresses by a (connected) communication graph with non negative weights. The question we ask in this paper is the following: is it possible to achieve a form of agreement 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 co nverge to a consensus value which is the same for all except for the sign. Necessary and sufficient conditions are obtained to describe the cases when this is possible.
Achieving consensus on networks with antagonistic interactions / Altafini, Claudio. - (2012), pp. 1966-1971. (Intervento presentato al convegno 51st IEEE Annual Conference on Decision and Control (CDC) tenutosi a Maui, Hawaii nel December 7-12, 2012) [10.1109/CDC.2012.6427063].
Achieving consensus on networks with antagonistic interactions
Altafini, Claudio
2012-01-01
Abstract
Consensus protocols achieve an agreement among agents thanks to the collaborativ e efforts of all agents, expresses by a (connected) communication graph with non negative weights. The question we ask in this paper is the following: is it possible to achieve a form of agreement 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 co nverge to a consensus value which is the same for all except for the sign. Necessary and sufficient conditions are obtained to describe the cases when this is possible.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
