Search NASA⌕ Search

SEARCH · Search NASA

Results for “state space model”

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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Computational tools for multi-linked flexible structures

A software module which designs and tests controllers and filters in Kalman Estimator form, based on a polynomial state-space model is discussed. The user-friendly program employs an interactive graphics approach to simplify the design process. A variety of input methods are provided to test the effectiveness of the estimator. Utilities are provided which address important issues in filter design such as graphical analysis, statistical analysis, and calculation time. The program also provides the user with the ability to save filter parameters, inputs, and outputs for future use.

Lee, Gordon K. F.↗
NASA NTRS1990

Active rejection of persistent disturbances in flexible space structures

A dynamic compensator for active rejection of persistent disturbances in flexible space structures is designed on the principle of the H(infinity)-optimization of the sensitivity transfer function matrix. A general state space solution is formulated to the multiinput multioutput H(infinity)-optimal control problem, allowing the use of the H(infinity)-optimal synthesis algorithm for the state-space models of space structures that result from model order reduction. Disturbances encountered in flexible space structures, such as shuttle docking, are investigated using the high-mode and the reduced-order models of a cantilevered two-bay truss, demonstrating the applicability of the H(infinity)-optimal approach.

Hwang, Cheng-Neng↗
NASA NTRS1991

Physically weighted approximations of unsteady aerodynamic forces using the minimum-state method

The Minimum-State Method for rational approximation of unsteady aerodynamic force coefficient matrices, modified to allow physical weighting of the tabulated aerodynamic data, is presented. The approximation formula and the associated time-domain, state-space, open-loop equations of motion are given, and the numerical procedure for calculating the approximation matrices, with weighted data and with various equality constraints are described. Two data weighting options are presented. The first weighting is for normalizing the aerodynamic data to maximum unit value of each aerodynamic coefficient. The second weighting is one in which each tabulated coefficient, at each reduced frequency value, is weighted according to the effect of an incremental error of this coefficient on aeroelastic characteristics of the system. This weighting yields a better fit of the more important terms, at the expense of less important ones. The resulting approximate yields a relatively low number of aerodynamic lag states in the subsequent state-space model. The formulation forms the basis of the MIST computer program which is written in FORTRAN for use on the MicroVAX computer and interfaces with NASA's Interaction of Structures, Aerodynamics and Controls (ISAC) computer program. The program structure, capabilities and interfaces are outlined in the appendices, and a numerical example which utilizes Rockwell's Active Flexible Wing (AFW) model is given and discussed.

Karpel, Mordechay↗
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

Estimation of Kalman filter gain from output residuals

This paper presents a procedure for estimating the Kalman filter gain from output residuals. The system state space model is assumed to be known, but the process and noise covariance are unknown. The proposed procedure consists of three basic steps. First, the output residuals are computed from the given model and a given set of input-output data. Second, a linear regression model for this part of the response is computed by a least squares solution. Third, the Kalman filter gain is then estimated from the coefficients of this model. Numerical results using experimental data are presented to illustrate the validity of the developed procedure.

Juang, Jer-Nan↗
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 NTRS1991

New bounds on parameter uncertainties for robust stability

The problem of robust stability in linear systems with parametric uncertainties is considered. A method is developed to determine bounds on uncertain parameters in the state-space model of the system, so that stability is preserved. Both continuous- and discrete-time systems are considered. Unlike previous results, the stability bounds are derived in terms of actual parameters instead of their absolute values, and consequently the stable region in the parameter space is not necessarily symmetric with respect to the origin. Furthermore, the uncertain parameters do not have to be linearly independent to each other.

Gao, Zhiqiang↗
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 NTRS1993

Robust root clustering for linear uncertain systems using generalized Lyapunov theory

Consideration is given to the problem of matrix root clustering in subregions of a complex plane for linear state space models with real parameter uncertainty. The nominal matrix root clustering theory of Gutman & Jury (1981) using the generalized Liapunov equation is extended to the perturbed matrix case, and bounds are derived on the perturbation to maintain root clustering inside a given region. The theory makes it possible to obtain an explicit relationship between the parameters of the root clustering region and the uncertainty range of the parameter space.

Yedavalli, R. K.↗
NASA NTRS1993

Q-Markov covariance equivalent realization and its application to flexible structure identification

The Q-Markov covariance equivalent realization algorithm is applied to NASA's Minimast structure to identify state-space models for the purpose of designing closed-loop controllers, and laboratory test results are shown for the identification and for the closed-loop performance. The paper also presents for the first time a deterministic formulation of covariance parameters from a pulse response, a stochastic formulation of Markov parameters from a white-noise response, and a simple Q-Markov covariance equivalent realization formulation. This requires only pulse laboratory tests or only white-noise laboratory tests to generate Q-Markov covariance equivalent realizations.

Liu, Ketao↗
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 NTRS1993

A layered approach to structural control system design for the JPL phase B testbed

This paper describes our efforts in structural control experiments for a flexible precision structure using both passive and active control. Specifically, a layered structural control approach utilizing passive viscous dampers, colocated and noncolocated active control is used. The passive dampers and active colocated control loops are used to enhance stability and robustness and the noncolocated multivariable controller is designed with respect to a partially controlled structure to further improve the performance. Our approach to the multivariable design problem requires not only a state space model description of the plant, but also an accompanying uncertainty model. To support the multivariable robust control design development, a significant effort in system identification was undertaken. The process of identification and identified results are discussed. Noncolocated controllers are designed using the H(infinity)/mu-synthesis methodology. The order of the controller is typically large, hence, model reduction is performed for practical digital implementation on a real-time control system developed at JPL. Finally, experimental results are presented and some of lessons are discussed.

Chu, Cheng-Chih↗
NASA NTRS1993

Flight control application of new stability robustness bounds for linear uncertain systems

This paper addresses the issue of obtaining bounds on the real parameter perturbations of a linear state-space model for robust stability. Based on Kronecker algebra, new, easily computable sufficient bounds are derived that are much less conservative than the existing bounds since the technique is meant for only real parameter perturbations (in contrast to specializing complex variation case to real parameter case). The proposed theory is illustrated with application to several flight control examples.

Yedavalli, Rama K.↗
NASA NTRS1996

Frequency Domain Identification Toolbox

This report documents software written in MATLAB programming language for performing identification of systems from frequency response functions. MATLAB is a commercial software environment which allows easy manipulation of data matrices and provides other intrinsic matrix functions capabilities. Algorithms programmed in this collection of subroutines have been documented elsewhere but all references are provided in this document. A main feature of this software is the use of matrix fraction descriptions and system realization theory to identify state space models directly from test data. All subroutines have templates for the user to use as guidelines.

Horta, Lucas G.↗
NASA NTRS1996

Comparison of System Identification Techniques for the Hydraulic Manipulator Test Bed (HMTB)

In this thesis linear, dynamic, multivariable state-space models for three joints of the ground-based Hydraulic Manipulator Test Bed (HMTB) are identified. HMTB, housed at the NASA Langley Research Center, is a ground-based version of the Dexterous Orbital Servicing System (DOSS), a representative space station manipulator. The dynamic models of the HMTB manipulator will first be estimated by applying nonparametric identification methods to determine each joint's response characteristics using various input excitations. These excitations include sum of sinusoids, pseudorandom binary sequences (PRBS), bipolar ramping pulses, and chirp input signals. Next, two different parametric system identification techniques will be applied to identify the best dynamical description of the joints. The manipulator is localized about a representative space station orbital replacement unit (ORU) task allowing the use of linear system identification methods. Comparisons, observations, and results of both parametric system identification techniques are discussed. The thesis concludes by proposing a model reference control system to aid in astronaut ground tests. This approach would allow the identified models to mimic on-orbit dynamic characteristics of the actual flight manipulator thus providing astronauts with realistic on-orbit responses to perform space station tasks in a ground-based environment.

Morris, A. Terry↗
NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes

A code trellis is a graphical representation of a code, block or convolutional, in which every path represents a codeword (or a code sequence for a convolutional code). This representation makes it possible to implement Maximum Likelihood Decoding (MLD) of a code with reduced decoding complexity. The most well known trellis-based MLD algorithm is the Viterbi algorithm. The trellis representation was first introduced and used for convolutional codes [23]. This representation, together with the Viterbi decoding algorithm, has resulted in a wide range of applications of convolutional codes for error control in digital communications over the last two decades. There are two major reasons for this inactive period of research in this area. First, most coding theorists at that time believed that block codes did not have simple trellis structure like convolutional codes and maximum likelihood decoding of linear block codes using the Viterbi algorithm was practically impossible, except for very short block codes. Second, since almost all of the linear block codes are constructed algebraically or based on finite geometries, it was the belief of many coding theorists that algebraic decoding was the only way to decode these codes. These two reasons seriously hindered the development of efficient soft-decision decoding methods for linear block codes and their applications to error control in digital communications. This led to a general belief that block codes are inferior to convolutional codes and hence, that they were not useful. Chapter 2 gives a brief review of linear block codes. The goal is to provide the essential background material for the development of trellis structure and trellis-based decoding algorithms for linear block codes in the later chapters. Chapters 3 through 6 present the fundamental concepts, finite-state machine model, state space formulation, basic structural properties, state labeling, construction procedures, complexity, minimality, and sectionalization of trellises. Chapter 7 discusses trellis decomposition and subtrellises for low-weight codewords. Chapter 8 first presents well known methods for constructing long powerful codes from short component codes or component codes of smaller dimensions, and then provides methods for constructing their trellises which include Shannon and Cartesian product techniques. Chapter 9 deals with convolutional codes, puncturing, zero-tail termination and tail-biting.Chapters 10 through 13 present various trellis-based decoding algorithms, old and new. Chapter 10 first discusses the application of the well known Viterbi decoding algorithm to linear block codes, optimum sectionalization of a code trellis to minimize computation complexity, and design issues for IC (integrated circuit) implementation of a Viterbi decoder. Then it presents a new decoding algorithm for convolutional codes, named Differential Trellis Decoding (DTD) algorithm. Chapter 12 presents a suboptimum reliability-based iterative decoding algorithm with a low-weight trellis search for the most likely codeword. This decoding algorithm provides a good trade-off between error performance and decoding complexity. All the decoding algorithms presented in Chapters 10 through 12 are devised to minimize word error probability. Chapter 13 presents decoding algorithms that minimize bit error probability and provide the corresponding soft (reliability) information at the output of the decoder. Decoding algorithms presented are the MAP (maximum a posteriori probability) decoding algorithm and the Soft-Output Viterbi Algorithm (SOVA) algorithm. Finally, the minimization of bit error probability in trellis-based MLD is discussed.

Lin, Shu↗