论文标题
DTAC-ADMM：用于分布式资源分配的基于延迟的增强共识ADMM的算法
DTAC-ADMM: Delay-Tolerant Augmented Consensus ADMM-based Algorithm for Distributed Resource Allocation
论文作者
论文摘要
延迟是几乎所有现实世界网络应用程序中固有的。在本文中，我们提出了具有延迟通信的多代理网络上的分布式分配策略。每个代理（或节点）的状态代表其在固定金额中分配的资源所占的份额（等于总体需求）。每个节点都在本地更新其状态，以通过接收到的相邻节点的信息优化全局分配成本函数，即使网络上的数据交换在不同的链接上延迟。该更新基于乘数（ADMM）公式的交替方向方法，但要遵守总和耦合约束和本地盒子约束。该解决方案是无衍生化的，可用于一般（不一定是可区分的）凸成本模型。我们将增强共识的概念与无向网络相比，以建模延迟信息交换并进行收敛分析。我们模拟我们的\ textit {delay-colerant}算法
Latency is inherent in almost all real-world networked applications. In this paper, we propose a distributed allocation strategy over multi-agent networks with delayed communications. The state of each agent (or node) represents its share of assigned resources out of a fixed amount (equal to overall demand). Every node locally updates its state toward optimizing a global allocation cost function via received information of its neighbouring nodes even when the data exchange over the network is heterogeneously delayed at different links. The update is based on the alternating direction method of multipliers (ADMM) formulation subject to both sum-preserving coupling-constraint and local box-constraints. The solution is derivative-free and holds for general (not necessarily differentiable) convex cost models. We use the notion of augmented consensus over undirected networks to model delayed information exchange and for convergence analysis. We simulate our \textit{delay-tolerant} algorithm for
