Distributed Online Resource Allocation in Open Networks

• 成果类型: Article
• 署名作者: Liu, Yuxuan; Ye, Maojiao; Ding, Lei; Xie, Lihua; Xu, Shengyuan
• 署名单位: Nanjing University of Science & Technology; Nanjing University of Posts & Telecommunications; Nanjing University of Posts & Telecommunications; Nanjing University of Posts & Telecommunications; Nanyang Technological University
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2024.3419818
• 发表日期: 2024
• 页码: 8876-8883
• 关键词: Resource management; Heuristic algorithms; Couplings; COSTS; cost function; Wireless communication; Upper bound; Distributed online optimization; resource allocation; open network

摘要

This article considers the problem of online resource allocation in an open network where the engaged agents are allowed to join and leave freely. To deal with network openness, each agent possesses two auxiliary variables, utilized to store the sum of gradients and record the number of stored gradients, respectively. Based on the stored information and primal-dual techniques, a distributed online optimization algorithm is constructed for agents to achieve the minimization of their total cost while satisfying local box constraints and a global balancing equality constraint. In the developed algorithm, the agents update their decision variables and dual variables via the projected gradient method and dual averaging method, respectively. A dynamic regret and an accumulation of constraint violation are introduced as performance indices of evaluating the established algorithm. Moreover, if the number of departing agents at each iteration is no larger than the connectivity degree of the communication graph, the upper bounds of both indices are obtained which grow sublinearly under suitable step-sizes, indicating that the proposed algorithm performs well. A simulation case study on economic dispatch in smart grids is given to verify the effectiveness of the developed algorithm.