论文标题
用于近似统一全球最小共享的分布式方法
A Distributed Methodology for Approximate Uniform Global Minimum Sharing
论文作者
论文摘要
本文处理了分布式最低共享问题：一组决策者通过通过通信网络交换信息来计算分布式和分散方式中一些局部兴趣的最小值。我们提出了一个可调节的近似解决方案，该解决方案在应用中具有至关重要的多种特性。特别是，所提出的解决方案具有良好的权力下放属性，并且可扩展的是，局部变量的数量不会随通信网络的大小或拓扑而增长。此外，将全球和统一（无论是在最初的时间还是在初始条件下）渐近稳定性结果，可将稳定状态提供给可以任意接近所寻求最小值的稳态。相对于初始时间，可以以失去均匀性的价格回收确切的渐近收敛性。
The paper deals with the distributed minimum sharing problem: a set of decision-makers compute the minimum of some local quantities of interest in a distributed and decentralized way by exchanging information through a communication network. We propose an adjustable approximate solution which enjoys several properties of crucial importance in applications. In particular, the proposed solution has good decentralization properties and it is scalable in that the number of local variables does not grow with the size or topology of the communication network. Moreover, a global and uniform (both in the initial time and in the initial conditions) asymptotic stability result is provided towards a steady state which can be made arbitrarily close to the sought minimum. Exact asymptotic convergence can be recovered at the price of losing uniformity with respect to the initial time.
