.png){kind=icon}
.png){kind=icon}
Return
Distributed Fixed-Time Optimization in Economic Dispatch Over Directed Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2020.3010282.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A distributed algorithm is presented in this article under directed communication networks, which is used to solve the economic dispatch problem in fixed time in smart grid systems. A new globally fixed-time stability theory (Lemma 3) is first given in this article, which contains a new upper bound for the estimation of the settling time. Moreover, the fixed-time convergence for the proposed algorithm is rigorously proved with the aid of convex optimization theory, the new lemma, and Lyapunov stability theory under the strongly connected and weight-balanced network topology. Finally, numerical simulations show the effectiveness and advantages of the distributed fixed-time optimization algorithm.
Keywords:
Optimization
Economics
Smart grids
Convex functions
Informatics
Communication networks
Distributed algorithms
Convex optimization
directed network
distributed algorithm
equality constraint
fixed-time convergence
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.9
Papers:
8.3K
Citations:
6.0W