A hard-constrained NN learning framework for rapidly restoring AC-OPF from DC-OPF

TL;DR

This paper introduces a hard-constrained neural network framework that rapidly restores AC-OPF solutions from DC-OPF solutions with high feasibility and near-optimality, significantly reducing computation time in power system operations.

Contribution

The paper presents a novel unsupervised learning approach with a differentiable optimization layer for fast, feasible AC-OPF solution recovery without ground-truth data, improving speed and accuracy.

Findings

Achieves 40x speedup over traditional solvers.

Maintains average constraint violation around 10^-4.

Attains sub-1% optimality gap.

Abstract

This paper proposes a hard-constrained unsupervised learning framework for rapidly solving the non-linear and non-convex AC optimal power flow (AC-OPF) problem in real-time operation. Without requiring ground-truth AC-OPF solutions, feasibility and optimality are ensured through a properly designed learning environment and training loss. Inspired by residual learning, the neural network (NN) learns the correction mapping from the DC-OPF solution to the active power setpoints of the generators through re-dispatch. A subsequent optimization model is utilized to restore the optimal AC-OPF solution, and the resulting projection difference is employed as the training loss. A replay buffer is utilized to enhance learning efficiency by fully leveraging past data pairs. The optimization model is cast as a differentiable optimization layer, where the gradient is derived by applying the implicit function theorem to the KKT conditions at the optimal solution. Tested on IEEE-118 and PEGASE-9241 bus systems, numerical results demonstrate that the proposed NN can obtain strictly feasible and near-optimal solutions with reduced computational time compared to conventional optimization solvers. In addition, aided by the updated DC-OPF solution under varying topologies, the trained NN, together with the PF solver, can rapidly find the corresponding AC solution. The proposed method achieves a $40\times$ time speedup, while maintaining an average constraint violation on the order of $10^{-4}$ and an optimization gap below $1\%$.