Browse wiki

From MurrayWiki
Jump to: navigation, search
Distributed Averaging on Asynchronous Communication Networks
Abstract Distributed algorithms for averaging have …
Distributed algorithms for averaging have at- tracted interest in the control and sensing literature. However, previous works have not addressed some practical concerns that will arise in actual implementations on packet-switched communication networks such as the Internet. In this paper, we present several implementable algorithms that are robust to asynchronism and dynamic topology changes. The algorithms do not require global coordination and can be proven to converge under very general asynchronous timing assumptions. Our results are verified by both simulation and experiments on a real-world TCP/IP network.
periments on a real-world TCP/IP network.  +
Authors Mortada Mehyar, Demetri Spanos, John Pongsajapan, Steven H. Low, Richard M. Murray  +
ID 2005m  +
Source 2005 Conference on Decision and Control (CDC)  +
Tag meh+05-cdc  +
Title Distributed Averaging on Asynchronous Communication Networks +
Type Conference Paper  +
Categories Papers
Modification date
This property is a special property in this wiki.
15 May 2016 06:17:52  +
URL
This property is a special property in this wiki.
http://www.cds.caltech.edu/~murray/preprints/meh+05-cdc.pdf  +
hide properties that link here 
Distributed Averaging on Asynchronous Communication Networks + Title
 

 

Enter the name of the page to start browsing from.