Engineering PapersSearch

SEARCH · Engineering Papers

Results for “AUTOMATON”

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.

51 records · Page 3

Evolution paths for advanced automation

As Space Station Freedom (SSF) evolves, increased automation and autonomy will be required to meet Space Station Freedom Program (SSFP) objectives. As a precursor to the use of advanced automation within the SSFP, especially if it is to be used on SSF (e.g., to automate the operation of the flight systems), the underlying technologies will need to be elevated to a high level of readiness to ensure safe and effective operations. Ground facilities supporting the development of these flight systems -- from research and development laboratories through formal hardware and software development environments -- will be responsible for achieving these levels of technology readiness. These facilities will need to evolve support the general evolution of the SSFP. This evolution will include support for increasing the use of advanced automation. The SSF Advanced Development Program has funded a study to define evolution paths for advanced automaton within the SSFP's ground-based facilities which will enable, promote, and accelerate the appropriate use of advanced automation on-board SSF. The current capability of the test beds and facilities, such as the Software Support Environment, with regard to advanced automation, has been assessed and their desired evolutionary capabilities have been defined. Plans and guidelines for achieving this necessary capability have been constructed. The approach taken has combined indepth interviews of test beds personnel at all SSF Work Package centers with awareness of relevant state-of-the-art technology and technology insertion methodologies. Key recommendations from the study include advocating a NASA-wide task force for advanced automation, and the creation of software prototype transition environments to facilitate the incorporation of advanced automation in the SSFP.

Healey, Kathleen J.

Pseudogradient Training For A Class Of Neural Networks

Developmental second-order recurrent neural networks of special type modified to enhance stability in face of inputs beyond range of inputs on which trained. Second-order recurrent neural networks contain product feedback units and can be trained, by use of example inputs and outputs, to act as finite-state automatons. Particular second-order recurrent neural networks in question learn grammars in sense they are trained to generate binary responses to input training sequences of ones and zeros, each sequence being marked "legal" or "illegal" according to grammar to be learned.

Zeng, Zheng

Analyzing Mode Confusion via Model Checking

Mode confusion is one of the most serious problems in aviation safety. Today's complex digital flight decks make it difficult for pilots to maintain awareness of the actual states, or modes, of the flight deck automation. NASA Langley leads an initiative to explore how formal techniques can be used to discover possible sources of mode confusion. As part of this initiative, a flight guidance system was previously specified as a finite Mealy automaton, and the theorem prover PVS was used to reason about it. The objective of the present paper is to investigate whether state-exploration techniques, especially model checking, are better able to achieve this task than theorem proving and also to compare several verification tools for the specific application. The flight guidance system is modeled and analyzed in Murphi, SMV, and Spin. The tools are compared regarding their system description language, their practicality for analyzing mode confusion, and their capabilities for error tracing and for animating diagnostic information. It turns out that their strengths are complementary.

Luettgen, Gerald

Linear System Control Using Stochastic Learning Automata

This paper explains the use of a Stochastic Learning Automata (SLA) to control switching between three systems to produce the desired output response. The SLA learns the optimal choice of the damping ratio for each system to achieve a desired result. We show that the SLA can learn these states for the control of an unknown system with the proper choice of the error criteria. The results of using a single automaton are compared to using multiple automata.

Ziyad, Nigel

Cellular Decomposition Based Hybrid-Hierarchical Control Systems with Applications to Flight Management Systems

The work in this research project has been focused on the construction of a hierarchical hybrid control theory which is applicable to flight management systems. The motivation and underlying philosophical position for this work has been that the scale, inherent complexity and the large number of agents (aircraft) involved in an air traffic system imply that a hierarchical modelling and control methodology is required for its management and real time control. In the current work the complex discrete or continuous state space of a system with a small number of agents is aggregated in such a way that discrete (finite state machine or supervisory automaton) controlled dynamics are abstracted from the system's behaviour. High level control may then be either directly applied at this abstracted level, or, if this is in itself of significant complexity, further layers of abstractions may be created to produce a system with an acceptable degree of complexity at each level. By the nature of this construction, high level commands are necessarily realizable at lower levels in the system.

Caines, P. E.

Spatial Autocatalytic Dynamics: An Approach to Modeling Prebiotic Evolution

This paper addresses the origin of robust and evolvable metabolic functions, and the conditions under which it took place. We propose that spatial considerations, traditionally ignored, are essential to answering these important questions in prebiotic evolution. Our probabilistic cellular automaton model, based on work on autocatalytic metabolisms by Eigen, Kauffman, and others, has biologically interesting dynamical behavior that is missed if spatial extension is ignored.

Stassinopoulos, Dimitris

Discrete Event Supervisory Control Applied to Propulsion Systems

The theory of discrete event supervisory (DES) control was applied to the optimal control of a twin-engine aircraft propulsion system and demonstrated in a simulation. The supervisory control, which is implemented as a finite-state automaton, oversees the behavior of a system and manages it in such a way that it maximizes a performance criterion, similar to a traditional optimal control problem. DES controllers can be nested such that a high-level controller supervises multiple lower level controllers. This structure can be expanded to control huge, complex systems, providing optimal performance and increasing autonomy with each additional level. The DES control strategy for propulsion systems was validated using a distributed testbed consisting of multiple computers--each representing a module of the overall propulsion system--to simulate real-time hardware-in-the-loop testing. In the first experiment, DES control was applied to the operation of a nonlinear simulation of a turbofan engine (running in closed loop using its own feedback controller) to minimize engine structural damage caused by a combination of thermal and structural loads. This enables increased on-wing time for the engine through better management of the engine-component life usage. Thus, the engine-level DES acts as a life-extending controller through its interaction with and manipulation of the engine s operation.

Litt, Jonathan S.

A Simple Model for the Evolution of Multi-Stranded Coronal Loops

We develop and analyze a simple cellular automaton (CA) model that reproduces the main properties of the evolution of soft X-ray coronal loops. We are motivated by the observation that these loops evolve in three distinguishable phases that suggest the development, maintainance, and decay of a self-organized system. The model is based on the idea that loops are made of elemental strands that are heated by the relaxation of magnetic stress in the form of nanoflares. In this vision, usually called "the Parker conjecture" (Parker 1988), the origin of stress is the displacement of the strand footpoints due to photospheric convective motions. Modeling the response and evolution of the plasma we obtain synthetic light curves that have the same characteristic properties (intensity, fluctuations, and timescales) as the observed cases. We study the dependence of these properties on the model parameters and find scaling laws that can be used as observational predictions of the model. We discuss the implications of our results for the interpretation of recent loop observations in different wavelengths. Subject headings: Sun: corona - Sun: flares - Sun: magnetic topology - Sun: X-rays, gamma rays

Fuentes, M. C. Lopez

Bit-Serial Adder Based on Quantum Dots

A proposed integrated circuit based on quantum-dot cellular automata (QCA) would function as a bit-serial adder. This circuit would serve as a prototype building block for demonstrating the feasibility of quantum-dots computing and for the further development of increasingly complex and increasingly capable quantum-dots computing circuits. QCA-based bit-serial adders would be especially useful in that they would enable the development of highly parallel and systolic processors for implementing fast Fourier, cosine, Hartley, and wavelet transforms. The proposed circuit would complement the QCA-based circuits described in "Implementing Permutation Matrices by Use of Quantum Dots" (NPO-20801), NASA Tech Briefs, Vol. 25, No. 10 (October 2001), page 42 and "Compact Interconnection Networks Based on Quantum Dots" (NPO-20855), which appears elsewhere in this issue. Those articles described the limitations of very-large-scale-integrated (VLSI) circuitry and the major potential advantage afforded by QCA. To recapitulate: In a VLSI circuit, signal paths that are required not to interact with each other must not cross in the same plane. In contrast, for reasons too complex to describe in the limited space available for this article, suitably designed and operated QCA-based signal paths that are required not to interact with each other can nevertheless be allowed to cross each other in the same plane without adverse effect. In principle, this characteristic could be exploited to design compact, coplanar, simple (relative to VLSI) QCA-based networks to implement complex, advanced interconnection schemes. To enable a meaningful description of the proposed bit-serial adder, it is necessary to further recapitulate the description of a quantum-dot cellular automation from the first-mentioned prior article: A quantum-dot cellular automaton contains four quantum dots positioned at the corners of a square cell. The cell contains two extra mobile electrons that can tunnel (in the quantum-mechanical sense) between neighboring dots within the cell. The Coulomb repulsion between the two electrons tends to make them occupy antipodal dots in the cell. For an isolated cell, there are two energetically equivalent arrangements (denoted polarization states) of the extra electrons. The cell polarization is used to encode binary information. Because the polarization of a nonisolated cell depends on Coulomb-repulsion interactions with neighboring cells, universal logic gates and binary wires could be constructed, in principle, by arraying QCA of suitable design in suitable patterns. Again, for reasons too complex to describe here, in order to ensure accuracy and timeliness of the output of a QCA array, it is necessary to resort to an adiabatic switching scheme in which the QCA array is divided into subarrays, each controlled by a different phase of a multiphase clock signal. In this scheme, each subarray is given time to perform its computation, then its state is frozen by raising its inter-dot potential barriers and its output is fed as the input to the successor subarray. The successor subarray is kept in an unpolarized state so it does not influence the calculation of preceding subarray. Such a clocking scheme is consistent with pipeline computation in the sense that each different subarray can perform a different part of an overall computation. In other words, QCA arrays are inherently suitable for pipeline and, moreover, systolic computations. This sequential or pipeline aspect of QCA would be utilized in the proposed bit-serial adders.

Fijany, Amir

Evidence of Nanoflare Heating in Coronal Loops Observed with Hinolde-XRT and SDO-AIA

We study a series of coronal loop lightcurves from X-ray and EUV observations. In search for signatures of nanoflare heating, we analyze the statistical properties of the observed lightcurves and compare them with synthetic cases obtained with a 2D cellular-automaton model based on nanoflare heating driven by photospheric motions. Our analysis shows that the observed and the model lightcurves have similar statistical properties. The asymmetries observed in the distribution of the intensity fluctuations indicate the possible presence of widespread cooling processes in sub-resolution magnetic strands.

Lopez-Fuentes, M. C.

Stochastic Simulation of Mudcrack Damage Formation in an Environmental Barrier Coating

The FEAMAC/CARES program, which integrates finite element analysis (FEA) with the MAC/GMC (Micromechanics Analysis Code with Generalized Method of Cells) and the CARES/Life (Ceramics Analysis and Reliability Evaluation of Structures / Life Prediction) programs, was used to simulate the formation of mudcracks during the cooling of a multilayered environmental barrier coating (EBC) deposited on a silicon carbide substrate. FEAMAC/CARES combines the MAC/GMC multiscale micromechanics analysis capability (primarily developed for composite materials) with the CARES/Life probabilistic multiaxial failure criteria (developed for brittle ceramic materials) and Abaqus (Dassault Systèmes) FEA. In this report, elastic modulus reduction of randomly damaged finite elements was used to represent discrete cracking events. The use of many small-sized low-aspect-ratio elements enabled the formation of crack boundaries, leading to development of mudcrack-patterned damage. Finite element models of a disk-shaped three-dimensional specimen and a twodimensional model of a through-the-thickness cross section subjected to progressive cooling from 1,300 °C to an ambient temperature of 23 °C were made. Mudcrack damage in the coating resulted from the buildup of residual tensile stresses between the individual material constituents because of thermal expansion mismatches between coating layers and the substrate. A two-parameter Weibull distribution characterized the coating layer stochastic strength response and allowed the effect of the Weibull modulus on the formation of damage and crack segmentation lengths to be studied. The spontaneous initiation of cracking and crack coalescence resulted in progressively smaller mudcrack cells as cooling progressed, consistent with a fractal-behaved fracture pattern. Other failure modes such as delamination, and possibly spallation, could also be reproduced. The physical basis assumed and the heuristic approach employed, which involves a simple stochastic cellular automaton methodology to approximate the crack growth process, are described. The results ultimately show that a selforganizing mudcrack formation can derive from a Weibull distribution that is used to describe the stochastic strength response of the bulk brittle ceramic material layers of an EBC.

Nemeth, Noel N.

Humans as Failsafe

Automation often relies on the human to "jump" into the loop and solve problems when the automation can’t due to conditions outside of which it was designed for or automaton failure. This talk proposes a methodology (Human Autonomy Assistant) to address that situation. Examples are provided from a wild fire context.

multi-vehicle control

Universal Coating by 3D Hybrid Programmable Matter

Motivated by the prospect of nano-robots that assist human physiological functions at the nanoscale, we investigate the coating problem in the three-dimensional model for hybrid programmable matter. In this model, a single agent with strictly limited viewing range and the computational capability of a deterministic finite automaton can act on passive tiles by picking up a tile, moving, and placing it at some spot. The goal of the coating problem is to fill each node of some surface graph of size n with a tile. We first solve the problem on a restricted class of graphs with a single tile type, and then use constantly many tile types to encode this graph in certain surface graphs capturing the surface of 3D objects. Our algorithm requires O(n^2) steps, which is worst-case optimal compared to an agent with global knowledge and no memory restrictions.

programmable matter