Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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,297 records · Page 72
All sourcesNASA NTRSDOE OSTI
NASA NTRS2004

Error and Symmetry Analysis of Misner's Algorithm for Spherical Harmonic Decomposition on a Cubic Grid

In an earlier paper, Misner (2004, Class. Quant. Grav., 21, S243) presented a novel algorithm for computing the spherical harmonic components of data represented on a cubic grid. I extend Misner s original analysis by making detailed error estimates of the numerical errors accrued by the algorithm, by using symmetry arguments to suggest a more efficient implementation scheme, and by explaining how the algorithm can be applied efficiently on data with explicit reflection symmetries.

Fiske, David R.↗
NASA NTRS2005

Retrieval of Dry Snow Parameters from Radiometric Data Using a Dense Medium Model and Genetic Algorithms

In this paper, GA-based techniques are used to invert the equations of an electromagnetic model based on Dense Medium Radiative Transfer Theory (DMRT) under the Quasi Crystalline Approximation with Coherent Potential to retrieve snow depth, mean grain size and fractional volume from microwave brightness temperatures. The technique is initially tested on both noisy and not-noisy simulated data. During this phase, different configurations of genetic algorithm parameters are considered to quantify how their change can affect the algorithm performance. A configuration of GA parameters is then selected and the algorithm is applied to experimental data acquired during the NASA Cold Land Process Experiment. Snow parameters retrieved with the GA-DMRT technique are then compared with snow parameters measured on field.

Tedesco, Marco↗
NASA NTRS2002

Turbopump Performance Improved by Evolutionary Algorithms

The development of design optimization technology for turbomachinery has been initiated using the multiobjective evolutionary algorithm under NASA's Intelligent Synthesis Environment and Revolutionary Aeropropulsion Concepts programs. As an alternative to the traditional gradient-based methods, evolutionary algorithms (EA's) are emergent design-optimization algorithms modeled after the mechanisms found in natural evolution. EA's search from multiple points, instead of moving from a single point. In addition, they require no derivatives or gradients of the objective function, leading to robustness and simplicity in coupling any evaluation codes. Parallel efficiency also becomes very high by using a simple master-slave concept for function evaluations, since such evaluations often consume the most CPU time, such as computational fluid dynamics. Application of EA's to multiobjective design problems is also straightforward because EA's maintain a population of design candidates in parallel. Because of these advantages, EA's are a unique and attractive approach to real-world design optimization problems.

Oyama, Akira↗
NASA NTRS2005

Aeroelastic Flight Data Analysis with the Hilbert-Huang Algorithm

This paper investigates the utility of the Hilbert-Huang transform for the analysis of aeroelastic flight data. It is well known that the classical Hilbert transform can be used for time-frequency analysis of functions or signals. Unfortunately, the Hilbert transform can only be effectively applied to an extremely small class of signals, namely those that are characterized by a single frequency component at any instant in time. The recently-developed Hilbert-Huang algorithm addresses the limitations of the classical Hilbert transform through a process known as empirical mode decomposition. Using this approach, the data is filtered into a series of intrinsic mode functions, each of which admits a well-behaved Hilbert transform. In this manner, the Hilbert-Huang algorithm affords time-frequency analysis of a large class of signals. This powerful tool has been applied in the analysis of scientific data, structural system identification, mechanical system fault detection, and even image processing. The purpose of this paper is to demonstrate the potential applications of the Hilbert-Huang algorithm for the analysis of aeroelastic systems, with improvements such as localized/online processing. Applications for correlations between system input and output, and amongst output sensors, are discussed to characterize the time-varying amplitude and frequency correlations present in the various components of multiple data channels. Online stability analyses and modal identification are also presented. Examples are given using aeroelastic test data from the F/A-18 Active Aeroelastic Wing aircraft, an Aerostructures Test Wing, and pitch-plunge simulation.

Brenner, Marty↗
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 NTRS2006

Aeroelastic Flight Data Analysis with the Hilbert-Huang Algorithm

This report investigates the utility of the Hilbert Huang transform for the analysis of aeroelastic flight data. It is well known that the classical Hilbert transform can be used for time-frequency analysis of functions or signals. Unfortunately, the Hilbert transform can only be effectively applied to an extremely small class of signals, namely those that are characterized by a single frequency component at any instant in time. The recently-developed Hilbert Huang algorithm addresses the limitations of the classical Hilbert transform through a process known as empirical mode decomposition. Using this approach, the data is filtered into a series of intrinsic mode functions, each of which admits a well-behaved Hilbert transform. In this manner, the Hilbert Huang algorithm affords time-frequency analysis of a large class of signals. This powerful tool has been applied in the analysis of scientific data, structural system identification, mechanical system fault detection, and even image processing. The purpose of this report is to demonstrate the potential applications of the Hilbert Huang algorithm for the analysis of aeroelastic systems, with improvements such as localized online processing. Applications for correlations between system input and output, and amongst output sensors, are discussed to characterize the time-varying amplitude and frequency correlations present in the various components of multiple data channels. Online stability analyses and modal identification are also presented. Examples are given using aeroelastic test data from the F-18 Active Aeroelastic Wing airplane, an Aerostructures Test Wing, and pitch plunge simulation.

Brenner, Martin J.↗
NASA NTRS2003

A Graph Based Backtracking Algorithm for Solving General CSPs

Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complete task in general, tractable classes of CSPs have been identified based on the structure of the underlying constraint graphs. Much effort has been spent on exploiting structural properties of the constraint graph to improve the efficiency of finding a solution. These efforts contributed to development of a class of CSP solving algorithms called decomposition algorithms. The strength of CSP decomposition is that its worst-case complexity depends on the structural properties of the constraint graph and is usually better than the worst-case complexity of search methods. Its practical application is limited, however, since it cannot be applied if the CSP is not decomposable. In this paper, we propose a graph based backtracking algorithm called omega-CDBT, which shares merits and overcomes the weaknesses of both decomposition and search approaches.

Pang, Wanlin↗
NASA NTRS2006

UWB Tracking Algorithms: AOA and TDOA

Ultra-Wideband (UWB) tracking prototype systems are currently under development at NASA Johnson Space Center for various applications on space exploration. For long range applications, a two-cluster Angle of Arrival (AOA) tracking method is employed for implementation of the tracking system; for close-in applications, a Time Difference of Arrival (TDOA) positioning methodology is exploited. Both AOA and TDOA are chosen to utilize the achievable fine time resolution of UWB signals. This talk presents a brief introduction to AOA and TDOA methodologies. The theoretical analysis of these two algorithms reveal the affecting parameters impact on the tracking resolution. For the AOA algorithm, simulations show that a tracking resolution less than 0.5% of the range can be achieved with the current achievable time resolution of UWB signals. For the TDOA algorithm used in close-in applications, simulations show that the (sub-inch) high tracking resolution is achieved with a chosen tracking baseline configuration. The analytical and simulated results provide insightful guidance for the UWB tracking system design.

Ni, Jianjun David↗
NASA NTRS2004

Modified polar format algorithm for processing spaceborne SAR data

This paper describes a modified polar format algorithm for SAR image-formation processing. the algorithm focuses raw data assuming a spherical reference surface (ground surface), and, unlike standard polar format algorithms, it assumes spherical rather than planar signal wavefronts.

polar format processing↗
NASA NTRS2006

Measuring Constraint-Set Utility for Partitional Clustering Algorithms

Clustering with constraints is an active area of machine learning and data mining research. Previous empirical work has convincingly shown that adding constraints to clustering improves the performance of a variety of algorithms. However, in most of these experiments, results are averaged over different randomly chosen constraint sets from a given set of labels, thereby masking interesting properties of individual sets. We demonstrate that constraint sets vary significantly in how useful they are for constrained clustering; some constraint sets can actually decrease algorithm performance. We create two quantitative measures, informativeness and coherence, that can be used to identify useful constraint sets. We show that these measures can also help explain differences in performance for four particular constrained clustering algorithms.

constraints↗
NASA NTRS2005

Combined Radar and Radiometer Analysis of Precipitation Profiles for a Parametric Retrieval Algorithm

A methodology to analyze precipitation profiles using the Tropical Rainfall Measuring Mission (TRMM) Microwave Imager (TMI) and precipitation radar (PR) is proposed. Rainfall profiles are retrieved from PR measurements, defined as the best-fit solution selected from precalculated profiles by cloud-resolving models (CRMs), under explicitly defined assumptions of drop size distribution (DSD) and ice hydrometeor models. The PR path-integrated attenuation (PIA), where available, is further used to adjust DSD in a manner that is similar to the PR operational algorithm. Combined with the TMI-retrieved nonraining geophysical parameters, the three-dimensional structure of the geophysical parameters is obtained across the satellite-observed domains. Microwave brightness temperatures are then computed for a comparison with TMI observations to examine if the radar-retrieved rainfall is consistent in the radiometric measurement space. The inconsistency in microwave brightness temperatures is reduced by iterating the retrieval procedure with updated assumptions of the DSD and ice-density models. The proposed methodology is expected to refine the a priori rain profile database and error models for use by parametric passive microwave algorithms, aimed at the Global Precipitation Measurement (GPM) mission, as well as a future TRMM algorithms.

Masunaga, Hirohiko↗
NASA NTRS2007

Evaluating ACLS Algorithms for the International Space Station (ISS) - A Paradigm Revisited

The ISS may have communication gaps of up to 45 minutes during each orbit and therefore it is imperative to have medical protocols, including an effective ACLS algorithm, that can be reliably autonomously executed during flight. The aim of this project was to compare the effectiveness of the current ACLS algorithm with an improved algorithm having a new navigation format.

Alexander, Dave↗
NASA NTRS2006

A Convex Guidance Algorithm for Formation Reconfiguration

In this paper, a reconfiguration guidance algorithm for formation flying spacecraft is presented. The formation reconfiguration guidance problem is first formulated as a continuous-time minimum-fuel or minimum-energy optimal control problem with collision avoidance and control constraints. The optimal control problem is then discretized to obtain a finite dimensional parameter optimization problem. In this formulation, the collision avoidance constraints are imposed via separating planes between each pair of spacecraft. A heuristic is introduced to choose these separating planes that leads to the convexification of the collision avoidance constraints. Additionally, convex constraints are imposed to guarantee that no collisions occur between discrete time samples. The resulting finite dimensional optimization problem is a second order cone program, for which standard algorithms can compute the global optimum with deterministic convergence and a prescribed level of accuracy. Consequently, the formation reconfiguration algorithm can be implemented onboard a spacecraft for real-time operations.

formation reconfiguration↗
NASA NTRS2007

In-Trail Procedure (ITP) Algorithm Design

The primary objective of this document is to provide a detailed description of the In-Trail Procedure (ITP) algorithm, which is part of the Airborne Traffic Situational Awareness In-Trail Procedure (ATSA-ITP) application. To this end, the document presents a high level description of the ITP Algorithm and a prototype implementation of this algorithm in the programming language C.

Munoz, Cesar A.↗
NASA NTRS2007

GIFTS SM EDU Data Processing and Algorithms

The Geosynchronous Imaging Fourier Transform Spectrometer (GIFTS) Sensor Module (SM) Engineering Demonstration Unit (EDU) is a high resolution spectral imager designed to measure infrared (IR) radiances using a Fourier transform spectrometer (FTS). The GIFTS instrument employs three Focal Plane Arrays (FPAs), which gather measurements across the long-wave IR (LWIR), short/mid-wave IR (SMWIR), and visible spectral bands. The raw interferogram measurements are radiometrically and spectrally calibrated to produce radiance spectra, which are further processed to obtain atmospheric profiles via retrieval algorithms. This paper describes the processing algorithms involved in the calibration stage. The calibration procedures can be subdivided into three stages. In the pre-calibration stage, a phase correction algorithm is applied to the decimated and filtered complex interferogram. The resulting imaginary part of the spectrum contains only the noise component of the uncorrected spectrum. Additional random noise reduction can be accomplished by applying a spectral smoothing routine to the phase-corrected blackbody reference spectra. In the radiometric calibration stage, we first compute the spectral responsivity based on the previous results, from which, the calibrated ambient blackbody (ABB), hot blackbody (HBB), and scene spectra can be obtained. During the post-processing stage, we estimate the noise equivalent spectral radiance (NESR) from the calibrated ABB and HBB spectra. We then implement a correction scheme that compensates for the effect of fore-optics offsets. Finally, for off-axis pixels, the FPA off-axis effects correction is performed. To estimate the performance of the entire FPA, we developed an efficient method of generating pixel performance assessments. In addition, a random pixel selection scheme is designed based on the pixel performance evaluation.

Tian, Jialin↗
NASA NTRS2006

Space-Based Near-Infrared CO2 Measurements: Testing the Orbiting Carbon Observatory Retrieval Algorithm and Validation Concept Using SCIAMACHY Observations over Park Falls, Wisconsin

Space-based measurements of reflected sunlight in the near-infrared (NIR) region promise to yield accurate and precise observations of the global distribution of atmospheric CO2. The Orbiting Carbon Observatory (OCO) is a future NASA mission, which will use this technique to measure the column-averaged dry air mole fraction of CO2 (XCO2) with the precision and accuracy needed to quantify CO2 sources and sinks on regional scales (approx.1000 x 1000 sq km and to characterize their variability on seasonal timescales. Here, we have used the OCO retrieval algorithm to retrieve XCO2 and surface pressure from space-based Scanning Imaging Absorption Spectrometer for Atmospheric Chartography (SCIAMACHY) measurements and from coincident ground-based Fourier transform spectrometer (FTS) measurements of the O2 A band at 0.76 mm and the 1.58 mm CO2 band for Park Falls,Wisconsin. Even after accounting for a systematic error in our representation of the O2 absorption cross sections, we still obtained a positive bias between SCIAMACHY and FTS XCO2 retrievals of approx.3.5%. Additionally, the retrieved surface pressures from SCIAMACHY systematically underestimate measurements of a calibrated pressure sensor at the FTS site. These findings lead us to speculate about inadequacies in the forward model of our retrieval algorithm. By assuming a 1% intensity offset in the O2 A band region for the SCIAMACHY XCO2 retrieval, we significantly improved the spectral fit and achieved better consistency between SCIAMACHY and FTS XCO2 retrievals. We compared the seasonal cycle of XCO2 at Park Falls from SCIAMACHY and FTS retrievals with calculations of the Model of Atmospheric Transport and Chemistry/Carnegie-Ames-Stanford Approach (MATCH/CASA) and found a good qualitative agreement but with MATCH/CASA underestimating the measured seasonal amplitude. Furthermore, since SCIAMACHY observations are similar in viewing geometry and spectral range to those of OCO, this study represents an important test of the OCO retrieval algorithm and validation concept using NIR spectra measured from space. Finally, we argue that significant improvements in precision and accuracy could be obtained from a dedicated CO2 instrument such as OCO, which has much higher spectral and spatial resolutions than SCIAMACHY. These measurements would then provide critical data for improving our understanding of the carbon cycle and carbon sources and sinks.

carbon dioxide↗
NASA NTRS2002

Algorithms and Sensors for Small Robot Path Following

Tracked mobile robots in the 20 kg size class are under development for applications in urban reconnaissance. For efficient deployment, it is desirable for teams of robots to be able to automatically execute path following behaviors, with one or more followers tracking the path taken by a leader. The key challenges to enabling such a capability are (l) to develop sensor packages for such small robots that can accurately determine the path of the leader and (2) to develop path following algorithms for the subsequent robots. To date, we have integrated gyros, accelerometers, compass/inclinometers, odometry, and differential GPS into an effective sensing package. This paper describes the sensor package, sensor processing algorithm, and path tracking algorithm we have developed for the leader/follower problem in small robots and shows the result of performance characterization of the system. We also document pragmatic lessons learned about design, construction, and electromagnetic interference issues particular to the performance of state sensors on small robots.

path following↗