标题： 分布式约束耦合资源分配：随时可行性与违反鲁棒性 显示英文标题

标题： Distributed Constraint-coupled Resource Allocation: Anytime Feasibility and Violation Robustness

摘要： 本文考虑了具有耦合约束的实时系统的分布式资源分配问题（DRAPs）。 基于原始对偶方法，我们通过使用控制屏障函数合成一个安全反馈控制器来保证约束满足，从而采用控制视角进行优化算法设计。 在此基础上，提出了一种分布式随时可行的资源分配（DanyRA）算法。 结果表明，DanyRA算法在所有时间步长上都能保证耦合不等式约束的可行性的同时，收敛到DRAPs的精确最优解。 考虑到约束违反可能来自潜在的外部干扰，引入了一个具有最小缓冲区的虚拟队列，在预定义截止时间前恢复约束满足性。 我们分析了收敛精度与违反鲁棒性之间的权衡，以维持或恢复可行性。 DanyRA算法进一步扩展以解决具有耦合等式约束的DRAPs，并理论上的建立了其线性收敛速率。 最后，提供了一个数值示例进行验证。 显示英文摘要

摘要： This paper considers distributed resource allocation problems (DRAPs) with a coupled constraint for real-time systems. Based on primal-dual methods, we adopt a control perspective for optimization algorithm design by synthesizing a safe feedback controller using control barrier functions to enforce constraint satisfaction. On this basis, a distributed anytime-feasible resource allocation (DanyRA) algorithm is proposed. It is shown that DanyRA algorithm converges to the exact optimal solution of DRAPs while ensuring feasibility of the coupled inequality constraint at all time steps. Considering constraint violation arises from potential external interferences, a virtual queue with minimum buffer is incorporated to restore the constraint satisfaction before the pre-defined deadlines. We characterize the trade-off between convergence accuracy and violation robustness for maintaining or recovering feasibility. DanyRA algorithm is further extended to address DRAPs with a coupled equality constraint, and its linear convergence rate is theoretically established. Finally, a numerical example is provided for verification.