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 random sleep algorithms for optimal consensus
Chinese Academy of Sciences, Beijing, China .
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: Systems & control letters (Print), ISSN 0167-6911, E-ISSN 1872-7956, Vol. 62, nr 12, s. 1196-1202Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

In this paper, we propose a random sleep algorithm for a network to cooperatively find a point within the intersection of some convex sets, each of which is known only to a particular node. At each step, each node first chooses to project its own set or not at random by a Bernoulli decision independently. When a node has chosen to project its set, we assume that it can detect only the projection direction rather than the exact projection point, based on which the node obtains an estimate for the projection point. Then the agents update their states by averaging the estimates with their neighbors. Under directed and time-varying communication graph, sufficient and/or necessary stepsize conditions are presented for the considered algorithm converging to a consensus within the intersection set.

sted, utgiver, år, opplag, sider
2013. Vol. 62, nr 12, s. 1196-1202
Emneord [en]
Intersection computation, Multi-agent systems, Optimal consensus, Random projection, Bernoulli, Communication graphs, Convex set, Projection direction, Random projections, Step size, Time varying, Directed graphs, Multi agent systems, Optimization, Set theory, Algorithms
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-139860DOI: 10.1016/j.sysconle.2013.10.001ISI: 000329149400012Scopus ID: 2-s2.0-84889068809OAI: oai:DiVA.org:kth-139860DiVA, id: diva2:690127
Forskningsfinansiär
Knut and Alice Wallenberg FoundationSwedish Research Council
Merknad

QC 20140122

Tilgjengelig fra: 2014-01-22 Laget: 2014-01-15 Sist oppdatert: 2017-12-06bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Personposter BETA

Johansson, Karl Henrik

Søk i DiVA

Av forfatter/redaktør
Lou, YouchengShi, GuodongJohansson, Karl Henrik
Av organisasjonen
I samme tidsskrift
Systems & control letters (Print)

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

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