Time Averaging Algorithms with Stopping Rules for Multi‐Agent Consensus with Noisy Measurements |
| |
| Authors: | R Morita T Wada I Masubuchi T Asai Y Fujisaki |
| |
| Affiliation: | 1. Graduate School of Information Science and Technology, Osaka University, Suita, Japan;2. Graduate School of System Informatics, Kobe University, Nada, Japan;3. Graduate School of Engineering, Nagoya University, Nagoya, Japan |
| |
| Abstract: | 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. |
| |
| Keywords: | Multi‐agent system consensus algorithm stochastic approximation stopping rule |
|
|
