Minimax Flow Over Acyclic Networks: Distributed Algorithms and Microgrid Application
Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic graphs in a distributed manner by showing that it can be recast...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on control of network systems 2023-06, Vol.10 (2), p.1-10 |
|---|---|
| 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 | 10 |
|---|---|
| container_issue | 2 |
| container_start_page | 1 |
| container_title | IEEE transactions on control of network systems |
| container_volume | 10 |
| creator | Coraggio, Marco Jafarpour, Saber Bullo, Francesco Bernardo, Mario di |
| description | Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic graphs in a distributed manner by showing that it can be recast as a consensus problem between the maximum downstream flows, which we define here for the first time. Additionally, we present a distributed algorithm to estimate these quantities. Finally, exploiting our theoretical results, we design an online distributed controller to prevent overcurrent in microgrids consisting of loads and droop-controlled inverters. Our results are validated numerically on the CIGRE benchmark microgrid. |
| doi_str_mv | 10.1109/TCNS.2022.3212638 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_9913724</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9913724</ieee_id><sourcerecordid>2828006122</sourcerecordid><originalsourceid>FETCH-LOGICAL-c245t-2917e99b4d767d96b02e36f8b1dc7bf6211e10d793ebc252bb7ff78e12fd65373</originalsourceid><addsrcrecordid>eNo9kMtOwzAQRS0EElXpByA2llineMZNHLOrCgWkPhaUtRUnTnFJk2KnlP49jlqxmhnNvfM4hNwCGwIw-bCaLN6HyBCHHAETnl6QHnKBEcacX3Y5xlGcCnZNBt5vGGOAcah5j6zmtrbb7JdOq-ZAlz_G0XF-zCub04VpD4378o_0yfrWWb1vTUHH1bpxtv3ceprVBZ3b3DVrZ0NjtwuurLVNfUOuyqzyZnCOffIxfV5NXqPZ8uVtMp5FOY7iNkIJwkipR4VIRCETzdDwpEw1FLnQZYIABlghJDc6xxi1FmUpUgNYFknMBe-T-9PcnWu-98a3atPsXR1WKkwxZSwBxKCCkypc6r0zpdq58LI7KmCq46c6fqrjp878gufu5LHGmH-9lBCojvgf8YRrlA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2828006122</pqid></control><display><type>article</type><title>Minimax Flow Over Acyclic Networks: Distributed Algorithms and Microgrid Application</title><source>IEEE/IET Electronic Library</source><creator>Coraggio, Marco ; Jafarpour, Saber ; Bullo, Francesco ; Bernardo, Mario di</creator><creatorcontrib>Coraggio, Marco ; Jafarpour, Saber ; Bullo, Francesco ; Bernardo, Mario di</creatorcontrib><description>Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic graphs in a distributed manner by showing that it can be recast as a consensus problem between the maximum downstream flows, which we define here for the first time. Additionally, we present a distributed algorithm to estimate these quantities. Finally, exploiting our theoretical results, we design an online distributed controller to prevent overcurrent in microgrids consisting of loads and droop-controlled inverters. Our results are validated numerically on the CIGRE benchmark microgrid.</description><identifier>ISSN: 2325-5870</identifier><identifier>EISSN: 2372-2533</identifier><identifier>DOI: 10.1109/TCNS.2022.3212638</identifier><identifier>CODEN: ITCNAY</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Algorithms ; Control systems design ; Distributed algorithms ; Distributed generation ; Image edge detection ; Microgrids ; Minimax technique ; network optimization problems ; Network systems ; Optimization ; Overcurrent ; Safety ; Transportation</subject><ispartof>IEEE transactions on control of network systems, 2023-06, Vol.10 (2), p.1-10</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2023</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c245t-2917e99b4d767d96b02e36f8b1dc7bf6211e10d793ebc252bb7ff78e12fd65373</cites><orcidid>0000-0002-2171-4745 ; 0000-0003-2784-1486 ; 0000-0002-4785-2118 ; 0000-0002-7614-2940</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9913724$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9913724$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Coraggio, Marco</creatorcontrib><creatorcontrib>Jafarpour, Saber</creatorcontrib><creatorcontrib>Bullo, Francesco</creatorcontrib><creatorcontrib>Bernardo, Mario di</creatorcontrib><title>Minimax Flow Over Acyclic Networks: Distributed Algorithms and Microgrid Application</title><title>IEEE transactions on control of network systems</title><addtitle>TCNS</addtitle><description>Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic graphs in a distributed manner by showing that it can be recast as a consensus problem between the maximum downstream flows, which we define here for the first time. Additionally, we present a distributed algorithm to estimate these quantities. Finally, exploiting our theoretical results, we design an online distributed controller to prevent overcurrent in microgrids consisting of loads and droop-controlled inverters. Our results are validated numerically on the CIGRE benchmark microgrid.</description><subject>Algorithms</subject><subject>Control systems design</subject><subject>Distributed algorithms</subject><subject>Distributed generation</subject><subject>Image edge detection</subject><subject>Microgrids</subject><subject>Minimax technique</subject><subject>network optimization problems</subject><subject>Network systems</subject><subject>Optimization</subject><subject>Overcurrent</subject><subject>Safety</subject><subject>Transportation</subject><issn>2325-5870</issn><issn>2372-2533</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kMtOwzAQRS0EElXpByA2llineMZNHLOrCgWkPhaUtRUnTnFJk2KnlP49jlqxmhnNvfM4hNwCGwIw-bCaLN6HyBCHHAETnl6QHnKBEcacX3Y5xlGcCnZNBt5vGGOAcah5j6zmtrbb7JdOq-ZAlz_G0XF-zCub04VpD4378o_0yfrWWb1vTUHH1bpxtv3ceprVBZ3b3DVrZ0NjtwuurLVNfUOuyqzyZnCOffIxfV5NXqPZ8uVtMp5FOY7iNkIJwkipR4VIRCETzdDwpEw1FLnQZYIABlghJDc6xxi1FmUpUgNYFknMBe-T-9PcnWu-98a3atPsXR1WKkwxZSwBxKCCkypc6r0zpdq58LI7KmCq46c6fqrjp878gufu5LHGmH-9lBCojvgf8YRrlA</recordid><startdate>20230601</startdate><enddate>20230601</enddate><creator>Coraggio, Marco</creator><creator>Jafarpour, Saber</creator><creator>Bullo, Francesco</creator><creator>Bernardo, Mario di</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-2171-4745</orcidid><orcidid>https://orcid.org/0000-0003-2784-1486</orcidid><orcidid>https://orcid.org/0000-0002-4785-2118</orcidid><orcidid>https://orcid.org/0000-0002-7614-2940</orcidid></search><sort><creationdate>20230601</creationdate><title>Minimax Flow Over Acyclic Networks: Distributed Algorithms and Microgrid Application</title><author>Coraggio, Marco ; Jafarpour, Saber ; Bullo, Francesco ; Bernardo, Mario di</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c245t-2917e99b4d767d96b02e36f8b1dc7bf6211e10d793ebc252bb7ff78e12fd65373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Control systems design</topic><topic>Distributed algorithms</topic><topic>Distributed generation</topic><topic>Image edge detection</topic><topic>Microgrids</topic><topic>Minimax technique</topic><topic>network optimization problems</topic><topic>Network systems</topic><topic>Optimization</topic><topic>Overcurrent</topic><topic>Safety</topic><topic>Transportation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Coraggio, Marco</creatorcontrib><creatorcontrib>Jafarpour, Saber</creatorcontrib><creatorcontrib>Bullo, Francesco</creatorcontrib><creatorcontrib>Bernardo, Mario di</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005–Present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEEE/IET Electronic Library</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on control of network systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Coraggio, Marco</au><au>Jafarpour, Saber</au><au>Bullo, Francesco</au><au>Bernardo, Mario di</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Minimax Flow Over Acyclic Networks: Distributed Algorithms and Microgrid Application</atitle><jtitle>IEEE transactions on control of network systems</jtitle><stitle>TCNS</stitle><date>2023-06-01</date><risdate>2023</risdate><volume>10</volume><issue>2</issue><spage>1</spage><epage>10</epage><pages>1-10</pages><issn>2325-5870</issn><eissn>2372-2533</eissn><coden>ITCNAY</coden><abstract>Given a flow network with variable suppliers and fixed consumers, the minimax flow problem consists in minimizing the maximum flow between nodes, subject to flow conservation and capacity constraints. We solve this problem over acyclic graphs in a distributed manner by showing that it can be recast as a consensus problem between the maximum downstream flows, which we define here for the first time. Additionally, we present a distributed algorithm to estimate these quantities. Finally, exploiting our theoretical results, we design an online distributed controller to prevent overcurrent in microgrids consisting of loads and droop-controlled inverters. Our results are validated numerically on the CIGRE benchmark microgrid.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/TCNS.2022.3212638</doi><tpages>10</tpages><orcidid>https://orcid.org/0000-0002-2171-4745</orcidid><orcidid>https://orcid.org/0000-0003-2784-1486</orcidid><orcidid>https://orcid.org/0000-0002-4785-2118</orcidid><orcidid>https://orcid.org/0000-0002-7614-2940</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2325-5870 |
| ispartof | IEEE transactions on control of network systems, 2023-06, Vol.10 (2), p.1-10 |
| issn | 2325-5870 2372-2533 |
| language | eng |
| recordid | cdi_ieee_primary_9913724 |
| source | IEEE/IET Electronic Library |
| subjects | Algorithms Control systems design Distributed algorithms Distributed generation Image edge detection Microgrids Minimax technique network optimization problems Network systems Optimization Overcurrent Safety Transportation |
| title | Minimax Flow Over Acyclic Networks: Distributed Algorithms and Microgrid Application |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T10%3A17%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Minimax%20Flow%20Over%20Acyclic%20Networks:%20Distributed%20Algorithms%20and%20Microgrid%20Application&rft.jtitle=IEEE%20transactions%20on%20control%20of%20network%20systems&rft.au=Coraggio,%20Marco&rft.date=2023-06-01&rft.volume=10&rft.issue=2&rft.spage=1&rft.epage=10&rft.pages=1-10&rft.issn=2325-5870&rft.eissn=2372-2533&rft.coden=ITCNAY&rft_id=info:doi/10.1109/TCNS.2022.3212638&rft_dat=%3Cproquest_RIE%3E2828006122%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2828006122&rft_id=info:pmid/&rft_ieee_id=9913724&rfr_iscdi=true |