Computing Optimal Control of Cascading Failure in DC Networks

Computing Optimal Control of Cascading Failure in DC Networks
复制标题

计算直流网络级联故障的最优控制

DOI:
10.1109/tac.2019.2930232
复制
发表时间:
2017
影响因子:
6.8
通讯作者:
K. Savla
K. Savla
中科院分区:
计算机科学2区
文献类型:
--
作者:
Qin Ba;K. Savla

文献摘要

参考文献

被引文献

相似文献

研究了直流网络连锁故障的离散时间动力学问题,其映射是故障规则与控制作用的组合。在容许控制下,节点的供需是单调非增的。在故障规则下,如果链路的流量超过容量,则永久删除该链路。我们考虑有限时域最优控制来引导网络从任意初始状态,根据活动链路集和节点处的供需来定义,到可行状态,即,在失效规则下不变的状态。没有运行成本,与可行的终端状态相关联的奖励是相关的累积供需。我们提出了两种计算最优控制的方法。第一种方法,面向树可约网络,将全局问题分解成一个耦合的局部问题系统,可以在两次迭代中求解到最优。当被限制为一类单次控制动作时,局部问题的最优解具有分段仿射性质,这有利于解析解。第二种方法通过搜索可达集来计算最优控制,所述可达集被示出为通过聚集导致相同的可达活动链路集的控制动作来承认等价的有限表示。通过利用和扩展用于安排超平面和多面体的工具来提供构造这种表示的算法过程。说明性的模拟,包括基于投影的近似算法的有效性,也提出了。
We consider discrete-time dynamics for cascading failure in DC networks whose map is a composition of failure rule with control actions. Supply–demand at the nodes is monotonically nonincreasing under admissible control. Under the failure rule, a link is removed permanently if its flow exceeds capacity. We consider finite horizon optimal control to steer the network from an arbitrary initial state, defined in terms of active link set and supply–demand at the nodes, to a feasible state, i.e., a state which is invariant under the failure rule. There is no running cost and the reward associated with a feasible terminal state is the associated cumulative supply–demand. We propose two approaches for computing optimal control. The first approach, geared toward tree reducible networks, decomposes the global problem into a system of coupled local problems, which can be solved to optimality in two iterations. When restricted to the class of one-shot control actions, the optimal solutions to the local problems possess a piecewise affine property, which facilitates analytical solutions. The second approach computes optimal control by searching over the reachable set, which is shown to admit an equivalent finite representation by aggregation of control actions leading to the same reachable active link set. An algorithmic procedure to construct this representation is provided by leveraging and extending tools for arrangement of hyperplanes and polytopes. Illustrative simulations, including showing the effectiveness of projection-based approximation algorithms, are also presented.
DOI: 10.1109/allerton.2017.8262836
发表时间: 2017
期刊: and Computing
影响因子: --
作者:
Guo, Linqi;Liang, Chen;Low, Steven H.
通讯作者: Low, Steven H.
任意精确的抽象以实现最佳控制器综合
DOI: 10.1109/cdc.2017.8263904
发表时间: 2017
期刊: 2017 IEEE 56th Annual Conference on Decision and Control (CDC)
影响因子: --
作者:
M. Rungger;G. Reissig
通讯作者: G. Reissig