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...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on control of network systems Vol. 10; no. 2; pp. 1 - 10
Main Authors Coraggio, Marco, Jafarpour, Saber, Bullo, Francesco, Bernardo, Mario di
Format Journal Article
LanguageEnglish
Published Piscataway IEEE 01.06.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Control systems design
Distributed algorithms
Distributed generation
Image edge detection
Microgrids
Minimax technique
network optimization problems
Network systems
Optimization
Overcurrent
Safety
Transportation
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2325-5870
2325-5870
2372-2533
DOI:10.1109/TCNS.2022.3212638