Return
Distributed Optimization for Resource Allocation Problems Under Large Delays
DOI:10.1109/TIE.2019.2891406.png)
Abstract
En 中文
In this paper, a distributed resource allocation problem is investigated based on a continuous-time algorithm in the presence of time-varying communication delays. The considered delays are allowed to take both large and small delay values in an alternating manner. The small delays refer to a class of delays that guarantee the exponential convergence to the optimal solution; otherwise, they are called large delays. The existence of large delays may affect the behavior of the optimal allocation solution, and the existing algorithms with delays may not be applicable to this kind of large delays. To address large delay cases, a switched algorithm is first proposed based on switching techniques, and then, such an algorithm is modeled as switched delay systems. Second, by adopting the Lyapunov functional theory, the upper bound of delays is first derived to guarantee the exponential convergence to the optimal solution under small delays, and then, a delay-dependent sufficient condition is obtained to ensure exponential convergence of the proposed algorithm based on some restrictions on large delays. Finally, we adopt an IEEE 118-bus practical example to show the effectiveness of the proposed algorithm.
Keywords:
Distributed optimization
large delays
Lyapunov functionals
resource allocation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.2
Papers:
1.8W
Citations:
9.8W
Organization
Cited Papers
Initialization-free distributed coordination for economic dispatch under varying loads and generator commitment
AUTOMATICA
IF5.9
Bilateral control of uncertain telerobotic systems using iterative learning control: Design and stability analysis
ACTA ASTRONAUTICA
IF3.4

