论文标题
使用屏障功能分布式安全资源分配
Distributed Safe Resource Allocation using Barrier Functions
论文作者
论文摘要
资源分配在许多网络系统(例如智能电网,通信网络和城市运输系统)中起着核心作用。在这些系统中,许多约束具有物理含义,并且具有可行分配通常对于避免系统崩溃至关重要。因此,具有渐近可行性保证的算法通常不足,因为对于无限次数的算法运行算法是不切实际的。本文提出了一种基于屏障功能的安全资源分配的分布式可行方法(DFM)。在DFM中,每个迭代都是可行的,因此可以安全实施。我们证明,在轻度条件下,DFM会收敛到最佳解决方案的任意小社区。数值实验证明了DFM的竞争性能。
Resource allocation plays a central role in many networked systems such as smart grids, communication networks and urban transportation systems. In these systems, many constraints have physical meaning and having feasible allocation is often vital to avoid system breakdown. Hence, algorithms with asymptotic feasibility guarantees are often insufficient since it is impractical to run algorithms for an infinite number of rounds. This paper proposes a distributed feasible method (DFM) for safe resource allocation based on barrier functions. In DFM, every iterate is feasible and thus safe to implement. We prove that under mild conditions, DFM converges to an arbitrarily small neighbourhood of the optimal solution. Numerical experiments demonstrate the competitive performance of DFM.