Reactive Power Optimization of Distribution Network Based on Graph Convolutional Network
2021 (English)In: Dianwang Jishu/Power System Technology, ISSN 1000-3673, Vol. 45, no 6, p. 2150-2160Article in journal (Refereed) Published
Abstract [en]
The construction of advanced metering infrastructure and the rapid development of deep learning technology make it possible to quickly find the optimal strategy for reactive power optimization by mining historical data and prior knowledge instead of relying on physical models. Therefore, a method for reactive power optimization based on graph convolutional network (GCN) is proposed. Through representing the topology information between nodes in distribution network with the adjacency matrix, the proposed algorithm can effectively mine the correlation between the node loads, mapping the complex nonlinear relationship between the power equipment status and the load data with the deep graph convolutional architecture. The simulation results show that the accuracy and robustness of the GCN are better than that of the existing data-driven methods such as the convolutional neural network, the multi-layer perceptron and the case-based reasoning. Its solution time is much shorter than the traditional heuristic algorithm, which can meet the real-time demand of the reactive power optimization in distribution networks.
Place, publisher, year, edition, pages
Power System Technology Press , 2021. Vol. 45, no 6, p. 2150-2160
Keywords [en]
Data driven, Deep learning, Distribution network, Graph convolutional network, Reactive power optimization, Advanced metering infrastructures, Case based reasoning, Convolution, Convolutional neural networks, Graph algorithms, Heuristic algorithms, Optimization, Reactive power, Topology, Adjacency matrices, Convolutional networks, Data-driven methods, Learning technology, Multi layer perceptron, Non-linear relationships, Topology information, Multilayer neural networks
National Category
Computer Sciences Computer graphics and computer vision
Identifiers
URN: urn:nbn:se:kth:diva-309940DOI: 10.13335/j.1000-3673.pst.2020.1593Scopus ID: 2-s2.0-85108226959OAI: oai:DiVA.org:kth-309940DiVA, id: diva2:1645915
Note
QC 20220321
2022-03-212022-03-212025-02-01Bibliographically approved