Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “power optimizer”

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 415 records · Page 23
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Conservation Voltage Reduction with Distributed Energy Resource Management System, Grid-Edge, and Legacy Devices: Preprint

Distribution utilities use conservation voltage reduction (CVR) to obtain energy savings and lower peak demand by reducing bus voltages. Traditionally, the CVR is accomplished by controlling the legacy assets such as load tap changers, voltage regulators, and capacitor banks. The deployment of the advanced distribution management system (ADMS) and distributed energy resource management system (DERMS) enables the integration of distributed energy resources into the distribution networks and provide the grid services including CVR. This paper studies the coordinated operation of an ADMS and a DERMS in achieving CVR and voltage regulation. A commercial ADMS uses legacy devices and Edge-of-Network Grid Optimization (ENGO) devices to obtain energy savings through CVR. A prototype DERMS dispatches the photovoltaic smart inverters based on real-time optimal power low to ensure voltage regulation across the feeder. The results show that the coordinated operation of ADMS and DERMS is effective in achieving CVR and voltage regulation. Specifically, energy savings of up to 4.7% are observed in the real utility distribution system used in this study.

advanced distribution management system↗
DOE OSTI2015

Scalable Heuristics for Planning, Placement and Sizing of Flexible AC Transmission System Devices

Aiming to relieve transmission grid congestion and improve or extend feasibility domain of the operations, we build optimization heuristics, generalizing standard AC Optimal Power Flow (OPF), for placement and sizing of Flexible Alternating Current Transmission System (FACTS) devices of the Series Compensation (SC) and Static VAR Compensation (SVC) type. One use of these devices is in resolving the case when the AC OPF solution does not exist because of congestion. Another application is developing a long-term investment strategy for placement and sizing of the SC and SVC devices to reduce operational cost and improve power system operation. SC and SVC devices are represented by modification of the transmission line inductances and reactive power nodal corrections respectively. We find one placement and sizing of FACTs devices for multiple scenarios and optimal settings for each scenario simultaneously. Our solution of the nonlinear and nonconvex generalized AC-OPF consists of building a convergent sequence of convex optimizations containing only linear constraints and shows good computational scaling to larger systems. The approach is illustrated on single- and multi-scenario examples of the Matpower case-30 model.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Local Feature Sufficiency Exploration for Predicting Security-constrained Generation Dispatch in Multi-Area Power Systems

Deriving generation dispatch is essential for efficient and secure operation of electric power systems. This is usually achieved by solving a security-constrained optimal power flow(SCOPF) problem, which is by nature non-convex, nonlinear and thus computational intensive. The state-of-the-art optimization approaches are not able to solve this problem for large-scale power systems within power system operation time window (usually 5 minutes). In this work, we developed supervised learning approaches to determine security-constrained generation dispatch within much shorter time window. More importantly, the physical constrain of only accessing to local measurements and other information in most utilities’ real-time operation can not be ignored for the predictive models.The feasibility and accuracy of utilizing only local features(measurements and grid information in one area) to predict optimal local generation dispatch (dispatch of all generators in the corresponding area) in multi-area power systems has been explored. The results showed optimal local generation dispatch can be predicted with local features with high accuracy, which is comparable to the results obtained with global features.

Sun, Yixuan↗
DOE OSTI2022

Feasible region-based heuristics for optimal transmission switching

In this paper, we develop a optimal transmission switching (OTS) heuristic based on DC optimal power flow (OPF) and assess the efficacy of the approach when implemented within AC OPF. Traditional formulations of the OTS problem can result in hundreds or thousands of binary variables for large networks, making the OTS problem challenging to solve on fast timescales even for relatively small networks. Here, we identify which constraints and therefore which variables are constraining the DC OPF feasible region, and rank them based on their impact on the cost function. We develop a heuristic algorithm which iteratively removes these constraints and solves a series of standard DC OPF problems. The heuristic is tested on a variety of PGlib networks and the results show that the algorithm can provide substantial cost decreases without having to solve any mixed integer programs. Additionally, we provide insights about the OTS problem, including identifying scenarios outside congestion where OTS can prove useful. Lastly, the performance of the DC-based heuristic is shown when the line switching decisions are implemented within AC OPF.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2024

ARPA-E Grid Optimization (GO) Competition Challenge 1

The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public. Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition. Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found. For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below.

ACOPF↗
DOE OSTI2019

Adjustable and distributionally robust chance-constrained economic dispatch considering wind power uncertainty

This paper proposes an adjustable and distributionally robust chance-constrained (ADRCC) optimal power flow (OPF) model for economic dispatch considering wind power forecasting uncertainty. The proposed ADRCC-OPF model is distributionally robust because the uncertainties of the wind power forecasting are represented only by their first- and second-order moments instead of a specific distribution assumption. The proposed model is adjustable because it is formulated as a second-order cone programming (SOCP) model with an adjustable coefficient. This coefficient can control the robustness of the chance constraints, which may be set up for the Gaussian distribution, symmetrically distributional robustness, or distributionally robust cases considering wind forecasting uncertainty. The conservativeness of the ADRCC-OPF model is analyzed and compared with the actual distribution data of wind forecasting error. The system operators can choose an appropriate adjustable coefficient to tradeoff between the economics and system security.

17 WIND ENERGY↗
DOE OSTI2021

PowerGridworld: A Framework for Multi-Agent Reinforcement Learning in Power Systems [SWR-22-07]

NREL's PowerGridworld provides a modular simulation environment for training heterogenous, grid-aware, multi-agent reinforcement learning (RL) policies at scale. The package enables the user to create component gym environments that can be composed into more complex agents. For example, a grid interactive building environment can be created by composing together component environments each encapsulating the building, PV, and battery physics. These multi-component environments can then be combined into multi-agent simulation where each agent's power consumption/injection becomes an input for solving the optimal power flow on a distribution feeder modeled in OpenDSS. Information from OpenDSS, such as bus voltages and line flows, can be included in the agents' observation spaces to enable grid-aware rewards. The default API for the PowerGridworld simulator conforms to RLLib's MultiAgent API and thus enables distributed training using HPC and cloud resources.

Biagioni, David↗
DOE OSTI2022

Learning Local Volt/VAR Controllers Toward Efficient Network Operation with Stability Guarantees: Preprint

This paper considers the problem of voltage regulation in distribution network. The primary motivation is to keep voltages within pre-assigned operating limits by commanding the reactive power output of distributed energy resources (DERs) deployed in the grid. We develop a framework for developing local Volt/Var control that comprises of two main steps. In the first, exploiting historical data and for each DER, we learn a function representing desirable equilibrium points for the power network. These points approximate solutions of an Optimal Power Flow problem. In the second, we propose a control scheme for steering the network towards these favorable configurations. Theoretical conditions are derived to formally guarantee the stability of the developed control scheme and numerical simulations illustrate the effectiveness of the proposed approach.

data-driven control↗
NASA NTRS2016

Trajectory Design Employing Convex Optimization for Landing on Irregularly Shaped Asteroids

Mission proposals that land on asteroids are becoming popular. However, in order to have a successful mission the spacecraft must reliably and softly land at the intended landing site. The problem under investigation is how to design a fuel-optimal powered descent trajectory that can be quickly computed on- board the spacecraft, without interaction from ground control. An optimal trajectory designed immediately prior to the descent burn has many advantages. These advantages include the ability to use the actual vehicle starting state as the initial condition in the trajectory design and the ease of updating the landing target site if the original landing site is no longer viable. For long trajectories, the trajectory can be updated periodically by a redesign of the optimal trajectory based on current vehicle conditions to improve the guidance performance. One of the key drivers for being completely autonomous is the infrequent and delayed communication between ground control and the vehicle. Challenges that arise from designing an asteroid powered descent trajectory include complicated nonlinear gravity fields, small rotating bodies and low thrust vehicles. There are two previous studies that form the background to the current investigation. The first set looked in-depth at applying convex optimization to a powered descent trajectory on Mars with promising results.1, 2 This showed that the powered descent equations of motion can be relaxed and formed into a convex optimization problem and that the optimal solution of the relaxed problem is indeed a feasible solution to the original problem. This analysis used a constant gravity field. The second area applied a successive solution process to formulate a second order cone program that designs rendezvous and proximity operations trajectories.3, 4 These trajectories included a Newtonian gravity model. The equivalence of the solutions between the relaxed and the original problem is theoretically established. The proposed solution for designing the asteroid powered descent trajectory is to use convex optimization, a gravity model with higher fidelity than Newtonian, and an iterative solution process to design the fuel optimal trajectory. The solution to the convex optimization problem is the thrust profile, magnitude and direction, that will yield the minimum fuel trajectory for a soft landing at the target site, subject to various mission and operational constraints. The equations of motion are formulated in a rotating coordinate system and includes a high fidelity gravity model. The vehicle's thrust magnitude can vary between maximum and minimum bounds during the burn. Also, constraints are included to ensure that the vehicle does not run out of propellant, or go below the asteroid's surface, and any vehicle pointing requirements. The equations of motion are discretized and propagated with the trapezoidal rule in order to produce equality constraints for the optimization problem. These equality constraints allow the optimization algorithm to solve the entire problem, without including a propagator inside the optimization algorithm.

Pinson, Robin M.↗
DOE OSTI2018

Beyond Relaxation and Newton–Raphson: Solving AC OPF for Multi-Phase Systems With Renewables

This paper focuses on the AC Optimal Power Flow (OPF) problem for multi-phase systems. Particular emphasis is given to systems with high integration of renewables, where adjustments of the real and reactive output powers from renewable sources of energy are necessary in order to enforce voltage regulation. The AC OPF problem is known to be nonconvex (and, in fact, NP-hard). Convex relaxation techniques have been recently explored to solve the OPF task with reduced computational burden; however, sufficient conditions for tightness of these relaxations are only available for restricted classes of system topologies and problem setups. Identifying feasible power-flow solutions remains hard in more general problem formulations, especially in unbalanced multi-phase systems with renewables. To identify feasible and optimal AC OPF solutions in challenging scenarios where existing methods may fail, this paper leverages the Feasible Point Pursuit - Successive Convex Approximation algorithm - a powerful approach for general nonconvex quadratically constrained quadratic programs. The merits of the approach are illustrated using single- and multiphase distribution networks with renewables, as well as several transmission systems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Machine Learning-Assisted Distribution System Network Reconfiguration Problem

High penetration from volatile renewable energy resources in the grid and the varying nature of loads raise the need for frequent line switching to ensure the efficient operation of electrical distribution networks. Operators must ensure maximum load delivery, reduced losses, and the operation between voltage limits. However, computations to decide the optimal feeder configuration are often computationally expensive and intractable, making it unfavorable for real-time operations. This is mainly due to the existence of binary variables in the network reconfiguration optimization problem. To tackle this issue, we have devised an approach that leverages machine learning techniques to reshape distribution networks featuring multiple substations. This involves predicting the substation responsible for serving each part of the network. Hence, it leaves simple and more tractable Optimal Power Flow problems to be solved. This method can produce accurate results in a significantly faster time, as demonstrated using the IEEE 37-bus distribution feeder. Compared to the traditional optimization-based approaches, a feasible solution is achieved approximately ten times faster for all the tested scenarios.

deep neural networks↗
DOE OSTI2022

Modeling the AC Power Flow Equations with Optimally Compact Neural Networks: Application to Unit Commitment

Nonlinear power flow constraints render a variety of power system optimization problems computationally intractable. Emerging research shows, however, that the nonlinear AC power flow equations can be successfully modeled using neural networks. These neural networks can be exactly transformed into mixed integer linear programs and embedded inside challenging optimization problems, thus replacing nonlinearities that are intractable for many applications with tractable piecewise linear approximations. Such approaches, though, suffer from an explosion of the number of binary variables needed to represent the neural network. Accordingly, this paper develops a technique for training an "optimally compact'' neural network, i.e., one that can represent the power flow equations with a sufficiently high degree of accuracy while still maintaining a tractable number of binary variables. We demonstrate the use of this neural network as an approximator of the nonlinear power flow equations by embedding it in the AC unit commitment problem, transforming the problem from a mixed integer nonlinear program into a more manageable mixed integer linear program. We use the 14-, 57-, and 89-bus networks as test cases and compare the AC-feasibility of commitment decisions resulting from the neural network, DC, and linearized power flow approximations. Our results show that the neural network model outperforms both the DC and linearized power flow approximations when embedded in the unit commitment problem. The neural network formulation most often selects a feasible unit commitment schedule, and furthermore, it only s

AC power flow↗
DOE OSTI2018

A multitree approach for global solution of ACOPF problems using piecewise outer approximations

Electricity markets rely on the rapid solution of the optimal power flow (OPF) problem to determine generator power levels and set nodal prices. Traditionally, the OPF problem has been formulated using linearized, approximate models, ignoring nonlinear alternating current (AC) physics. These approaches do not guarantee global optimality or even feasibility in the real ACOPF problem. We introduce an outer-approximation approach to solve the ACOPF problem to global optimality based on alternating solution of upper- and lower-bounding problems. The lower-bounding problem is a piecewise relaxation based on strong second-order cone relaxations of the ACOPF, and these piecewise relaxations are selectively refined at each major iteration through increased variable domain partitioning. Our approach is able to efficiently solve all but one of the test cases considered to an optimality gap below 0.1%. This approach opens the door for global solution of MINLP problems with AC power flow equations.

42 ENGINEERING↗
DOE OSTI2023

Pathways to High-Power-Density Redox Flow Batteries

Redox flow batteries (RFBs) promise to fill a crucial missing link in the energy transition: inexpensive and widely deployable grid and industrial-scale energy storage for intermittent renewable electricity. While numerous lab-scale and demonstration-scale RFBs have been delivered, widespread commercial deployment is still limited by high electrolyte, stack, and balance of plant capital costs. Increasing the power density of RFBs is correlated with lower stack costs, primarily because the area needed for expensive electrode and membrane components to reach a target power density is reduced. Here, in the present contribution, we summarize the areal power densities reported for lab-scale RFBs, critically evaluate major pathways employed for power optimization, and identify opportunities for developing yet-higher power density systems.

25 ENERGY STORAGE↗
NASA NTRS2006

Multichannel Phase and Power Detector

An electronic signal-processing system determines the phases of input signals arriving in multiple channels, relative to the phase of a reference signal with which the input signals are known to be coherent in both phase and frequency. The system also gives an estimate of the power levels of the input signals. A prototype of the system has four input channels that handle signals at a frequency of 9.5 MHz, but the basic principles of design and operation are extensible to other signal frequencies and greater numbers of channels. The prototype system consists mostly of three parts: An analog-to-digital-converter (ADC) board, which coherently digitizes the input signals in synchronism with the reference signal and performs some simple processing; A digital signal processor (DSP) in the form of a field-programmable gate array (FPGA) board, which performs most of the phase- and power-measurement computations on the digital samples generated by the ADC board; and A carrier board, which allows a personal computer to retrieve the phase and power data. The DSP contains four independent phase-only tracking loops, each of which tracks the phase of one of the preprocessed input signals relative to that of the reference signal (see figure). The phase values computed by these loops are averaged over intervals, the length of which is chosen to obtain output from the DSP at a desired rate. In addition, a simple sum of squares is computed for each channel as an estimate of the power of the signal in that channel. The relative phases and the power level estimates computed by the DSP could be used for diverse purposes in different settings. For example, if the input signals come from different elements of a phased-array antenna, the phases could be used as indications of the direction of arrival of a received signal and/or as feedback for electronic or mechanical beam steering. The power levels could be used as feedback for automatic gain control in preprocessing of incoming signals. For another example, the system could be used to measure the phases and power levels of outputs of multiple power amplifiers to enable adjustment of the amplifiers for optimal power combining.

Li, Samuel↗
DOE OSTI2024

Challenges in Training PINNs: A Loss Landscape Perspective

This paper explores challenges in training Physics Informed Neural Networks (PINNs), emphasizing the role of the loss landscape in the training process. We examine difficulties in minimizing the PINN loss function, particularly due to ill conditioning caused by differential operators in the residual term. We compare gradient-based optimizers Adam, L-BFGS, and their combination Adam+L-FGS, showing the superiority of Adam+L-BFGS, and introduce a novel secondorder optimizer, NysNewton-CG (NNCG), which significantly improves PINN performance. Theoretically, our work elucidates the connection between ill-conditioned differential operators and ill-conditioning in the PINN loss and shows the benefits of combining first- and second-order optimization methods. Our work presents valuable insights and more powerful optimization strategies for training PINNs, which could improve the utility of PINNs for solving difficult partial differential equations.

Rathore, Pratik↗
NASA NTRSDate not supplied

Robust Trajectory Optimization for Guided Powered Descent and Landing

A robust trajectory optimization approach for guidance algorithm gain selection for powered descent and landing is developed. This approach uses a genetic algorithm to determine optimal guidance algorithm parameters while incorporating uncertainty information from linear covariance analysis. The optimal guidance algorithm parameters are determined while accounting for environment, navigation, and vehicle property uncertainty and sensor suite fidelity. As a demonstration of this method, the optimal gains for the fractional polynomial powered descent guidance are found for the braking phase of a robotic lunar landing mission. Scenarios with differing sensor suites and sensor qualities are considered, with objective functions to minimize variability in propellant usage or terminal position. Results show that the optimal guidance algorithm gains for a given trajectory differ based on the sensor suite, and optimal guidance algorithm gains may result in up to 20% performance improvements over the baseline in propellant usage and landed accuracy.

Grace E Calkins↗