By Topic

Average-Consensus in a Deterministic Framework—Part I: Strong Connectivity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Topley, K. ; Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada ; Krishnamurthy, V.

This paper considers the average-consensus problem in a network with arbitrary (but finite) communication delays. A novel Distributed-Averaging (DA) algorithm is presented and shown to achieve average-consensus if at any time t there exists a finite time interval [t, Tt] over which each node can communicate (via a time-respecting path) with all other nodes. For consensus variables with dimensions on the order of the network size, the DA algorithm requires an order of magnitude less data to be communicated and stored at each node as compared to an idealized algorithm that floods the initial data. In the companion paper , practical applications of the DA algorithm are provided along with numerical examples.

Published in:

Signal Processing, IEEE Transactions on  (Volume:60 ,  Issue: 12 )