Convergence Speed in Distributed Consensus and Control

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We study the convergence speed of distributed iterative algorithms for the consensus and averaging problems, with emphasis on the latter. We first consider the case of a fixed communication topology. We show that a simple adaptation of a consensus algorithm leads to an averaging algorithm. We prove lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods, and provide an algorithm that essentially matches those lower bounds. We then consider the case of a time-varying topology, and provide a polynomial-time averaging algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Convergence Speed in Distributed Consensus and Control does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Convergence Speed in Distributed Consensus and Control, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Convergence Speed in Distributed Consensus and Control will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-531860

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.