Distributed strategies for making a digraph weight-balanced
Lists
Only you see this
Abstract
A digraph is weight-balanced if, at each node, the sum of the weights of the incoming edges (in-degree) equals the sum of the weights of the outgoing edges (out-degree). Weight-balanced digraphs play an important role in a variety of cooperative control problems, including formation control, distributed averaging and optimization. We call a digraph weight-balanceable if it admits an edge weight assignment that makes it weight-balanced. It is known that semiconnectedness is a necessary and sufficient condition for a digraph to be weight-balanceable. However, to our knowledge, the available approaches to compute the appropriate set of weights are centralized. In this paper, we propose a distributed algorithm running synchronously on a directed communication network that allows individual agents to balance their in- and out-degrees. We also develop a systematic centralized algorithm for constructing a weight-balanced digraph and compute its time complexity. Finally, we modify the distributed procedure to design an algorithm which is distributed over the mirror digraph and has a time complexity much smaller than the centralized algorithm.
BibTeX
@inproceedings{gharesifard2009distributed,
author = {Bahman Gharesifard and Jorge Cortés},
title = {{Distributed strategies for making a digraph weight-balanced}},
booktitle = {Allerton},
year = {2009},
url = {https://openreview.net/forum?id=qDM6J2LaCF},
}Loading related content...