Distributed Minimum-Time Weight Balancing over Digraphs
2014 (English)Conference paper (Refereed)
We address the weight-balancing problem for a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, communication topology (digraph). A weighted digraph is balanced if, for each node, the sum of the weights of the edges outgoing from that node is equal to the sum of the weights of the edges incoming to that node. Weight-balanced digraphs play a key role in a variety of applications, such as coordination of groups of robots, distributed decision making, and distributed averaging which is important for a wide range of applications in signal processing. We propose a distributed algorithm for solving the weight balancing problem in a minimum number of iterations, when the weights are nonnegative real numbers. We also provide examples to corroborate the proposed algorithm.
Place, publisher, year, edition, pages
2014. 190-193 p.
Consensus Problems, Networks, Agents
IdentifiersURN: urn:nbn:se:kth:diva-159045DOI: 10.1109/ISCCSP.2014.6877847ISI: 000346443500047ScopusID: 2-s2.0-84906766947ISBN: 978-147992890-3OAI: oai:DiVA.org:kth-159045DiVA: diva2:785474
6th International Symposium on Communications, Control and Signal Processing (ISCCSP), MAY 21-23, 2014, Athens, GREECE
QC 201502032015-02-032015-01-202015-02-03Bibliographically approved