Data-Driven Chance Constrained AC-OPF using Hybrid Sparse Gaussian Processes
The alternating current (AC) chance-constrained optimal power flow (CC-OPF) problem addresses the economic efficiency of electricity generation and delivery under generation uncertainty. The latter is intrinsic to modern power grids because of the high amount of renewables. Despite its academic succ...
Gespeichert in:
Hauptverfasser: | , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Mitrovic, Mile Lukashevich, Aleksandr Vorobev, Petr Terzija, Vladimir Maximov, Yury Deka, Deepjyoti |
description | The alternating current (AC) chance-constrained optimal power flow (CC-OPF)
problem addresses the economic efficiency of electricity generation and
delivery under generation uncertainty. The latter is intrinsic to modern power
grids because of the high amount of renewables. Despite its academic success,
the AC CC-OPF problem is highly nonlinear and computationally demanding, which
limits its practical impact. For improving the AC-OPF problem
complexity/accuracy trade-off, the paper proposes a fast data-driven setup that
uses the sparse and hybrid Gaussian processes (GP) framework to model the power
flow equations with input uncertainty. We advocate the efficiency of the
proposed approach by a numerical study over multiple IEEE test cases showing up
to two times faster and more accurate solutions compared to the
state-of-the-art methods. |
doi_str_mv | 10.48550/arxiv.2208.14814 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2208_14814</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2208_14814</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-1c280274bddd18e767b71633211f5fef8d1869398868cee25b655cbcb5710fe93</originalsourceid><addsrcrecordid>eNotz81KAzEYheFsXEj1AlyZG8g4yUx-ZllS2woDLdj98CX5ogFNS9IWe_dqdXXgXRx4CHngbdMbKdsnKF_p3AjRmob3hve3ZFzAEdiipDNmat8he6R2n-uxQMoY6NyyzXZJTzXlN7q-uJICfT1AqUhXcKo1QabbsvdYK9Y7chPho-L9_87Ibvm8s2s2blYvdj4yULpn3AvTCt27EAI3qJV2mquuE5xHGTGan6qGbjBGGY8opFNSeued1LyNOHQz8vh3e-VMh5I-oVymX9Z0ZXXfEDdG1g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Data-Driven Chance Constrained AC-OPF using Hybrid Sparse Gaussian Processes</title><source>arXiv.org</source><creator>Mitrovic, Mile ; Lukashevich, Aleksandr ; Vorobev, Petr ; Terzija, Vladimir ; Maximov, Yury ; Deka, Deepjyoti</creator><creatorcontrib>Mitrovic, Mile ; Lukashevich, Aleksandr ; Vorobev, Petr ; Terzija, Vladimir ; Maximov, Yury ; Deka, Deepjyoti</creatorcontrib><description>The alternating current (AC) chance-constrained optimal power flow (CC-OPF)
problem addresses the economic efficiency of electricity generation and
delivery under generation uncertainty. The latter is intrinsic to modern power
grids because of the high amount of renewables. Despite its academic success,
the AC CC-OPF problem is highly nonlinear and computationally demanding, which
limits its practical impact. For improving the AC-OPF problem
complexity/accuracy trade-off, the paper proposes a fast data-driven setup that
uses the sparse and hybrid Gaussian processes (GP) framework to model the power
flow equations with input uncertainty. We advocate the efficiency of the
proposed approach by a numerical study over multiple IEEE test cases showing up
to two times faster and more accurate solutions compared to the
state-of-the-art methods.</description><identifier>DOI: 10.48550/arxiv.2208.14814</identifier><language>eng</language><subject>Computer Science - Learning ; Computer Science - Systems and Control ; Statistics - Machine Learning</subject><creationdate>2022-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2208.14814$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2208.14814$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Mitrovic, Mile</creatorcontrib><creatorcontrib>Lukashevich, Aleksandr</creatorcontrib><creatorcontrib>Vorobev, Petr</creatorcontrib><creatorcontrib>Terzija, Vladimir</creatorcontrib><creatorcontrib>Maximov, Yury</creatorcontrib><creatorcontrib>Deka, Deepjyoti</creatorcontrib><title>Data-Driven Chance Constrained AC-OPF using Hybrid Sparse Gaussian Processes</title><description>The alternating current (AC) chance-constrained optimal power flow (CC-OPF)
problem addresses the economic efficiency of electricity generation and
delivery under generation uncertainty. The latter is intrinsic to modern power
grids because of the high amount of renewables. Despite its academic success,
the AC CC-OPF problem is highly nonlinear and computationally demanding, which
limits its practical impact. For improving the AC-OPF problem
complexity/accuracy trade-off, the paper proposes a fast data-driven setup that
uses the sparse and hybrid Gaussian processes (GP) framework to model the power
flow equations with input uncertainty. We advocate the efficiency of the
proposed approach by a numerical study over multiple IEEE test cases showing up
to two times faster and more accurate solutions compared to the
state-of-the-art methods.</description><subject>Computer Science - Learning</subject><subject>Computer Science - Systems and Control</subject><subject>Statistics - Machine Learning</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81KAzEYheFsXEj1AlyZG8g4yUx-ZllS2woDLdj98CX5ogFNS9IWe_dqdXXgXRx4CHngbdMbKdsnKF_p3AjRmob3hve3ZFzAEdiipDNmat8he6R2n-uxQMoY6NyyzXZJTzXlN7q-uJICfT1AqUhXcKo1QabbsvdYK9Y7chPho-L9_87Ibvm8s2s2blYvdj4yULpn3AvTCt27EAI3qJV2mquuE5xHGTGan6qGbjBGGY8opFNSeued1LyNOHQz8vh3e-VMh5I-oVymX9Z0ZXXfEDdG1g</recordid><startdate>20220830</startdate><enddate>20220830</enddate><creator>Mitrovic, Mile</creator><creator>Lukashevich, Aleksandr</creator><creator>Vorobev, Petr</creator><creator>Terzija, Vladimir</creator><creator>Maximov, Yury</creator><creator>Deka, Deepjyoti</creator><scope>AKY</scope><scope>EPD</scope><scope>GOX</scope></search><sort><creationdate>20220830</creationdate><title>Data-Driven Chance Constrained AC-OPF using Hybrid Sparse Gaussian Processes</title><author>Mitrovic, Mile ; Lukashevich, Aleksandr ; Vorobev, Petr ; Terzija, Vladimir ; Maximov, Yury ; Deka, Deepjyoti</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-1c280274bddd18e767b71633211f5fef8d1869398868cee25b655cbcb5710fe93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Learning</topic><topic>Computer Science - Systems and Control</topic><topic>Statistics - Machine Learning</topic><toplevel>online_resources</toplevel><creatorcontrib>Mitrovic, Mile</creatorcontrib><creatorcontrib>Lukashevich, Aleksandr</creatorcontrib><creatorcontrib>Vorobev, Petr</creatorcontrib><creatorcontrib>Terzija, Vladimir</creatorcontrib><creatorcontrib>Maximov, Yury</creatorcontrib><creatorcontrib>Deka, Deepjyoti</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Statistics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mitrovic, Mile</au><au>Lukashevich, Aleksandr</au><au>Vorobev, Petr</au><au>Terzija, Vladimir</au><au>Maximov, Yury</au><au>Deka, Deepjyoti</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Data-Driven Chance Constrained AC-OPF using Hybrid Sparse Gaussian Processes</atitle><date>2022-08-30</date><risdate>2022</risdate><abstract>The alternating current (AC) chance-constrained optimal power flow (CC-OPF)
problem addresses the economic efficiency of electricity generation and
delivery under generation uncertainty. The latter is intrinsic to modern power
grids because of the high amount of renewables. Despite its academic success,
the AC CC-OPF problem is highly nonlinear and computationally demanding, which
limits its practical impact. For improving the AC-OPF problem
complexity/accuracy trade-off, the paper proposes a fast data-driven setup that
uses the sparse and hybrid Gaussian processes (GP) framework to model the power
flow equations with input uncertainty. We advocate the efficiency of the
proposed approach by a numerical study over multiple IEEE test cases showing up
to two times faster and more accurate solutions compared to the
state-of-the-art methods.</abstract><doi>10.48550/arxiv.2208.14814</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.2208.14814 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_2208_14814 |
source | arXiv.org |
subjects | Computer Science - Learning Computer Science - Systems and Control Statistics - Machine Learning |
title | Data-Driven Chance Constrained AC-OPF using Hybrid Sparse Gaussian Processes |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T03%3A32%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Data-Driven%20Chance%20Constrained%20AC-OPF%20using%20Hybrid%20Sparse%20Gaussian%20Processes&rft.au=Mitrovic,%20Mile&rft.date=2022-08-30&rft_id=info:doi/10.48550/arxiv.2208.14814&rft_dat=%3Carxiv_GOX%3E2208_14814%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |