We establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. The...
详细信息
We establish finite time termination algorithms for consensus algorithms based on geometric properties that yield finite-time guarantees, suited for use in high dimension and in the absence of a central authority. These pursuits motivate a new peer to peer convex hull algorithm, which is utilized for one stopping algorithm. Further an alternative lightweight norm based stopping criteria is also developed. The practical utility of the algorithm is illustrated through MATLAB simulations.
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 ...
详细信息
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. Copyright (C) 2020 The Authors.
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 ...
详细信息
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.
暂无评论