期刊
IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING
卷 10, 期 1, 页码 489-499出版社
IEEE COMPUTER SOC
DOI: 10.1109/TNSE.2022.3216286
关键词
Network topology; Topology; Consensus algorithm; Heuristic algorithms; Switches; Convergence; Automobiles; Distributed consensus; multi-agent systems; network-based computing systems; switching topology
This article presents a finite-time stopping criterion for consensus algorithms in networks with dynamic communication topology. It proposes a maximum-minimum protocol to propagate global maximum and minimum values of agent states, allowing for a distributive determination of convergence in finite time. Experimental results illustrate the practical utility of the algorithm.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据