TIME AVERAGING ALGORITHMS WITH STOPPING RULES FOR MULTI-AGENT CONSENSUS WITH NOISY MEASUREMENTS

被引：4

作者：

Morita, R. ^{[1
,2
]}

Wada, T. ^{[1
]}

Masubuchi, I. ^{[3
]}

Asai, T. ^{[4
]}

Fujisaki, Y. ^{[1
]}

机构：

[1] Osaka Univ, Grad Sch Informat Sci & Technol, 1-5 Yamadaoka, Suita, Osaka 5650871, Japan

[2] Gifu Univ, Fac Engn, 1-1 Yanagito, Gifu 5011193, Japan

[3] Kobe Univ, Grad Sch Syst Informat, Nada Ku, 1-1 Rokkodai, Kobe, Hyogo 6578501, Japan

[4] Nagoya Univ, Grad Sch Engn, Chikusa Ku, Nagoya, Aichi 4648603, Japan

来源：

ASIAN JOURNAL OF CONTROL | 2016年 / 18卷 / 06期

关键词：

Multi-agent system; consensus algorithm; stochastic approximation; stopping rule; AD-HOC WSNS; STOCHASTIC-APPROXIMATION; DISTRIBUTED ESTIMATION; SENSOR NETWORKS; SYSTEMS; AGENTS; LINKS;

D O I：

10.1002/asjc.1349

中图分类号：

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

学科分类号：

0812 ;

摘要：

A time averaging technique is introduced to consensus algorithms in networked multi-agent systems under a noisy environment. Each agent communicates with its neighboring agents via a constant gain, while the time averaging states of the agents are considered as the values for agreement. The variation of the time averaging states then is evaluated at a specific number of iterations, where the number is given explicitly in terms of parameters related to the consensus accuracy and its probabilistic guarantee. This result establishes a rigorous stopping rule for the multi-agent consensus with noisy measurements. Several results on this type of stopping rules are provided for undirected, directed, and time-varying communication graphs. These theoretical results are illustrated through numerical examples.

引用

页码：1969 / 1982

页数：14

共 28 条

[1]

Bertsekas Dimitri, 2015, Parallel and Distributed Computation: Numerical Methods

[2] Performance of a Distributed Stochastic Approximation Algorithm [J].