A dynamic programming approach to optimal load shedding control of cascading failure in DC power networks
A dynamic programming approach to optimal load shedding control of cascading failure in DC power networks
复制标题
直流电网级联故障最优减载控制的动态规划方法
DOI：
10.1109/cdc.2016.7798818
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
K. Savla
中科院分区：
文献类型：
--
作者：
Qin Ba;K. Savla
将多轮最优减载问题归结为一个由离散变量和连续变量组成的状态空间上的动态规划问题，该状态空间分别对应于节点的有功状态和供需状态。我们提出了一个通用的分支和边界算法，这个问题，并提出了工具，以减少相关的计算复杂性。特别是，我们适应的结果秩一扰动的拉普拉斯矩阵的伪逆计算链路故障下的流量再分配，并引入单调性属性下，需要考虑的控制策略集减少到一个相当小的集合。这些工具的比例减载控制和简单的网络拓扑结构的上下文中说明。仿真结果比较下的最优控制策略和最优比例控制策略，在一个基准IEEE网络的剩余负载。
We postulate the problem of optimal load shedding over multiple rounds to prevent cascading failure in power networks as a dynamic programming problem over a state space consisting of discrete and continuous variables, corresponding to link active status and demand-supply at the nodes respectively. We propose a generic branch and bound algorithm for this problem, and present tools to reduce the associated computational complexity. In particular, we adapt results on rank one perturbations of pseudo-inverse of Laplacian matrices to compute flow redistribution under link failure, and introduce monotonicity properties under which the set of control policies requiring consideration reduces to a considerably small set. These tools are illustrated in the context of proportional load shedding control and simple network topologies. Simulation results to compare the residual load under an optimal control policy and under an optimal proportional control policy, on a benchmark IEEE network, are also included.