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...

Full description

Bibliographic Details

Published in:	2011 50th IEEE Conference on Decision and Control and European Control Conference pp. 2124 - 2129
Main Authors:	Dominguez-Garcia, Alejandro D., Hadjicostis, Christoforos N.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.12.2011
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!