Yuan, Y and Stan, G-B and Shi, L and Barahona, M and Goncalves, J (2013) Decentralised minimum-time consensus. Automatica, 49. pp. 1227-1235. ISSN 0005-1098Full text not available from this repository.
We consider the discrete-time dynamics of a network of agents that exchange information according to a 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 final consensus value of the whole network in finite time using the minimum number of successive values of its own state history. We show that the minimum number of steps is related to a Jordan block decomposition of the network dynamics, and present an algorithm to compute the final consensus value in the minimum number of steps by checking a rank condition of a Hankel matrix of local observations. Furthermore, we prove that the minimum number of steps is related to graph theoretical notions that can be directly computed from the Laplacian matrix of the graph and from the minimum external equitable partition. © 2013 Elsevier Ltd. All rights reserved.
|Uncontrolled Keywords:||Decentralised network consensus Graph theory Laplacian matrix Minimum finite-time consensus Single node observation|
|Divisions:||Div F > Control|
|Depositing User:||Cron job|
|Date Deposited:||04 Feb 2015 22:40|
|Last Modified:||12 Jun 2015 10:54|