dc.contributor.author | Domínguez-Garcia, A. D. | en |
dc.contributor.author | Hadjicostis, Christoforos N. | en |
dc.creator | Domínguez-Garcia, A. D. | en |
dc.creator | Hadjicostis, Christoforos N. | en |
dc.date.accessioned | 2019-04-08T07:45:39Z | |
dc.date.available | 2019-04-08T07:45:39Z | |
dc.date.issued | 2011 | |
dc.identifier.isbn | 978-1-61284-800-6 | |
dc.identifier.uri | http://gnosis.library.ucy.ac.cy/handle/7/43316 | |
dc.description.abstract | 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 consensus (i.e., obtain the average of their initial values) with linear-iterative algorithms in which each node updates its value using a weighted linear combination of its own value and the values of neighboring nodes. In the process, the strategies we develop allow the nodes to adapt their weights in a distributed fashion, so that asymptotically they obtain a doubly stochastic weight matrix, which is useful for many algorithms that utilize linear- or nonlinear-iterative schemes to perform various estimation and optimization tasks. © 2011 IEEE. | en |
dc.source | Proceedings of the IEEE Conference on Decision and Control | en |
dc.source | Proceedings of the IEEE Conference on Decision and Control | en |
dc.source.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84860678822&doi=10.1109%2fCDC.2011.6160462&partnerID=40&md5=64d61238463b493031c92d3c575231fd | |
dc.subject | Algorithms | en |
dc.subject | Weight matrices | en |
dc.subject | Distributed systems | en |
dc.subject | Topology | en |
dc.subject | Linear combinations | en |
dc.subject | Directed graphs | en |
dc.subject | Strongly connected | en |
dc.subject | Via interconnection | en |
dc.subject | Distributed strategies | en |
dc.subject | Average consensus | en |
dc.subject | Doubly stochastic | en |
dc.subject | Estimation and optimization | en |
dc.subject | Initial values | en |
dc.subject | Neighboring nodes | en |
dc.title | Distributed strategies for average consensus in directed graphs | en |
dc.type | info:eu-repo/semantics/conferenceObject | |
dc.identifier.doi | 10.1109/CDC.2011.6160462 | |
dc.description.startingpage | 2124 | |
dc.description.endingpage | 2129 | |
dc.author.faculty | Πολυτεχνική Σχολή / Faculty of Engineering | |
dc.author.department | Τμήμα Ηλεκτρολόγων Μηχανικών και Μηχανικών Υπολογιστών / Department of Electrical and Computer Engineering | |
dc.type.uhtype | Conference Object | en |
dc.contributor.orcid | Hadjicostis, Christoforos N. [0000-0002-1706-708X] | |
dc.gnosis.orcid | 0000-0002-1706-708X | |