NDLI: Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays

Please wait, while we are loading the content...

Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays

Content Provider	IEEE Xplore Digital Library
Author	Charalambous, T. Ye Yuan Tao Yang Wei Pan Hadjicostis, C.N. Johansson, M.
Copyright Year	2014
Abstract	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.
Starting Page	370
Ending Page	381
Page Count	12
File Size	1460793
File Format	PDF
ISSN	23255870
Volume Number	2
Issue Number	4
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-01-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Control systems Convergence Topology Delays Electronic mail Upper bound digraphs distributed algorithms finite time convergence average consensus delays Average consensus
Content Type	Text
Resource Type	Article
Subject	Control and Optimization Signal Processing Control and Systems Engineering Computer Networks and Communications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Distributed Weight Balancing Over Digraphs

Average consensus on general digraphs

Decentralised minimum-time average consensus in digraphs

Average Consensus in the Presence of Delays in Directed Graph Topologies

Optimization and Analysis of Distributed Averaging With Short Node Memory

Finite-time distributed consensus through graph filters

Revisiting Finite-Time Distributed Algorithms via Successive Nulling of Eigenvalues

Integer weight balancing in directed graphs in the presence of communication delays

Average-Consensus in a Deterministic Framework— Part II: Central Connectivity

Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays

Similar Documents

Distributed Weight Balancing Over Digraphs

Average consensus on general digraphs

Decentralised minimum-time average consensus in digraphs

Average Consensus in the Presence of Delays in Directed Graph Topologies

Optimization and Analysis of Distributed Averaging With Short Node Memory

Finite-time distributed consensus through graph filters

Revisiting Finite-Time Distributed Algorithms via Successive Nulling of Eigenvalues

Integer weight balancing in directed graphs in the presence of communication delays

Average-Consensus in a Deterministic Framework— Part II: Central Connectivity

Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays