Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Persistent graphs and consensus convergence
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.
KTH, School of Electrical Engineering (EES), Automatic Control. KTH, School of Electrical Engineering (EES), Centres, ACCESS Linnaeus Centre.ORCID iD: 0000-0001-9940-5929
2012 (English)In: 2012 IEEE 51st Annual Conference on Decision and Control (CDC), IEEE conference proceedings, 2012, 2046-2051 p.Conference paper, Published paper (Refereed)
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.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2012. 2046-2051 p.
Series
IEEE Conference on Decision and Control. Proceedings, ISSN 0191-2216
Keyword [en]
Averaging Algorithms, Consensus, Persistent Graphs
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-111454DOI: 10.1109/CDC.2012.6426728ISI: 000327200402070Scopus ID: 2-s2.0-84874267009ISBN: 978-1-4673-2064-1 (print)OAI: oai:DiVA.org:kth-111454DiVA: diva2:586421
Conference
51st IEEE Conference on Decision and Control, CDC 2012; Maui, HI; United States; 10 December 2012 through 13 December 2012
Note

Qc 20130212

Available from: 2013-02-12 Created: 2013-01-11 Last updated: 2013-12-20Bibliographically approved

Open Access in DiVA

fulltext(354 kB)274 downloads
File information
File name FULLTEXT02.pdfFile size 354 kBChecksum SHA-512
f0896f74f3d96fe731827cc0de7960b447b22d54aee52f17416942f42ede116b5bd4b5aa24920817fe03147f1754cd0d62c0f5055c0bf26b4fa17039e3cf0b38
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusIEEEXplore

Authority records BETA

Johansson, Karl Henrik

Search in DiVA

By author/editor
Shi, GuodongJohansson, Karl Henrik
By organisation
Automatic ControlACCESS Linnaeus Centre
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 274 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 64 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf