Skip to main content

A Meta-Learning Approach to the Optimal Power Flow Problem Under Topology Reconfigurations

Author(s): Chen, Yexiang; Lakshminarayana, Subhash; Maple, Carsten; Poor, H Vincent

To refer to this page use:
Abstract: Recently there has been a surge of interest in adopting deep neural networks (DNNs) for solving the optimal power flow (OPF) problem in power systems. Computing optimal generation dispatch decisions using a trained DNN takes significantly less time when compared to conventional optimization solvers. However, a major drawback of existing work is that the machine learning models are trained for a specific system topology. Hence, the DNN predictions are only useful as long as the system topology remains unchanged. Changes to the system topology (initiated by the system operator) would require retraining the DNN, which incurs significant training overhead and requires an extensive amount of training data (corresponding to the new system topology). To overcome this drawback, we propose a DNN-based OPF predictor that is trained using a meta-learning (MTL) approach. The key idea behind this approach is to find a common initialization vector that enables fast training for any system topology. The developed OPF-predictor is validated through simulations using benchmark IEEE bus systems. The results show that the MTL approach achieves significant training speed-ups and requires only a few gradient steps with a few data samples to achieve high OPF prediction accuracy and outperforms other pretraining techniques.
Publication Date: 4-Jan-2022
Citation: Chen, Yexiang, Lakshminarayana, Subhash, Maple, Carsten, Poor, H Vincent. (2022). A Meta-Learning Approach to the Optimal Power Flow Problem Under Topology Reconfigurations. IEEE Open Access Journal of Power and Energy, 9 (109 - 120. doi:10.1109/oajpe.2022.3140314
DOI: doi:10.1109/oajpe.2022.3140314
EISSN: 2687-7910
Pages: 109 - 120
Type of Material: Journal Article
Journal/Proceeding Title: IEEE Open Access Journal of Power and Energy
Version: Final published version. This is an open access article.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.