A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays

被引：207

作者：

Yang, Tao ^{[1
]}

Lu, Jie ^{[2
]}

Wu, Di ^{[3
]}

Wu, Junfeng ^{[4
]}

Shi, Guodong ^{[5
]}

Meng, Ziyang ^{[6
,7
]}

Johansson, Karl Henrik ^{[4
]}

机构：

[1] Univ North Texas, Dept Elect Engn, Denton, TX 76203 USA

[2] ShanghaiTech Univ, Sch Informat Sci & Technol, Shanghai 200031, Peoples R China

[3] Pacific Northwest Natl Lab, Richland, WA 99352 USA

[4] Royal Inst Technol, Sch Elect Engn, ACCESS Linnaeus Ctr, S-10044 Stockholm, Sweden

[5] Australian Natl Univ, Res Sch Engn, Canberra, ACT 0200, Australia

[6] Tsinghua Univ, Dept Precis Instruments, Beijing 100084, Peoples R China

[7] Tsinghua Univ, State Key Lab Precis Measurement Technol & Instru, Beijing 100084, Peoples R China

来源：

IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS | 2017年 / 64卷 / 06期

基金：

瑞典研究理事会; 中国国家自然科学基金; 上海市自然科学基金;

关键词：

Distributed algorithm; economic dispatch; gradient push-sum method; time-varying delays; time-varying networks; MULTIAGENT SYSTEMS; CONSENSUS; OPTIMIZATION; TOPOLOGY;

D O I：

10.1109/TIE.2016.2617832

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In power system operation, the economic dispatch problem (EDP) aims to minimize the total generation cost while meeting the demand and satisfying generator capacity limits. This paper proposes an algorithm based on the gradient push-sum method to solve the EDP in a distributed manner over communication networks potentially with time-varying topologies and communication delays. This paper shows that the proposed algorithm is guaranteed to solve the EDP if the time-varying directed communication network is uniformly jointly strongly connected. Moreover, the proposed algorithm is also able to handle arbitrarily large but bounded time-varying delays on communication links. Numerical simulations are used to illustrate and validate the proposed algorithm.

引用

页码：5095 / 5106

页数：12

共 35 条

[1]

[Anonymous], P IEEE POW EN SOC GE

[2]

[Anonymous], GRADUATE TEXTS MATH

[3]

[Anonymous], P IEEE POW EN SOC GE

[4] Control: A perspective [J].

Astrom, Karl J. ;

Kumar, P. R. .

AUTOMATICA, 2014, 50 (01) :3-43

[5]

Bertsekas D., 2003, Convex analysis and optimization

[6]

Bertsekas D. P., 1999, Nonlinear Programming

[7] An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination [J].

Cao, Yongcan ;

Yu, Wenwu ;

Ren, Wei ;

Chen, Guanrong .

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2013, 9 (01) :427-438

[8] Distributed Finite-Time Average Consensus in Digraphs in the Presence of Time Delays [J].

Charalambous, Themistoklis ;

Yuan, Ye ;

Yang, Tao ;

Pan, Wei ;

Hadjicostis, Christoforos N. ;

Johansson, Mikael .

IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2015, 2 (04) :370-381

[9]

Domínguez-García AD, 2012, IEEE DECIS CONTR P, P3688, DOI 10.1109/CDC.2012.6426665

[10]

Domínguez-García AD, 2011, IEEE DECIS CONTR P, P2124, DOI 10.1109/CDC.2011.6160462

← 1 2 3 4 →