Convergence speed of distributed consensus and topology of the associated information spread

Author

Angeli, David ; Bliman, Pierre-Alexandre

Author_Institution

INRIA de Rocquencourt, Paris

fYear

2007

fDate

12-14 Dec. 2007

Firstpage

300

Lastpage

305

Abstract

Results for estimating the convergence rate of non-stationary distributed consensus algorithms are provided, on the basis of qualitative (mainly topological) as well as basic quantitative information (lower-bounds on the matrix entries). The results appear to be tight in a number of instances and are illustrated through simple as well as more sophisticated examples. The main idea is to follow propagation of information along certain spanning trees which arise in the communication graph.

Keywords

Lyapunov matrix equations; matrix multiplication; multi-robot systems; trees (mathematics); Lyapunov exponent; agent consensus; communication graph; information propagation; information spread; matrix product; multiagents systems; nonstationary distributed consensus algorithm; quantitative information; spanning trees; topology; Algorithm design and analysis; Communication networks; Computer networks; Concurrent computing; Control theory; Convergence; Peer to peer computing; Topology; Tree graphs; USA Councils;

fLanguage

English

Publisher

ieee

Conference_Titel

Decision and Control, 2007 46th IEEE Conference on

Conference_Location

New Orleans, LA

ISSN

0191-2216

Print_ISBN

978-1-4244-1497-0

Electronic_ISBN

0191-2216

Type

conf

DOI

10.1109/CDC.2007.4434087

Filename

4434087