Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.3166/EJC.18.539-557 | European Journal of Control |
Keywords | Field | DocType |
Distributed dynamical systems,set-valued stability analysis,cooperative control,network design and communication,weight-balanced digraphs,doubly stochastic digraphs | Adjacency matrix,Discrete mathematics,Mathematical optimization,Combinatorics,Distributed algorithm,Mathematics,Digraph | Journal |
Volume | Issue | ISSN |
18 | 6 | 0947-3580 |
Citations | PageRank | References |
24 | 1.32 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bahman Gharesifard | 1 | 340 | 26.54 |
| Jorge Cortes | 2 | 1452 | 128.75 |