Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies
【Author】 Saraswat, Govind; Khatana, Vivek; Patel, Sourav; Salapaka, Murti V.
【Source】IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING
【影响因子】5.033
【Abstract】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.
【Keywords】Network topology; Topology; Consensus algorithm; Heuristic algorithms; Switches; Convergence; Automobiles; Distributed consensus; multi-agent systems; network-based computing systems; switching topology
【发表时间】2023 1-Jan
【收录时间】2023-04-20
【文献类型】理论模型
【主题类别】
区块链应用-实体经济-通信领域
评论