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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

Identification and dual adaptive control of a turbojet engine

The objective of this paper is to utilize the design methods of modern control theory to realize a dual-adaptive feedback control unit for a highly nonlinear single spool airbreathing turbojet engine. Using a very detailed and accurate simulation of the nonlinear engine as the data source, linear operating point models of unspecified dimension are identified. Feedback control laws are designed at each operating point for a prespecified set of sampling rates using sampled-data output regulator theory. The control system sampling rate is determined by an adaptive sampling algorithm in correspondence with turbojet engine performance. The result is a dual-adaptive control law that is functionally dependent upon the sampling rate selected and environmental operating conditions. Simulation transients demonstrate the utility of the dual-adaptive design to improve on-board computer utilization while maintaining acceptable levels of engine performance.

Merrill, W.↗
NASA NTRS1993

Six-degree-of-freedom guidance and control-entry analysis of the HL-20

The ability of the HL-20 lifting body to fly has been evaluated for an automated entry from atmospheric interface to landing. This evaluation was required to demonstrate that not only successful touchdown conditions would be possible for this low lift-to-drag-ratio vehicle, but also the vehicle would not exceed its design dynamic pressure limit of 400 psf during entry. This dynamic pressure constraint limit, coupled with limited available pitch-control authority at low supersonic speeds, restricts the available maneuvering capability for the HL-20 to acquire the runway. One result of this analysis was that this restrictive maneuvering capability does not allow the use of a model-following atmospheric entry-guidance algorithm, such as that used by the Space Shuttle, but instead requires a more adaptable guidance algorithm. Therefore, for this analysis, a predictor-corrector guidance algorithm was developed that would provide successful touchdown conditions while not violating the dynamic pressure constraint. A flight-control system was designed and incorporated, along with the predictor-corrector guidance algorithm, into a six-DOF simulation. which showed that the HL-20 remained controllable and could reach the landing site and execute a successful landing under all off-nominal conditions simulated.

Powell, Richard W.↗
NASA NTRS2005

Reconfiguration of Analog Electronics for Extreme Environments: Problem or Solution?

This paper argues in favor of adaptive reconfiguration as a technique to expand the operational envelope of analog electronics for extreme environments (EE). In addition to hardening-by-process and hardening-by-design, "hardening-by-reconfiguration", when applicable, could be used to mitigate drifts, degradation, or damage on electronic devices (chips) in EE, by using re-configurable devices and an adaptive self-reconfiguration of their circuit topology. Conventional circuit design exploits device characteristics within a certain temperature/radiation range; when that is exceeded, the circuit function degrades. On a reconfigurable device, although component parameters change in EE, as long as devices still operate, albeit degraded, a new circuit design, suitable for new parameter values, may be mapped into the reconfigurable structure to recover the initial circuit function. Partly degraded resources are still used, while completely damaged resources are bypassed. Designs suitable for various environmental conditions can be determined prior to operation or can be determined in-situ, by adaptive reconfiguration algorithms running on built-in digital controllers. Laboratory demonstrations of this technique were performed by JPL in several independent experiments in which bulk CMOS reconfigurable devices were exposed to, and degraded by, low temperatures (approx. 196 C), high temperatures (approx.300 C) or radiation (300kRad TID), and then recovered by adaptive reconfiguration using evolutionary search algorithms. Taking this technology from Technology Readiness Level (TRL) 3 to TRL 5 is the target of a current NASA project.

Field Programmable Transistor Array (FPTA)↗
NASA NTRS2005

Implementation of Real-Time Feedback Flow Control Algorithms on a Canonical Testbed

This report summarizes the activities on "Implementation of Real-Time Feedback Flow Control Algorithms on a Canonical Testbed." The work summarized consists primarily of two parts. The first part summarizes our previous work and the extensions to adaptive ID and control algorithms. The second part concentrates on the validation of adaptive algorithms by applying them to a vibration beam test bed. Extensions to flow control problems are discussed.

Tian, Ye↗
NASA NTRS1980

Some queuing network models of computer systems

Queuing network models of a computer system operating with a single workload type are presented. Program algorithms are adapted for use on the Texas Instruments SR-52 programmable calculator. By slightly altering the algorithm to process the G and H matrices row by row instead of column by column, six devices and an unlimited job/terminal population could be handled on the SR-52. Techniques are also introduced for handling a simple load dependent server and for studying interactive systems with fixed multiprogramming limits.

Herndon, E. S.↗
NASA NTRSDate not supplied

Cooperative Clustering Techniques For Space Network Scalability

Routing in the space internet must face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this paper we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. We propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol (DTCP). In addition, we explore the underlying networking mechanisms such as multicast, neighbor discovery, and software defined networking that may be used to enable DTCP.

Delay Tolerant Networking↗
NASA NTRSDate not supplied

Cooperative Clustering Techniques Applied to Contact Graph Routing

Routing in the space internet has to face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this presentation we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. Finally, we propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol.

Yael Kirkpatrick↗
NASA NTRS2004

Planetary Transmission Diagnostics

This report presents a methodology for detecting and diagnosing gear faults in the planetary stage of a helicopter transmission. This diagnostic technique is based on the constrained adaptive lifting algorithm. The lifting scheme, developed by Wim Sweldens of Bell Labs, is a time domain, prediction-error realization of the wavelet transform that allows for greater flexibility in the construction of wavelet bases. Classic lifting analyzes a given signal using wavelets derived from a single fundamental basis function. A number of researchers have proposed techniques for adding adaptivity to the lifting scheme, allowing the transform to choose from a set of fundamental bases the basis that best fits the signal. This characteristic is desirable for gear diagnostics as it allows the technique to tailor itself to a specific transmission by selecting a set of wavelets that best represent vibration signals obtained while the gearbox is operating under healthy-state conditions. However, constraints on certain basis characteristics are necessary to enhance the detection of local wave-form changes caused by certain types of gear damage. The proposed methodology analyzes individual tooth-mesh waveforms from a healthy-state gearbox vibration signal that was generated using the vibration separation (synchronous signal-averaging) algorithm. Each waveform is separated into analysis domains using zeros of its slope and curvature. The bases selected in each analysis domain are chosen to minimize the prediction error, and constrained to have the same-sign local slope and curvature as the original signal. The resulting set of bases is used to analyze future-state vibration signals and the lifting prediction error is inspected. The constraints allow the transform to effectively adapt to global amplitude changes, yielding small prediction errors. However, local wave-form changes associated with certain types of gear damage are poorly adapted, causing a significant change in the prediction error. The constrained adaptive lifting diagnostic algorithm is validated using data collected from the University of Maryland Transmission Test Rig and the results are discussed.

Lewicki, David G.↗
NASA NTRS1981

Transonic airfoil calculations using solution-adaptive grids

A new algorithm for generating solution-adaptive grids (SAG) about airfoil configurations embedded in transonic flow is presented. The present SAG approach uses only the airfoil surface solution to recluster grid points on the airfoil surface, i.e., the reclustering problem is one dimension smaller than the flow-field calculation problem. Special controls automatically built into the elliptic grid generation procedure are then used to obtain grids with suitable interior behavior. This concept of redistributing grid points greatly simplifies the idea of solution-adaptive grids. Numerical results indicate significant improvements in accuracy for SAG grids relative to standard grids using the same number of points.

Holst, T. L.↗
NASA NTRS1992

A proposed study of multiple scattering through clouds up to 1 THz

A rigorous computation of the electromagnetic field scattered from an atmospheric liquid water cloud is proposed. The recent development of a fast recursive algorithm (Chew algorithm) for computing the fields scattered from numerous scatterers now makes a rigorous computation feasible. A method is presented for adapting this algorithm to a general case where there are an extremely large number of scatterers. It is also proposed to extend a new binary PAM channel coding technique (El-Khamy coding) to multiple levels with non-square pulse shapes. The Chew algorithm can be used to compute the transfer function of a cloud channel. Then the transfer function can be used to design an optimum El-Khamy code. In principle, these concepts can be applied directly to the realistic case of a time-varying cloud (adaptive channel coding and adaptive equalization). A brief review is included of some preliminary work on cloud dispersive effects on digital communication signals and on cloud liquid water spectra and correlations.

Gerace, G. C.↗
NASA NTRS2021

Multi-Pass Sequential Mini-Batch Stochastic Gradient Descent Algorithms for Noise Covariance Estimation in Adaptive Kalman Filtering

Estimation of unknown noise covariances in a Kalman filter is a problem of significant practical interest in a wide array of applications. Although this problem has a long history, reliable algorithms for their estimation were scant, and necessary and sufficient conditions for identifiability of the covariances were in dispute until recently. Necessary and sufficient conditions for covariance estimation and a batch estimation algorithm were presented in our previous study. This paper presents stochastic gradient descent algorithms for noise covariance estimation in adaptive Kalman filters that are an order of magnitude faster than the batch method for similar or better root mean square error. More significantly, these algorithms are applicable to non-stationary systems where the noise covariances can occasionally jump up or down by an unknown magnitude. The computational efficiency of the new algorithms stems from adaptive thresholds for convergence, recursive fading memory estimation of the sample cross-correlations of the innovations, and accelerated stochastic gradient descent algorithms. The comparative evaluation of the proposed methods on a number of test cases demonstrates their computational efficiency and accuracy.

Adaptive Kalman filtering↗
NASA NTRS2000

Adaptive Interplanetary Navigation Using Genetic Algorithms

The problem of tuning trajectory determination models for interplanetary navigation is a complex task requiring an intensive search of multiple dynamical and nondynamical models that yield trajectory solutions with minimal errors.

adaptive↗
NASA NTRS2006

Fast Lossless Compression of Multispectral-Image Data

An algorithm that effects fast lossless compression of multispectral-image data is based on low-complexity, proven adaptive-filtering algorithms. This algorithm is intended for use in compressing multispectral-image data aboard spacecraft for transmission to Earth stations. Variants of this algorithm could be useful for lossless compression of three-dimensional medical imagery and, perhaps, for compressing image data in general.

Klimesh, Matthew↗
NASA NTRSDate not supplied

Incorporating ADAPT-VQE with a Sparse Wavefunction Circuit Simulator to Find Compact Quantum Circuits for Chemical Applications

We implemented the ADAPT-VQE algorithm into our recent classical sparse wavefunction circuit simulator to demonstrate that classical resources can (1) efficiently find a physically motivated compact wavefunction ansatz for further refinement on near-term quantum hardware and (2) benchmark expected results of VQE-based algorithms once the quantum hardware is available to study large-scale applications. In particular, we study the role of the ADAPT-VQE operator pool, molecular basis set selection, and variations such as TETRIS-ADAPT-VQE on the performance of our classical circuit simulator. This work demonstrates the promise of using classical resources to generate highly accurate wavefunctions that can be prepared on quantum hardware to initiate other quantum algorithms such as phase estimation. Our approach harnesses the power of high-performance computing resources with the more limited available quantum computers to map a path toward quantum advantage for electronic structure calculations in chemistry and materials science.

Quantum Computing↗
NASA NTRS1985

New Directions in Asymptotically Stable Finite-dimensional Adaptive Control of Linear Distributed Parameter Systems

Distributed Parameter Systems (DPS), such as systems described by partial differential equations, require infinite-dimensional state space descriptions to correctly model their dynamical behavior. However, any adaptive control algorithm must be finite-dimensional in order to be implemented via on-line digital computers. Finite-dimensional adaptive control of linear DPS requires stability analysis of nonlinear, time-varying, infinite-dimensional systems. The structure of nonadaptive finite-dimensional control of linear DPS is summarized as it relates to the existence of limiting systems for adaptive control. Two candidate schemes for finite-dimensional adaptive control of DPS are described and critical issues in infinite-dimensional stability analysis are discussed, in particular, the invariance principle, center manifold theory, and relationships between input-output and internal stability.

Balas, M. J.↗
NASA NTRS2024

A Multi‐Probe Automated Classification of Ice Crystal Habits During the IMPACTS Campaign

Although all ice crystals are unique, many can be grouped together by shape or habit, with members of a habit class sharing similar representations of properties such as fall velocity and growth rate. A decision tree algorithm designed to be adaptable to any particle imaging probe, thus enabling the creation of habit size distributions over a size range larger than that of any probe on its own, is used to classify ice crystals imaged by three airborne cloud probes in mid-latitude winter cyclones during the Investigation of Microphysics and Precipitation for Atlantic Coast-Threatening Snowstorms (IMPACTS) field campaign. Crystals are sorted into seven habit classes based on their morphological properties: sphere, column/needle, plate, graupel, dendrite, aggregate, and irregular. Although adaptability was its primary goal, the algorithm was found to be moderately skillful for identifying idealized habit images. Quantitative tests of the algorithm’s adaptability displayed mixed results, as Two-Dimensional Stereo Probe (2DS) classifications showed moderate correlation with Particle Habit Imaging and Polar Scattering Probe (PHIPS) classifications, but only weak correlation with High Volume Precipitation Spectrometer (HVPS) classifications. The algorithm was applied to random sets of images from each probe in a case study of a mesoscale snow band sampled on 7 February 2020. In the case study, qualitative analysis of particle images revealed general agreement on classifications among the probes, supporting the algorithm’s applicability to multiple cloud probes. Most classifications appeared correct upon manual inspection, suggesting that in practical use, the algorithm is reasonably able to classify non-idealized images.

Julian Schima↗
NASA NTRS1992

Unstructured mesh algorithms for aerodynamic calculations

The use of unstructured mesh techniques for solving complex aerodynamic flows is discussed. The principle advantages of unstructured mesh strategies, as they relate to complex geometries, adaptive meshing capabilities, and parallel processing are emphasized. The various aspects required for the efficient and accurate solution of aerodynamic flows are addressed. These include mesh generation, mesh adaptivity, solution algorithms, convergence acceleration, and turbulence modeling. Computations of viscous turbulent two-dimensional flows and inviscid three-dimensional flows about complex configurations are demonstrated. Remaining obstacles and directions for future research are also outlined.

Mavriplis, D. J.↗