Convergence of random sleep algorithms for optimal consensus
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
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.
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
IdentifiersURN: urn:nbn:se:kth:diva-139860DOI: 10.1016/j.sysconle.2013.10.001ISI: 000329149400012ScopusID: 2-s2.0-84889068809OAI: oai:DiVA.org:kth-139860DiVA: diva2:690127
FunderKnut and Alice Wallenberg FoundationSwedish Research Council
QC 201401222014-01-222014-01-152014-01-23Bibliographically approved