Search NASA⌕ Search

SEARCH · Search NASA

Results for “recursive estimation”

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 127 records · Page 7

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↗

Multi-Objective Flight Control for Ride Quality Improvement for Flexible Aircraft

This paper describes a multi-objective flight control system design for ride quality improvement for flexible aircraft using multi-functional distributed flight control surfaces. A multi-objective optimal control design is developed to provide an acceleration suppression capability in conjunction with a gust load alleviation in order to provide ride quality improvement. A gust estimation is developed to estimate the gust load using a recursive least-squares algorithm. A ride quality assessment study is conducted using a flexible wing generic transport model. Six different flight control designs are implemented. The study shows that ride quality can be significantly improved with the acceleration suppression control.

Nguyen, Nhan↗

Measurement updating using the U-D factorization

A new mechanization of the Kalman updating algorithm based on a U-D factorization of the estimate error covariance is introduced. Efficient and stable updating recursions are developed for the unit upper triangular factor U and the diagonal factor D, treating only the parameter estimation problem. Properties of the factorization update performed here include efficient one point at a time processing that requires little more computation than the optimal but numerically unstable conventional Kalman measurement update algorithm, and stability that compares with the square root filter.

Bierman, G. J.↗

Real-Time Frequency Response Estimation Using Joined-Wing SensorCraft Aeroelastic Wind-Tunnel Data

A new method is presented for estimating frequency responses and their uncertainties from wind-tunnel data in real time. The method uses orthogonal phase-optimized multi- sine excitation inputs and a recursive Fourier transform with a least-squares estimator. The method was first demonstrated with an F-16 nonlinear flight simulation and results showed that accurate short period frequency responses were obtained within 10 seconds. The method was then applied to wind-tunnel data from a previous aeroelastic test of the Joined- Wing SensorCraft. Frequency responses describing bending strains from simultaneous control surface excitations were estimated in a time-efficient manner.

Grauer, Jared A↗

On-line parameter estimation using a high sensitivity estimator

An on-line parameter identification method is presented. The method is based on a recursive formulation of the maximum likelihood method, with a significant modification on the gains of the state estimator. In the conventional maximum likelihood method, the Kalman gains are used in the state estimator. This produces unbiased, minimum variance parameter estimates in the presence of process noise and measurement noise, but it also slows the convergence rate when the identification is done on-line. Here we suggest choosing the gains to maximize a measure of the sensitivities of the state estimates to parameter variations. One such criterion is to minimize the trace of the inverse information matrix. This increases the convergence rate significantly. After one or two time constants, the gains are switched to the Kalman values to assure unbiased, minimum-variance estimates. The state estimate will initially be nonoptimal, and may not be adequate for control purposes. In this case, a parallel Kalman filter which uses the identifier's parameter estimates can be used. This method is applied here for the identification of a simple first-order system, and for the identification of short-period stability derivatives of an F-8 aircraft from simulated data.

Mishne, D.↗

An investigation of new methods for estimating parameter sensitivities

Parameter sensitivity is defined as the estimation of changes in the modeling functions and the design variables due to small changes in the fixed parameters of the formulation. There are currently several methods for estimating parameter sensitivities requiring either difficult to obtain second order information, or do not return reliable estimates for the derivatives. Additionally, all the methods assume that the set of active constraints does not change in a neighborhood of the estimation point. If the active set does in fact change, than any extrapolations based on these derivatives may be in error. The objective here is to investigate more efficient new methods for estimating parameter sensitivities when the active set changes. The new method is based on the recursive quadratic programming (RQP) method and in conjunction a differencing formula to produce estimates of the sensitivities. This is compared to existing methods and is shown to be very competitive in terms of the number of function evaluations required. In terms of accuracy, the method is shown to be equivalent to a modified version of the Kuhn-Tucker method, where the Hessian of the Lagrangian is estimated using the BFS method employed by the RPQ algorithm. Inital testing on a test set with known sensitivities demonstrates that the method can accurately calculate the parameter sensitivity. To handle changes in the active set, a deflection algorithm is proposed for those cases where the new set of active constraints remains linearly independent. For those cases where dependencies occur, a directional derivative is proposed. A few simple examples are included for the algorithm, but extensive testing has not yet been performed.

Beltracchi, Todd J.↗

A nonparametric clustering technique which estimates the number of clusters

In applications of cluster analysis, one usually needs to determine the number of clusters, K, and the assignment of observations to each cluster. A clustering technique based on recursive application of a multivariate test of bimodality which automatically estimates both K and the cluster assignments is presented.

Ramey, D. B.↗

Real-time flutter identification with close mode resolution

Real-time flutter prediction including close modes can be effectively estimated from turbulence or on-board excitation with an Extended Kalman Filter (EKF) approach. A physically based model form enables prediction of the damping rate as well as damping, giving a time to instability estimate with its variance. The approach is recursive and can operate asynchronously to drop data outliers and hence is quite robust. Its speed is reasonable for on-line application but can also be used effectively as an off-line analysis tool for application to any modal testing situation.

Roy, R. H.↗

Spatially recursive filtering and smoothing for multibody dynamics

Methods developed recently by the author to solve the problem of forward dynamics for nonlinear joint-connected multibody systems are summarized. Solution of this problem is of interest in such application areas as robotics, deploying structures, ground vehicles, and pointing of antennas and instrumented platforms. The problem is solved by the recursive filtering and smoothing techniques of state estimation theory. The filtering stage takes the applied joint moments as inputs to produce a sequence of spatial constraint forces acting at the joints of the system. The smoothing stage takes the innovations process resulting from the filter as an input and produces a set of spatial accelerations and a corresponding set of joint-angle accelerations.

Rodriguez, G.↗

Recent developments in learning control and system identification for robots and structures

This paper reviews recent results in learning control and learning system identification, with particular emphasis on discrete-time formulation, and their relation to adaptive theory. Related continuous-time results are also discussed. Among the topics presented are proportional, derivative, and integral learning controllers, time-domain formulation of discrete learning algorithms. Newly developed techniques are described including the concept of the repetition domain, and the repetition domain formulation of learning control by linear feedback, model reference learning control, indirect learning control with parameter estimation, as well as related basic concepts, recursive and non-recursive methods for learning identification.

Phan, M.↗

Sequential Filtering in the Presence of Uniform Measurement Errors

This paper presents a sequential filtering strategy using observations corrupted with uniform measurement noise. While the Kalman filter remains the best linear estimator of the state, other filtering techniques provide minimum variance optimal estimates, a trait only enjoyed by the Kalman filter when the underlying noises are, in fact, Gaussian. This work develops a new approximate optimal estimator for uniform measurement noises. The resulting recursion requires just slightly more computational time to complete a measurement update than the Kalman filter, which generally cannot be claimed by other optimal strategies such as the particle or Gaussian mixture filters.

James S. McCabe↗

Sequential Filtering in the Presence of Uniform Measurement Errors

This paper presents a sequential filtering strategy using observations corrupted with uniform measurement noise. While the Kalman filter remains the best linear estimator of the state, other filtering techniques provide minimum variance optimal estimates, a trait only enjoyed by the Kalman filter when the underlying noises are, in fact, Gaussian. This work develops a new approximate optimal estimator for uniform measurement noises. The resulting recursion requires just slightly more computational time to complete a measurement update than the Kalman filter, which generally cannot be claimed by other optimal strategies such as the particle or Gaussian mixture filters.

James S McCabe↗

Approximate estimation for systems with quantized data.

Estimation of the state of a nonlinear discrete-time system using quantized data is considered. An exact solution for the maximum likelihood estimate is expressed as the solution of a nonlinear two-point boundary-value problem. Approximate recursive solutions for both the maximum likelihood and the conditional-mean estimates are obtained. The results of Monte-Carlo simulations are presented in which the performance of these two algorithms is compared with that of a Kalman filter in which the quantization error is approximated by white noise.-

Clements, K. A.↗

Analysis of Satellite-to-Satellite Tracking (SST) and altimetry data from GEOS-C

Radar altimetry and satellite-to-satellite (SST) range and range rate tracking measurements were used to infer the exterior gravitational field of the earth and the structure of the geoid from GEOS-C metric data. Under the SST analysis, a direct point-by-point estimate of gravity disturbance by means of a recursive filter with backward smoothing was attempted but had to be forsaken because of poor convergence. The adopted representation consists of a more or less uniform grid of discrete masses at a depth of approximately 400 km from the earth's surface. The layer is superimposed on a spherical harmonics model. The procedure for smoothing the altimetry and inferring the fine-structured gravity field over the Atlantic test area is described. The local disturbances are represented by means of a density layer. The altimeter height biases were first estimated by a least squares adjustment at orbital crossover points. After taking out the bias, long wavelength contributions from GEM-6 as well as a calibration correction were subtracted. The residual heights were then represented by a mass distribution beneath the earth's surface.

Wong, L.↗

Generalized covariance analysis for partially autonomous deep space missions

A new covariance analysis method is presented that is suitable for the evaluation of multiple impulsive controllers acting on some stochastic process x. The method accommodates batch and sequential estimators with equal ease and accounts for time-delay effects in a natural manner. The formalism is developed in terms of a generalized state vector that is formed from the system state vector x, augmented by various fixed epoch estimates, and a data vector formed from discrete time observations of the system. Recursions are developed for time transition, measurement incorporation, and impulsive control updating of the generalized covariance matrix. Means of limiting the dimensional growth of the generalized state vector via the processes of estimator epoch adjustment and measurement vector deflation are described and the application of numerically stable matrix factorization methods to the generalized covariance recursions is outlined. The method is applied to the Magellan spacecraft to demonstrate the capability of ground-based optimal estimation and control of gyro/star scanner misalignment.

Boone, Jack N.↗

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.↗

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↗