Supervised Learning for Optimal Power Flow as a Real-Time Proxy
Not on the map. Why?
Abstract (arXiv)
In this work we design and compare different supervised learning algorithms to compute the cost of Alternating Current Optimal Power Flow (ACOPF). The motivation for quick calculation of OPF cost outcomes stems from the growing need of algorithmic-based long-term and medium-term planning methodologies in power networks. Integrated in a multiple time-horizon coordination framework, we refer to this approximation module as a proxy for predicting short-term decision outcomes without the need of actual simulation and optimization of them. Our method enables fast approximate calculation of OPF cost with less than 1% error on average, achieved in run-times that are several orders of magnitude lower than of exact computation. Several test-cases such as IEEE-RTS96 are used to demonstrate the efficiency of our approach.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). First posted on arXiv 20 Dec 2016.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 1.
4 papers.
- 2023A Physics-Informed Machine Learning for Electricity Markets: A NYISO Case Studycited by 4
- 2022Bucketized Active Sampling for Learning ACOPFcited by 3
- 2021Neural Predictive Control for the Optimization of Smart Grid Flexibility Schedulescited by 0
- 2022Machine Learning for Improved Gas Network Models in Coordinated Energy Systemscited by 0
- 2023A Physics-Informed Machine Learning for Electricity Markets: A NYISO Case Study31 Mar 2023
- 2022Machine Learning for Improved Gas Network Models in Coordinated Energy Systems26 Sep 2022
- 2022Bucketized Active Sampling for Learning ACOPF16 Aug 2022
- 2021Neural Predictive Control for the Optimization of Smart Grid Flexibility Schedules19 Aug 2021