Distributed strategies for generating weight-balanced and doubly stochastic digraphs

Details Distributed strategies for generating weight-balanced and doubly stochastic digraphs Distributed strategies for generating weight-balanced and doubly stochastic digraphs

2009-11-02

arxiv.org/abs/0911.0232v6

Mathematics

Optimization and Control

Scientific paper

Weight-balanced and doubly stochastic digraphs are two classes of digraphs that play an essential role in a variety of cooperative control problems, including formation control, distributed averaging, and optimization. We refer to a digraph as doubly stochasticable (weight-balanceable) if it admits a doubly stochastic (weight-balanced) adjacency matrix. This paper studies the characterization of both classes of digraphs, and introduces distributed algorithms to compute the appropriate set of weights in each case.

Affiliated with

Also associated with

No associations

Rating

Distributed strategies for generating weight-balanced and doubly stochastic 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 Distributed strategies for generating weight-balanced and doubly stochastic digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Distributed strategies for generating weight-balanced and doubly stochastic digraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-29063