返回
Distributed Event-Triggered Algorithm Designs for Resource Allocation Problems via a Universal Scalar Function-Based Analysis
DOI:10.1109/TCYB.2022.3219449.png)
摘要
En 中文
In this article, we are concerned with distributed algorithm designs for resource allocation problems via event-triggered communication. The target is to search an optimal resource allocation scheme such that the summation of n(>1) objective functions is minimized. Due to communication efficiency and privacy concerns, distributed algorithms with event-triggered communications are proposed in this article. The communication is only permitted or triggered if variation of gradient of the local objective function exceeds a threshold. By constructing a novel technical lemma and a universal scalar function, the convergence and linear convergence rates are established under some mild assumptions. Extensive numerical experiments on the IEEE 118-bus power system demonstrate that: Compared to the periodic algorithms, such as ADMM and Mirror-P-EXTRA, the proposed algorithms not only remarkably reduce the communication times but also have competitive convergence speed. The latter is striking that it implies there exist useless communications in the periodic algorithms that are censored by the proposed event-triggered strategy.
Keyword:
Distributed optimization
event-triggered communication
resource allocation
scalar function
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Distributed event-triggered algorithms for a class of convex optimization problems over directed networks有向网络上一类凸优化问题的分布式事件触发算法
AUTOMATICA
IF5.9
Distributed Continuous-Time Algorithms for Resource Allocation Problems Over Weight-Balanced Digraphs权重平衡有向图上资源分配问题的分布式连续时间算法
Event-Triggered Communication and Data Rate Constraint for Distributed Optimization of Multiagent Systems多智能体系统分布式优化的事件触发通信和数据速率约束
Decentralized estimation of Laplacian eigenvalues in multi-agent systems多智能体系统中Laplacian特征值的分散估计
AUTOMATICA
IF5.9

