Distributed strategies for average consensus in directed graphs

We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an arbitrary, strongly connected but possibly directed, topology (graph). Specifically, we discuss how the nodes can asymptotically reach average...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2011 50th IEEE Conference on Decision and Control and European Control Conference S. 2124 - 2129
Hauptverfasser:	Dominguez-Garcia, Alejandro D., Hadjicostis, Christoforos N.
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.12.2011
Schlagworte:	Convergence Directed graphs Distributed algorithms Eigenvalues and eigenfunctions Europe Iterative algorithms Topology US Government Weighted sum model Wireless networks
ISBN:	9781612848006, 1612848001
ISSN:	0191-2216
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!