Distributed Formation of Balanced and Bistochastic Weighted Digraphs in Multi-Agent Systems
2013 (English)In: 2013 European Control Conference (ECC), IEEE , 2013, 1752-1757 p.Conference paper (Refereed)
We propose two distributed algorithms, one for solving the weight-balance problem and another for solving the bistochastic matrix formation problem, in a distributed system whose components (nodes) can exchange information via interconnection links (edges) that form an arbitrary, possibly directed, strongly connected communication topology (digraph). Both distributed algorithms achieve their goal asymptotically and operate iteratively by having each node adapt the (nonnegative) weights on its outgoing edges based on the weights of its incoming links. The weight-balancing algorithm is shown to admit geometric convergence rate, whereas the second algorithm, which is a modification of the weight-balancing algorithm, leads asymptotically to a bistochastic digraph with geometric convergence rate for a certain set of initial values. The two algorithms perform better than existing approaches, as illustrated by the examples we provide.
Place, publisher, year, edition, pages
IEEE , 2013. 1752-1757 p.
Bi-stochastic matrices, Communication topologies, Convergence rates, Distributed systems, Non negatives, Strongly connected, Via interconnection, Weighted digraph
Electrical Engineering, Electronic Engineering, Information Engineering Control Engineering
IdentifiersURN: urn:nbn:se:kth:diva-136164ISI: 000332509702025ScopusID: 2-s2.0-84893260453ISBN: 978-303303962-9OAI: oai:DiVA.org:kth-136164DiVA: diva2:675496
2013 12th European Control Conference, ECC 2013; Zurich; Switzerland; 17 July 2013 through 19 July 2013
QC 201403142013-12-042013-12-042014-04-24Bibliographically approved