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

Celý popis

Podrobná bibliografie

Vydáno v:	IEEE transactions on control of network systems Ročník 10; číslo 2; s. 937 - 946
Hlavní autoři:	Coraggio, Marco, Jafarpour, Saber, Bullo, Francesco, Bernardo, Mario di
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Piscataway IEEE 01.06.2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!