Models of latent consensus
Authors:
- 1 January 2017
- journal article
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 78 (1) , 88-99
Abstract
The paper studies the problem of achieving consensus in multi-agent systems in the case where the dependency digraph Γ has no spanning in-tree. We consider the regularization protocol that amounts to the addition of a dummy agent (hub) uniformly connected to the agents. The presence of such a hub guarantees the achievement of an asymptotic consensus. For the “evaporation” of the dummy agent, the strength of its influences on the other agents vanishes, which leads to the concept of latent consensus. We obtain a closed-form expression for the consensus when the connections of the hub are symmetric; in this case, the impact of the hub upon the consensus remains fixed. On the other hand, if the hub is essentially influenced by the agents, whereas its influence on them tends to zero, then the consensus is expressed by the scalar product of the vector of column means of the Laplacian eigenprojection of Γ and the initial state vector of the system. Another protocol, which assumes the presence of vanishingly weak uniform background links between the agents, leads to the same latent consensus.Keywords
All Related Versions
This publication has 17 references indexed in Scilit:
- The projection method for continuous-time consensus seekingAutomation and Remote Control, 2015
- The Forest Consensus TheoremIEEE Transactions on Automatic Control, 2014
- Semi-Global Leader-Following Consensus of Linear Multi-Agent Systems With Input Saturation via Low Gain FeedbackIEEE Transactions on Circuits and Systems I: Regular Papers, 2013
- The projection method for reaching consensus and the regularized power limit of a stochastic matrixAutomation and Remote Control, 2011
- Distributed Coordination of Multi-agent Networks2011
- Graph Theoretic Methods in Multiagent Networks2010
- Consensus of high-order linear systems using dynamic output feedback compensator: Low gain approachAutomatica, 2009
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Forest matrices around the Laplacian matrixLinear Algebra and its Applications, 2002
- Reaching a ConsensusJournal of the American Statistical Association, 1974