Scholarlink

<p>A gossip-based economic dispatch (ED) algorithm for microgrids is presented in this paper, designed to cope with communication link failures and enable smooth switching of microgrid operation modes. The algorithm is supported by the Push-Pull architecture, which allows its application to direct graphs and relaxes the initial conditions compared to many existing ED algorithms. Under an asynchronous communication network, where only one directed edge is activated at each moment, it has been shown that ED can be achieved with probability 1, provided that the communication graph is strongly connected. Similarly, in a synchronous communication network, where each directed communication link is activated at each moment with a certain probability, ED is also achieved with probability 1 under the condition that the communication graph is strongly connected. This demonstrates that optimal consensus is reached under randomly switched communication networks as long as the expectation of communication graphs is strongly connected, a condition that is less stringent than the <i>B</i>-strongly connected requirement found in many other studies. The algorithm’s use of a non-decreasing variable step size enables a transition from a sub-linear convergence rate, associated with a diminishing step size, to a linear convergence rate. This also lays the groundwork for future improvements in convergence rate through online step size optimization based on the communication topology. Finally, the algorithm’s effectiveness and its potential application to anti-collusion are demonstrated through simulations.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Gossip-based algorithm for economic dispatch of microgrids integrating isolated and grid-connected modes

  • 期刊论文

  • 发表日期：

    2025年2月8日

查看全文
  • Yanmeng Zhang,
  • Yalin Zhang,
  • Zhongxin Liu,
  • Zengqiang Chen

摘要

A gossip-based economic dispatch (ED) algorithm for microgrids is presented in this paper, designed to cope with communication link failures and enable smooth switching of microgrid operation modes. The algorithm is supported by the Push-Pull architecture, which allows its application to direct graphs and relaxes the initial conditions compared to many existing ED algorithms. Under an asynchronous communication network, where only one directed edge is activated at each moment, it has been shown that ED can be achieved with probability 1, provided that the communication graph is strongly connected. Similarly, in a synchronous communication network, where each directed communication link is activated at each moment with a certain probability, ED is also achieved with probability 1 under the condition that the communication graph is strongly connected. This demonstrates that optimal consensus is reached under randomly switched communication networks as long as the expectation of communication graphs is strongly connected, a condition that is less stringent than the B-strongly connected requirement found in many other studies. The algorithm’s use of a non-decreasing variable step size enables a transition from a sub-linear convergence rate, associated with a diminishing step size, to a linear convergence rate. This also lays the groundwork for future improvements in convergence rate through online step size optimization based on the communication topology. Finally, the algorithm’s effectiveness and its potential application to anti-collusion are demonstrated through simulations.