Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Convergence of Distributed Averaging and Maximizing Algorithms: Part II: State-dependent Graphs
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0001-9940-5929
2013 (engelsk)Inngår i: 2013 American Control Conference, American Automatic Control Council , 2013, s. 6859-6864Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In this paper, we formulate and investigate a generalized consensus algorithm which makes an attempt to unify distributed averaging and maximizing algorithms considered in the literature. Each node iteratively updates its state as a time-varying weighted average of its own state, the minimal state, and the maximal state of its neighbors. In Part I of the paper, time-dependent graphs are studied. This part of the paper focuses on state-dependent graphs. We use a μ-nearest-neighbor rule, where each node interacts with its μ nearest smaller neighbors and the μ nearest larger neighbors. It is shown that μ+1 is a critical threshold on the total number of nodes for the transit from finite-time to asymptotic convergence for averaging, in the absence of node self-confidence. The threshold is 2μ if each node chooses to connect only to neighbors with unique values. The results characterize some similarities and differences between distributed averaging and maximizing algorithms.

sted, utgiver, år, opplag, sider
American Automatic Control Council , 2013. s. 6859-6864
Serie
Proceedings of the American Control Conference, ISSN 0743-1619
Emneord [en]
Averaging algorithms, Finite-time convergence, Max-consensus
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-133373ISI: 000327210207009Scopus ID: 2-s2.0-84883517207ISBN: 978-147990177-7 (tryckt)OAI: oai:DiVA.org:kth-133373DiVA, id: diva2:661959
Konferanse
2013 1st American Control Conference, ACC 2013; Washington, DC; United States; 17 June 2013 through 19 June 2013
Merknad

QC 20131105

Tilgjengelig fra: 2013-11-05 Laget: 2013-10-31 Sist oppdatert: 2014-01-20bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Scopus

Personposter BETA

Johansson, Karl Henrik

Søk i DiVA

Av forfatter/redaktør
Shi, GuodongJohansson, Karl Henrik
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 38 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf