Asynchronous Decomposition Method for the Coordinated Operation of Virtual Power Plants

Virtual Power Plant (VPP) aggregates and coordinates community-owned renewable distributed generations (DGs) and flexibility resources for participating in power system operation. In this paper, the coordinated operation problem of VPPs and the distribution system operator (DSO) is formulated as min...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems Vol. 38; no. 1; pp. 767 - 782
Main Authors: Wang, Qi, Wu, Wenchuan, Wang, Bin, Wang, Guannan, Xi, Yanna, Liu, Haitao, Wang, Shu, Zhang, Jun
Format: Journal Article
Language:English
Published: New York IEEE 01.01.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:0885-8950, 1558-0679
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Virtual Power Plant (VPP) aggregates and coordinates community-owned renewable distributed generations (DGs) and flexibility resources for participating in power system operation. In this paper, the coordinated operation problem of VPPs and the distribution system operator (DSO) is formulated as minimizing the total operational cost constrained by linearized three-phase power flow equations and operational constraints. To preserve the VPPs' privacy, the DSO needs to coordinate the VPPs in a distributed manner. However, conventional synchronous distributed methods may suffer from communication delays or failures because of the flimsy communication conditions between DSO and VPPs. We propose an asynchronous distributed algorithm that is robust against communication uncertainties. Firstly, a hybrid alternative direction method of multipliers (ADMM) algorithm is developed, which can be applied to convex problems with promising convergence performance. In the hybrid ADMM framework, the delayed or missing data that transmitted from VPPs are compensated by a novel predicting algorithm combining the multi-parameter quadratic programming (MPQP) and autoregressive integrated moving average model (ARIMA). We prove that the proposed algorithm can converge under imperfect communication condition with some mild assumptions. Numerical tests on IEEE 33-bus and IEEE 123-bus systems indicate that the proposed method has more reliable and faster convergence performance than existing asynchronous methods in all cases.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2022.3162329