Search NASA⌕ Search

SEARCH · Search NASA

Results for “Recursion”

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 271 records · Page 15

Fast frequency acquisition via adaptive least squares algorithm

A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general, adaptive parameter-estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be nonGaussian, nonstationary and colored. As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the fast Fourier transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.

Kumar, R.↗

Method for the determination of the three-dimensional aerodynamic field of a rotor-stator combination to compressible flow

Using the lifting surface theory and the acceleration potential method for the flow field of an axial turbocompressor stage, a recursive and a direct method are presented that make use of the eigenfunction solutions of the isolated rotor and stator to solve for the rotor-stator interaction problem. The net pressure distribution on the rotor and stator blades is represented by modified Birnbaum series, whose coefficients are determined using a matrix procedure and satisfying the boundary conditions on the surface of the blades. The relation between the matrix operators of the recursive and the direct methods is also shown. Expressions have been given for the blade circulation, the axial and tangential forces on the blade, the rotor power required, and the induced upwash velocity of the stage.

Ramachandra, Sridhar M.↗

Fast frequency acquisition via adaptive least squares algorithm

A new least squares algorithm is proposed and investigated for fast frequency and phase acquisition of sinusoids in the presence of noise. This algorithm is a special case of more general, adaptive parameter-estimation techniques. The advantages of the algorithms are their conceptual simplicity, flexibility and applicability to general situations. For example, the frequency to be acquired can be time varying, and the noise can be non-Gaussian, nonstationary and colored. As the proposed algorithm can be made recursive in the number of observations, it is not necessary to have a priori knowledge of the received signal-to-noise ratio or to specify the measurement time. This would be required for batch processing techniques, such as the fast Fourier transform (FFT). The proposed algorithm improves the frequency estimate on a recursive basis as more and more observations are obtained. When the algorithm is applied in real time, it has the extra advantage that the observations need not be stored. The algorithm also yields a real time confidence measure as to the accuracy of the estimator.

Kumar, Rajendra↗

Method for the determination of the three dimensional aerodynamic field of a rotor-stator combination in compressible flow

Using the lifting surface theory and the acceleration potential method for the flow field of an axial turbocompressor stage, a recursive and a direct method are presented that make use of the eigenfunction solutions of the isolated rotor and stator to solve for the rotor-stator interaction problem. The net pressure distribution on the rotor and stator blades is represented by modified Birnbaum series, whose coefficients are determined using a matrix procedure and satisfying the boundary conditions on the surface of the blades. The relation between the matrix operators of the recursive and the direct methods is also shown. Expressions have been given for the blade circulation, the axial and tangential forces on the blade, the rotor power required, and the induced upwash velocity of the stage.

Ramachandra, Sridhar M.↗

Least squares linear lags and limited memory filters

Pure autoregressive (AR) models which are linear in the short term, that is when a variable can be predicted by linear regression on a limited number of past observations, are discussed. When evenly spaced observations are available, a fixed set of AR coefficients can be calculated independent of the data. For filtering purposes, such a lag structure can be implemented recursively with an efficient algorithm. The method of computing variance recursively is also derived. A complete algorithm is presented in the appendix.

Discenza, Joseph H.↗

An improved algorithm for optimum structural design with multiple frequency constraints

An optimality criterion (OC) method for minimum-weight design of structures having multiple constraints on natural frequencies is presented. In this work a new resizing strategy is developed based on relaxation techniques. A computationally adaptive control parameter is used in conjunction with existing OC recursive formulae to promote convergence of optimum structural designs. Some considerations regarding the coupling of the modified Aitken accelerator with the OC method are discussed. Improved and rapidly converged minimum-weight designs are obtained when using an under-relaxed recursive scheme combined with the modified Aitken accelerator.

Mcgee, Oliver G.↗

Direct evaluation of fault trees using object-oriented programming techniques

Object-oriented programming techniques are used in an algorithm for the direct evaluation of fault trees. The algorithm combines a simple bottom-up procedure for trees without repeated events with a top-down recursive procedure for trees with repeated events. The object-oriented approach results in a dynamic modularization of the tree at each step in the reduction process. The algorithm reduces the number of recursive calls required to solve trees with repeated events and calculates intermediate results as well as the solution of the top event. The intermediate results can be reused if part of the tree is modified. An example is presented in which the results of the algorithm implemented with conventional techniques are compared to those of the object-oriented approach.

Patterson-Hine, F. A.↗

NETRA: A parallel architecture for integrated vision systems. 1: Architecture and organization

Computer vision is regarded as one of the most complex and computationally intensive problems. An integrated vision system (IVS) is considered to be a system that uses vision algorithms from all levels of processing for a high level application (such as object recognition). A model of computation is presented for parallel processing for an IVS. Using the model, desired features and capabilities of a parallel architecture suitable for IVSs are derived. Then a multiprocessor architecture (called NETRA) is presented. This architecture is highly flexible without the use of complex interconnection schemes. The topology of NETRA is recursively defined and hence is easily scalable from small to large systems. Homogeneity of NETRA permits fault tolerance and graceful degradation under faults. It is a recursively defined tree-type hierarchical architecture where each of the leaf nodes consists of a cluster of processors connected with a programmable crossbar with selective broadcast capability to provide for desired flexibility. A qualitative evaluation of NETRA is presented. Then general schemes are described to map parallel algorithms onto NETRA. Algorithms are classified according to their communication requirements for parallel processing. An extensive analysis of inter-cluster communication strategies in NETRA is presented, and parameters affecting performance of parallel algorithms when mapped on NETRA are discussed. Finally, a methodology to evaluate performance of algorithms on NETRA is described.

Choudhary, Alok N.↗

Kalman filter based range estimation for autonomous navigation using imaging sensors

Rotorcraft operating in high-threat environments fly close to the surface of the earth to utilize surrounding terrain, vegetation, or man-made objects to minimize the risk of being detected by the enemy. Two basic requirements for obstacle avoidance are detection and range estimation of the object from the current rotorcraft position. There are many approaches to the estimation of range using a sequence of images. The approach used in this analysis differes from previous methods in two significant ways: an attempt is not made to estimate the rotorcraft's motion from the images; and the interest lies in recursive algorithms. The rotorcraft parameters are assumed to be computed using an onboard inertial navigation system. Given a sequence of images, using image-object differential equations, a Kalman filter (Sridhar and Phatak, 1988) can be used to estimate both the relative coordinates and the earth coordinates of the objects on the ground. The Kalman filter can also be used in a predictive mode to track features in the images, leading to a significant reduction of search effort in the feature extraction step of the algorithm. The purpose is to summarize early results obtained in extending the Kalman filter for use with actual image sequences. The experience gained from the application of this algorithm to real images is very valuable and is a necessary step before proceeding to the estimation of range during low-altitude curvilinear flight. A simple recursive method is presented to estimate range to objects using a sequence of images. The method produces good range estimates using real images in a laboratory set up and needs to be evaluated further using several different image sequences to test its robustness. The feature generation part of the algorithm requires further refinement on the strategies to limit the number of features (Sridhar and Phatak, 1989). The extension of the work reported here to curvilinear flight may require the use of the extended Kalman filter.

Sridhar, Banavar↗

An innovations approach to decoupling of multibody dynamics and control

The problem of hinged multibody dynamics is solved using an extension of the innovations approach of linear filtering and prediction theory to the problem of mechanical system modeling and control. This approach has been used quite effectively to diagonalize the equations for filtering and prediction for linear state space systems. It has similar advantages in the study of dynamics and control of multibody systems. The innovations approach advanced here consists of expressing the equations of motion in terms of two closely related processes: (1) the innovations process e, a sequence of moments, obtained from the applied moments T by means of a spatially recursive Kalman filter that goes from the tip of the manipulator to its base; (2) a residual process, a sequence of velocities, obtained from the joint-angle velocities by means of an outward smoothing operations. The innovations e and the applied moments T are related by means of the relationships e = (I - L)T and T = (I + K)e. The operation (I - L) is a causal lower triangular matrix which is generated by a spatially recursive Kalman filter and the corresponding discrete-step Riccati equation. Hence, the innovations and the applied moments can be obtained from each other by means of a causal operation which is itself casually invertible.

Rodriguez, G.↗

Development of efficient computer program for dynamic simulation of telerobotic manipulation

Research in robot control has generated interest in computationally efficient forms of dynamic equations for multi-body systems. For a simply connected open-loop linkage, dynamic equations arranged in recursive form were found to be particularly efficient. A general computer program capable of simulating an open-loop manipulator with arbitrary number of links has been developed based on an efficient recursive form of Kane's dynamic equations. Also included in the program is some of the important dynamics of the joint drive system, i.e., the rotational effect of the motor rotors. Further efficiency is achieved by the use of symbolic manipulation program to generate the FORTRAN simulation program tailored for a specific manipulator based on the parameter values given. The formulations and the validation of the program are described, and some results are shown.

Chen, J.↗

Comparison of methods for developing the dynamics of rigid-body systems

Several approaches for developing the equations of motion for a three-degree-of-freedom PUMA robot were compared on the basis of computational efficiency (i.e., the number of additions, subtractions, multiplications, and divisions). Of particular interest was the investigation of the use of computer algebra as a tool for developing the equations of motion. Three approaches were implemented algebraically: Lagrange's method, Kane's method, and Wittenburg's method. Each formulation was developed in absolute and relative coordinates. These six cases were compared to each other and to a recursive numerical formulation. The results showed that all of the formulations implemented algebraically required fewer calculations than the recursive numerical algorithm. The algebraic formulations required fewer calculations in absolute coordinates than in relative coordinates. Each of the algebraic formulations could be simplified, using patterns from Kane's method, to yield the same number of calculations in a given coordinate system.

Ju, M. S.↗

System identification in the repetition domain

Procedures for system identification using realization theory in conjunction with learning control ideas are developed. The Markov parameters of the system are identified by combining data from repeated experiments. Three approaches are discussed for identification of as many Markov parameters as sample points in the experiment. Making use of all the parameters, realization theory is then employed to determine the system order and to obtain a minimal order representation. The first two approaches are non-recursive, which in the case of noise-free data yields a one step solution. The third approach uses a recursive formulation rendered from adaptive control but modified for successive experiments. A simple example shows the numerical convergence of the identified parameters as a function of the number of experiments. The procedure presented herein is an extension of the existing Eigensystem Realization Algorithm (ERA), which has been successfully applied for system identification of large structures.

Juang, Jer-Nan↗

The determination of third order linear models from a seventh order nonlinear jet engine model

Results are presented that demonstrate how good reduced-order models can be obtained directly by recursive parameter identification using input/output (I/O) data of high-order nonlinear systems. Three different methods of obtaining a third-order linear model from a seventh-order nonlinear turbojet engine model are compared. The first method is to obtain a linear model from the original model and then reduce the linear model by standard reduction techniques such as residualization and balancing. The second method is to identify directly a third-order linear model by recursive least-squares parameter estimation using I/O data of the original model. The third method is to obtain a reduced-order model from the original model and then linearize the reduced model. Frequency responses are used as the performance measure to evaluate the reduced models. The reduced-order models along with their Bode plots are presented for comparison purposes.

Lalonde, Rick J.↗

Ridge Regression Signal Processing

The introduction of the Global Positioning System (GPS) into the National Airspace System (NAS) necessitates the development of Receiver Autonomous Integrity Monitoring (RAIM) techniques. In order to guarantee a certain level of integrity, a thorough understanding of modern estimation techniques applied to navigational problems is required. The extended Kalman filter (EKF) is derived and analyzed under poor geometry conditions. It was found that the performance of the EKF is difficult to predict, since the EKF is designed for a Gaussian environment. A novel approach is implemented which incorporates ridge regression to explain the behavior of an EKF in the presence of dynamics under poor geometry conditions. The basic principles of ridge regression theory are presented, followed by the derivation of a linearized recursive ridge estimator. Computer simulations are performed to confirm the underlying theory and to provide a comparative analysis of the EKF and the recursive ridge estimator.

Kuhl, Mark R.↗

Identification of observer/Kalman filter Markov parameters: Theory and experiments

An algorithm to compute Markov parameters of an observer or Kalman filter from experimental input and output data is discussed. The Markov parameters can then be used for identification of a state space representation, with associated Kalman gain or observer gain, for the purpose of controller design. The algorithm is a non-recursive matrix version of two recursive algorithms developed in previous works for different purposes. The relationship between these other algorithms is developed. The new matrix formulation here gives insight into the existence and uniqueness of solutions of certain equations and gives bounds on the proper choice of observer order. It is shown that if one uses data containing noise, and seeks the fastest possible deterministic observer, the deadbeat observer, one instead obtains the Kalman filter, which is the fastest possible observer in the stochastic environment. Results are demonstrated in numerical studies and in experiments on an ten-bay truss structure.

Juang, Jer-Nan↗

Random field estimation approach to robot dynamics

The difference equations of Kalman filtering and smoothing recursively factor and invert the covariance of the output of a linear state-space system driven by a white-noise process. Here it is shown that similar recursive techniques factor and invert the inertia matrix of a multibody robot system. The random field models are based on the assumption that all of the inertial (D'Alembert) forces in the system are represented by a spatially distributed white-noise model. They are easier to describe than the models based on classical mechanics, which typically require extensive derivation and manipulation of equations of motion for complex mechanical systems. With the spatially random models, more primitive locally specified computations result in a global collective system behavior equivalent to that obtained with deterministic models. The primary goal of applying random field estimation is to provide a concise analytical foundation for solving robot control and motion planning problems.

Rodriguez, Guillermo↗

Spatial operator approach to flexible manipulator inverse and forward dynamics

This study extends to flexible multibody manipulators the recent results of the author on the use of spatially recursive filtering and smoothing techniques for robot arm dynamics. The configuration analyzed is that of a mechanical system of flexible bodies joined together by articulated joints. The inverse and forward dynamics problems are solved using the techniques of spatially recursive Kalman filtering and smoothing. The algorithms are easily developed using a set of identities associated with mass matrix factorization and inversion. The identities are easily derived using a spatial operator algebra developed by the author.

Rodriguez, G.↗