Saved in:
| Main Authors: | , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2405.03262 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913397895856128 |
|---|---|
| author | Wolf, Hinrikus Böttcher, Luis Bouchkati, Sarra Lutat, Philipp Breitung, Jens Jung, Bastian Möllemann, Tina Todosijević, Viktor Schiefelbein-Lach, Jan Pohl, Oliver Ulbig, Andreas Grohe, Martin |
| author_facet | Wolf, Hinrikus Böttcher, Luis Bouchkati, Sarra Lutat, Philipp Breitung, Jens Jung, Bastian Möllemann, Tina Todosijević, Viktor Schiefelbein-Lach, Jan Pohl, Oliver Ulbig, Andreas Grohe, Martin |
| contents | In the course of the energy transition, the expansion of generation and consumption will change, and many of these technologies, such as PV systems, electric cars and heat pumps, will influence the power flow, especially in the distribution grids. Scalable methods that can make decisions for each grid connection are needed to enable congestion-free grid operation in the distribution grids. This paper presents a novel end-to-end approach to resolving congestion in distribution grids with deep reinforcement learning. Our architecture learns to curtail power and set appropriate reactive power to determine a non-congested and, thus, feasible grid state. State-of-the-art methods such as the optimal power flow (OPF) demand high computational costs and detailed measurements of every bus in a grid. In contrast, the presented method enables decisions under sparse information with just some buses observable in the grid. Distribution grids are generally not yet fully digitized and observable, so this method can be used for decision-making on the majority of low-voltage grids. On a real low-voltage grid the approach resolves 100\% of violations in the voltage band and 98.8\% of asset overloads. The results show that decisions can also be made on real grids that guarantee sufficient quality for congestion-free grid operation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_03262 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | End-to-End Reinforcement Learning of Curative Curtailment with Partial Measurement Availability Wolf, Hinrikus Böttcher, Luis Bouchkati, Sarra Lutat, Philipp Breitung, Jens Jung, Bastian Möllemann, Tina Todosijević, Viktor Schiefelbein-Lach, Jan Pohl, Oliver Ulbig, Andreas Grohe, Martin Machine Learning Artificial Intelligence Systems and Control In the course of the energy transition, the expansion of generation and consumption will change, and many of these technologies, such as PV systems, electric cars and heat pumps, will influence the power flow, especially in the distribution grids. Scalable methods that can make decisions for each grid connection are needed to enable congestion-free grid operation in the distribution grids. This paper presents a novel end-to-end approach to resolving congestion in distribution grids with deep reinforcement learning. Our architecture learns to curtail power and set appropriate reactive power to determine a non-congested and, thus, feasible grid state. State-of-the-art methods such as the optimal power flow (OPF) demand high computational costs and detailed measurements of every bus in a grid. In contrast, the presented method enables decisions under sparse information with just some buses observable in the grid. Distribution grids are generally not yet fully digitized and observable, so this method can be used for decision-making on the majority of low-voltage grids. On a real low-voltage grid the approach resolves 100\% of violations in the voltage band and 98.8\% of asset overloads. The results show that decisions can also be made on real grids that guarantee sufficient quality for congestion-free grid operation. |
| title | End-to-End Reinforcement Learning of Curative Curtailment with Partial Measurement Availability |
| topic | Machine Learning Artificial Intelligence Systems and Control |
| url | https://arxiv.org/abs/2405.03262 |