Decentralised minimal-time consensus
By Ye Yuan, Guy-Bart Vincent Stan, Mauricio Barahona, Ling Shi, Jorge M. Goncalves. 2011
32 citations recorded by the source corpus.
This study considers the discrete-time dynamics of a network of agents that exchange information according to the nearest-neighbour protocol under which all agents are guaranteed to reach consensus asymptotically. We present a fully decentralised algorithm that allows any agent to compute the consensus value of the whole network in finite time using only the minimal number of successive values of its own history. We show that this minimal number of steps is related to a Jordan block decomposition of the network dynamics and present an algorithm to obtain the minimal number of steps in question by checking a rank condition on a Hankel matrix of the local observations. Furthermore, we prove that the minimal number of steps is related to other algebraic and graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the underlying graph topology.
Subfields: Atomic and Molecular Physics, and Optics, Computer Networks and Communications
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Atomic and Molecular Physics, and Optics
In Computer Networks and Communications
Citations in the corpus
- An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, background): “ with general linear/nonlinear dynamics in the future. In addition, it is interesting to study finite-time consensus in the discrete-time setting. Some recent work on this topic can be found in [165], [166], where the objective is to compute the final consensus value for all agents in a finite number o”