Eliseev, Andrew ; Steinke, Florian (2024)
Conceptual framework for determining the treewidth of distribution grids.
In: Electric Power Systems Research, 234
doi: 10.1016/j.epsr.2024.110756
Artikel, Bibliographie
Kurzbeschreibung (Abstract)
While distribution grids are often operated radially, they are typically designed to be more redundant, so that each load has multiple connections to the main grid. For complex networks like these, the notion of treewidth can be used to quantify their complexity. In this paper, we propose a new conceptual framework and derive an exact formula for computing treewidth with the help of our constructs. We argue that our framework effectively captures complexities in the structure of distribution grids and has a potential to simplify the calculation of treewidth. After analysing our findings, we hypothesise that the treewidth of distribution grids will typically be low implying that some difficult power system problems can be solved on them in parameterised polynomial time with dynamic programming. We demonstrate this with an example problem of dividing a distribution grid into tree-like operational subgraphs around the primary substations so that no voltage violations occur.
| Typ des Eintrags: | Artikel |
|---|---|
| Erschienen: | 2024 |
| Autor(en): | Eliseev, Andrew ; Steinke, Florian |
| Art des Eintrags: | Bibliographie |
| Titel: | Conceptual framework for determining the treewidth of distribution grids |
| Sprache: | Englisch |
| Publikationsjahr: | September 2024 |
| Verlag: | Elsevier |
| Titel der Zeitschrift, Zeitung oder Schriftenreihe: | Electric Power Systems Research |
| Jahrgang/Volume einer Zeitschrift: | 234 |
| DOI: | 10.1016/j.epsr.2024.110756 |
| URL / URN: | https://www.sciencedirect.com/science/article/pii/S037877962... |
| Kurzbeschreibung (Abstract): | While distribution grids are often operated radially, they are typically designed to be more redundant, so that each load has multiple connections to the main grid. For complex networks like these, the notion of treewidth can be used to quantify their complexity. In this paper, we propose a new conceptual framework and derive an exact formula for computing treewidth with the help of our constructs. We argue that our framework effectively captures complexities in the structure of distribution grids and has a potential to simplify the calculation of treewidth. After analysing our findings, we hypothesise that the treewidth of distribution grids will typically be low implying that some difficult power system problems can be solved on them in parameterised polynomial time with dynamic programming. We demonstrate this with an example problem of dividing a distribution grid into tree-like operational subgraphs around the primary substations so that no voltage violations occur. |
| Freie Schlagworte: | distribution grid, dynamic programming, tree decomposition, treewidth |
| ID-Nummer: | Artikel-ID: 110756 |
| Zusätzliche Informationen: | Proceedings of the 23rd Power Systems Computation Conference (PSCC 2024) |
| Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik > Energieinformationsnetze und Systeme (EINS) 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Datentechnik DFG-Graduiertenkollegs DFG-Graduiertenkollegs > Graduiertenkolleg 2222 KRITIS - Kritische Infrastrukturen. Konstruktion, Funktionskrisen und Schutz in Städten Profilbereiche Profilbereiche > Energiesysteme der Zukunft |
| Hinterlegungsdatum: | 01 Jul 2024 11:06 |
| Letzte Änderung: | 22 Jul 2024 08:27 |
| PPN: | |
| Export: | |
| Suche nach Titel in: | TUfind oder in Google |
 |
Frage zum Eintrag |
Optionen (nur für Redakteure)
 |
Redaktionelle Details anzeigen |
Drucken
Impressum