Optimization-Based Exploration of the Feasible Power Flow Space for Rapid Data Collection
arXiv:2206.12214 · doi:10.1109/SmartGridComm52983.2022.9960969
Abstract
This paper provides a systematic investigation into the various nonlinear objective functions which can be used to explore the feasible space associated with the optimal power flow problem. A total of 40 nonlinear objective functions are tested, and their results are compared to the data generated by a novel exhaustive rejection sampling routine. The Hausdorff distance, which is a min-max set dissimilarity metric, is then used to assess how well each nonlinear objective function performed (i.e., how well the tested objective functions were able to explore the non-convex power flow space). Exhaustive test results were collected from five PGLib test-cases and systematically analyzed.
References in corpus (5)
- Convex Relaxation of Optimal Power Flow, Part I: Formulations and Equivalence
- Reinforcement Learning for Selective Key Applications in Power Systems: Recent Advances and Future Challenges
- The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms
- Encoding Frequency Constraints in Preventive Unit Commitment Using Deep Learning with Region-of-Interest Active Sampling
- OPF-Learn: An Open-Source Framework for Creating Representative AC Optimal Power Flow Datasets