DocumentCode
184744
Title
Finite-time distributed averaging
Author
Shaoshuai Mou ; Morse, A.S.
Author_Institution
Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA
fYear
2014
fDate
4-6 June 2014
Firstpage
5260
Lastpage
5263
Abstract
This paper proposes a distributed averaging algorithm for multi-agent networks, in which each agent is with a real-valued measurement. Provided that the underlying graph of the network is a tree, the proposed algorithm enables each agent to compute the average of the values of all agents in the network in a finite number of steps. Different from most existing finite-time distributed averaging algorithms, the algorithm proposed in this paper does not require each agent to know any global information.
Keywords
multi-agent systems; trees (mathematics); distributed averaging algorithm; finite-time distributed averaging; multiagent networks; real-valued measurement; tree; Convergence; Distributed algorithms; Eigenvalues and eigenfunctions; Equations; Laplace equations; Nickel; Tree graphs; Agents-based systems; Autonomous systems; Cooperative control;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference (ACC), 2014
Conference_Location
Portland, OR
ISSN
0743-1619
Print_ISBN
978-1-4799-3272-6
Type
conf
DOI
10.1109/ACC.2014.6859261
Filename
6859261
Link To Document