4.7 Article

Learning to Solve the AC-OPF Using Sensitivity-Informed Deep Neural Networks

Journal

IEEE TRANSACTIONS ON POWER SYSTEMS
Volume 37, Issue 4, Pages 2833-2846

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2021.3127189

Keywords

Training; Sensitivity; Optimization; Power systems; Jacobian matrices; Task analysis; Mathematical models; Sensitivity analysis; data efficiency; optimality conditions; non-linear OPF solvers

Funding

  1. U.S. National Science Foundation [1901134, 2126052, 2128593, TPWRS-00473-2021]
  2. Direct For Computer & Info Scie & Enginr
  3. Division of Computing and Communication Foundations [1901134] Funding Source: National Science Foundation
  4. Directorate For Engineering
  5. Div Of Electrical, Commun & Cyber Sys [2126052, 2128593] Funding Source: National Science Foundation

Ask authors/readers for more resources

Recent works propose the use of deep neural networks to predict optimal power flow solutions in power systems applications. This paper introduces a sensitivity-informed DNN and demonstrates its effectiveness and constraint satisfaction capabilities in optimization problems.
To shift the computational burden from real-time to offline in delay-critical power systems applications, recent works entertain the idea of using a deep neural network (DNN) to predict the solutions of the AC optimal power flow (AC-OPF) once presented load demands. As network topologies may change, training this DNN in a sample-efficient manner becomes a necessity. To improve data efficiency, this work utilizes the fact OPF data are not simple training labels, but constitute the solutions of a parametric optimization problem. We thus advocate training a sensitivity-informed DNN (SI-DNN) to match not only the OPF optimizers, but also their partial derivatives with respect to the OPF parameters (loads). It is shown that the required Jacobian matrices do exist under mild conditions, and can be readily computed from the related primal/dual solutions. The proposed SI-DNN is compatible with a broad range of OPF solvers, including a non-convex quadratically constrained quadratic program (QCQP), its semidefinite program (SDP) relaxation, and MATPOWER; while SI-DNN can be seamlessly integrated in other learning-to-OPF schemes. Numerical tests on three benchmark power systems corroborate the advanced generalization and constraint satisfaction capabilities for the OPF solutions predicted by an SI-DNN over a conventionally trained DNN, especially in low-data setups.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available