Search NASA⌕ Search

DOE OSTI · 1968835

Primal-Dual Differentiable Programming for Distribution System Critical Load Restoration: Preprint

Abstract

Swift and reliable critical load restoration (CLR) can help make a distribution system resilient towards extreme events. To optimally achieve that, alongside practical concerns such as limiting online computational burden, some studies leverage model-free reinforcement learning (RL) to train control policies. Despite the advantages provided by RL algorithms, these approaches suffer from two issues: 1) the lack of a proper mechanism for constraint enforcement, and 2) poor sample efficiency. Therefore, in this paper, a primal-dual differentiable programming (PDDP) method is developed for guiding the training leading to a constraint-satisfying policy. Additionally, the model-based nature of the proposed method aims at improving sample efficiency. The experiment on a CLR problem demonstrates that PDDP can effectively train a control policy that both achieves desirable performance and satisfies required constraints.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhang, Xiangyu, Knueven, Bernard, Zamzam, Ahmed, Reynolds, Matthew, Jones, Wesley. 2023-04-03. Primal-Dual Differentiable Programming for Distribution System Critical Load Restoration: Preprint. https://www.osti.gov/biblio/1968835

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related reports

Optimization of Distribution Feeder Topology: A Differential Programming Learning Approach

This paper presents a gradient based method for optimizing distribution feeder network topology under load un- certainty. We recast the optimal network reconfiguration problem as a learning problem where edge weights of a graph are learned to produce an optimized spanning tree for a distribution network. Using recent methods published on differentiable programming, we provide a data driven method for learning these weights. We test our method on 100 variations of an IEEE 15-bus test system. Our results show that our method outperforms more traditional mathematical programming-based approaches.

differentiable programming↗