Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Markov state models”

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
All sourcesNASA NTRSDOE OSTI
NASA NTRS2001

Development of Unsteady Aerodynamic State-Space Models from CFD-Based Pulse Responses

A method for computing discrete-time state-space models of linearized unsteady aerodynamic behavior directly from aeroelastic CFD codes is presented. The method involves the treatment of CFD-based pulse responses as Markov parameters for use in a system identification /realization algorithm. Results are presented for the AGARD 445.6 Aeroelastic Wing with four aeroelastic modes at a Mach number of 0.96 using the EZNSS Euler/Navier-Stokes flow solver with aeroelastic capability. The System/Observer/Controller Identification Toolbox (SOCIT) algorithm, based on the Ho-Kalman realization algorithm, is used to generate 15th- and 32nd-order discrete-time state-space models of the unsteady aerodynamic response of the wing over the entire frequency range of interest.

Silva, Walter A.↗
NASA NTRS1992

Identification of system, observer, and controller from closed-loop experimental data

This paper considers the identification problem of a system operating in closed-loop with an existing feedback controller. The closed-loop system is excited by a known excitation signal, and the resulting time histories of the closed-loop system response and the feedback signal are measured. From the time history data, the algorithm computes the Markov parameters of a closed-loop observer, from which the Markov parameters of the individual open-loop plant, observer, and controller are recovered. A state space model of the open-loop plant and the gain matrices for the controller and the observer are then realized. The results of the paper are demonstrated by an example using actual aircraft flutter test data.

Juang, Jer-Nan↗
NASA NTRS2018

Metabrain for Embedded Cognition (MBEC)

This study presents the application of Hidden Markov Models (HMM) to determine specialized features without expert input. Specifically, the application of such a method for classification of high multi-path fading is targeted, for demonstrating the feasibility of such an approach. This is the first step in the development of a meta-brain for embedded cognition (M-BEC) suite that can be used to apply machine learning to various communication systems at NASA GRC. The project explores the concept of fading and how it affects communication systems in a negative way. Currently, supervised learning methods are used to study the effects of fading on space links. However, such models rely on expert features to make predictions as to the state of a link and whether fading is present. This project offers the possibility of having the HMM learn what characteristics are important and make predictions based on those characteristics. This project explores Hidden Markov Models, their theory and applications to various problems, as well as the underlying equations and assumptions. A preliminary result is presented and recommendations are made as to the use of such an approach for communications systems.

Propagation↗
NASA NTRS1979

Spectral characteristics of convolutionally coded digital signals

The power spectral density of the output symbol sequence of a convolutional encoder is computed for two different input symbol stream source models, namely, an NRZ signaling format and a first order Markov source. In the former, the two signaling states of the binary waveform are not necessarily assumed to occur with equal probability. The effects of alternate symbol inversion on this spectrum are also considered. The mathematical results are illustrated with many examples corresponding to optimal performance codes.

Divsalar, D.↗
NASA NTRS2018

A Component-Level Model of Automatic Dependent Surveillance - Broadcast (ADS-B)

Automatic Dependent Surveillance – Broadcast (ADS-B) is being employed in numerous peer-to-peer initiatives attempting to expand the capacity of the National Airspace System (NAS) or enable mixed operations of manned and unmanned vehicles. Safety assessments of these initiatives rely, in part, on modeling the accuracy of ADS-B in reporting the position and direction of an ownship and surrounding traffic. Frequently, these initiatives utilize a position uncertainty model that applies a reported ADS-B estimation position uncertainty (EPU) value to a Rayleigh distribution and uses a Gauss-Markov random walk to add error to the ADS-B output of a vehicle. This model of ADS-B state error is easy to implement and apply to numerous problems. However, it has a couple of draw-backs. First, the ADS-B state errors are equally probable in all directions. This is a good assumption in situations where aircraft maneuvering is not constrained. However, in situations where the aircraft maneuvering is constrained such as landing, the error distribution is likely to exhibit directionality and the non-directional model may skew results especially when assessing very low probabilities (e.g., 10(exp -9)) of catastrophic encounters. Second, the model does not account for processing latency in the receiving aircraft. NASA Langley Research Center (LaRC) recently examined the feasibility of decreasing the spacing of aircraft on parallel approaches to runways separated by as little as 700 feet. For Monte-Carlo analysis using a high-fidelity simulation of a large transport, LaRC started with a Gauss-Markov model of ADS-B error but then developed a component level model of ADS-B error to increase the fidelity of results.

Madden, Michael M.↗
NASA NTRS1993

Automatic specification of reliability models for fault-tolerant computers

The calculation of reliability measures using Markov models is required for life-critical processor-memory-switch structures that have standby redundancy or that are subject to transient or intermittent faults or repair. The task of specifying these models is tedious and prone to human error because of the large number of states and transitions required in any reasonable system. Therefore, model specification is a major analysis bottleneck, and model verification is a major validation problem. The general unfamiliarity of computer architects with Markov modeling techniques further increases the necessity of automating the model specification. Automation requires a general system description language (SDL). For practicality, this SDL should also provide a high level of abstraction and be easy to learn and use. The first attempt to define and implement an SDL with those characteristics is presented. A program named Automated Reliability Modeling (ARM) was constructed as a research vehicle. The ARM program uses a graphical interface as its SDL, and it outputs a Markov reliability model specification formulated for direct use by programs that generate and evaluate the model.

Liceaga, Carlos A.↗
NASA NTRS1986

Towards automatic Markov reliability modeling of computer architectures

The analysis and evaluation of reliability measures using time-varying Markov models is required for Processor-Memory-Switch (PMS) structures that have competing processes such as standby redundancy and repair, or renewal processes such as transient or intermittent faults. The task of generating these models is tedious and prone to human error due to the large number of states and transitions involved in any reasonable system. Therefore model formulation is a major analysis bottleneck, and model verification is a major validation problem. The general unfamiliarity of computer architects with Markov modeling techniques further increases the necessity of automating the model formulation. This paper presents an overview of the Automated Reliability Modeling (ARM) program, under development at NASA Langley Research Center. ARM will accept as input a description of the PMS interconnection graph, the behavior of the PMS components, the fault-tolerant strategies, and the operational requirements. The output of ARM will be the reliability of availability Markov model formulated for direct use by evaluation programs. The advantages of such an approach are (a) utility to a large class of users, not necessarily expert in reliability analysis, and (b) a lower probability of human error in the computation.

Liceaga, C. A.↗
NASA NTRS1993

Frequency domain system identification methods - Matrix fraction description approach

This paper presents the use of matrix fraction descriptions for least-squares curve fitting of the frequency spectra to compute two matrix polynomials. The matrix polynomials are intermediate step to obtain a linearized representation of the experimental transfer function. Two approaches are presented: first, the matrix polynomials are identified using an estimated transfer function; second, the matrix polynomials are identified directly from the cross/auto spectra of the input and output signals. A set of Markov parameters are computed from the polynomials and subsequently realization theory is used to recover a minimum order state space model. Unevenly spaced frequency response functions may be used. Results from a simple numerical example and an experiment are discussed to highlight some of the important aspect of the algorithm.

Horta, Luca G.↗
NASA NTRS2011

Runtime Verification with State Estimation

We introduce the concept of Runtime Verification with State Estimation and show how this concept can be applied to estimate theprobability that a temporal property is satisfied by a run of a program when monitoring overhead is reduced by sampling. In such situations, there may be gaps in the observed program executions, thus making accurate estimation challenging. To deal with the effects of sampling on runtime verification, we view event sequences as observation sequences of a Hidden Markov Model (HMM), use an HMM model of the monitored program to "fill in" sampling-induced gaps in observation sequences, and extend the classic forward algorithm for HMM state estimation (which determines the probability of a state sequence, given an observation sequence) to compute the probability that the property is satisfied by an execution of the program. To validate our approach, we present a case study based on the mission software for a Mars rover. The results of our case study demonstrate high prediction accuracy for the probabilities computed by our algorithm. They also show that our technique is much more accurate than simply evaluating the temporal property on the given observation sequences, ignoring the gaps.

sampling↗
NASA NTRS1972

Control theory for random systems

A survey is presented of the current knowledge available for designing and predicting the effectiveness of controllers for dynamic systems which can be modeled by ordinary differential equations. A short discussion of feedback control is followed by a description of deterministic controller design and the concept of system state. The need for more realistic disturbance models led to the use of stochastic process concepts, in particular the Gauss-Markov process. A compensator controlled system, with random forcing functions, random errors in the measurements, and random initial conditions, is treated as constituting a Gauss-Markov random process; hence the mean-square behavior of the controlled system is readily predicted. As an example, a compensator is designed for a helicopter to maintain it in hover in a gusty wind over a point on the ground.

Bryson, A. E., Jr.↗
NASA NTRS1991

Identification of linear multivariable systems from a single set of data by identification of observers with assigned real eigenvalues

A formulation is presented for identification of linear multivariable from a single set of input-output data. The identification method is formulated with the mathematical framework of learning identifications, by extension of the repetition domain concept to include shifting time intervals. This method contrasts with existing learning approaches that require data from multiple experiments. In this method, the system input-output relationship is expressed in terms of an observer, which is made asymptotically stable by an embedded real eigenvalue assignment procedure. Through this relationship, the Markov parameters of the observer are identified. The Markov parameters of the actual system are recovered from those of the observer, and then used to obtain a state space model of the system by standard realization techniques. The basic mathematical formulation is derived, and numerical examples presented to illustrate.

Phan, Minh↗
NASA NTRS1991

Identification of linear multivariable systems from a single set of data by identification of observers with assigned real eigenvalues

This paper presents a formulation for identification of linear multivariable systems from a single set of input-output data. The identification method is formulated with the mathematical framework of learning identification, by extension of the repetition domain concept to include shifting time intervals. This contrasts existing learning approaches that require data from multiple experiments. In this method, the system input-output relationship is expressed in terms of an observer, which is made asymptotically stable by an embedded real eigenvalue assignment procedure. Through this relationship, the Markov parameters of the observer are identified. The Markov parameters of the actual system are recovered from those of the observer, and then used to obtain a state space model of the system by standard realization techniques. The basic mathematical formulation is derived, and numerical examples presented to illustrate the proposed method.

Phan, Minh↗
NASA NTRS1991

Linear system identification via an asymptotically stable observer

This paper presents a formulation for identification of linear multivariable systems from single or multiple sets of input-output data. The system input-output relationship is expressed in terms of an observer, which is made asymptotically stable by an embedded eigenvalue assignment procedure. The prescribed eigenvalues for the observer may be real, complex, mixed real and complex, or zero. In this formulation, the Markov parameters of the observer are identified from input-output data. The Markov parameters of the actual system are then recovered from those of the observer, and used to obtain a state space model of the system by standard realization techniques. The basic mathematical formulation is derived, and numerical examples using simulated noise-free data are presented to illustrate the proposed method.

Phan, Minh↗
NASA NTRS1992

Identification of linear systems by an asymptotically stable observer

A formulation is presented for the identification of a linear multivariable system from single or multiple sets of input-output data. The system input-output relationship is expressed in terms of an observer, which is made asymptotically stable by an embedded eigenvalue assignment procedure. The prescribed eigenvalues for the observer may be real, complex, mixed real and complex, or zero. In this formulation, the Markov parameters of the observer are identified from input-output data. The Markov parameters of the actual system are then recovered from those of the observer and used to obtain a state space model of the system by standard realization techniques. The basic mathematical formulation is derived, and extensive numerical examples using simulated noise-free data are presented to illustrate the proposed method.

Phan, Minh Q.↗
NASA NTRS1988

Determining state-space models from sequential output data

This talk focuses on the determination of state-space models for large space systems using only the output data. The output data could be generated by the unknown or deliberate initial conditions of the space structure in question. We shall review some relevant fundamental work on the state-space modeling of sequential output data that is potentially applicable to large space structures. If formulated in terms of some generalized Markov parameters, this approach is in some sense similar to, but much simpler than, the Juang-Pappa Eigensystem Realization Algorithm (ERA) and the Ho-Kalman construction procedure.

Lin, Jiguan Gene↗
NASA NTRS1982

Reliability calculation using randomization for Markovian fault-tolerant computing systems

The randomization technique for computing transient probabilities of Markov processes is presented. The technique is applied to a Markov process model of a simplified fault tolerant computer system for illustrative purposes. It is applicable to much larger and more complex models. Transient state probabilities are computed, from which reliabilities are derived. An accelerated version of the randomization algorithm is developed which exploits ''stiffness' of the models to gain increased efficiency. A great advantage of the randomization approach is that it easily allows probabilities and reliabilities to be computed to any predetermined accuracy.

Miller, D. R.↗
NASA NTRS1985

An abstract specification language for Markov reliability models

Markov models can be used to compute the reliability of virtually any fault tolerant system. However, the process of delineating all of the states and transitions in a model of complex system can be devastatingly tedious and error-prone. An approach to this problem is presented utilizing an abstract model definition language. This high level language is described in a nonformal manner and illustrated by example.

Butler, R. W.↗
NASA NTRS1986

An abstract language for specifying Markov reliability models

Markov models can be used to compute the reliability of virtually any fault tolerant system. However, the process of delineating all of the states and transitions in a model of complex system can be devastatingly tedious and error-prone. An approach to this problem is presented utilizing an abstract model definition language. This high level language is described in a nonformal manner and illustrated by example.

Butler, Ricky W.↗