Change search
ReferencesLink to record
Permanent link

Direct link
Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
Show others and affiliations
2015 (English)In: IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, ISSN 2325-5870, Vol. 2, no 4, 370-381 p.Article in journal (Refereed) PublishedText
Abstract [en]

Most algorithms for distributed averaging only guarantee asymptotic convergence. This paper introduces a distributed protocol that allows nodes to find the exact average of the initial values in a finite and minimum number of steps on interconnection topologies described by strongly connected directed graphs (digraphs). More specifically, under the assumption that each component has knowledge of the number of its outgoing links (i.e., the number of components to which it sends information), we show that the average value can be computed based on local observations over a finite time interval. The average can be obtained in a finite number of steps even when the information exchange is subject to delays. The proposed algorithm is the first in the literature that allows for distributed computation of the exact average in digraphs in finite time, with and without delays.

Place, publisher, year, edition, pages
IEEE , 2015. Vol. 2, no 4, 370-381 p.
Keyword [en]
Average consensus, delays, digraphs, distributed algorithms, finite time convergence
National Category
Computer Science
URN: urn:nbn:se:kth:diva-180614DOI: 10.1109/TCNS.2015.2426732ISI: 000367145800005ScopusID: 2-s2.0-84961615455OAI: diva2:896109

QC 20160120

Available from: 2016-01-20 Created: 2016-01-19 Last updated: 2016-01-20Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Charalambous, ThemistoklisYang, TaoJohansson, Mikael
By organisation
ACCESS Linnaeus CentreAutomatic Control
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 474 hits
ReferencesLink to record
Permanent link

Direct link