.png){kind=icon}
.png){kind=icon}
Return
A Privacy Preserving Distributed Optimization Algorithm for Economic Dispatch Over Time-Varying Directed Networks
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2020.2996198.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The economic dispatch problem (EDP) plays a fundamental and significant role in smart grids. Its purpose is to decide the output power of every generator in smart grids for achieving the minimal generation cost. With advantages in flexibility, robustness, and scalability, it is desirable to apply distributed optimization methods to solve EDPs. In most existing distributed optimization approaches, all generators explicitly exchange their states with neighbors to obtain the optimal solution, which may result in disclosing the privacy information of generators. This problem becomes worse if there are some adversaries aimed at inferring privacy information from the communication network for nefarious purposes. For privacy preservation, a privacy preserving distributed optimization algorithm over time-varying directed communication networks is proposed in this article by adding conditional noises to the exchanged states. It is proved that this proposed algorithm is able to solve the EDP. Moreover, the convergence rate and privacy analysis of the proposed algorithm are also shown in this article. An example is provided to confirm the effectiveness of this proposed algorithm.
Keywords:
Privacy
Optimization
Communication networks
Generators
Convergence
Economics
Smart grids
Distributed optimization
economic dispatch
privacy preservation
smart grids
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
Organization
No organization information available