Computing optimal control of cascading failure in DC networks

Q Ba, K Savla - IEEE Transactions on Automatic Control, 2019 - ieeexplore.ieee.org
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, ie, a state which is invariant under the …

[PDF][PDF] Computing Optimal Control of Cascading Failure in DC Networks

QBK Savla - arXiv preprint arXiv:1712.06064, 2017 - ieeexplore.ieee.org
We consider discrete-time dynamics, for cascading failure in DC networks, whose map is
composition of failure rule with control actions. Supply-demand at the nodes is
monotonically non-increasing 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, ie, a state which is invariant under the …
Showing the best results for this search. See all results