DocumentCode :
645990
Title :
Distributed formation of balanced and bistochastic weighted digraphs in multi-agent systems
Author :
Charalambous, Themistoklis ; Hadjicostis, Christoforos N.
Author_Institution :
Sch. of Electr. Eng., R. Inst. of Technol. (KTH), Stockholm, Sweden
fYear :
2013
fDate :
17-19 July 2013
Firstpage :
1752
Lastpage :
1757
Abstract :
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.
Keywords :
directed graphs; distributed algorithms; matrix algebra; multi-agent systems; balanced weighted digraphs; bistochastic matrix formation; bistochastic weighted digraphs; distributed algorithms; distributed formation; distributed system; geometric convergence rate; multiagent systems; weight balance problem; Algorithm design and analysis; Convergence; Distributed algorithms; Equations; Steady-state; Stochastic processes; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control Conference (ECC), 2013 European
Conference_Location :
Zurich
Type :
conf
Filename :
6669187
Link To Document :
بازگشت