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
Persistent graphs and consensus convergence
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
2012 (engelsk)Inngår i: 2012 IEEE 51st Annual Conference on Decision and Control (CDC), IEEE conference proceedings, 2012, s. 2046-2051Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

This paper investigates the role persistent arcs play for averaging algorithms to reach a global consensus under discrete-time or continuous-time dynamics. Each (directed) arc in the underlying communication graph is assumed to be associated with a time-dependent weight function. An arc is said to be persistent if its weight function has infinite ℒ1 or ℓ1 norm for continuous-time or discrete-time models, respectively. The graph that consists of all persistent arcs is called the persistent graph of the underlying network. Three necessary and sufficient conditions on agreement or ε-agreement are established, by which we prove that the persistent graph fully determines the convergence to a consensus. It is also shown how the convergence rates explicitly depend on the diameter of the persistent graph.

sted, utgiver, år, opplag, sider
IEEE conference proceedings, 2012. s. 2046-2051
Serie
IEEE Conference on Decision and Control. Proceedings, ISSN 0191-2216
Emneord [en]
Averaging Algorithms, Consensus, Persistent Graphs
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-111454DOI: 10.1109/CDC.2012.6426728ISI: 000327200402070Scopus ID: 2-s2.0-84874267009ISBN: 978-1-4673-2064-1 (tryckt)OAI: oai:DiVA.org:kth-111454DiVA, id: diva2:586421
Konferanse
51st IEEE Conference on Decision and Control, CDC 2012; Maui, HI; United States; 10 December 2012 through 13 December 2012
Merknad

Qc 20130212

Tilgjengelig fra: 2013-02-12 Laget: 2013-01-11 Sist oppdatert: 2013-12-20bibliografisk kontrollert

Open Access i DiVA

fulltext(354 kB)327 nedlastinger
Filinformasjon
Fil FULLTEXT02.pdfFilstørrelse 354 kBChecksum SHA-512
f0896f74f3d96fe731827cc0de7960b447b22d54aee52f17416942f42ede116b5bd4b5aa24920817fe03147f1754cd0d62c0f5055c0bf26b4fa17039e3cf0b38
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopusIEEEXplore

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
Totalt: 327 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 103 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