A Hybrid Data-Driven Method for Fast Solution of Security-Constrained Optimal Power Flow
Ziming Yan, Yan Xu
Abstract
This paper proposes a hybrid data-driven method for fast solutions of preventive security-constrained optimal power flow (SCOPF) of power systems. The proposed method formulates the SCOPF problem as constraints-satisfying training of a deep reinforcement learning (DRL) agent, where the action-value function of DRL is augmented by contingency security constraints. In the training process, the proposed method hybridizes the primal-dual deep deterministic policy gradient (PD-DDPG) and the classic SCOPF model. Instead of building reward critic networks and cost critic networks via interacting with the environment (i.e., power flow equations), the actor gradients are approximated by solving KKT conditions of the <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Lagrangian</i> . Finally, with the formulated sparse Jacobians of constraints and sparse Hessians of Lagrangians, the interior point method is incorporated in PD-DDPG to derive the parameters updating rule of the DRL agent. Numerical tests are carried out on a modified IEEE 57-bus system and a modified IEEE 300-bus system for critical contingencies. The results show that the well-trained DRL agent can rapidly (real-time) obtain high-quality SCOPF solutions that satisfy the security constraints.