Computer Science – Multiagent Systems
Scientific paper
2011-09-19
Automation and Remote Control, 2011, vol.72, No.12, P.2458-2476
Computer Science
Multiagent Systems
19 pages, 2 figures
Scientific paper
10.1134/S0005117911120034
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.$
Agaev R. P.
Chebotarev Yu. P.
No associations
LandOfFree
The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Projection Method for Reaching Consensus and the Regularized Power Limit of a Stochastic Matrix will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-96294