arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.08458math.OC
收藏

基数约束下不确定分布式非光滑鲁棒资源分配

Distributed Nonsmooth Robust Resource Allocation with Cardinality Constrained Uncertainty

Yue Wei, Shuxin Ding, Hao Fang, Xianlin Zeng, Qingkai Yang, Bin Xin

摘要:

研究了具有基数约束不确定性的分布式非光滑鲁棒资源分配问题。全局目标由局部目标组成,局部目标是凸的但非光滑的。每个智能体被约束在其私有凸集中,并且只具有其对应的局部目标的信息。资源分配条件受基数约束的不确定集约束。利用凸优化的对偶理论,给出了鲁棒资源分配问题的对偶问题。针对这一对偶问题,提出了一种分布式原始-对偶投影算法。在理论上,利用微分包含的稳定性理论,进行了收敛性分析。仿真结果表明,该算法能够引导多智能体系统在满足资源分配条件的情况下达到最优解。最后,一个非平凡的仿真结果表明,所提出的算法的有效性。

英文摘要:

A distributed nonsmooth robust resource allocation problem with cardinality constrained uncertainty is investigated in this paper. The global objective is consisted of local objectives, which are convex but nonsmooth. Each agent is constrained in its private convex set and has only the information of its corresponding local objective. The resource allocation condition is subject to the cardinality constrained uncertainty sets. By employing the duality theory of convex optimization, a dual problem of the robust resource allocation problem is presented. For solving this dual problem, a distributed primal-dual projected algorithm is proposed. Theoretically, the convergence analysis by using stability theory of differential inclusions is conducted. It shows that the algorithm can steer the multi-agent system to satisfy resource allocation condition at the optimal solution. In the end, a nontrivial simulation is shown and the results demonstrate the efficiency of the proposed algorithm.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑