The projection method for reaching consensus and the regularized power limit of a stochastic matrix
Authors:
- 21 December 2011
- journal article
- research article
- Published by Pleiades Publishing Ltd in Automation and Remote Control
- Vol. 72 (12) , 2458-2476
Abstract
In the coordination/consensus problem for multi-agent systems, a well-known condition of achieving consensus is the presence of a spanning arborescence in the communication digraph. The paper deals with the discrete consensus problem in the case where this condition is not satisfied. A characterization of the subspace T P of initial opinions (where P is the influence matrix) that ensure consensus in the DeGroot model is given. We propose a method of coordination that consists of: (1) the transformation of the vector of initial opinions into a vector belonging to T P by orthogonal projection and (2) subsequent iterations of the transformation P. The properties of this method are studied. It is shown that for any non-periodic stochastic matrix P, the resulting matrix of the orthogonal projection method can be treated as a regularized power limit of P.Keywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Distributed Coordination of Multi-agent Networks2011
- Graph Theoretic Methods in Multiagent Networks2010
- Evolution and Dynamics of Complex Networks of Coupled SystemsIEEE Circuits and Systems Magazine, 2010
- Coordination in multiagent systems and Laplacian spectra of digraphsAutomation and Remote Control, 2009
- Social and Economic Networks2008
- Distributed Consensus in Multi-vehicle Cooperative Control2008
- Synchronization in Complex Networks of Nonlinear Dynamical Systems2007
- Information consensus in multivehicle cooperative controlIEEE Control Systems, 2007
- Consensus and Cooperation in Networked Multi-Agent SystemsProceedings of the IEEE, 2007
- Reaching a ConsensusJournal of the American Statistical Association, 1974