论文标题
超级环网上的最小流量：分布式算法和微电网应用
Minimax Flow over Acyclic Networks: Distributed Algorithms and Microgrid Application
论文作者
论文摘要
给定一个带有可变供应商和固定消费者的流网络，最小值流量问题包括最大程度地减少节点之间的最大流量，但受到流量保护和容量约束。我们通过表明它可以作为最大下游流量之间的共识问题进行重新铸造，以分布式的方式通过无环图解决了这个问题，我们首次在这里定义了这一点。此外，我们提出了分布式算法以估计这些数量。最后，利用我们的理论结果，我们设计了一个在线分布式控制器，以防止由负载和下垂控制的逆变器组成的微电网过度流动。我们的结果在CIGRE基准微电网上进行了数值验证。
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.
