Graphical models for optimal power flow
From MaRDI portal
Abstract: Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for "smart grid" applications like control of distributed energy resources. We evaluate our technique numerically on several benchmark networks and show that practical OPF problems can be solved effectively using this approach.
Recommendations
- Globally solving a class of optimal power flow problems in radial networks by tree reduction
- Graphical models and belief propagation hierarchy for physics-constrained network flows
- Global optimal power flow over large-scale power transmission networks
- Electrical flows over spanning trees
- Chance-constrained optimal power flow: risk-aware network control under uncertainty
Cites work
- An algorithmic framework for convex mixed integer nonlinear programs
- Belief propagation for min-cost network flow: convergence and correctness
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence
- Convex Relaxation of Optimal Power Flow—Part II: Exactness
- Exact Convex Relaxation of Optimal Power Flow in Radial Networks
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Factor graphs and the sum-product algorithm
- Graphical models, exponential families, and variational inference
- JuMP: a modeling language for mathematical optimization
- Learning Theory
- Probabilistic graphical models.
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- SCIP: solving constraint integer programs
- Strong NP-hardness of AC power flows feasibility
Cited in
(5)- Limit graphs in structural optimization of modes in distribution networks
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
- Graphical models and belief propagation hierarchy for physics-constrained network flows
- Interdependent defense games with applications to internet security at the level of autonomous systems
- Electrical flows over spanning trees
This page was built for publication: Graphical models for optimal power flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1701228)
