Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimal Power Flow”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗

Exploiting Power Flow Manifold to Solve AC Optimal Power Flow

AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.

AC optimal power flow↗

On Distribution Grid Optimal Power Flow Development and Integration

Due to changes in electric distribution grid operation, new operation regimes have been recommended. Distribution grid optimal power flow (DOPF) has received tremendous attention in the research community, yet it has not been fully adopted across the utility industry. Our paper recognizes this problem and suggests a development and integration procedure for DOPF. We propose development of DOPF as a three step procedure of 1) processing the grid, 2) obtaining a tractable solution, and 3) implementing multiple solution algorithms and benchmarking them to improve application reliability. For the integration of DOPF, we demonstrate how a DOPF federate may be developed that can be integrated in a co-simulation environment to mimic the real-world conditions and hence improve its practicality to be deployed in the field. To demonstrate the efficacy of the proposed methods, tests on IEEE 123 bus system are performed where the usage of tractable formulation in DOPF algorithm development and its comparison to the benchmark solution are demonstrated.

Hanif, Sarmad↗

Development of a Distribution Optimal Power Flow Federate for Open-Source OEDI-SI Platform

Increasing numbers of distributed generators in the electric power distribution networks require developing a control strategy to optimize solutions in real time. Linearized optimal distribution flow development has seen growth and acceptance in the distribution systems literature for efficiently modeling the \glspl{opf} for distribution systems. This paper examines the implementation and integration procedure for linearized optimal distribution flow federate to \gls{oedisi} platform. Specifically, we discuss i) the usage of the \gls{oedisi} platform, ii) obtaining a tractable solution using developed \gls{opf} federate, and iii) validation of solutions and bench-marking the \gls{oedisi} platform with developed \gls{opf} federate using OpenDSS. In brief, we demonstrate how a general linearized optimal distribution flow federate can be developed and integrated with a co-simulation environment to mimic real-world examples. The efficacy of the proposed method is demonstrated using the IEEE 123-bus test system under different scenarios to obtain a tractable solution and compare its results.

Sadnan, Rabayet↗

Learning model combining convolutional deep neural network with a self-attention mechanism for AC optimal power flow

Alternating current optimal power flow (OPF) analysis is critical for efficient and reliable operation of power systems. For large systems or repetitive computations, the traditional methods such as the direct and gradient methods, or non-traditional methods, such as the genetic algorithm and simulating annealing, are time-consuming and unsuitable for real-time computing. The work in this paper proposes a novel framework to obtain the optimal solution of power flow in real-time using a combination of convolutional neural networks and a self-attention mechanism. All parameters of the power networks are rearranged in an image-like shape of a multi-channel image where each channel is a two-dimensional matrix. The proposed approach is adaptive with every input size of power systems as well as frequent variations of network topologies without intervention to the framework core. The encompassment of all power system contexts in which all parameters of internal elements, generation costs, and topology information are included, contributes to the higher accuracy of inference compared to other current machine-learning-based OPF-solving methods. Besides, the proposed framework established on ubiquitous platforms is effortlessly integrated into current infrastructures of power systems, and the great efficiency along with the computation speed may serve as a critical point for practical implications, such as enabling faster decision-making during real-time operations, predicting system contingencies, and remedial actions based on an offline pre-trained model. Furthermore, this supervised learning process is applied to the dataset of four case studies of meshed power systems: the IEEE 5-bus system (IEEE-5), the IEEE 30-bus system (IEEE-30), the IEEE 39-bus system (IEEE-39), and the IEEE 57-bus system (IEEE-57) to prove the efficacy of the proposed method.

42 ENGINEERING↗

Convergence Analysis of Fixed Point Chance Constrained Optimal Power Flow Problems

For optimal power flow problems with chance constraints, a particularly effective method is based on a fixed point iteration applied to a sequence of deterministic power flow problems. However, a priori, the convergence of such an approach is not necessarily guaranteed. Here this article analyses the convergence conditions for this fixed point approach, and reports numerical experiments including for large IEEE networks.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Towards Efficient Alternating Current Optimal Power Flow Analysis on Graphical Processing Units

We present a solution of sparse ACOPF analysis on GPU. In particular, we discuss the performance bottlenecks and detail our efforts to accelerate the linear solver, a core component of ACOPF that dominates the computational time. ACOPF solutions of two large-scale systems, synthetic Northeast (25,000 buses) and Eastern (70,000 buses) \cite{birchfield2017tamu-cases} on GPU show promising speed-up compared to CPU based solution using a state-of-the-art solver. To our knowledge, this is the first result demonstrating acceleration of sparse ACOPF on GPUs.

Power grid analysis, GPU↗

High Performance Solution for Security Constrained Optimal Power Flow

Solving the Alternating Current Optimal Power Flow (ACOPF) problem is key to economically efficient and reliable power networks with a good solution potentially saving utilities tens of billions of dollars annually (according to FERC). The Grid Optimization (GO) Competition set up by ARPA-E saw several promising solutions in Challenge 1. While team GOT-TJU-OPF placed top 10 in Division 3 and 4, this was not a satisfactory performance, and the team has identified specific areas to improve and will be adding more members to round out the necessary skills and expertise needed to be more competitive. The team set out for redemption during GO Challenge 2 with an improved High-Performance Solution for Security Constrained Optimal Power Flow. The (renamed) BSI-GOT-OPF Team ended up finishing top 2 overall in the competition. The algorithms developed have potential impacts for the electric power markets that are enormous. Optimal Power Flow technology can be an enabling technology to achieve energy-efficient power grids while enhancing renewable energy penetration, among others.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Riemannian Optimization Applied to AC Optimal Power Flow

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. This is done by using the Julia programming language and the Julia packages PowerModels.jl and Manopt.jl.

AC optimal power flow↗

A Privacy-Preserving Distributed Control of Optimal Power Flow

Here, we consider a distributed optimal power flow formulated as an optimization problem that maximizes a nondifferentiable concave function. Solving such a problem by the existing distributed algorithms can lead to data privacy issues because the solution information exchanged within the algorithms can be utilized by an adversary to infer the data. To preserve data privacy, in this paper we propose a differentially private projected subgradient (DP-PS) algorithm that includes a solution encryption step. We show that a sequence generated by DP-PS converges in expectation, in probability, and with probability 1. Moreover, we show that the rate of convergence in expectation is affected by a target privacy level of DP-PS chosen by the user. We conduct numerical experiments that demonstrate the convergence and data privacy preservation of DP-PS.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition

In “Recent Developments in Security-Constrained AC Optimal Power Flow: Overview of Challenge 1 in the ARPA-E Grid Optimization Competition,” we review the state of the art in practical algorithms for scheduling power-systems operations in the short term and the results of the recent competition organized by the U.S. Advanced Research Projects Agency–Energy. We explain the mixed-integer nonlinear formulation used in the competition for nonspecialists in electrical engineering, the context and organization of the competition, and the performance of competitors. We find that the collective approaches and results of competitors provide support for efforts to move nonlinear optimization techniques into industrial applications, as they have proven to be a robust and efficient alternative to current linear approximation techniques.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimization with Neural Network Feasibility Surrogates: Formulations and Application to Security-Constrained Optimal Power Flow

In many areas of constrained optimization, representing all possible constraints that give rise to an accurate feasible region can be difficult and computationally prohibitive for online use. Satisfying feasibility constraints becomes more challenging in high-dimensional, non-convex regimes which are common in engineering applications. A prominent example that is explored in the manuscript is the security-constrained optimal power flow (SCOPF) problem, which minimizes power generation costs, while enforcing system feasibility under contingency failures in the transmission network. In its full form, this problem has been modeled as a nonlinear two-stage stochastic programming problem. In this work, we propose a hybrid structure that incorporates and takes advantage of both a high-fidelity physical model and fast machine learning surrogates. Neural network (NN) models have been shown to classify highly non-linear functions and can be trained offline but require large training sets. In this work, we present how model-guided sampling can efficiently create datasets that are highly informative to a NN classifier for non-convex functions. We show how the resultant NN surrogates can be integrated into a non-linear program as smooth, continuous functions to simultaneously optimize the objective function and enforce feasibility using existing non-linear solvers. Overall, this allows us to optimize instances of the SCOPF problem with an order of magnitude CPU improvement over existing methods.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Linearized Distribution Optimal Power Flow for OEDI SI

This research is to meant to demonstrate the OEDI SI use case for distributed optimal power flow (DOPF). The goal was to formulate the optimal power flow problem in the distribution system for active and reactive power setpoints of PV systems using topology information and voltage measurements. The co-simulation runs every 15 minutes as outlined within the scenario file for the given feeder configuration. The linked GitHub repository includes five federates to achieve DOPF for the small, medium, large, and IEEE 123 feeder scenarios. We are using the OEDI SI framework, as well as the example feeder, sensor, recorder, and estimator federates provided in the example repository for OEDI SI. We also provide a runner script for switching between scenarios.

algorithm↗

Sensitivity-based voltage constraints for optimal power flow in low-voltage distribution feeders

The optimal power flow (OPF) problem for distribution systems can include network details down to the low-voltage (LV) points of interconnection of individual customers. This paper addresses the implementation of voltage magnitude constraints, and sets forth a practicable approach for capturing the effects on voltage from the switching behavior of loads (e.g., heat pumps, air conditioners, water heaters, or pool pumps) and from the variability of renewable generation (e.g., rooftop solar). The proposed method adjusts the OPF voltage constraints based on forecasts of load and generation upper and lower bounds, in conjunction with sensitivity factors derived from the power flow equations. An illustrative OPF formulation is also provided, which incorporates transformer models that include core loss. We demonstrate that accurate modeling of these LV network components is critical to avoid voltage violations at customer points of interconnection. Furthermore, the ideas are validated through numerical case studies on a realistic distribution feeder.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Computational and numerical analysis of AC optimal power flow formulations on large-scale power grids

We report that alternating current optimal power flow (AC-OPF) is a fundamental tool in electric utilities to determine optimal operation of the various resources. Typically, the AC-OPF problem uses power balance formulation containing voltages and power equations. Yet, there is no comprehensive comparison of the different AC-OPF formulations, especially for large-scale networks. This paper presents a detailed comparative evaluation of different formulations of the AC-OPF problem on networks ranging from 9-bus to 25,000 buses. Three different formulations: 1) power balance with polar voltages, 2) power balance with Cartesian voltages, and 3) current balance with Cartesian voltages are discussed in detail by comparing their characteristics, and numerical and computational performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Reinforcement Learning Approach to Parameter Selection for Distributed Optimal Power Flow

With the increasing penetration of distributed energy resources, distributed optimization algorithms have attracted significant attention for power systems applications due to their potential for superior scalability, privacy, and robustness to a single point-of-failure. The Alternating Direction Method of Multipliers (ADMM) is a popular distributed optimization algorithm; however, its convergence performance is highly dependent on the selection of penalty parameters, which are usually chosen heuristically. In this work, we use reinforcement learning (RL) to develop an adaptive penalty parameter selection policy for alternating current optimal power flow (ACOPF) problem solved via ADMM with the goal of minimizing the number of iterations until convergence. We train our RL policy using deep Q-learning and show that this policy can result in significantly accelerated convergence (up to a 59% reduction in the number of iterations compared to existing, curvatureinformed penalty parameter selection methods). Furthermore, we show that our RL policy demonstrates promise for generalizability, performing well under unseen loading schemes as well as under unseen losses of lines and generators (up to a 50% reduction in iterations). This work thus provides a proof-of-concept for using RL for parameter selection in ADMM for power systems applications.

alternating current optimal power flow↗

Hierarchical Optimal Power Flow with Improved Gradient Evaluation

Existing algorithms to solve alternating-current optimal power flow (AC-OPF) often exploit linear approximations to simplify system models and accelerate computations. In this paper, we improve a recent hierarchical OPF algorithm, which rested on primal-dual gradients evaluated in a linearized distribution power flow model. Specifically, we identify a risk of voltage violation arising from the model linearization, and propose a more accurate gradient evaluation method to eliminate that risk. We further develop a hierarchical primal-dual algorithm to solve OPF based on the proposed gradient evaluation method. Numerical results on IEEE networks show that our algorithm can enhance voltage safety with satisfactory computational efficiency.

distributed algorithm↗