We present insights into the geometry of the ratio consensus algorithm that lead to finite time distributed stopping criteria for the algorithm in higher dimension. In particular we show that the polytopes of network states indexed by time form a nested sequence. This monotonicity allows the construction of a distributed algorithm that terminates in finite time when applied to consensus problems in any dimension and guarantees the convergence of the consensus algorithm in norm, within any given tolerance. The practical utility of the algorithm is illustrated through MATLAB simulations.
Bibliographical noteFunding Information:
This work is supported by Advanced Research Projects Agency-Energy OPEN through the project titled "Rapidly Viable Sustained Grid" via grant no. DE-AR0001016.
© 2020 Elsevier B.V.. All rights reserved.
- Convex hull
- Distributed consensus
- High-dimensional state algorithms
- Multi-agent systems
- Network-based computing systems