A fully distributed approach to resource allocation problem under directed and switching topologies
A fully distributed approach to resource allocation problem under directed and switching topologies
复制标题
DOI：
10.1109/ascc.2015.7244581
复制
发表时间：
2015-05
期刊：
影响因子：
--
通讯作者：
Yun Xu;Kai Cai;Tingrui Han;Zhiyun Lin
中科院分区：
文献类型：
--
作者：
Yun Xu;Kai Cai;Tingrui Han;Zhiyun Lin
本文研究了具有定向和时变通信拓扑结构的多代理网络的分布式资源分配问题。假设资源总量是一个常数，由等式约束表示，分配给每个代理的资源量受到不等式约束，称为状态约束。然后，我们的目标是以完全分布式的方式解决它。通过引入一个剩余变量来存储每个Agent的状态约束下的每一步的剩余，提出了一种分布式迭代算法来求解状态约束下的分布式资源分配问题.结果表明，该算法是全局收敛的通信图是联合强连通的。该算法最有前途的特点是，每个代理在迭代中使用的参数只依赖于本地知识的入度和出度的本身，但算法全局收敛的时变通信网络。
This paper addresses the distributed resource allocation problem for a network of multiple agents with directed and time-varying communication topologies. Suppose that the total amount of resources is a constant, represented by an equality constraint, and that the amount of resources allocated to each agent is subject to an inequality constraint, called the state constraint. We then aim to solve it in a fully distributed manner. By introducing a surplus variable to store the residue at each step due to the state constraint on each agent, a distributed iteration algorithm is proposed to solve the distributed resource allocation problem subject to the state constraints. It is shown that the algorithm converges globally provided that the communication graph is jointly strongly connected. The most promising characteristic of the algorithm is that the parameters used in the iteration by each agent depend only on local knowledge of the in-degree and out-degree of itself, yet the algorithm converges globally for a time-varying communication network.