The projection method for reaching consensus and the regularized power limit of a stochastic matrix

DOI10.1134/S0005117911120034zbMATH Open1269.93002arXiv1109.3948OpenAlexW2142285137MaRDI QIDQ2392630FDOQ2392630

Authors: R. P. Agaev, Pavel Chebotarev 

Publication date: 2 August 2013

Published in: Automation and Remote Control (Search for Journal in Brave)

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 emph{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.$

Full work available at URL: https://arxiv.org/abs/1109.3948

Recommendations

• On the properties of orthogonal projection method for reaching consensus
• The projection method for continuous-time consensus seeking
• On the role of the eigenprojector of the Laplacian matrix for reaching consensus in multiagent second-order systems
• On the convergence domain in the differential model of reaching a consensus
• Models of latent consensus

zbMATH Keywords

multi-agent systemsDeGroot modelcommunication digraphdiscrete consensus problemregularized power limitsubsequent iterationsvector of initial opinions

Mathematics Subject Classification ID

Agent technology and artificial intelligence (68T42) Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Title not available (Why is that?)
• Social and economic networks.
• Graph theoretic methods in multiagent networks
• ON SMALL RANDOM PERTURBATIONS OF DYNAMICAL SYSTEMS
• Consensus and Cooperation in Networked Multi-Agent Systems
• Distributed coordination of multi-agent networks. Emergent problems, models, and issues.
• Coordination in multiagent systems and Laplacian spectra of digraphs
• Distributed consensus in multi-vehicle cooperative control. Theory and applications.
• Title not available (Why is that?)
• The Role of the Group Generalized Inverse in the Theory of Finite Markov Chains
• Title not available (Why is that?)
• On determining the eigenprojection and components of a matrix
• Forest matrices around the Laplacian matrix
• The matrix of maximum out forests of a digraph and its applications
• Google's PageRank and beyond. The science of search engine rankings
• Dynamic models of informational control in social networks
• Synchronization in complex networks of nonlinear dynamical systems
• Spanning forests of a digraph and their applications
• Addendum to: ``On determining the eigenprojection and components of a matrix
• Flocks and formations

Cited In (9)

• A cyclic representation of discrete coordination procedures
• Dynamic graph models and their properties
• The projection method for continuous-time consensus seeking
• Models of latent consensus
• Regularization-based solution of the PageRank problem for large matrices
• Resource network with limited capacity of attractor vertices
• On the convergence domain in the differential model of reaching a consensus
• On the properties of orthogonal projection method for reaching consensus
• Consensus in social networks of compound nodes

This page was built for publication: The projection method for reaching consensus and the regularized power limit of a stochastic matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392630)