Online optimization in closed loop on the power flow manifold
Open accessThe DOI matches its Crossref record.
Abstract
The focus of this paper is the online load flow optimization of power systems in closed loop. In contrast to the conventional approach where an AC OPF solution is computed before being applied to the system, our objective is to design an adaptive feedback controller that steers the system in real time to the optimal operating point without explicitly solving an AC OPF problem. Our approach can be used for example to simultaneously regulate voltages, mitigate line congestion, and optimize operating costs under time-varying conditions. In contrast to related work which is mostly focused on distribution grids, we introduce a modeling approach in terms of manifold optimization that is applicable in general scenarios. For this, we treat the power flow equations as implicit constraints that are naturally enforced and hence give rise to the power flow manifold (PFM). Based on our theoretical results for this type of optimization problems, we propose a discrete-time projected gradient descent scheme on the PFM. In this work, we confirm through a detailed simulation study that the algorithm performs well in a more realistic power system setup and reliably tracks the time-varying optimum of the underlying AC OPF problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems
Molzahn, D. K., Dorfler, F., Sandberg, H., Low, S. H., Chakrabarti, S., Baldick, R., & Lavaei, J. (2017) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2017.2720471 · Cited by 1,273
Self-citationLearning Optimal Solutions for Extremely Fast AC Optimal Power Flow
Zamzam, A. S., & Baker, K. (2020) · 2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm) · doi:10.1109/smartgridcomm47815.2020.9303008 · Cited by 206
“…of the AC power flow equations (e.g. [2]–[5]); 2) Distributed techniques which allocate the computation of the AC OPF problem across devices, agents, or distributed computational platforms (e.g. [6]– [8]); and 3) So-called “real-time” or “online” optimization techniques (e.g., [9]–[11]).”
BackgroundTime-Varying Convex Optimization: Time-Structured Algorithms and Applications
Simonetto, A., Dall'Anese, E., Paternain, S., Leus, G., & Giannakis, G. B. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.3003156 · Cited by 177
“[62] A.”
Toward Distributed Energy Services: Decentralizing Optimal Power Flow With Machine Learning
Dobbe, R., Sondermeijer, O., Fridovich-Keil, D., Arnold, D., Callaway, D., & Tomlin, C. (2020) · IEEE Transactions on Smart Grid · doi:10.1109/tsg.2019.2935711 · Cited by 120
Learning to Control in Power Systems: Design and Analysis Guidelines for Concrete Safety Problems
Dobbe, R., Hidalgo-Gonzalez, P., Karagiannopoulos, S., Henriquez-Auba, R., Hug, G., Callaway, D. S., & Tomlin, C. J. (2020) · Electric Power Systems Research · doi:10.1016/j.epsr.2020.106615 · Cited by 31
Self-citation
Metadata
- Authors
- Hauswirth, A., Zanardi, A., Bolognani, S., Dorfler, F., & Hug, G.
- Venue
- 2017 IEEE Manchester PowerTech
- Publisher
- IEEE
- Published
- 2017-06
- Pages
- 1-6
- OpenAlex
- W2738184248
- Cited by
- 69
- References
- 0
- FWCI
- 14.79
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.