Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “graph states”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

quantum computing↗
NASA NTRS2022

Multi-Agent Control Approach to the Stability of Linear Deployable Systems

Collisions and undesired dynamic responses may occur during the expansion phase of deployable elements on a spacecraft. This problem is more pronounced in large and complex deployable elements where characterization of transient dynamics using testing and simulation can be challenging. This paper introduces a multi-agent control theory approach to address the problem of collisions and transient behavior in deployable lattice systems. We introduce the graph theoretic and relative error vector-based state-space structures to represent the geometry of a lattice-based deploy system. We show that under the assumption of almost-strict dissipativity, the closed-loop feedback gains of the relative error dynamics are the spring and damper constants in the structure. Moreover, we introduce the control perspective of shaping transient dynamics using eigenstructure assignment and balanced coordinate transformation.

Pablos, Juan L. de↗
NASA NTRS1990

Near-infrared absorption spectra of (O-16)3 and (O-18)3 - Adiabatic energy of the 1A2 state?

The band positions and isotope shifts for the weak vibronic bands of O3 near 1 micron are determined experimentally using a low-resolution dual-beam absorption spectrometer with a 0.2-m holographic-grating monochromator and identical absorption chambers of volume about 600 cu cm and optical path length 46 cm. The experimental setup and procedures and the signal-processing methods applied are described, and the results are presented in tables and graphs. It is found that the adiabatic energy of the 1A2 state lies 9990 + or - 70/cm (1.24 + or - 0.01 eV) above the electronic ground state, close to the O + O2 dissociation limit. The applicability of the present results to studies of O3 in the upper atmosphere is indicated.

Anderson, S. M.↗
NASA NTRS1994

A genetic technique for planning a control sequence to navigate the state space with a quasi-minimum-cost output trajectory for a non-linear multi-dimnensional system

There are many multi-stage optimization problems that are not easily solved through any known direct method when the stages are coupled. For instance, we have investigated the problem of planning a vehicle's control sequence to negotiate obstacles and reach a goal in minimum time. The vehicle has a known mass, and the controlling forces have finite limits. We have developed a technique that finds admissible control trajectories which tend to minimize the vehicle's transit time through the obstacle field. The immediate applications is that of a space robot which must rapidly traverse around 2-or-3 dimensional structures via application of a rotating thruster or non-rotating on-off for such vehicles is located at the Marshall Space Flight Center in Huntsville Alabama. However, it appears that the development method is applicable to a general set of optimization problems in which the cost function and the multi-dimensional multi-state system can be any nonlinear functions, which are continuous in the operating regions. Other applications included the planning of optimal navigation pathways through a transversability graph; the planning of control input for under-water maneuvering vehicles which have complex control state-space relationships; the planning of control sequences for milling and manufacturing robots; the planning of control and trajectories for automated delivery vehicles; and the optimization and athletic training in slalom sports.

Hein, C.↗
NASA NTRS1988

Finite-state codes

A class of codes called finite-state (FS) codes is defined and investigated. The codes, which generalize both block and convolutional codes, are defined by their encoders, which are finite-state machines with parallel inputs and outputs. A family of upper bounds on the free distance of a given FS code is derived. A general construction for FS codes is given, and it is shown that in many cases the FS codes constructed in this way have a free distance that is the largest possible. Catastrophic error propagation (CEP) for FS codes is also discussed. It is found that to avoid CEP one must solve the graph-theoretic problem of finding a uniquely decodable edge labeling of the state diagram.

Pollara, Fabrizio↗
NASA NTRS2015

Software Testbed for Developing and Evaluating Integrated Autonomous Subsystems

To implement fault tolerant autonomy in future space systems, it will be necessary to integrate planning, adaptive control, and state estimation subsystems. However, integrating these subsystems is difficult, time-consuming, and error-prone. This paper describes Intelliface/ADAPT, a software testbed that helps researchers develop and test alternative strategies for integrating planning, execution, and diagnosis subsystems more quickly and easily. The testbed's architecture, graphical data displays, and implementations of the integrated subsystems support easy plug and play of alternate components to support research and development in fault-tolerant control of autonomous vehicles and operations support systems. Intelliface/ADAPT controls NASA's Advanced Diagnostics and Prognostics Testbed (ADAPT), which comprises batteries, electrical loads (fans, pumps, and lights), relays, circuit breakers, invertors, and sensors. During plan execution, an experimentor can inject faults into the ADAPT testbed by tripping circuit breakers, changing fan speed settings, and closing valves to restrict fluid flow. The diagnostic subsystem, based on NASA's Hybrid Diagnosis Engine (HyDE), detects and isolates these faults to determine the new state of the plant, ADAPT. Intelliface/ADAPT then updates its model of the ADAPT system's resources and determines whether the current plan can be executed using the reduced resources. If not, the planning subsystem generates a new plan that reschedules tasks, reconfigures ADAPT, and reassigns the use of ADAPT resources as needed to work around the fault. The resource model, planning domain model, and planning goals are expressed using NASA's Action Notation Modeling Language (ANML). Parts of the ANML model are generated automatically, and other parts are constructed by hand using the Planning Model Integrated Development Environment, a visual Eclipse-based IDE that accelerates ANML model development. Because native ANML planners are currently under development and not yet sufficiently capable, the ANML model is translated into the New Domain Definition Language (NDDL) and sent to NASA's EUROPA planning system for plan generation. The adaptive controller executes the new plan, using augmented, hierarchical finite state machines to select and sequence actions based on the state of the ADAPT system. Real-time sensor data, commands, and plans are displayed in information-dense arrays of timelines and graphs that zoom and scroll in unison. A dynamic schematic display uses color to show the real-time fault state and utilization of the system components and resources. An execution manager coordinates the activities of the other subsystems. The subsystems are integrated using the Internet Communications Engine (ICE). an object-oriented toolkit for building distributed applications.

Testbed↗
NASA NTRS1972

Application of numerical methods to extend capabilities for optimal rocket guidance: report on reentry guidance of shuttle orbiter

Analytical models are presented for optimal trajectories and reentry guidance of the space shuttle orbiter. Major emphasis is placed on the development of a "footprint', which refers to a set of reachable destination positions attainable by the shuttle at a specified terminal altitude. An unconstrained reentry footprint was calculated for a shuttle vehicle which enters the earth's atmosphere at 93 km initial altitude after a deboost from a near earth orbit. The method of computation is briefly described, and graphs are presented which illustrate the footprint and the variation of state and control variables along it. The effects of constraints and of variations in initial state upon the footprint are discussed.

Source record↗
NASA NTRS1977

The characteristics of sealed nickel-cadmium cells during voltage reversal

A mechanism which allows a cell voltage reversal in a nickel cadmium battery are discussed. The effects of reconditioning and the characteristics of Ni-Cd cells during voltage reversal at low overdischarge rates are outlined. Graphs are presented for: (1) hydrogen pressure decay-effect of state of charge (open circuit stand); (2) hydrogen pressure increase during overdischarge; (3) hydrogen pressure decay-effect of temperature (cells terminals connected through resistors); (4) cell, positive and negative electrode voltage during reversal when reconditioning a 13 cell-24-Ah battery pack through a 40 Omega resistor; (5) pressure discharge current and recombination current during voltage reversal when reconditioning a 13 cell-24-Ah battery pack through a 40 Omega resistor; (6) theoretical hydrogen gas pressure if there were no recombination; and (7) effect of hydrogen pressure on recombination rate during overcharge.

Ritterman, P. F.↗
NASA NTRS1999

Large-Scale Parallel Viscous Flow Computations using an Unstructured Multigrid Algorithm

The development and testing of a parallel unstructured agglomeration multigrid algorithm for steady-state aerodynamic flows is discussed. The agglomeration multigrid strategy uses a graph algorithm to construct the coarse multigrid levels from the given fine grid, similar to an algebraic multigrid approach, but operates directly on the non-linear system using the FAS (Full Approximation Scheme) approach. The scalability and convergence rate of the multigrid algorithm are examined on the SGI Origin 2000 and the Cray T3E. An argument is given which indicates that the asymptotic scalability of the multigrid algorithm should be similar to that of its underlying single grid smoothing scheme. For medium size problems involving several million grid points, near perfect scalability is obtained for the single grid algorithm, while only a slight drop-off in parallel efficiency is observed for the multigrid V- and W-cycles, using up to 128 processors on the SGI Origin 2000, and up to 512 processors on the Cray T3E. For a large problem using 25 million grid points, good scalability is observed for the multigrid algorithm using up to 1450 processors on a Cray T3E, even when the coarsest grid level contains fewer points than the total number of processors.

Mavriplis, Dimitri J.↗
NASA NTRS2008

The Analysis of Image Segmentation Hierarchies with a Graph-based Knowledge Discovery System

Currently available pixel-based analysis techniques do not effectively extract the information content from the increasingly available high spatial resolution remotely sensed imagery data. A general consensus is that object-based image analysis (OBIA) is required to effectively analyze this type of data. OBIA is usually a two-stage process; image segmentation followed by an analysis of the segmented objects. We are exploring an approach to OBIA in which hierarchical image segmentations provided by the Recursive Hierarchical Segmentation (RHSEG) software developed at NASA GSFC are analyzed by the Subdue graph-based knowledge discovery system developed by a team at Washington State University. In this paper we discuss out initial approach to representing the RHSEG-produced hierarchical image segmentations in a graphical form understandable by Subdue, and provide results on real and simulated data. We also discuss planned improvements designed to more effectively and completely convey the hierarchical segmentation information to Subdue and to improve processing efficiency.

Tilton, James C.↗
NASA NTRS1987

Recent progress in the development and understanding of SUPG methods with special reference to the compressible Euler and Navier-Stokes equations

The current status of streamline-upwind/Petrov-Galerkin (SUPG) methods for the analysis of flow problems is surveyed in an analytical review. Problem areas addressed include classical Galerkin, upwind, artificial-diffusion, SUPG, discontinuous Galerkin, space-time FEM, and discontinuity-capturing approaches to the scalar advection-diffusion equation; incompressible flows; advective-diffusive systems; and the compressible Euler and Navier-Stokes equations. Graphs and diagrams are provided, and the good stability properties of state-of-the-art SUPG methods are pointed out.

Hughes, Thomas J. R.↗
NASA NTRS1993

RENEW v3.2 user's manual, maintenance estimation simulation for Space Station Freedom Program

RENEW is a maintenance event estimation simulation program developed in support of the Space Station Freedom Program (SSFP). This simulation uses reliability and maintainability (R&M) and logistics data to estimate both average and time dependent maintenance demands. The simulation uses Monte Carlo techniques to generate failure and repair times as a function of the R&M and logistics parameters. The estimates are generated for a single type of orbital replacement unit (ORU). The simulation has been in use by the SSFP Work Package 4 prime contractor, Rocketdyne, since January 1991. The RENEW simulation gives closer estimates of performance since it uses a time dependent approach and depicts more factors affecting ORU failure and repair than steady state average calculations. RENEW gives both average and time dependent demand values. Graphs of failures over the mission period and yearly failure occurrences are generated. The averages demand rate for the ORU over the mission period is also calculated. While RENEW displays the results in graphs, the results are also available in a data file for further use by spreadsheets or other programs. The process of using RENEW starts with keyboard entry of the R&M and operational data. Once entered, the data may be saved in a data file for later retrieval. The parameters may be viewed and changed after entry using RENEW. The simulation program runs the number of Monte Carlo simulations requested by the operator. Plots and tables of the results can be viewed on the screen or sent to a printer. The results of the simulation are saved along with the input data. Help screens are provided with each menu and data entry screen.

Bream, Bruce L.↗
NASA NTRS2004

Plan-graph Based Heuristics for Conformant Probabilistic Planning

In this paper, we introduce plan-graph based heuristics to solve a variation of the conformant probabilistic planning (CPP) problem. In many real-world problems, it is the case that the sensors are unreliable or take too many resources to provide knowledge about the environment. These domains are better modeled as conformant planning problems. POMDP based techniques are currently the most successful approach for solving CPP but have the limitation of state- space explosion. Recent advances in deterministic and conformant planning have shown that plan-graphs can be used to enhance the performance significantly. We show that this enhancement can also be translated to CPP. We describe our process for developing the plan-graph heuristics and estimating the probability of a partial plan. We compare the performance of our planner PVHPOP when used with different heuristics. We also perform a comparison with a POMDP solver to show over a order of magnitude improvement in performance.

Ramakrishnan, Salesh↗
NASA NTRSDate not supplied

Perturbations in Brain Functional Connectivity Patterns After Waking From Slow Wave Sleep Under Different Cognitive States

Sleep inertia refers to the state of transition between sleep and wake characterized by impaired alertness, confusion, and reduced cognitive and behavioral performance. While the behavioral symptoms of sleep inertia are well described, the neurological changes that lead to this state remain elusive. Here, to understand the state of sleep inertia and the reorganization that the brain undergoes, we took a graph theoretical approach and compared the EEG derived brain connectivity patterns before sleep and after waking up while participants (n = 10) performed multiple tasks that differed in cognitive complexities. We focused on how the degree and the clustering coefficient of brain regions (EEG sensors) change immediately after participants wake up from slow wave sleep. During a psychomotor vigilance task (PVT), designed to assess vigilant attention, we find that the brain regions with strong network connectivity (degree) before sleep show a reduction in connectivity after waking. In contrast, those with low connectivity before sleep have greater connectivity after waking. The regions that undergo these changes are specific to each participant and these findings are unique to the beta frequency range, which plays a key role in sensorimotor functioning and preserving the current state of the brain. Moreover, in tasks that required inhibitory control and arithmetic reasoning, we found that only regions with weak connectivity before sleep exhibited more connections after waking, but regions with high connectivity prior to sleeping remained unchanged, highlighting task specific effects. Furthermore, we find that during the PVT, the clustering coefficient within low frequency oscillations of the brain is reduced upon waking while it remains unchanged during other tasks. These results suggest that the connections between regions that are lost after abrupt awakening can be reallocated to other regions in order to renormalize the brain. However, this response may only be evident during specific cognitive states and may be more nuanced during complex task performance.

sleep inertia↗
NASA NTRS1992

Approximation methods for stochastic petri nets

Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay equivalence often fails to converge, while flow equivalent aggregation can lead to potentially bad results if a strong dependence of the mean completion time on the interarrival process exists.

Jungnitz, Hauke Joerg↗
NASA NTRS1988

Effect of microstructural damage on ply stresses in laminated composites

The mechanisms involved in damage and failure of laminated orthotropic composites are investigated theoretically. The continuum model developed accounts for both matrix cracks and interply delamination using second-order tensor-valued internal-state variables based on the locally averaged microcrack dynamics. The derivation of the model is given in detail, and numerical results for sample problems are presented in extensive graphs and tables. The model is shown to be effective in predicting stresses at the ply level, and significant damage-induced decreases in laminate stress states are found.

Allen, D. H.↗
NASA NTRS1988

An application of MSC/NASTRAN in the interdisciplinary analysis of large space-based structures

The Integrated Multidisciplinary Analysis Tool (IMAT), a computer software system developed at NASA Langley to analyze and simulate the dynamics of space-structure/control-system interactions, is described, and its application to the MAST problem (a 60-m truss with fundamental frequency less than 200 mHz and equipped with linear proof-mass actuators, to be deployed from the Space Shuttle as part of COFS-I flight experiment) is demonstrated. Particular attention is given to the IMAT procedures which facilitate the use of the MCS/NASTRAN code to recover physical results from time-domain state-space solutions obtained with an FEM control-design code. Diagrams, drawings, and graphs are provided.

Stockwell, Alan E.↗
NASA NTRS1993

Applications of active adaptive noise control to jet engines

During phase 2 research on the application of active noise control to jet engines, the development of multiple-input/multiple-output (MIMO) active adaptive noise control algorithms and acoustic/controls models for turbofan engines were considered. Specific goals for this research phase included: (1) implementation of a MIMO adaptive minimum variance active noise controller; and (2) turbofan engine model development. A minimum variance control law for adaptive active noise control has been developed, simulated, and implemented for single-input/single-output (SISO) systems. Since acoustic systems tend to be distributed, multiple sensors, and actuators are more appropriate. As such, the SISO minimum variance controller was extended to the MIMO case. Simulation and experimental results are presented. A state-space model of a simplified gas turbine engine is developed using the bond graph technique. The model retains important system behavior, yet is of low enough order to be useful for controller design. Expansion of the model to include multiple stages and spools is also discussed.

Shoureshi, Rahmat↗