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
Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds
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-7309-8086
Vise andre og tillknytning
2014 (engelsk)Inngår i: Automatica, ISSN 0005-1098, E-ISSN 1873-2836, Vol. 50, nr 12, s. 3253-3259Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

The algebraic connectivity of the graph Laplacian plays an essential role in various multi-agent control systems. In many cases a lower bound of this algebraic connectivity is necessary in order to achieve a certain performance. Lately, several methods based on distributed Power Iteration have been proposed for computing the algebraic connectivity of a symmetric Laplacian matrix. However, these methods cannot give any lower bound of the algebraic connectivity and their convergence rates are often unclear. In this paper, we present a distributed algorithm for estimating the algebraic connectivity for undirected graphs with symmetric Laplacian matrices. Our method relies on the distributed computation of the powers of the adjacency matrix and its main interest is that, at each iteration, agents obtain both upper and lower bounds for the true algebraic connectivity. Both bounds successively approach the true algebraic connectivity with the convergence speed no slower than O(1/k).

sted, utgiver, år, opplag, sider
2014. Vol. 50, nr 12, s. 3253-3259
Emneord [en]
Multi-agent systems, Control of networks, Sensor networks, Algebraic connectivity
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-159987DOI: 10.1016/j.automatica.2014.10.051ISI: 000347760100032Scopus ID: 2-s2.0-84919435363OAI: oai:DiVA.org:kth-159987DiVA, id: diva2:790775
Merknad

QC 20150225

Tilgjengelig fra: 2015-02-25 Laget: 2015-02-12 Sist oppdatert: 2017-12-04bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Dimarogonas, Dimos V.Johansson, Karl Henrik

Søk i DiVA

Av forfatter/redaktør
Dimarogonas, Dimos V.Johansson, Karl Henrik
Av organisasjonen
I samme tidsskrift
Automatica

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

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