.png){kind=icon}
Return
A distributed algorithm with dynamic event-triggered mechanism for resource allocation problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10586-024-04693-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Distributed algorithms have continued to attract attention due to their decentralized nature, strong robustness, and ease of scalability. However, as the scale of networks expands, the implementation of distributed algorithms also increases the demand for communication resources. In this study, we introduce a distributed algorithm incorporating a dynamic event-triggered communication mechanism to address the widespread issue of resource allocation in numerous engineering disciplines. The proposed algorithm significantly reduces communication frequency while maintaining competitive convergence speed. We prove that under the condition of strongly convex and smoothness local cost functions, by selecting appropriate parameters, the algorithm can attain linear convergence. The efficacy and benefits of our method are confirmed through several simulation experiments.
Keywords:
Resource allocation
Distributed algorithm
Dynamic event-triggered mechanism
Linear convergence
Journal
C
IF:
4.1
Papers:
5.1K
Citations:
7.5K
Organization
Cited Papers
ShareSaveShareSaveDistributed optimization of first-order discrete-time multi-agent systems with event-triggered communication.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
ShareSaveShareSaveDEFENESTRATION OF HEPATIC SINUSOIDS AS A CAUSE OF HYPERLIPOPROTEINAEMIA IN ALCOHOLICSThe Lancet
The LancetIF0
PREAI
ShareSaveShareSave
View more