Convergence of random sleep algorithms for optimal consensus

被引：32

作者：

Lou, Youcheng ^{[1
]}

Shi, Guodong ^{[2
]}

Johansson, Karl Henrik ^{[2
]}

Hong, Yiguang ^{[1
]}

机构：

[1] Chinese Acad Sci, Acad Math & Syst Sci, Key Lab Syst & Control, Beijing 100190, Peoples R China

[2] Royal Inst Technol, Sch Elect Engn, ACCESS Linnaeus Ctr, S-10044 Stockholm, Sweden

来源：

SYSTEMS & CONTROL LETTERS | 2013年 / 62卷 / 12期

基金：

瑞典研究理事会;

关键词：

Multi-agent systems; Random projection; Intersection computation; Optimal consensus; MULTIAGENT SYSTEMS; SUBGRADIENT METHODS; CONVEX-OPTIMIZATION; RANDOM NETWORKS; TOPOLOGIES;

D O I：

10.1016/j.sysconle.2013.10.001

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

080201 [机械制造及其自动化];

摘要：

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. (C) 2013 Elsevier B.V. All rights reserved.

引用

页码：1196 / 1202

页数：7

共 35 条

[1]

[Anonymous], T AM MATH SOC, DOI DOI 10.2307/1990404

[2]

Boyd S., 2004, CONVEX OPTIMIZATION, VFirst, DOI DOI 10.1017/CBO9780511804441

[3]

Chow Y. S., 1997, Probability theory. Independence, interchangeability, martingales, Vthird

[4]

Clarke F. H., 1998, NONSMOOTH ANAL CONTR, V178, DOI 10.1007/b97650

[5]

Deutsch F., 1983, PARAMETRIC OPTIMIZAT, V72, P96

[6]

Godsil C., 2001, Algebraic graph theory

[7]

Gubin L. C., 1967, USSR COMP MATH MATH, V7, P1211

[8]

Agreement over random networks [J].

Hatano, Y ;

Mesbahi, M .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2005, 50 (11) :1867-1872

[9]

Cooperative Convex Optimization in Networked Systems: Augmented Lagrangian Algorithms With Directed Gossip Communication [J].

Jakovetic, Dusan ;

Xavier, Joao ;

Moura, Jose M. F. .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 59 (08) :3889-3902

[10]

Johansson B., 2007, 46 IEEE C DECISION C, P4705

← 1 2 3 4 →