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
Convergence of random sleep algorithms for optimal consensus
Chinese Academy of Sciences, Beijing, China .
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
2013 (English)In: Systems & control letters (Print), ISSN 0167-6911, E-ISSN 1872-7956, Vol. 62, no 12, 1196-1202 p.Article in journal (Refereed) 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.

Place, publisher, year, edition, pages
2013. Vol. 62, no 12, 1196-1202 p.
Keyword [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
National Category
Control Engineering
Identifiers
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: diva2:690127
Funder
Knut and Alice Wallenberg FoundationSwedish Research Council
Note

QC 20140122

Available from: 2014-01-22 Created: 2014-01-15 Last updated: 2017-12-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Johansson, Karl Henrik

Search in DiVA

By author/editor
Lou, YouchengShi, GuodongJohansson, Karl Henrik
By organisation
Automatic ControlACCESS Linnaeus Centre
In the same journal
Systems & control letters (Print)
Control Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 141 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