Distributed Continuous-Time Algorithm for Economic Dispatch Problem Over Switching Communication Topology

被引:16
|
作者
Yan, Jiaojiao [1 ]
Cao, Jinde [2 ,3 ]
Cao, Yichao [4 ]
机构
[1] Southeast Univ, Sch Math, Jiangsu Prov Key Lab Networked Collect Intelligen, Nanjing 210096, Peoples R China
[2] Southeast Univ, Sch Math, Nanjing 210096, Peoples R China
[3] Yonsei Univ, Yonsei Frontier Lab, Seoul 03722, South Korea
[4] Southeast Univ, Key Lab Measurement & Control Complex Syst Engn, Minist Educ, Sch Automat, Nanjing 210096, Peoples R China
基金
中国国家自然科学基金;
关键词
Power generation; Generators; Smart grids; Privacy; Switches; Network topology; Topology; Economic dispatch; initialization-free; privacy-guaranteed; sign of relative state; gradient measurement noise; distributed algorithm; RESOURCE-ALLOCATION; COORDINATION;
D O I
10.1109/TCSII.2020.3041504
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This brief mainly studies the economic dispatch problem (EDP) in smart grid. The purpose of this problem is to minimize the total power generation cost under the conditions of balance between supply and demand and power generation capacity constraints. A distributed continuous-time solver is proposed, which only requires the sign of relative dual variable information between neighbors, which ensures the privacy of the generators. In addition, the algorithm does not require initialization and allows online changes of network topology, load, etc. It is theoretically proved that the algorithm achieve the optimal scheduling of smart grid over undirected switching graphs under certain conditions. In the presence of gradient measurement noise, the variation form of the algorithm which converges in the mean square sense is given. Finally, the simulation example illustrates the validness of the algorithm.
引用
收藏
页码:2002 / 2006
页数:5
相关论文
共 50 条
  • [1] Distributed Privacy Preserving Algorithm for Economic Dispatch Over Time-Varying Communication
    Zhao, Duqiao
    Liu, Ding
    Liu, Linxiong
    [J]. IEEE TRANSACTIONS ON POWER SYSTEMS, 2024, 39 (01) : 643 - 657
  • [2] A Distributed Convex Optimization Algorithm with Continuous-Time Communication
    Jahvani, Mohammad
    Guay, Martin
    [J]. 2022 IEEE INTERNATIONAL SYMPOSIUM ON ADVANCED CONTROL OF INDUSTRIAL PROCESSES (ADCONIP 2022), 2022, : 313 - 318
  • [3] A Finite-time Distributed Algorithm for Economic Dispatch Problem
    Lei Yunjiao
    Chen Gang
    [J]. 2015 34TH CHINESE CONTROL CONFERENCE (CCC), 2015, : 2704 - 2709
  • [4] Distributed Event-based Algorithm for Economic Dispatch Problem over Digraph with Time delays
    Zhao, Zhongyuan
    Chen, Gang
    [J]. 2018 15TH INTERNATIONAL CONFERENCE ON CONTROL, AUTOMATION, ROBOTICS AND VISION (ICARCV), 2018, : 77 - 82
  • [5] Distributed Optimization Over Directed Graphs with Continuous-Time Algorithm
    Jia, Wenwen
    Qin, Sitian
    [J]. PROCEEDINGS OF THE 38TH CHINESE CONTROL CONFERENCE (CCC), 2019, : 1911 - 1916
  • [6] Distributed continuous-time algorithm for a general nonsmooth monotropic optimization problem
    Li, Xiuxian
    Xie, Lihua
    Hong, Yiguang
    [J]. INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL, 2019, 29 (10) : 3252 - 3266
  • [7] An efficient distributed algorithm for economic dispatch considering communication asynchrony and time delays
    Wang, Zheng
    Chen, Guo
    Li, Huaqing
    [J]. Energy Conversion and Economics, 2022, 3 (04): : 214 - 226
  • [8] Continuous-time distributed Nash strategy over switching topologies with gain adaptation
    Dong, Hangning
    Li, Jianqing
    Li, Chaoyong
    Qi, Donglian
    [J]. Systems and Control Letters, 2021, 153
  • [9] Continuous-Time Algorithm For Distributed Constrained Optimization Over Directed Graphs
    Yang, Qiang
    Chen, Gang
    Ren, Jianghong
    [J]. 2019 IEEE 15TH INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA), 2019, : 1020 - 1025
  • [10] Continuous-time distributed Nash strategy over switching topologies with gain adaptation
    Dong, Hangning
    Li, Jianqing
    Li, Chaoyong
    Qi, Donglian
    [J]. SYSTEMS & CONTROL LETTERS, 2021, 153