We consider discrete-time dynamics, for cascading failure in DC networks, whose map is composition of failure rule with control actions. Supply-demand at nodes is monotonically nonincreasing under admissible control. Under the failure rule, a link is removed permanently if its flow exceeds its capacities. 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 nodes, to a feasible state, i.e., a state that 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, and provide time complexity analysis for these approaches. The first approach, geared towards tree reducible networks, decomposes the global problem into a system of coupled local problems, which can be solved to optimality in two iterations. In the first iteration, optim 查看全文>>