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 1,153 records · Page 64

North American Fuzzy Logic Processing Society (NAFIPS 1992), volume 2

This document contains papers presented at the NAFIPS '92 North American Fuzzy Information Processing Society Conference. More than 75 papers were presented at this Conference, which was sponsored by NAFIPS in cooperation with NASA, the Instituto Tecnologico de Morelia, the Indian Society for Fuzzy Mathematics and Information Processing (ISFUMIP), the Instituto Tecnologico de Estudios Superiores de Monterrey (ITESM), the International Fuzzy Systems Association (IFSA), the Japan Society for Fuzzy Theory and Systems, and the Microelectronics and Computer Technology Corporation (MCC). The fuzzy set theory has led to a large number of diverse applications. Recently, interesting applications have been developed which involve the integration of fuzzy systems with adaptive processes such a neural networks and genetic algorithms. NAFIPS '92 was directed toward the advancement, commercialization, and engineering development of these technologies.

Villarreal, James A.↗

Model based matching using simulated annealing and a minimum representation size criterion

We define the model based matching problem in terms of the correspondence and transformation that relate the model and scene, and the search and evaluation measures needed to find the best correspondence and transformation. Simulated annealing is proposed as a method for search and optimization, and the minimum representation size criterion is used as the evaluation measure in an algorithm that finds the best correspondence. An algorithm based on simulated annealing is presented and evaluated. This algorithm is viewed as a part of an adaptive, hierarchical approach which provides robust results for a variety of model based matching problems.

Ravichandran, B.↗

Structures cluster

The objective of this program is to develop technology needed for structural evaluation of alternative space construction concepts. Those concepts are as follows: interactive effects on dynamic performance of various environment and self-generated disturbance; new materials concepts, failure mechanisms, and non-destructive evaluation/failure detection; develop stable control algorithms and design effective combination of hierarchical and adaptive controls; and assess control-structure integrated performance and stability.

Datta, Subhendu K.↗

Direct model reference adaptive control of robotic arms

The results of controlling A PUMA 560 Robotic Manipulator and the NASA shuttle Remote Manipulator System (RMS) using a Command Generator Tracker (CGT) based Model Reference Adaptive Controller (DMRAC) are presented. Initially, the DMRAC algorithm was run in simulation using a detailed dynamic model of the PUMA 560. The algorithm was tuned on the simulation and then used to control the manipulator using minimum jerk trajectories as the desired reference inputs. The ability to track a trajectory in the presence of load changes was also investigated in the simulation. Satisfactory performance was achieved in both simulation and on the actual robot. The obtained responses showed that the algorithm was robust in the presence of sudden load changes. Because these results indicate that the DMRAC algorithm can indeed be successfully applied to the control of robotic manipulators, additional testing was performed to validate the applicability of DMRAC to simulated dynamics of the shuttle RMS.

Kaufman, Howard↗

The nonlinear Galerkin method: A multi-scale method applied to the simulation of homogeneous turbulent flows

Using results of Direct Numerical Simulation (DNS) in the case of two-dimensional homogeneous isotropic flows, the behavior of the small and large scales of Kolmogorov like flows at moderate Reynolds numbers are first analyzed in detail. Several estimates on the time variations of the small eddies and the nonlinear interaction terms were derived; those terms play the role of the Reynolds stress tensor in the case of LES. Since the time step of a numerical scheme is determined as a function of the energy-containing eddies of the flow, the variations of the small scales and of the nonlinear interaction terms over one iteration can become negligible by comparison with the accuracy of the computation. Based on this remark, a multilevel scheme which treats differently the small and the large eddies was proposed. Using mathematical developments, estimates of all the parameters involved in the algorithm, which then becomes a completely self-adaptive procedure were derived. Finally, realistic simulations of (Kolmorov like) flows over several eddy-turnover times were performed. The results are analyzed in detail and a parametric study of the nonlinear Galerkin method is performed.

Debussche, A.↗

Noise and drift analysis of non-equally spaced timing data

Generally, it is possible to obtain equally spaced timing data from oscillators. The measurement of the drifts and noises affecting oscillators is then performed by using a variance (Allan variance, modified Allan variance, or time variance) or a system of several variances (multivariance method). However, in some cases, several samples, or even several sets of samples, are missing. In the case of millisecond pulsar timing data, for instance, observations are quite irregularly spaced in time. Nevertheless, since some observations are very close together (one minute) and since the timing data sequence is very long (more than ten years), information on both short-term and long-term stability is available. Unfortunately, a direct variance analysis is not possible without interpolating missing data. Different interpolation algorithms (linear interpolation, cubic spline) are used to calculate variances in order to verify that they neither lose information nor add erroneous information. A comparison of the results of the different algorithms is given. Finally, the multivariance method was adapted to the measurement sequence of the millisecond pulsar timing data: the responses of each variance of the system are calculated for each type of noise and drift, with the same missing samples as in the pulsar timing sequence. An estimation of precision, dynamics, and separability of this method is given.

Vernotte, F.↗

Real-Time Compression Of Digital Video

Enhanced DPCM video compression algorithm utilizes non-uniform quantizer, non-adaptive predictor, and multi-level Huffman coder to substantially reduce data rate below that achievable with conventional DPCM. Images reconstructed without noticeable degradation.

Bizon, Thomas P.↗

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

Biswas, Rupak↗

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗

Performance Analysis and Portability of the PLUM Load Balancing System

The ability to dynamically adapt an unstructured mesh is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is rather difficult. To address this problem, we have developed PLUM, an automatic portable framework for performing adaptive numerical computations in a message-passing environment. PLUM requires that all data be globally redistributed after each mesh adaption to achieve load balance. We present an algorithm for minimizing this remapping overhead by guaranteeing an optimal processor reassignment. We also show that the data redistribution cost can be significantly reduced by applying our heuristic processor reassignment algorithm to the default mapping of the parallel partitioner. Portability is examined by comparing performance on a SP2, an Origin2000, and a T3E. Results show that PLUM can be successfully ported to different platforms without any code modifications.

Oliker, Leonid↗

Unic Unstructured CFD Methodology Development

Base heating characteristics is crucial to the success and the overall performance of the X-33 engine. Base heating is important throughout the entire flight trajectory due to the aerospike engine design of X-33. The base region is surrounded by the hot-gas plume, which expands, circulates and impinges on the base. An advanced computation fluid dynamics method is employed in an effort to develop a robust, accurate and efficient tool for the X-33 base heating performance predictions. This computational tool is developed based on a Navier-Stokes flow solver, which is suitable for general complex geometry and includes turbulence, finite-rate chemistry, and radiation models. To fulfill the fast turnaround requirement as a design analysis tool, adaptive mesh refinement method and parallel-computing algorithm are also incorporated in the present model. Case study for the X-33 base-region fluid dynamics and heat transfer characteristics are presented.

Chen, Y. S.↗

Center for Space Telemetering and Telecommunications Systems, New Mexico State University

This viewgraph presentation gives an overview of the Center for Space Telemetering and Telecommunications Systems activities at New Mexico State University. Presentations cover the following topics: (1) small satellite communications, including nanosatellite radio and virtual satellite development; (2) modulation and detection studies, including details on smooth phase interpolated keying (SPIK) spectra and highlights of an adaptive turbo multiuser detector; (3) decoupled approaches to nonlinear ISI compensation; (4) space internet testing; (4) optical communication; (5) Linux-based receiver for lightweight optical communications without a laser in space, including software design, performance analysis, and the receiver algorithm; (6) carrier tracking hardware; and (7) subband transforms for adaptive direct sequence spread spectrum receivers.

Horan, Stephen↗

Wing Flutter Control

Through Small Business Innovation Research (SBIR) contracts from Langley Research Center, Orbital Research Inc. developed the Orbital Research Intelligent Control Algorithm (ORICA), the first practical hardware-independent adaptive predictive control structure, specifically suited for optimal control of complex, time-varying systems. ORICA technology has been applied to the problem of controlling aircraft wing flutter. Coupled with NASA expertise, the technology has the possibility of making jet travel safer, more cost effective by extending distance range, and lowering overall aircraft operating costs. Future application areas for ORICA include control of robots, power trains, systems with arrays of sensors, or regulating chemical plants or electrical power plant control.

Source record↗

Validation of an Impedance Education Method in Flow

This paper reports results of a research effort to validate a method for educing the normal incidence impedance of a locally reacting liner, located in a grazing incidence, nonprogressive acoustic wave environment with flow. The results presented in this paper test the ability of the method to reproduce the measured normal incidence impedance of a solid steel plate and two soft test liners in a uniform flow. The test liners are known to be locally react- ing and exhibit no measurable amplitude-dependent impedance nonlinearities or flow effects. Baseline impedance spectra for these liners were therefore established from measurements in a conventional normal incidence impedance tube. A key feature of the method is the expansion of the unknown impedance function as a piecewise continuous polynomial with undetermined coefficients. Stewart's adaptation of the Davidon-Fletcher-Powell optimization algorithm is used to educe the normal incidence impedance at each Mach number by optimizing an objective function. The method is shown to reproduce the measured normal incidence impedance spectrum for each of the test liners, thus validating its usefulness for determining the normal incidence impedance of test liners for a broad range of source frequencies and flow Mach numbers. Nomenclature

Watson, Willie R.↗

A Simple Physical Optics Algorithm Perfect for Parallel Computing

One of the simplest reflector antenna computer programs is based upon a discrete approximation of the radiation integral. This calculation replaces the actual reflector surface with a triangular facet representation so that the reflector resembles a geodesic dome. The Physical Optics (PO) current is assumed to be constant in magnitude and phase over each facet so the radiation integral is reduced to a simple summation. This program has proven to be surprisingly robust and useful for the analysis of arbitrary reflectors, particularly when the near-field is desired and surface derivatives are not known. Because of its simplicity, the algorithm has proven to be extremely easy to adapt to the parallel computing architecture of a modest number of large-grain computing elements such as are used in the Intel iPSC and Touchstone Delta parallel machines.

Imbriale, W. A.↗

An Active Damping at Blade Resonances Using Piezoelectric Transducers

The NASA Glenn Research Center (GRC) is developing an active damping at blade resonances using piezoelectric structure to reduce excessive vibratory stresses that lead to high cycle fatigue (HCF) failures in aircraft engine turbomachinery. Conventional passive damping work was shown first on a nonrotating beam made by Ti-6A1-4V with a pair of identical piezoelectric patches, and then active feedback control law was derived in terms of inductor, resister, and capacitor to control resonant frequency only. Passive electronic circuit components and adaptive feature could be easily programmable into control algorithm. Experimental active damping was demonstrated on two test specimens achieving significant damping on tip displacement and patch location. Also a multimode control technique was shown to control several modes.

Choi, Benjamin↗

The InSAR Scientific Computing Environment

We have developed a flexible and extensible Interferometric SAR (InSAR) Scientific Computing Environment (ISCE) for geodetic image processing. ISCE was designed from the ground up as a geophysics community tool for generating stacks of interferograms that lend themselves to various forms of time-series analysis, with attention paid to accuracy, extensibility, and modularity. The framework is python-based, with code elements rigorously componentized by separating input/output operations from the processing engines. This allows greater flexibility and extensibility in the data models, and creates algorithmic code that is less susceptible to unnecessary modification when new data types and sensors are available. In addition, the components support provenance and checkpointing to facilitate reprocessing and algorithm exploration. The algorithms, based on legacy processing codes, have been adapted to assume a common reference track approach for all images acquired from nearby orbits, simplifying and systematizing the geometry for time-series analysis. The framework is designed to easily allow user contributions, and is distributed for free use by researchers. ISCE can process data from the ALOS, ERS, EnviSAT, Cosmo-SkyMed, RadarSAT-1, RadarSAT-2, and TerraSAR-X platforms, starting from Level-0 or Level 1 as provided from the data source, and going as far as Level 3 geocoded deformation products. With its flexible design, it can be extended with raw/meta data parsers to enable it to work with radar data from other platforms

geodetic imaging↗

The Hitchhiker's Guide to the Outer Solar System

We propose a novel deep space propulsion method called the Comet Hitchhiker. The concept is to perform momentum exchange with small bodies (i.e., asteroid and comet) using an extendable/retrievable tether and a harpoon. Unlike previously proposed tethered fly-by, the use of extendable tether enables to change the relative speed with a target. Hence Hitchhiker would be a prospective means of providing orbit insertion deltaV, particularly for rendezvous missions to small bodies in the outer Solar System such as Kuiper belt objects and Centaurs, which are not easily manageable with chemical propulsion or solar electric propulsion. Furthermore, by applying regenerative brake during a hitchhike maneuver, a Hitchhiker can harvest energy. The stored energy can be used to make a departure from the target by quickly retrieving the tether, which we call a inverse hitchhike maneuver. By repeating hitchhike and inverse Hitchhike maneuvers, a Hitchhiker could perform a mission to rendezvous with multiple targets efficiently, which we call a multi-hitchhike mission. We derive the basic equation of Hitchhiker, namely the Space Hitchhike Equation, which relates the specific strength and mass fraction of tether to achievable ∆V. We then perform detailed feasibility analysis through finite element simulations of tether as well as hypervelocity impact simulations of the harpoon using the Adaptive Mesh Refinement Objected-oriented C++ (AMROC) algorithm. The analysis results suggest that a hitchhike maneuver with deltaV = approximately 1.5km/s is feasible with flight proven materials such as Kevlar/Zylon tether and tungsten harpoon. A carbon nanotube tether, combined with diamond harpoon, would enable approximately 10 km/s hitchhike maneuver. Finally, we present two particular mission scenarios for Hitchhiker: Pluto rendezvous and a multi-hitchhike mission to the Themis family asteroids in the main belt.

Ono, Masahiro↗