Search NASA⌕ Search

SEARCH · Search NASA

Results for “OPF”

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 109 records · Page 6

Orbiter processing facility service platform failure and redesign

In a high bay of the Orbiter Processing Facility (OPF) at the Kennedy Space Center, technicians were preparing the space shuttle orbiter Discovery for rollout to the Vehicle Assembly Building (VAB). A service platform, commonly referred to as an OPF Bucket, was being retracted when it suddenly fell, striking a technician and impacting Discovery's payload bay door. A critical component in the OPF Bucket hoist system had failed, allowing the platform to fall. The incident was thoroughly investigated by both NASA and Lockheed, revealing many design deficiencies within the system. The deficiencies and the design changes made to correct them are reviewed.

Harris, Jesse L.↗

STS-121: Discovery L-2 Countdown Status Briefing

Bruce Buckingham from NASA Public Affairs introduces Pete Nicolenko, NASA Test Director, and Kathy Winters, Shuttle Weather Officer. During this STS-121 two days before launch countdown briefing, Pete Nicolenko says that there are no issues of concern and that they are on schedule for launch. He then presents and discusses an Orbiter Processing Facility (OPF) video. The OPF topics of discussion include: 1) Wheel and tire installation; 2) Gap filler installation; 3) Booster build-up; 4) Transport of External Tank (ET) 119; 5) ET to Shuttle Rocket Booster (SRB) Mate operation; 6) Roll-over of Discovery out of OPF to the Vehicle Assembly Building (VAB); and 7) Roll-out to the pad. Kathy Winters gives her weather forecast for the STS-121 launch. The video ends with a question and answer period from the media.

Source record↗

Well Abandonment at Various Sites, John F. Kennedy Space Center, Florida

Between January 29 and March 9, 2016, a total of 23 monitoring wells were properly abandoned-in-place at five KSC sites (OPF-1&2, OPF-3, RDG, SRB, and HSB). The total abandonment encompassed 489.06 linear feet. The wells abandoned were constructed of PVC with diameters ranging from 1-inch to 2-inches. The shallowest well abandoned was measured to be 11.6 ft bls (OPF) and the deepest well abandoned was documented to be 51.45 feet bls (HSB). All aboveground completions were removed and each area was re-graded and/or grouted to surface to match existing surroundings. All materials (concrete pads, well casings, etc.) were disposed of accordingly.

MW↗

Optimal Power Flow in Multiphase Radial Networks with Delta Connections: Preprint

This paper focuses on multiphase radial distribution networks with mixed wye and delta connections, and proposes a semidefinite relaxation of the AC optimal power flow (OPF) problem. Two multiphase power-flow models are developed to facilitate the integration of delta-connected generation units/loads in the OPF problem. The first model extends traditional branch flow models - and it is referred to as extended branch flow model (EBFM). The second model leverages a linear relationship between per-phase power injections and delta connections, which holds under a balanced voltage approximation (BVA). Based on these models, pertinent OPF problems are formulated and relaxed to semidefinite programs (SDPs). Numerical studies on IEEE test feeders show that SDP relaxations can be solved efficiently by a generic optimization solver. Numerical evidences indicate that solving the resultant SDP under BVA is faster than under EBFM. Moreover, both SDP solutions are numerically exact with respect to voltages and branch flows. It is also shown that the SDP solution under BVA has a small optimality gap, while the BVA model is accurate in the sense that it reflects actual system voltages.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Decentralized wind uncertainty management: Alternating direction method of multipliers based distributionally-robust chance constrained optimal power flow

How to manage wind power uncertainty in system operation is an urgent and important issue, especially under substantially increasing penetration levels of wind generation in electric power systems. With increasing numbers of wind power plants (WPPs) integrated into power systems, their variability and uncertain power outputs become a challenge to maintaining system reliability. Traditional stochastic optimization-based models face the curse of dimensionality when the number of WPPs increases. This paper proposes a novel decentralized wind power uncertainty management model. In this model, conventional generators optimize their power capacity output and their participation to mitigate wind power uncertainty locally with only limited information exchange with the system operators. First, a distributionally-robust chance-constrained optimal power flow (DRCC-OPF) model is deployed to schedule the generation and reserve considering the wind power forecast uncertainty. Then, the alternating direction method of multipliers (ADMM) is used to reformulate the DRCC-OPF model into the distributed optimization model for each conventional generator and WPP. The tests on a small PJM 5-bus system and the IEEE 118-bus system demonstrate that the proposed decentralized model can increase the operation reliability without sacrificing system operating cost, especially when the wind power penetration levels are high. Using the proposed model, the optimal solutions can be obtained within one minute, for all studied cases, which verifies the computation efficiency of the proposed decentralized model. Furthermore, considering a large number of WPPs integrated into the system, the proposed decentralized method obtains a lower operating cost within one minute which demonstrates its efficiency to deal with high dimension of uncertainties.

17 WIND ENERGY↗

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↗

Applications of Lifted Nonlinear Cuts to Convex Relaxations of the AC Power Flow Equations

Here, we demonstrate that valid inequalities, or lifted nonlinear cuts (LNC), can be projected to tighten the Second Order Cone (SOC), Convex DistFlow (CDF), and Network Flow (NF) relaxations of the AC Optimal Power Flow (AC-OPF) problem. We conduct experiments on 38 cases from the PGLib-OPF library, showing that the LNC strengthen the SOC and CDF relaxations in 100% of the test cases, with average and maximum differences in the optimality gaps of 6.2% and 17.5% respectively. The NF relaxation is strengthened in 46.2% of test cases, with average and maximum differences in the optimality gaps of 1.3% and 17.3% respectively. We also study the trade-off between relaxation quality and solve time, demonstrating that the strengthened CDF relaxation outperforms the strengthened SOC formulation in terms of runtime and number of iterations needed, while the strengthened NF formulation is the most scalable with the lowest relaxation quality improvement due to these LNC.

24 POWER TRANSMISSION AND DISTRIBUTION↗

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↗

Inexact convex relaxations for AC optimal power flow: Towards AC feasibility

Convex relaxations of AC optimal power flow (AC-OPF) problems have attracted significant interest as in several instances they provably yield the global optimum to the original non-convex problem. If, however, the relaxation is inexact, the obtained solution is not AC-feasible. The quality of the obtained solution is essential for several practical applications of AC-OPF, but detailed analyses are lacking in existing literature. Here, this paper aims to cover this gap. We provide an in-depth investigation of the solution characteristics when convex relaxations are inexact, we assess the most promising AC feasibility recovery methods for large-scale systems, and we propose two new metrics that lead to a better understanding of the quality of the identified solutions. We perform a comprehensive assessment on 96 different test cases, ranging from 14 to 3120 buses, and we show the following: (i) Despite an optimality gap of less than 1%, several test cases still exhibit substantial distances to both AC feasibility and local optimality and the newly proposed metrics characterize these deviations. (ii) Penalization methods fail to recover an AC-feasible solution in 15 out of 45 test cases. (iii) The computational benefits of warm-starting non-convex solvers have significant variation, but a computational speedup exists in over 75% of cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stochastic multi-period optimal dispatch of energy storage in unbalanced distribution feeders

This report presents a convex, multi-period, AC-feasible Optimal Power Flow (OPF) framework that robustly dispatches flexible demand-side resources in unbalanced distribution feeders against uncertainty in very-short timescale solar Photo-Voltaic (PV) forecasts. This is valuable for power systems with significant behind-the-meter solar PV generation as their operation is affected by uncertainty from forecasts of demand and solar PV generation. The aim of this work is then to ensure the feasibility and reliability of distribution system operation under high solar PV penetration. We develop and present a novel, robust OPF formulation that accounts for both the nonlinear power flow constraints and the uncertainty in forecasts. This is achieved by linearizing an optimal trajectory and using first-order methods to systematically tighten voltage bounds. Case studies on a realistic distribution feeder shows the effectiveness of a receding-horizon implementation.

25 ENERGY STORAGE↗

Joint scheduling of energy, fast and primary frequency response reserves in integrated transmission–distribution networks

Inverter-based distributed energy resources (DERs) connected to distribution networks (DNs) can provide fast frequency support, but their reserve deliverability depends on feeder constraints and differs from synchronous primary frequency response (PFR). Existing transmission–distribution coordination studies usually treat reserve generically or neglect feeder-level feasibility, while frequency-security scheduling studies rarely represent distribution feeders explicitly. This paper develops a bi-level day-ahead scheduling framework for integrated transmission–distribution networks that jointly clears energy, transmission-side PFR, and distribution-side fast frequency response (FFR) under exogenous hourly inertia and largest-loss inputs from an external unit commitment (UC) schedule. The transmission problem is modeled with DC-optimal power flow (OPF) and closed-form second-order cone (SOC) frequency-security constraints, whereas each DN is represented by a reserve-aware branch-flow AC-OPF so that scheduled fast reserves remain deliverable during activation. The bi-level problem is reformulated through Karush–Kuhn–Tucker (KKT) conditions into a mixed-integer SOC program, and a penalty term is used to tighten the distribution-network relaxation. In the reduced test system, lower exogenous inertia increased the required primary response from 179.64 MW to 191.08 MW, distribution-side fast response reduced total frequency-response procurement by up to 4.9%, and neglecting distribution constraints overstated the combined distribution-side energy and reserve award by up to 18%. In the expanded study, the largest case was solved in 2.02 s with a 0.00% optimality gap. Time-domain simulations kept the frequency nadir above 59.0 Hz in all tested hours. These results demonstrate the value of fast-response modeling and distribution-feasible reserve delivery in coordinated market clearing.

Noh, Seung-Gil↗

Solution techniques for transient stability‐constrained optimal power flow – Part I

This series of studies present the state‐of‐the‐art for the solution of the transient stability constrained optimal power flow problem (TSC‐OPF). Three different classes of solution techniques: dynamic optimisation‐based, SIME method, and computational intelligence, are discussed in detail. Moreover, discussed are issues to consider while solving such problems, various application areas, and future directions in this research area. A comprehensive resource of the available literature, publicly available test systems, and relevant numerical libraries is also provided. This study presents the TSC‐OPF formulation and discusses various dynamic optimisation‐based approaches. Two optimisation techniques, full‐space and reduced‐space method, are presented for solving the resulting non‐linear optimisation problem.

Abhyankar, Shrirang↗

Endogenous Interface Pricing for Consistent Transmission–Distribution Co-Optimization With Discrete Distribution Controls

This paper proposes an endogenous interface pricing model for day-ahead transmission–distribution co-optimization that co-determines the interface locational marginal price (LMP) and the transmission–distribution exchange, ensuring price–dispatch consistency while optimally scheduling discrete distribution controls. The formulation couples a DC optimal power flow (OPF) with a branch-flow AC OPF that schedules distributed energy resources (DERs), tap-changer settings, capacitor banks (CBs), and multi-period energy storage systems (ESSs) under feeder voltage and current limits, and is solved as a mixed-integer second-order cone program (MISOCP). In a T14–D33 system, coordinated device scheduling recovers about 90% of the distribution-to-transmission export achievable in a reference case that ignores distribution network (DN) limits, while satisfying a 1.05 p.u. voltage upper bound. In a T39–D34/D37/D123 system, a sequential decoupled benchmark produces interface LMP distortions up to 12.5% and a 7.28% mismatch in net export energy, whereas the proposed model removes these distortions and the associated settlement mismatches. Second-order cone (SOC) relaxation gaps remain below $10^{-3}$ in all cases.

Noh, Seung-Gil↗

Assessing the Optimality of LinDist3Flow for Optimal Tap Selection of Step Voltage Regulators in Unbalanced Distribution Networks

The adoption of distributed energy resources such as photovoltaics (PVs) has increased dramatically during the previous decade. The increased penetration of PVs into distribution networks (DNs) can cause voltage fluctuations that have to be mitigated. One of the key utility assets employed to this end are step-voltage regulators (SVRs). It is desirable to include tap selection of SVRs in optimal power flow (OPF) routines, a task that turns out to be challenging because the resultant OPF problem is nonconvex with added complexities stemming from accurate SVR modeling. While several convex relaxations based on semi-definite programming (SDP) have been presented in the literature for optimal tap selection, SDP based schemes do not scale well and are challenging to implement in large-scale planning or operational frameworks. This paper deals with the optimal tap selection (OPTS) problem for wye-connected SVRs using linear approximations of power flow equations. Specifically, the LinDist3Flow model is adopted and the effective SVR ratio is assumed to be continuous- enabling the formulation of a problem called LinDist3Flow-OPTS, which amounts to a linear program. The scalability and optimality gap of LinDist3Flow-OPTS are evaluated with respect to existing SDP-based and nonlinear programming techniques for optimal tap selection in three standard feeders, namely, the IEEE 13-bus, 123-bus, and 8500-node DNs. For all DNs considered, LinDist3Flow-OPTS achieves an optimality gap of approximately 1% or less while significantly lowering the computational burden.

linear approximations↗

Hybrid Cascading Outage Analysis of Extreme Events with Optimized Corrective Actions

Power system are vulnerable to extreme contingencies (like an outage of a major generating substation) that can cause significant generation and load loss and can lead to further cascading outages of other transmission facilities and generators in the system. Some cascading outages are seen within minutes following a major contingency, which may not be captured exclusively using the dynamic simulation of the power system. The utilities plan for contingencies either based on dynamic or steady state analysis separately which may not accurately capture the impact of one process on the other. We address this gap in cascading outage analysis by developing Dynamic Contingency Analysis Tool (DCAT) that can analyze hybrid dynamic and steady state behavior of the power system, including protection system models in dynamic simulations, and simulating corrective actions in post-transient steady state conditions. One of the important implemented steady state processes is to mimic operator corrective actions to mitigate aggravated states caused by dynamic cascading. This paper presents an Optimal Power Flow (OPF) based formulation for selecting corrective actions that utility operators can take during major contingency and thus automate the hybrid dynamic-steady state cascading outage process. The improved DCAT framework with OPF based corrective actions is demonstrated on IEEE 300 bus test system.

Cascading outage↗

Learning-Accelerated ADMM for Distributed DC Optimal Power Flow

We suggest a novel data-driven method to accelerate the convergence of Alternating Direction Method of Multipliers (ADMM) for solving distributed DC optimal power flow (DC-OPF) where lines are shared between independent network partitions. Using previous observations of ADMM trajectories for a given system under varying load, the method trains a recurrent neural network (RNN) to predict the converged values of dual and consensus variables. Given a new realization of system load, a small number of initial ADMM iterations is taken as input to infer the converged values and directly inject them into the iteration. We empirically demonstrate that the online injection of these values into the ADMM iteration accelerates convergence by a significant factor for partitioned 14-, 118-and 2848-bus test systems under differing load scenarios. The proposed method has several advantages: it maintains the security of private decision variables inherent in consensus ADMM; inference is fast and so may be used in online settings; RNN-generated predictions can dramatically improve time to convergence but, by construction, can never result in infeasible ADMM subproblems; it can be easily integrated into existing software implementations. While we focus on the ADMM formulation of distributed DC-OPF in this paper, the ideas presented are naturally extended to other distributed optimization problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Graph-Based Attention Mechanisms for Solving the AC Optimal Power Flow Problem in Electrical Power Networks

With the increasing complexity and data availability in modern power systems, learning-based approaches to AC Optimal Power Flow (AC OPF) have garnered significant attention. In particular, the structure of smart grids lends itself naturally to graph-based representations, where Graph Neural Networks (GNNs) can capture spatial and relational dependencies. This paper investigates attention-based GNN architectures tailored to heterogeneous graph representations of electric grids. We evaluate two major paradigms: relational attention, which distinguishes between edge types during message passing, and meta-path attention, which captures high-level semantics through multi-hop, typed paths. Using a large corpus of public AC OPF scenarios, we benchmark representative models of each type of attention. Our results demonstrate the benefits of heterogeneous attention-based models in accurately capturing grid dynamics; heterogeneous attention models achieve superior performance in both standard and perturbed settings. The findings highlight the importance of semantic-aware architectures for improving prediction robustness and interpretability in power system applications.

Trigui, Ali [Qubit Engineering Inc.]↗