🤖 AI Summary
Newton–Raphson (NR) power flow computation often suffers from divergence or slow convergence under poor initial voltage estimates or in systems with high renewable energy penetration. To address this, this paper proposes a quantum-enhanced reinforcement learning (RL) method for optimal initialization of voltage magnitudes and angles. Specifically, the voltage initialization problem is formulated as an unconstrained binary quadratic optimization task, and a system-specific Hamiltonian model is constructed. By integrating RL with quantum/digital annealers (Ising machines), the approach efficiently explores large-scale action spaces to identify optimal voltage adjustment policies. The proposed method significantly improves the convergence reliability and speed of the NR method, substantially reducing the number of iterations required. Moreover, it demonstrates exceptional robustness across diverse extreme operating conditions—including severe load imbalances, high PV/wind integration, and critical contingency scenarios—while maintaining computational tractability for practical power system applications.
📝 Abstract
The Newton-Raphson (NR) method is widely used for solving power flow (PF) equations due to its quadratic convergence. However, its performance deteriorates under poor initialization or extreme operating scenarios, e.g., high levels of renewable energy penetration. Traditional NR initialization strategies often fail to address these challenges, resulting in slow convergence or even divergence. We propose the use of reinforcement learning (RL) to optimize the initialization of NR, and introduce a novel quantum-enhanced RL environment update mechanism to mitigate the significant computational cost of evaluating power system states over a combinatorially large action space at each RL timestep by formulating the voltage adjustment task as a quadratic unconstrained binary optimization problem. Specifically, quantum/digital annealers are integrated into the RL environment update to evaluate state transitions using a problem Hamiltonian designed for PF. Results demonstrate significant improvements in convergence speed, a reduction in NR iteration counts, and enhanced robustness under different operating conditions.