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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on control of network systems Jg. 10; H. 2; S. 937 - 946
Hauptverfasser:	Coraggio, Marco, Jafarpour, Saber, Bullo, Francesco, Bernardo, Mario di
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.06.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Control systems design Distributed algorithms Distributed generation Image edge detection Microgrids Minimax technique network optimization problems Network systems Optimization Overcurrent Safety Transportation
ISSN:	2325-5870, 2372-2533
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!