Source-linked AI summary
Learning Warm-Start Points for AC Optimal Power Flow
Kyri Baker
TL;DR
ACOPF solvers can struggle with convergence, and common starting points may be poor or costly to obtain. This paper trains a multi-target Random Forest to predict voltage and generation from loads and uses its predictions as warm starts. On the considered networks, learned starts reduce convergence time relative to flat and DC starts, with benefits depending on the solver.
Problem
Nonconvex ACOPF methods may fail to converge, while flat, convex-approximation, and prior-timestep starts have limitations.
Source: §1.1 · p. 2Method
A multi-target Random Forest trained on prior ACOPF solutions predicts voltage and generation from network loads for use as solver warm starts.
Source: §1.2 · p. 2, §2.2 · p. 3Results
In the considered networks, learned warm starts converged faster than DC or flat starts, but overall benefits were solver-dependent.
Source: §4 · p. 5Takeaways & Limitations
Predicted voltages and generation show promise for quickly finding approximate ACOPF solutions, although learned starts generally remain infeasible.
Source: §4 · p. 5No sensitivity analysis was performed on training-set size, leaving its effect on performance untested.
Source: §4 · p. 6
Abstract
from arXiv · showhide
A large amount of data has been generated by grid operators solving AC optimal power flow (ACOPF) throughout the years, and we explore how leveraging this data can be used to help solve future ACOPF problems. We use this data to train a Random Forest to predict solutions of future ACOPF problems. To preserve correlations and relationships between predicted variables, we utilize a multi-target approach to learn approximate voltage and generation solutions to ACOPF problems directly by only using network loads, without the knowledge of other network parameters or the system topology. We explore the benefits of using the learned solution as an intelligent warm start point for solving the ACOPF, and the proposed framework is evaluated numerically using multiple IEEE test networks. The benefit of using learned ACOPF solutions is shown to be solver and network dependent, but shows promise for quickly finding approximate solutions to the ACOPF problem.
1. INTRODUCTION AND MOTIVATION
Repeated ACOPF solves create historical data that could support learned solutions, while existing initial-point strategies can be poor or costly. The paper explores learning approximate ACOPF solutions and using them to initialize future solves.
1. INTRODUCTION AND MOTIVATION
- Grid operators solve ACOPF repeatedly, creating historical data that the paper proposes leveraging to estimate future solutions.The motivation draws on earlier use of operator-generated data for power-system state estimation.Source: §1 · p. 1
1.1. Challenges with solving ACOPF
- Flat starts may fail, convex approximations add computation, and previous-timestep solutions may be poor as grid conditions change.The paper notes that increasing intermittent renewable and inverter-interfaced resources can make prior-timestep solutions less representative.Source: §1.1 · p. 2
1.2. Previous related efforts
- Earlier learned ACOPF predictions violated constraints about 60% of the time, motivating a multi-target Random Forest warm-start approach that retains the original ACPF equations.Other approaches trade accuracy, topology knowledge, robustness, or speed; prior convex-relaxation warm-start benefits were reported as solver-dependent [11].Source: §1.2 · p. 2
2. LEARNING FRAMEWORK
The framework trains a multi-target Random Forest on prior ACOPF solutions, using bus loads to predict voltage magnitudes and generation. Its predictions are intended as solver warm starts because regression alone does not ensure constraint satisfaction.
2. LEARNING FRAMEWORK
- Bus loads are the Random Forest inputs, while optimal generation and voltage magnitudes are predicted using prior ACOPF solutions for training.The framework assumes knowledge of bus and generator counts but no topology, admittance matrix, or line parameters, and assumes thousands of prior solutions are available.Source: §2 · p. 2
2.1. Multi-target Random Forests
- Multi-target regression predicts correlated voltage and generation outputs together, combining multiple Decision Tree regressions into one predicted vector.This approach is intended to preserve relationships among outputs rather than predicting each target independently.Source: §2.1 · p. 3, Figure 1 · p. 3
2.2. Warm starts - preventing forest fires
- Regression predictions may violate the original OPF constraints, so the framework targets better solver warm starts rather than directly learning feasible optima.The paper makes no claim of global optimality; it notes that global-optimum methods may not be practical for sub-second ACOPF solving.Source: §2.2 · p. 3
- The paper identifies possible repeated training samples for identical network loads and suggests offline-generated solutions as a future approach to address this issue.It also identifies projecting predictions onto the feasible set or ensuring feasible predictions as future work.Source: §2.2 · p. 3
3. NUMERICAL EXPERIMENTS
The experiments evaluate Random Forest predictions and warm starts on four IEEE networks, finding fast inference and accuracy gains alongside solver- and network-dependent convergence benefits.
3.1. System setup
- The experiments used 2,000 load-perturbed ACOPF samples per network, split 80/20 for training and testing, across the 14-, 57-, 118-, and 300-bus IEEE cases.MIPS and fmincon were used to compare convergence behavior.Source: §3.1 · p. 3
3.3. Prediction error
- Often <1%, voltage-magnitude prediction errors are small; on the 118-bus case, generation predictions are fairly accurate and lower-error than DC warm starts in all cases.The voltage comparison is shown for the 14-bus case, and the generation comparison for the 118-bus case.Source: Figure 2 · p. 4, §3.3 · p. 4, Figure 3 · p. 4
3.2. Hyperparameter tuning
- Table 1 reports selected Random Forest hyperparameters for each network; the supplied results identify minimum split-size candidates of 2, 3, 4, and 5.The numerical table entries are not stated in the accompanying passage.Source: §3.2 · p. 4, Table 1 · p. 4
3.4. Improved computational time
- Learned starts improve convergence time over both flat and DCOPF starts, and consistently reduce iteration counts versus DCOPF on the IEEE 300-bus case.The reported benefit depends on the solver and network.Source: Figure 4 · p. 5, §3.4 · p. 5
- With fmincon, learned starts improved successful convergence on the 57-bus case but performed slightly worse on the 300-bus case; learned points were often initially infeasible.On ten 57-bus runs, maximum constraint violation was generally lower with the learned point than with the DC start.Source: §3.4 · p. 5, Figure 5 · p. 5
4. CONCLUSIONS AND FUTURE WORK
In the considered networks, learned warm starts converged faster than DC or flat starts, with benefits dependent on the solver. The authors identify feasibility and training-set sensitivity as open issues and propose several directions for future work.
4. CONCLUSIONS AND FUTURE WORK
- Learned warm starts converged faster than DC or flat starts in the considered networks, but overall benefits were solver-dependent.Predicted voltages and optimal generation values also showed promise for applications needing quick approximate solutions; learned starts generally had lower maximum constraint violations than DC starts, though they were generally infeasible.Source: §4 · p. 5
- Future work will explore neural networks or support vector regression, additional predicted variables such as voltage angle and reactive power, and feature selection.Source: §4 · p. 5
- The study did not test sensitivity to training-set size, and feasible predictions or projection onto the feasible set remain open needs.Source: §4 · p. 6