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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 50th IEEE Conference on Decision and Control and European Control Conference s. 2124 - 2129
Hlavní autoři: Dominguez-Garcia, Alejandro D., Hadjicostis, Christoforos N.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.12.2011
Témata:
ISBN:9781612848006, 1612848001
ISSN:0191-2216
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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.
AbstractList 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.
Author Hadjicostis, Christoforos N.
Dominguez-Garcia, Alejandro D.
Author_xml – sequence: 1
  givenname: Alejandro D.
  surname: Dominguez-Garcia
  fullname: Dominguez-Garcia, Alejandro D.
  email: aledan@ILLINOIS.EDU
  organization: Department of Electrical and Computer Engineering at the University of Illinois at Urbana-Champaign, 61801, USA
– sequence: 2
  givenname: Christoforos N.
  surname: Hadjicostis
  fullname: Hadjicostis, Christoforos N.
  email: chadjic@UCY.AC.CY
  organization: Department of Electrical and Computer Engineering at the University of Cyprus, Nicosia, Cyprus
BookMark eNotj81Kw0AURkesYFO7F9zkBRLvnUnuTFYiaf2Bghtdl5nkThzRtMykgm9vxa6-b3E4cDIxG3cjC3GNUCJCc9uu2lICYklIUJE8ExlWpBVUtVbnYtlog4TSVAaAZmIO2GAhJdKlyFL6AAADRHNxtwppisEdJu7z47MTD4FT7ncxt98c7cB5txsTj-mQ8jDmfYjc_cFDtPv3dCUuvP1MvDztQrw9rF_bp2Lz8vjc3m-KgLqeCitro3oiawmc7ZgRyTunvNGgVNM13ndkXHOErGF_rDCOtEbjOl_1UqqFuPn3Bmbe7mP4svFne4pXv9glTag
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/CDC.2011.6160462
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1467304573
1612847994
9781612847993
161284801X
9781612848013
9781467304573
EndPage 2129
ExternalDocumentID 6160462
Genre orig-research
GroupedDBID 29P
6IE
6IF
6IH
6IK
6IM
AAJGR
AFFNX
ALMA_UNASSIGNED_HOLDINGS
CBEJK
IPLJI
RIE
RIO
RNS
ID FETCH-LOGICAL-i175t-a2583d66aa60bacee116fbb3f870339c9ffc68b983da8ef0458b67718bcf4d223
IEDL.DBID RIE
ISBN 9781612848006
1612848001
ISICitedReferencesCount 56
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000303506202119&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0191-2216
IngestDate Wed Sep 10 07:40:54 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-a2583d66aa60bacee116fbb3f870339c9ffc68b983da8ef0458b67718bcf4d223
PageCount 6
ParticipantIDs ieee_primary_6160462
PublicationCentury 2000
PublicationDate 2011-Dec.
PublicationDateYYYYMMDD 2011-12-01
PublicationDate_xml – month: 12
  year: 2011
  text: 2011-Dec.
PublicationDecade 2010
PublicationTitle 2011 50th IEEE Conference on Decision and Control and European Control Conference
PublicationTitleAbbrev CDC
PublicationYear 2011
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0008066
ssj0000669063
Score 1.740631
Snippet We address the average consensus problem for a distributed system whose components (nodes) can exchange information via interconnections (links) that form an...
SourceID ieee
SourceType Publisher
StartPage 2124
SubjectTerms Convergence
Directed graphs
Distributed algorithms
Eigenvalues and eigenfunctions
Europe
Iterative algorithms
Topology
US Government
Weighted sum model
Wireless networks
Title Distributed strategies for average consensus in directed graphs
URI https://ieeexplore.ieee.org/document/6160462
WOSCitedRecordID wos000303506202119&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwFLbaigEWjhZxywMjpnGS-pgYWioGVHUA1K3yKXVJUZPy-3l20hQkFrbEsmTLx3uf3_E9hO5Tbn3YWqIzp0juPSfKckYoNTm8tYVVkZ3_45XPZmKxkPMOemhzYZxzMfjMPYbP6Mu3a7MNprIhoyzkUnZRl3Ne52q19hRQnTJheyksktpPCe8RkqaUhaQuFoQxICTacD3t_lv_ZSKH48m4JvZsBvtVdSUqnenx_6Z7ggb77D08b_XSKeq44gwd_SAe7KOnSeDLDaWunMVltaOLwIBgsYLDDUIGmxBnXZTbEq8KXGs-6BwJrssBep8-v41fSFNKgawAH1REpSORWcaUYolWMAFKmdc683Bds0wa6b1hQkvopITzwXuqGQe9pY3PLUCIc9Qr1oW7QJiLxEPzSGpjAX2MNAAirrXKLKUy9-wS9cNSLD9rtoxlswpXfzdfo8NopY0BIjeoV2227hYdmK9qVW7u4hZ_AyfeoC4
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JTwIxFG4QTdSLCxh3e_BoZTpLZ3ryABKMSDig4Ua6JlwGwwz-fl87MGjixdtM06RNl_e-vuV7CN2HqbZua4mMjCCxtSkROmWEUhXDWzvTwrPzfwzT0SibTvm4gR7qXBhjjA8-M4_u0_vy9UKtnKmswyhzuZQ7aDeJ45BW2Vq1RQWUJw_YVg5nQeWphBcJCUPKXFoXc-IYMBJdsz1t_msPZsA73V63ovZcD_er7opXO_2j_034GLW3-Xt4XGumE9Qw-Sk6_EE92EJPPceY64pdGY2LckMYgQHDYgHHG8QMVi7SOi9WBZ7nuNJ90NlTXBdt9N5_nnQHZF1MgcwBIZREhEkWacaEYIEUMAFKmZUysnBho4grbq1imeTQSWTGOv-pZCloLqlsrAFEnKFmvsjNOcJpFlhoTrhUGvBHIgESpVKKSFPKY8suUMstxeyz4suYrVfh8u_mO7Q_mLwNZ8OX0esVOvA2Wx8uco2a5XJlbtCe-irnxfLWb_c3tFWjdQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2011+50th+IEEE+Conference+on+Decision+and+Control+and+European+Control+Conference&rft.atitle=Distributed+strategies+for+average+consensus+in+directed+graphs&rft.au=Dominguez-Garcia%2C+Alejandro+D.&rft.au=Hadjicostis%2C+Christoforos+N.&rft.date=2011-12-01&rft.pub=IEEE&rft.isbn=9781612848006&rft.issn=0191-2216&rft.spage=2124&rft.epage=2129&rft_id=info:doi/10.1109%2FCDC.2011.6160462&rft.externalDocID=6160462
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0191-2216&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0191-2216&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0191-2216&client=summon