Average Consensus on General Strongly Connected Digraphs

Details Average Consensus on General Strongly Connected Digraphs Average Consensus on General Strongly Connected Digraphs

2012-03-12

arxiv.org/abs/1203.2563v1

Computer Science

Systems and Control

Scientific paper

We study the average consensus problem of multi-agent systems for general network topologies with unidirectional information flow. We propose two (linear) distributed algorithms, deterministic and gossip, respectively for the cases where the inter-agent communication is synchronous and asynchronous. Our contribution is that in both cases, the developed algorithms guarantee state averaging on arbitrary strongly connected digraphs; in particular, this graphical condition does not require that the network be balanced or symmetric, thereby extending many previous results in the literature. The key novelty of our approach is to augment an additional variable for each agent, called "surplus", whose function is to locally record individual state updates. For convergence analysis, we employ graph-theoretic and nonnegative matrix tools, with the eigenvalue perturbation theory playing a crucial role.

Affiliated with

Also associated with

No associations

Rating

Average Consensus on General Strongly Connected Digraphs 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 Average Consensus on General Strongly Connected Digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Average Consensus on General Strongly Connected Digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-489035