Distributed Fixed-Time Optimization in Economic Dispatch Over Directed Networks

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 <xref ref-type="lemma" rid="lemma5">3 ) is...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on industrial informatics Jg. 17; H. 5; S. 3011 - 3019
Hauptverfasser: Dai, Hao, Jia, Jinping, Yan, Li, Fang, Xinpeng, Chen, Weisheng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.05.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Communication networks
Computational geometry
Convex functions
Convex optimization
Convexity
directed network
distributed algorithm
Distributed algorithms
Economics
equality constraint
fixed-time convergence
Informatics
Network topologies
Optimization
Smart grid
Smart grids
Stability
Upper bounds
ISSN:1551-3203, 1941-0050
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 <xref ref-type="lemma" rid="lemma5">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.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1551-3203
1941-0050
DOI:10.1109/TII.2020.3010282