arrow
返回

Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies

delete2023-01-01
delete3
delete
OA
AI
G
Govind Saraswat *
V
Vivek Khatana
S
Sourav Patel
M
Murti V. Salapaka
DOI:10.1109/TNSE.2022.3216286delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this article, we present a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. Prior state of the art has established convergence to the consensus value; however, the asymptotic convergence of these algorithms poses a challenge in practical settings where the response from agents is required in finite time. To this end, we propose a maximum-minimum protocol that propagates the global maximum and minimum values of agent states (while running the consensus algorithm) in the network. This article focuses on establishing that the global maximum and minimum values are strictly monotonic even for a dynamic topology, and they can be used to distributively ascertain the closeness to convergence in finite time. We rigorously show that each node can have access to the global maximum and minimum by running the proposed maximum-minimum protocol to realize a finite-time stopping criterion for the otherwise asymptotic consensus algorithm. The practical utility of the algorithm is illustrated through experiments where each agent is instantiated by a NodeJS socket.io server.
Keyword:
Network topology
Topology
Consensus algorithm
Heuristic algorithms
Switches
Convergence
Automobiles
Distributed consensus
multi-agent systems
network-based computing systems
switching topology

期刊

I
IEEE Transactions on Network Science and Engineering
IF:
7.9
论文数:
2.6K
被引数:
10.0K

机构

N
national renewable energy laboratory - usa
学者数:
3.8K
论文数: 2.8K
被引数: 10
U
united states department of energy (doe)
学者数:
11.3W
论文数: 9.6W
被引数: 246
引用论文

引用论文

Thermal desorption of gases
err1962-07-01
err0
PREAI
errP.A. Redhead
err分享
err收藏
err分享
err收藏
学者 查看更多内容