Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “adaptive algorithm”

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 721 records · Page 40
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Alternating direction adaptive grid generation

The present investigation is concerned with the development of an alternating direction method which can adaptively resolve numerical solutions involving physical problems by moving the points of a coordinate grid. The alternating direction movement algorithm is applied to adapt a grid to surface data and weights which are given with respect to the grid itself. Attention is given to details concerning the alternating direction method, aspects of algorithmic construction, the choice of weights which controls the coordinate movement and structure, and questions regarding the applications of the alternating direction movement algorithm. On an analytical basis, the method is seen to move points in a nonsingular fashion.

Eiseman, P. R.↗
NASA NTRS1975

New method for propagating the square root covariance matrix in triangular form

A method proposed by Potter of applying the Kalman-Bucy filter to the problem of estimating the state of a dynamic system is described, in which the square root of the state error covariance matrix is used to process the observations. A new technique which propagates the covariance square root matrix in lower triangular form is given for the discrete observation case. The technique is faster than previously proposed algorithms and is well-adapted for use with the Carlson square root measurement algorithm.

Choe, C. Y.↗
NASA NTRS2010

Adaptive Fault Detection on Liquid Propulsion Systems with Virtual Sensors: Algorithms and Architectures

Prior to the launch of STS-119 NASA had completed a study of an issue in the flow control valve (FCV) in the Main Propulsion System of the Space Shuttle using an adaptive learning method known as Virtual Sensors. Virtual Sensors are a class of algorithms that estimate the value of a time series given other potentially nonlinearly correlated sensor readings. In the case presented here, the Virtual Sensors algorithm is based on an ensemble learning approach and takes sensor readings and control signals as input to estimate the pressure in a subsystem of the Main Propulsion System. Our results indicate that this method can detect faults in the FCV at the time when they occur. We use the standard deviation of the predictions of the ensemble as a measure of uncertainty in the estimate. This uncertainty estimate was crucial to understanding the nature and magnitude of transient characteristics during startup of the engine. This paper overviews the Virtual Sensors algorithm and discusses results on a comprehensive set of Shuttle missions and also discusses the architecture necessary for deploying such algorithms in a real-time, closed-loop system or a human-in-the-loop monitoring system. These results were presented at a Flight Readiness Review of the Space Shuttle in early 2009.

Matthews, Bryan L.↗
NASA NTRS2009

Algorithm for Detecting a Bright Spot in an Image

An algorithm processes the pixel intensities of a digitized image to detect and locate a circular bright spot, the approximate size of which is known in advance. The algorithm is used to find images of the Sun in cameras aboard the Mars Exploration Rovers. (The images are used in estimating orientations of the Rovers relative to the direction to the Sun.) The algorithm can also be adapted to tracking of circular shaped bright targets in other diverse applications. The first step in the algorithm is to calculate a dark-current ramp a correction necessitated by the scheme that governs the readout of pixel charges in the charge-coupled-device camera in the original Mars Exploration Rover application. In this scheme, the fraction of each frame period during which dark current is accumulated in a given pixel (and, hence, the dark-current contribution to the pixel image-intensity reading) is proportional to the pixel row number. For the purpose of the algorithm, the dark-current contribution to the intensity reading from each pixel is assumed to equal the average of intensity readings from all pixels in the same row, and the factor of proportionality is estimated on the basis of this assumption. Then the product of the row number and the factor of proportionality is subtracted from the reading from each pixel to obtain a dark-current-corrected intensity reading. The next step in the algorithm is to determine the best location, within the overall image, for a window of N N pixels (where N is an odd number) large enough to contain the bright spot of interest plus a small margin. (In the original application, the overall image contains 1,024 by 1,024 pixels, the image of the Sun is about 22 pixels in diameter, and N is chosen to be 29.)

Source record↗
NASA NTRS2009

A Local Scalable Distributed Expectation Maximization Algorithm for Large Peer-to-Peer Networks

This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining tasks in a distributed environment such as clustering, anomaly detection, target tracking to name a few. This technology is crucial for many emerging peer-to-peer applications for bioinformatics, astronomy, social networking, sensor networks and web mining. Centralizing all or some of the data for building global models is impractical in such peer-to-peer environments because of the large number of data sources, the asynchronous nature of the peer-to-peer networks, and dynamic nature of the data/network. The distributed algorithm we have developed in this paper is provably-correct i.e. it converges to the same result compared to a similar centralized algorithm and can automatically adapt to changes to the data and the network. We show that the communication overhead of the algorithm is very low due to its local nature. This monitoring algorithm is then used as a feedback loop to sample data from the network and rebuild the model when it is outdated. We present thorough experimental results to verify our theoretical claims.

Bhaduri, Kanishka↗
NASA NTRS1987

Adaptive proximate time-optimal servomechanisms - Continuous time case

A Proximate Time-Optimal Servo (PTOS) is developed, along with conditions for its stability. An algorithm is proposed for adapting the PTOS (APTOS) to improve performance in the face of uncertain plant parameters. Under ideal conditions APTOS is shown to be uniformly asymptotically stable. Simulation results demonstrate the predicted performance.

Workman, M. L.↗
NASA NTRS2007

Adaptive Deadband Synchronization for a Spacecraft Formation

A paper discusses general problems in estimation and control of the states (positions, attitudes, and velocities) of spacecraft flying in formation, then addresses the particular formation-flying-control problem of synchronization of deadbands. The paper presents a deadband synchronization algorithm for the case in which the spacecraft are equipped with pulse-width-modulated thrusters for maintaining their required states. The algorithm synchronizes thruster-firing times across all six degrees of freedom of all the spacecraft. The algorithm is scalable, inherently adapts to disturbances, and does not require knowledge of spacecraft masses and disturbance forces. In this algorithm, one degree of freedom of one spacecraft is designated the leader, and all other degrees of freedom of all spacecraft as followers. The Cassini adaptive optimum deadband drift controller is the subalgorithm for control in each degree of freedom, and the adaptation is run until each spacecraft achieves a specified drift period. The adaptation is critical because a different disturbance affects each different degree of freedom. Then the leader communicates its thruster-firing starting times to the followers. Then, for each follower, a deadband-synchronization subalgorithm determines the shift needed to synchronize its drift period with that of the leader.

Scharf, Daniel↗
DOE OSTI2023

Residual estimation for grid modification in wall-modeled large eddy simulation using unstructured high-order methods

Here, the accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive strategies can provide a robust and cost-efficient method to generate a grid with the desired accuracy. We adapt the residual estimation algorithm developed by Toosi and Larsson for Discontinuous Galerkin Spectral Elements Methods (DGSEM) to guide the grid-adaptation process. The core of the method is the computation of the estimated modeling residual using the polynomial basis functions used in DGSEM, and the averaging of the estimated residual over each element. The final method is assessed in multiple channel flow test cases and for the transonic flow over an airfoil, in both cases making use of mortar interfaces between elements with hanging nodes. The method is found to be robust and reliable, and to provide solutions on grids with significantly fewer elements at comparable accuracy compared to when using human-generated grids.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2018

Closed Loop Guidance Trade Study for Space Launch System Block-1B Vehicle

NASA is currently building the Space Launch System (SLS) Block-1 launch vehicle for the Exploration Mission 1 (EM-1) test flight. The design of the next evolution of SLS, Block-1B, is well underway. The Block-1B vehicle is more capable overall than Block-1; however, the relatively low thrust-to-weight ratio of the Exploration Upper Stage (EUS) presents a challenge to the Powered Explicit Guidance (PEG) algorithm used by Block-1. To handle the long burn durations (on the order of 1000 seconds) of EUS missions, two algorithms were examined. An alternative algorithm, OPGUID, was introduced, while modifications were made to PEG. A trade study was conducted to select the guidance algorithm for future SLS vehicles. The chosen algorithm needs to support a wide variety of mission operations: ascent burns to LEO, apogee raise burns, trans-lunar injection burns, hyperbolic Earth departure burns, and contingency disposal burns using the Reaction Control System (RCS). Additionally, the algorithm must be able to respond to a single engine failure scenario. Each algorithm was scored based on pre-selected criteria, including insertion accuracy, algorithmic complexity and robustness, extensibility for potential future missions, and flight heritage. Monte Carlo analysis was used to select the final algorithm. This paper covers the design criteria, approach, and results of this trade study, showing impacts and considerations when adapting launch vehicle guidance algorithms to a broader breadth of in-space operations.

Von der Porten, Paul↗
NASA NTRS1974

A new adaptive classifier using iterative filtering

To cope with signature variability, an algorithm has been defined which will adaptively classify remotely sensed data in the visible and near infrared band. The signal is divided into a space-dependent component and a target-dependent component. The target-dependent component is assumed fixed across the image for each target type. The space-dependent component is estimated iteratively by a weighted, least-squares algorithm. Included are the derivations of the sensor model and the two-dimensional, estimation algorithm.

Actkinson, A. L.↗
NASA NTRS1993

Structured adaptive grid generation using algebraic methods

The accuracy of the numerical algorithm depends not only on the formal order of approximation but also on the distribution of grid points in the computational domain. Grid adaptation is a procedure which allows optimal grid redistribution as the solution progresses. It offers the prospect of accurate flow field simulations without the use of an excessively timely, computationally expensive, grid. Grid adaptive schemes are divided into two basic categories: differential and algebraic. The differential method is based on a variational approach where a function which contains a measure of grid smoothness, orthogonality and volume variation is minimized by using a variational principle. This approach provided a solid mathematical basis for the adaptive method, but the Euler-Lagrange equations must be solved in addition to the original governing equations. On the other hand, the algebraic method requires much less computational effort, but the grid may not be smooth. The algebraic techniques are based on devising an algorithm where the grid movement is governed by estimates of the local error in the numerical solution. This is achieved by requiring the points in the large error regions to attract other points and points in the low error region to repel other points. The development of a fast, efficient, and robust algebraic adaptive algorithm for structured flow simulation applications is presented. This development is accomplished in a three step process. The first step is to define an adaptive weighting mesh (distribution mesh) on the basis of the equidistribution law applied to the flow field solution. The second, and probably the most crucial step, is to redistribute grid points in the computational domain according to the aforementioned weighting mesh. The third and the last step is to reevaluate the flow property by an appropriate search/interpolate scheme at the new grid locations. The adaptive weighting mesh provides the information on the desired concentration of points to the grid redistribution scheme. The evaluation of the weighting mesh is accomplished by utilizing the weight function representing the solution variation and the equidistribution law. The selection of the weight function plays a key role in grid adaptation. A new weight function utilizing a properly weighted boolean sum of various flowfield characteristics is defined. The redistribution scheme is developed utilizing Non-Uniform Rational B-Splines (NURBS) representation. The application of NURBS representation results in a well distributed smooth grid by maintaining the fidelity of the geometry associated with boundary curves. Several algebraic methods are applied to smooth and/or nearly orthogonalize the grid lines. An elliptic solver is utilized to smooth the grid lines if there are grid crossings. Various computational examples of practical interest are presented to demonstrate the success of these methods.

Yang, Jiann-Cherng↗
DOE OSTI2022

Integrating Reanalysis and Satellite Cloud Information to Estimate Surface Downward Long-Wave Radiation

The estimation of downward long-wave radiation (DLR) at the surface is very important for the understanding of the Earth’s radiative budget with implications in surface–atmosphere exchanges, climate variability, and global warming. Theoretical radiative transfer and observationally based studies identify the crucial role of clouds in modulating the temporal and spatial variability of DLR. In this study, a new machine learning algorithm that uses multivariate adaptive regression splines (MARS) and the combination of near-surface meteorological data with satellite cloud information is proposed. The new algorithm is compared with the current operational formulation used by the European Organization for the Exploitation of Meteorological Satellites (EUMETSAT) Satellite Application Facility on Land Surface Analysis (LSA-SAF). Both algorithms use near-surface temperature and dewpoint temperature along with total column water vapor from the latest European Centre for Medium-range Weather Forecasts (ECMWF) reanalysis ERA5 and satellite cloud information from the Meteosat Second Generation. The algorithms are trained and validated using both ECMWF-ERA5 and DLR acquired from 23 ground stations as part of the Baseline Surface Radiation Network (BSRN) and the Atmospheric Radiation Measurement (ARM) user facility. Results show that the MARS algorithm generally improves DLR estimation in comparison with other model estimates, particularly when trained with observations. When considering all the validation data, root mean square errors (RMSEs) of 18.76, 23.55, and 22.08 W·m –2 are obtained for MARS, operational LSA-SAF, and ERA5, respectively. The added value of using the satellite cloud information is accessed by comparing with estimates driven by ERA5 total cloud cover, showing an increase of 17% of the RMSE. The consistency of MARS estimate is also tested against an independent dataset of 52 ground stations (from FLUXNET2015), further supporting the good performance of the proposed model.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS2006

Numerical Schemes for the Hamilton-Jacobi and Level Set Equations on Triangulated Domains

Borrowing from techniques developed for conservation law equations, we have developed both monotone and higher order accurate numerical schemes which discretize the Hamilton-Jacobi and level set equations on triangulated domains. The use of unstructured meshes containing triangles (2D) and tetrahedra (3D) easily accommodates mesh adaptation to resolve disparate level set feature scales with a minimal number of solution unknowns. The minisymposium talk will discuss these algorithmic developments and present sample calculations using our adaptive triangulation algorithm applied to various moving interface problems such as etching, deposition, and curvature flow.

Barth, Timothy J.↗
NASA NTRS1987

A hierarchical structure for automatic meshing and adaptive FEM analysis

A new algorithm for generating automatically, from solid models of mechanical parts, finite element meshes that are organized as spatially addressable quaternary trees (for 2-D work) or octal trees (for 3-D work) is discussed. Because such meshes are inherently hierarchical as well as spatially addressable, they permit efficient substructuring techniques to be used for both global analysis and incremental remeshing and reanalysis. The global and incremental techniques are summarized and some results from an experimental closed loop 2-D system in which meshing, analysis, error evaluation, and remeshing and reanalysis are done automatically and adaptively are presented. The implementation of 3-D work is briefly discussed.

Kela, Ajay↗
NASA NTRS2015

Airborne Simulation of Launch Vehicle Dynamics

In this paper we present a technique for approximating the short-period dynamics of an exploration-class launch vehicle during flight test with a high-performance surrogate aircraft in relatively benign endoatmospheric flight conditions. The surrogate vehicle relies upon a nonlinear dynamic inversion scheme with proportional-integral feedback to drive a subset of the aircraft states into coincidence with the states of a time-varying reference model that simulates the unstable rigid body dynamics, servodynamics, and parasitic elastic and sloshing dynamics of the launch vehicle. The surrogate aircraft flies a constant pitch rate trajectory to approximate the boost phase gravity turn ascent, and the aircraft's closed-loop bandwidth is sufficient to simulate the launch vehicle's fundamental lateral bending and sloshing modes by exciting the rigid body dynamics of the aircraft. A novel control allocation scheme is employed to utilize the aircraft's relatively fast control effectors in inducing various failure modes for the purposes of evaluating control system performance. Sufficient dynamic similarity is achieved such that the control system under evaluation is configured for the full-scale vehicle with no changes to its parameters, and pilot-control system interaction studies can be performed to characterize the effects of guidance takeover during boost. High-fidelity simulation and flight-test results are presented that demonstrate the efficacy of the design in simulating the Space Launch System (SLS) launch vehicle dynamics using the National Aeronautics and Space Administration (NASA) Armstrong Flight Research Center Fullscale Advanced Systems Testbed (FAST), a modified F/A-18 airplane (McDonnell Douglas, now The Boeing Company, Chicago, Illinois), over a range of scenarios designed to stress the SLS's Adaptive Augmenting Control (AAC) algorithm.

airborne simulation↗
DOE OSTI2026

Control Algorithms for Dual-wavefront Sensor Single-conjugate Adaptive Optics

High-contrast imaging systems using active control with adaptive optics (AO) are often limited by non-common path (NCP) aberrations that are seen only at the final science image. AO systems employing focal-plane wavefront sensors (FP-WFSs) are able to simultaneously correct NCP aberrations and measure science images, but they typically require a second stage of control that adds system cost and complexity. We present control algorithms to augment AO systems with FP-WFSs within their existing control setup. We demonstrate inter-arm NCP aberration transfer can be mitigated through temporal filtering, present frequency- and time-domain validation of controller stability and performance, and discuss the optimality of the chosen controllers. This work will enable the development, testing, and installation of FP-WFS technologies for direct imaging of exoplanets.

79 ASTRONOMY AND ASTROPHYSICS↗