SEARCH · Search NASA
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.
Novel uncertainty quantification approach for machine learning based physics informed graph neural networks capable of quickly computing bulk energy system contingencies from a large search space with tolerance to changing grid topologies.
The standard optimal power flow (OPF) problem is an economic dispatch (ED) problem combined with transmission constraints, which are based on a static topology. Prior research has demonstrated that cooptimization of generation dispatch and transmission topology results in cost savings. However, the computational complexity associated with topology control (TC) has been a major deterrent to its implementation. The proposed work investigates the application of a heuristic, a greedy algorithm, to improve the computational time for the TC problem while still maintaining the ability to find quality solutions. An expression is derived, which indicates the impact on the objective for a marginal change in the state of a transmission line. This expression is used to generate a priority list with potential candidate lines for switching, which may provide huge improvements to the system. The advantage of this method is that it is a fast heuristic as compared to using mixed integer programming (MIP) to find a solution. The heuristic is tested on real-time applications such as N-1 events, N - m events (m simultaneous contingencies), and cascading events. The proposed algorithm specifically targets cases that lead to load shedding in the system and provides a quick and efficient method to restore the loads by improving the deliverability of reserves via TC. Simulation results on the IEEE 73 bus test system and the IEEE 118 bus test system suggest a significant improvement in the amount of load served to the system with TC as opposed to without TC with minimal time and computation.
This document provides implementation guidance for implementing personnel group FTE costs by JCA Tier 1 or 2 categories in the Contingency Contractor Optimization Tool – Engineering Prototype (CCOT-P). CCOT-P currently only allows FTE costs by personnel group to differ by mission. Changes will need to be made to the user interface inputs pages and the database
Los Alamos researchers have developed the Severe Contingency Solver (SCS) to help power network operators and policy makers better understand the vulnerabilities of electric power transmission systems to extreme events, such as hurricanes, ice storms, and earthquakes. It guarantees a solution for power networks with hundreds to thousands of damaged components. SCS supports multiple platforms (e.g., Linux, Windows, Mac OS X) and removes the need for human intervention when analyzing severely damaged power networks. The information can be used to prepare for extreme events and plan network upgrades for improved network resilience.
A Long Term Monitoring System Design has been designed to monitor conditions in the perched groundwater including changes in the perched aquifer as a result of implementing the response actions. Monitoring is required for verifying the effectiveness of perched groundwater response actions (i.e., conditions in the perched aquifer are being affected as intended) and for confirming that the perched aquifer and Ogallala Aquifer characterization as defined in the Resource Conservation and Recovery Act Facility Investigation Report and the Corrective Measure Studies/Feasibility Study remains accurate. If monitoring results obtained through the monitoring network identify an unexpected conditions or deviation, contingent actions will be considered and implemented as necessary to ensure continued protection of the Ogallala Aquifer and human health and the environment.
Introducing machine learning (ML) assistance into any established process comes with adoption barriers, including entrenched procedures, technological and human readiness levels, human-machine trust, and work culture resistance to change. These barriers are even greater in critical operations such as operating a national or regional power grid, in which both regulatory frameworks and the importance of maintaining reliability levels causes additional resistance to the adoption of new computational support. Developers of future systems and job aides must consider not only technical aspects, but also whether new systems are usable by power system operators. This work presents the methodology and results of a study to evaluate the usability and readiness of a prototype recommender system for power grid contingency analysis. We explore operator cognitive load and evaluate operator performance when solving a collection of scenarios both with and without recommender assistance. We also examine operator trust in the system. We report insights gained on the readiness of the system using a collection of evaluation techniques.
Explore the source record for details and available documents.
Not Available
Not Available
Changing power system configuration may result in load shed recovery (LSR) because topology change can provide power flow control in meshed network. Some topologies may favor generation redispatch as compared to others and can eliminate line congestion which leads to LSR. One of the known methods for topology change is called transmission switching (TS) and research conducted in the past showed that TS is an effective means of mitigating load shedding. Another method of topology control is intentional islanding (IIS). In this manuscript, we explore IIS as a potential solution for LSR. IIS based on generator coherency has been presented in literature for mitigating cascading failures. However, IIS has not been explored solely as a LSR mechanism. In this paper, we compare the LSR based on IIS with well known LSR algorithm based on TS. The comparison is performed for IEEE 39-bus system and IEEE 118- bus system. The results show that IIS has a potential to perform better than TS in terms of computational efficiency and LSR.
Explore the source record for details and available documents.
This work considers the task of finding an AC-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC Maximal Load Delivery (AC-MLD) task is a nonlinear, non-convex optimization problem, and is incredibly challenging to solve on large-scale transmission system datasets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate their effectiveness, the solution methods proposed in this work are rigorously evaluated on 1000 N – k scenarios on seven power networks ranging in size from 70 to 6000 buses. Furthermore, the most effective relaxation of the AC-MLD problem converges in less than 20 seconds on commodity computing hardware for all 7000 of the scenarios considered.
We address the bilevel optimization problem of identifying the most critical attacks to an alternating current (AC) power flow network. The upper-level binary maximization problem consists of choosing an attack that is treated as a parameter in the lower-level defender minimization problem. Instances of the lower-level global minimization problem by themselves are NP-hard due to the nonconvex AC power flow constraints, and bilevel solution approaches commonly apply a convex relaxation or approximation to allow for tractable bilevel reformulations at the cost of underestimating some power system vulnerabilities. Our main contribution is to provide an alternative branch-and-bound algorithm whose upper bounding mechanism (in a maximization context) is based on a reformulation that avoids relaxation of the AC power flow constraints in the lower-level defender problem. Lower bounding is provided with semidefinite programming (SDP) relaxed solutions to the lower-level problem. We establish finite termination with guarantees of either a globally optimal solution to the original bilevel problem, or a globally optimal solution to the SDP-relaxed bilevel problem which is included in a vetted list of upper-level attack solutions, at least one of which is a globally optimal solution to the bilevel problem. We demonstrate through computational experiments applied to IEEE case instances both the relevance of our contribution, and the effectiveness of our contributed algorithm for identifying power system vulnerabilities without resorting to convex relaxations of the lower-level problem. We conclude with a discussion of future extensions and improvements.
Oral presentation at the !AEA International Conference on Physical Protection of Nuclear Material and Nuclear Facilities, Nov 13-17, 2017, Vienna, Austria.
Abstract Not Provided
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Abstract not provided.