Search NASA⌕ Search

SEARCH · Search NASA

Results for “sequential updates”

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 19 records

Sequential estimation and satellite data assimilation in meteorology and oceanography

The role of dynamics in estimating the state of the atmosphere and ocean from incomplete and noisy data is discussed and the classical applications of four-dimensional data assimilation to large-scale atmospheric dynamics are presented. It is concluded that sequential updating of a forecast model with continuously incoming conventional and remote-sensing data is the most natural way of extracting the maximum amount of information from the imperfectly known dynamics, on the one hand, and the inaccurate and incomplete observations, on the other.

Ghil, M.↗

A Framework to Debug Diagnostic Matrices

Diagnostics is an important concept in system health and monitoring of space operations. Many of the existing diagnostic algorithms utilize system knowledge in the form of diagnostic matrix (D-matrix, also popularly known as diagnostic dictionary, fault signature matrix or reachability matrix) gleaned from physical models. But, sometimes, this may not be coherent to obtain high diagnostic performance. In such a case, it is important to modify this D-matrix based on knowledge obtained from other sources such as time-series data stream (simulated or maintenance data) within the context of a framework that includes the diagnostic/inference algorithm. A systematic and sequential update procedure, diagnostic modeling evaluator (DME) is proposed to modify D-matrix and wrapper logic considering least expensive solution first. This iterative procedure includes conditions ranging from modifying 0s and 1s in the matrix, or adding/removing the rows (failure sources) columns (tests). We will experiment this framework on datasets from DX challenge 2009.

Model-based↗

Comparison of EKF and UKF for Robotic Missions to Mars

The batched Kalman lter works well for a wide variety of orbit determination scenarios but requires linearized approximations to the underlying dynamical system. Furthermore, implementation depends on the computation of partial derivatives for all measurements and parameters used in the lter, a non-trivial task even when analytical derivations are possible. To address these limitations, many extensions and modi - cations to the linear Kalman lter have been proposed over the years since Kalman's initial publication. Our investigation examines two popular variants of the Kalman lter, namely the Extended Kalman Filter (EKF) and Unscented Kalman Filter (UKF), within the context of spacecraft missions to Mars. The EKF relies on the same mathematical basis as the classic version of the lter, however it sequentially updates the linearization as the ltering process is conducted. In contrast, the UKF is built upon the unscented transform which samples the nearby solution space and numerically propagates perturbed trajectories as part of the update / estimation process. We assess the performance of the ltering algorithms under a variety of mission scenarios with the goal of establishing decision criteria for which implementation to use under di ering circumstances.

Ely, Todd↗

Update on Bayesian Blocks: Segmented Models for Sequential Data

The Bayesian Block algorithm, in wide use in astronomy and other areas, has been improved in several ways. The model for block shape has been generalized to include other than constant signal rate - e.g., linear, exponential, or other parametric models. In addition the computational efficiency has been improved, so that instead of O(N**2) the basic algorithm is O(N) in most cases. Other improvements in the theory and application of segmented representations will be described.

Scargle, Jeff↗

Multiplexed Predictive Control of a Large Commercial Turbofan Engine

Model predictive control is a strategy well-suited to handle the highly complex, nonlinear, uncertain, and constrained dynamics involved in aircraft engine control problems. However, it has thus far been infeasible to implement model predictive control in engine control applications, because of the combination of model complexity and the time allotted for the control update calculation. In this paper, a multiplexed implementation is proposed that dramatically reduces the computational burden of the quadratic programming optimization that must be solved online as part of the model-predictive-control algorithm. Actuator updates are calculated sequentially and cyclically in a multiplexed implementation, as opposed to the simultaneous optimization taking place in conventional model predictive control. Theoretical aspects are discussed based on a nominal model, and actual computational savings are demonstrated using a realistic commercial engine model.

Richter, hanz↗

A Learn-To-Fly Approach for Adaptively Tuning Flight Control Systems

A method is presented for adaptively tuning feedback control gains in a ight control sys- tem to achieve desired closed-loop performance. The method combines efficient parameter estimation for identifying closed-loop dynamics models, with online nonlinear optimization for sequentially perturbing and updating control gains to improve performance. Prior in- formation on stability and control derivatives is not needed, nor is any knowledge about the control system architecture. Following convergence, the optimized control gains (with uncertainties), the open-loop dynamics model, and the closed-loop dynamics model are available. The method is demonstrated for tuning a longitudinal stability augmentation system using a realistic nonlinear ight dynamics simulation of the NASA FASER airplane. Convergence was attained using five piloted maneuvers that spanned approximately one minute of ight test time. Although demonstrated for a relatively simple case, the method is general and can be applied to other aircraft, axes, performance metrics, and control systems.

Grauer, Jared A.↗

A Learn-to-Fly Approach for Adaptively Tuning Flight Control Systems

A method is presented for adaptively tuning feedback control gains in a flight control system to achieve desired closed-loop performance. The method combines efficient aircraft parameter estimation, for identifying closed-loop dynamics models, with online nonlinear optimization, for sequentially perturbing and updating control gains to improve performance. Access to flight measurements and the control gains is required, but no prior information about the aircraft dynamics or the flight control architecture is needed. After the procedure, the optimized control gains (with uncertainties), the open-loop dynamics model, and the closed-loop dynamics model are available. The method is demonstrated for tuning a longitudinal stability augmentation system using a realistic nonlinear flight dynamics simulation of a subscale airplane. Convergence was attained using five maneuvers that spanned approximately one minute of flight test time. Although shown for a relatively simple case, the method is general and can be applied to other aircraft, axes of motion, performance metrics, and control system designs.

Adaptive tuning↗

Strake-generated vortex interactions for a fighter-like configuration

A combination of the Euler, and thin-layer Navier-Stokes equations were solved for the flowfield around a wing-strake-fuselage configuration similar to the F-16A aircraft. The flowfield was divided into multiple blocks using a zoning program, and the TNSWF solution program, based on an implicit solution algorithm, updates each subregion of the flowfield sequentially. The total grid contained approximately 300,000 grid points, and clustering was effected normal to all aircraft surfaces. The computed solutions agreed well quantitatively with wind-tunnel pressure distribution data, and they agreed well qualitatively with flow visualization from wind- and water-tunnel tests.

Reznick, Steven G.↗

An algorithm for propagating the square-root covariance matrix in triangular form

A method for propagating the square root of the state error covariance matrix in lower triangular form is described. The algorithm can be combined with any triangular square-root measurement update algorithm to obtain a triangular square-root sequential estimation algorithm. The triangular square-root algorithm compares favorably with the conventional sequential estimation algorithm with regard to computation time.

Tapley, B. D.↗

A study of autonomous satellite navigation methods using the global positioning satellite system

Special orbit determination algorithms were developed to accommodate the size and speed limitations of on-board computer systems of the NAVSTAR Global Positioning System. The algorithms use square root sequential filtering methods. A new method for the time update of the square root covariance matrix was also developed. In addition, the time update method was compared with another square root convariance propagation method to determine relative performance characteristics. Comparisions were based on the results of computer simulations of the LANDSAT-D satellite processing pseudo range and pseudo range-rate measurements from the phase one GPS. A summary of the comparison results is presented.

Tapley, B. D.↗

An advisory system for predicting and resolving airspace violations based on four-dimensional guidance techniques

New heuristics are integrated with four-dimensional guidance techniques developed by NASA in order to automate the prediction and resolution of airspace violations, and three rules are derived to reduce the amount of computation time for conflict detection. Controller experience has been used to establish techniques for resolving potential conflicts including speed control, altitude maneuvers, and horizontal flight maneuvers. Current aircraft states, flight plans, and extrapolation of aircraft trajectories are used to synthesize four-dimensional trajectories, and the state of the air traffic and the interaction between aircraft are projected into the future using the four-dimensional algorithms. The situation is immediately updated to incorporate any new information. Potential conflicts among multiple aircraft are resolved by fast sequential resolution of potential conflicts between aircraft pairs, one at a time.

Lee, Homer Q.↗

Batch Sequential Estimation with Non-Uniform Measurements and Non-Stationary Noise

Sequential estimation using the traditional discrete Kalman filter typically assumes the measurement time and state update time are coincident. This is often a poor assumption in realistic measurement scenarios where the data can be received from multiple sources at differing times. This paper develops the necessary algorithm adjustments needed for the Kalman filter to readily process measurement data that arrive at varying times and with non-stationary noise. The algorithm is applied to a relevant problem of orbit determination using one-way uplink radiometric tracking of a spacecraft (in the present case a Mars orbiter).

Seubert, Jill↗

Nonlinear Rescaling and Proximal-Like Methods in Convex Optimization

The nonlinear rescaling principle (NRP) consists of transforming the objective function and/or the constraints of a given constrained optimization problem into another problem which is equivalent to the original one in the sense that their optimal set of solutions coincides. A nonlinear transformation parameterized by a positive scalar parameter and based on a smooth scaling function is used to transform the constraints. The methods based on NRP consist of sequential unconstrained minimization of the classical Lagrangian for the equivalent problem, followed by an explicit formula updating the Lagrange multipliers. We first show that the NRP leads naturally to proximal methods with an entropy-like kernel, which is defined by the conjugate of the scaling function, and establish that the two methods are dually equivalent for convex constrained minimization problems. We then study the convergence properties of the nonlinear rescaling algorithm and the corresponding entropy-like proximal methods for convex constrained optimization problems. Special cases of the nonlinear resealing algorithm are presented. In particular a new class of exponential penalty-modified barrier functions methods is introduced.

Polyak, Roman↗

Ignition of Metals in Heated Supersonic Particle Impact with Inert Particulate

The conventional understanding of particle impact ignition characteristic elements relies on the following principles: 1) flammable particulate (except in the case of titanium and aluminum target materials); 2) gas velocity greater than 100 ft/s; 3) Impact point ranging from 45° to perpendicular to the path of the particle [1]; 4) flammable target material. To test assumptions about particulate flammability being necessary for particle impact ignition of less reactive target materials, such as Inconel 718, testing was performed with inert particulate. Supersonic particle impact testing was conducted with heated gas and 1500-µm sapphire particulate on various target materials: 304 stainless steel, wrought and selective laser melted Inconel 718, and Monel 400. Posttest characterization of impact craters was performed on each type of metallic target sample, including surface characterization performed by light optical microscopy and scanning electron microscopy with energy dispersive spectroscopy. Full consumption of the stainless steel and wrought Inconel 718 targets were noted to occur with sequential impacts. The results of testing will be discussed in detail, as well as recommendations for updating the understanding of the particle impact ignition mechanism.

Particle Impact↗

Real-Time Principal-Component Analysis

A recently written computer program implements dominant-element-based gradient descent and dynamic initial learning rate (DOGEDYN), which was described in Method of Real-Time Principal-Component Analysis (NPO-40034) NASA Tech Briefs, Vol. 29, No. 1 (January 2005), page 59. To recapitulate: DOGEDYN is a method of sequential principal-component analysis (PCA) suitable for such applications as data compression and extraction of features from sets of data. In DOGEDYN, input data are represented as a sequence of vectors acquired at sampling times. The learning algorithm in DOGEDYN involves sequential extraction of principal vectors by means of a gradient descent in which only the dominant element is used at each iteration. Each iteration includes updating of elements of a weight matrix by amounts proportional to a dynamic initial learning rate chosen to increase the rate of convergence by compensating for the energy lost through the previous extraction of principal components. In comparison with a prior method of gradient-descent-based sequential PCA, DOGEDYN involves less computation and offers a greater rate of learning convergence. The sequential DOGEDYN computations require less memory than would parallel computations for the same purpose. The DOGEDYN software can be executed on a personal computer.

Duong, Vu↗

Reduction of display artifacts by random sampling

The application of random-sampling techniques to remove visible artifacts (such as flicker, moire patterns, and paradoxical motion) introduced in TV-type displays by discrete sequential scanning is discussed and demonstrated. Sequential-scanning artifacts are described; the window of visibility defined in spatiotemporal frequency space by Watson and Ahumada (1982 and 1983) and Watson et al. (1983) is explained; the basic principles of random sampling are reviewed and illustrated by the case of the human retina; and it is proposed that the sampling artifacts can be replaced by random noise, which can then be shifted to frequency-space regions outside the window of visibility. Vertical sequential, single-random-sequence, and continuously renewed random-sequence plotting displays generating 128 points at update rates up to 130 Hz are applied to images of stationary and moving lines, and best results are obtained with the single random sequence for the stationary lines and with the renewed random sequence for the moving lines.

Ahumada, A. J., Jr.↗