Search NASA⌕ Search

SEARCH · Search NASA

Results for “contingency”

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 235 records · Page 13

Dynamic Vehicle Assessment for Intelligent Contingency Management for Urban Air Mobility Vehicles

New algorithms will be required to ensure passenger and bystander safety during the expected era of autonomous urban air mobility (UAM) aircraft. This paper examines an approach for assessing the vehicle capability to fly itself and to complete a mission safely. The concepts combine elements of system identification, adaptive control, flight dynamics, envelope predictions, and handling qualities, as well as human pilot intuition. The approach is applied to a simulation of a generic distributed electric propulsion urban air mobility-type aircraft, which was developed under the NASA Transformational Tools and Technologies (TTT) project, Autonomous Systems / Intelligent Contingency Management subproject.

flight envelope prediction↗

Assuring Intelligent Systems: Contingency Management for UAS

Unmanned aircraft systems (UAS) collaborate with humans to operate in diverse, safety-critical applications. However, assurance technologies need to be integrated into the design process in order to guarantee safe behavior, thereby enabling UAS operations in the National Airspace System (NAS). In this paper, formal methods are integrated with learning-enabled systems representations. The generation and representation of knowledge are captured via monadic second-order logic rules in the cognitive architecture Soar. These rules are translated into timed automata, and a proof of correctness for the translation is provided so that safety and liveness properties can be checked in the formal verification environment Uppaal. This approach is agnostic to the learning mechanism used to generate the learned rules (e.g., chunking, etc.). An example of a fault-tolerant, learning-enabled UAS deciding which of four contingency procedures to execute under a lost link scenario while overflying an urban area is used to illustrate the approach.

Intelligent Systems↗

Benchmark Problem Development for Testing Maturity of Intelligent Contingency Management Tools

Increasingly autonomous Advanced Air Mobility (AAM) vehicles will be required to handle diverse conditions with limited human intervention. Intelligent contingency management (iCM) approaches are under development to address how automated agents can handle unforeseen, unplanned, and unanticipated events. Benchmark scenario is needed to test the maturity of the developed iCM tools and techniques.

Jon Holbrook↗

Event-Driven Modeling and Execution of Robotic Activities and Contingencies in the Europa Lander Mission Concept Using BPMN

TRACE (Traceable Robotic Activity Composer and Executive) is a tool designed to address the model-ing, verification, and execution of planned and con-tingent activities during robotic space missions. These activities can be modeled (i.e., planned) graph-ically in TRACE using the Business Process Model and Notation (BPMN) language. This standardized language is used to model a sequence of robotic ac-tivities tied together by logical constructs, events, and time. TRACE includes verification tools to en-sure feasibility before mission models are executed by TRACE’s executive, which is integrated into the autonomy subsystem via a connector. In this paper, we describe TRACE in detail as it would apply to a conceptual Europa Lander surface mission with planned excavation and sample collection activities, as well as, contingency activities when execution is off-nominal—all highlighting our novel use of BPMN as a lingua franca for the pipeline from mis-sion planning to autonomous execution.

Lim, Grace↗

JWST REAL-TIME MID-COURSE CORRECTION MANEUVER MONITORING CONTINGENCY PREPARATION

The NASA James Webb Space Telescope (JWST) mission successfully launched on Dec 25, 2021, at 12:20 Coordinated Universal Time (UTC). During the 30-day transfer to the second Sun-Earth-Moon (SEM) libration point (L2), JWST executed three mid-course correction (MCC) maneuvers to insert into a quasi-halo orbit about L2. This paper covers the design and modeling for these three maneuvers with a focus on the timeline around the execution of each MCC maneuver. It will summarize the actual on-board events as well as the contingency preparation done for maneuver planning, monitoring, and final post-burn reconstruction of all three MCC maneuvers.

Wayne Yu↗

JWST Real-Time Mid-Course Correction Maneuver Monitoring Contingency Preparation

The NASA James Webb Space Telescope (JWST) mission successfully launched on Dec 25, 2021, at 12:20 Coordinated Universal Time (UTC). During the 30-day transfer to the second Sun-Earth-Moon (SEM) libration point (L2), JWST executed three mid-course correction (MCC) maneuvers to insert into a quasi-halo orbit about L2. This paper covers the design and modeling for these three maneuvers with a focus on the timeline around the execution of each MCC maneuver. It will summarize the actual on-board events as well as the contingency preparation done for maneuver planning, monitoring, and final post-burn reconstruction of all three MCC maneuvers.

Toni Santacroce↗

On-Orbit Contingency Plan for the Mars 2020 Mission

NASA’s Mars 2020 mission successfully launched to Mars July 30, 2020. An on-orbit contingency plan was developed to accomplish a controlled re-entry of the spacecraft in the event of a launch vehicle anomaly. The entire launch period was assessed, and satisfactory de-orbit burns were designed for every launch opportunity. An operational implementation was created for rapid adoption if needed, and validated using information from the Gravity Recovery and Climate Experiment (GRACE) satellites. This paper presents the orbit determination models and filter strategies used to conduct the pre-launch analyses, as well as the operational implementation validation methodologies and results.

Kruizinga, Gerhard↗

Contingency Analysis of Cascading Line Outage Events

As the US power systems continue to increase in size and complexity, including the growth of smart grids, larger blackouts due to cascading outages become more likely. Grid congestion is often associated with a cascading collapse leading to a major blackout. Such a collapse is characterized by a self-sustaining sequence of line outages followed by a topology breakup of the network. This paper addresses the implementation and testing of a process for N-k contingency analysis and sequential cascading outage simulation in order to identify potential cascading modes. A modeling approach described in this paper offers a unique capability to identify initiating events that may lead to cascading outages. It predicts the development of cascading events by identifying and visualizing potential cascading tiers. The proposed approach was implemented using a 328-bus simplified SERC power system network. The results of the study indicate that initiating events and possible cascading chains may be identified, ranked and visualized. This approach may be used to improve the reliability of a transmission grid and reduce its vulnerability to cascading outages.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An assessment of nonindustrial private forest landowner willingness to harvest woody biomass in support of bioenergy production in Mississippi: A contingent rating approach

Abstract: The economic feasibility of utilizing woody biomass to produce biofuel lies in the willingness to harvest by non-industrial private forest (NIPF) landowners, who control 71% of forestland in the southern United States. A mail survey was distributed to NIPF landowners throughout Mississippi to elicit their preferences concerning the utilization of logging residues from harvesting operations to produce bioenergy. When presented with hypothetical situations that compared the bioenergy utilization harvesting attributes along with those of standard clearcutting in pine plantations, more landowners preferred those associated with the bioenergy utilization scenarios, even when more money was offered for the standard clearcutting option. Older landowners with larger landholdings were less likely to prefer the bioenergy scenarios. Landowners with more formal education who were financially motivated, considered habitat management an important goal, and thought global climate change was an important issue, were more likely to prefer the bioenergy utilization scenario over the standard clearcut. This indicates that a market for logging residues, in the form of wood-based bioenergy, could increase NIPF landowner harvest rates based solely on the different harvesting attributes, and that most woody biomass feedstocks from pine plantations would be available for the production of bioenergy in Mississippi.

Bioenergy↗

Load Shed Recovery With Transmission Switching and Intentional Islanding Methods After (N-2) Line Contingencies

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.

42 ENGINEERING↗

Relaxations of AC Maximal Load Delivery for Severe Contingency Analysis

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.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Bilevel Approach for Identifying the Worst Contingencies for Nonconvex Alternating Current Power Systems

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.

97 MATHEMATICS AND COMPUTING↗