.png){kind=icon}
.png){kind=icon}
Return
Distributed Finite-Time Termination for Consensus Algorithm in Switching Topologies
.png){kind=icon}
OA
AI
DOI：10.1109/TNSE.2022.3216286.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Network topology
Topology
Consensus algorithm
Heuristic algorithms
Switches
Convergence
Automobiles
Distributed consensus
multi-agent systems
network-based computing systems
switching topology
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K