Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 991 records · Page 55

Aviation safety research and transportation/hazard avoidance and elimination

Data collected by the Scanning Laser Doppler Velocimeter System (SLDVS) was analyzed to determine the feasibility of the SLDVS for monitoring aircraft wake vortices in an airport environment. Data were collected on atmospheric vortices and analyzed. Over 1600 landings were monitored at Kennedy International Airport and by the end of the test period 95 percent of the runs with large aircraft were producing usable results in real time. The transport was determined in real time and post analysis using algorithms which performed centroids on the highest amplitude in the thresholded spectrum. Making use of other parameters of the spectrum, vortex flow fields were studied along with the time histories of peak velocities and amplitudes. The post analysis of the data was accomplished with a CDC-6700 computer using several programs developed for LDV data analysis.

Sonnenschein, C. M.↗

Experimental Performance of a Genetic Algorithm for Airborne Strategic Conflict Resolution

The Autonomous Operations Planner, a research prototype flight-deck decision support tool to enable airborne self-separation, uses a pattern-based genetic algorithm to resolve predicted conflicts between the ownship and traffic aircraft. Conflicts are resolved by modifying the active route within the ownship s flight management system according to a predefined set of maneuver pattern templates. The performance of this pattern-based genetic algorithm was evaluated in the context of batch-mode Monte Carlo simulations running over 3600 flight hours of autonomous aircraft in en-route airspace under conditions ranging from typical current traffic densities to several times that level. Encountering over 8900 conflicts during two simulation experiments, the genetic algorithm was able to resolve all but three conflicts, while maintaining a required time of arrival constraint for most aircraft. Actual elapsed running time for the algorithm was consistent with conflict resolution in real time. The paper presents details of the genetic algorithm s design, along with mathematical models of the algorithm s performance and observations regarding the effectiveness of using complimentary maneuver patterns when multiple resolutions by the same aircraft were required.

Karr, David A.↗

Experimental Performance of a Genetic Algorithm for Airborne Strategic Conflict Resolution

The Autonomous Operations Planner, a research prototype flight-deck decision support tool to enable airborne self-separation, uses a pattern-based genetic algorithm to resolve predicted conflicts between the ownship and traffic aircraft. Conflicts are resolved by modifying the active route within the ownship's flight management system according to a predefined set of maneuver pattern templates. The performance of this pattern-based genetic algorithm was evaluated in the context of batch-mode Monte Carlo simulations running over 3600 flight hours of autonomous aircraft in en-route airspace under conditions ranging from typical current traffic densities to several times that level. Encountering over 8900 conflicts during two simulation experiments, the genetic algorithm was able to resolve all but three conflicts, while maintaining a required time of arrival constraint for most aircraft. Actual elapsed running time for the algorithm was consistent with conflict resolution in real time. The paper presents details of the genetic algorithm's design, along with mathematical models of the algorithm's performance and observations regarding the effectiveness of using complimentary maneuver patterns when multiple resolutions by the same aircraft were required.

Karr, David A.↗

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.↗

Optimal space communications techniques

The encoding of video signals using the Song Adaptive Delta Modulator (Song ADM) is discussed. The video signals are characterized as a sequence of pulses having arbitrary height and width. Although the ADM is suited to tracking signals having fast rise times, it was found that the DM algorithm (which permits an exponential rise for estimating an input step) results in a large overshoot and an underdamped response to the step. An overshoot suppression algorithm which significantly reduces the ringing while not affecting the rise time is presented along with formuli for the rise time and the settling time. Channel errors and their effect on the DM encoded bit stream were investigated.

Schilling, D. L.↗

Interactive Digital Signal Processor

Interactive Digital Signal Processor, IDSP, consists of set of time series analysis "operators" based on various algorithms commonly used for digital signal analysis. Processing of digital signal time series to extract information usually achieved by applications of number of fairly standard operations. IDSP excellent teaching tool for demonstrating application for time series operators to artificially generated signals.

Mish, W. H.↗

NPLOT: an Interactive Plotting Program for NASTRAN Finite Element Models

The NPLOT (NASTRAN Plot) is an interactive computer graphics program for plotting undeformed and deformed NASTRAN finite element models. Developed at NASA's Goddard Space Flight Center, the program provides flexible element selection and grid point, ASET and SPC degree of freedom labelling. It is easy to use and provides a combination menu and command driven user interface. NPLOT also provides very fast hidden line and haloed line algorithms. The hidden line algorithm in NPLOT proved to be both very accurate and several times faster than other existing hidden line algorithms. A fast spatial bucket sort and horizon edge computation are used to achieve this high level of performance. The hidden line and the haloed line algorithms are the primary features that make NPLOT different from other plotting programs.

Jones, G. K.↗

Strategies for concurrent processing of complex algorithms in data driven architectures

The performance modeling and enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures is examined. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called ATAMM (Algorithm To Architecture Mapping Model). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.

Stoughton, John W.↗

Strategies for concurrent processing of complex algorithms in data driven architectures

Performance modeling and performance enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures are discussed. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called algorithm to architecture mapping model (ATAMM). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.

Som, Sukhamoy↗

First International Diagnosis Competition - DXC'09

A framework to compare and evaluate diagnosis algorithms (DAs) has been created jointly by NASA Ames Research Center and PARC. In this paper, we present the first concrete implementation of this framework as a competition called DXC 09. The goal of this competition was to evaluate and compare DAs in a common platform and to determine a winner based on diagnosis results. 12 DAs (model-based and otherwise) competed in this first year of the competition in 3 tracks that included industrial and synthetic systems. Specifically, the participants provided algorithms that communicated with the run-time architecture to receive scenario data and return diagnostic results. These algorithms were run on extended scenario data sets (different from sample set) to compute a set of pre-defined metrics. A ranking scheme based on weighted metrics was used to declare winners. This paper presents the systems used in DXC 09, description of faults and data sets, a listing of participating DAs, the metrics and results computed from running the DAs, and a superficial analysis of the results.

Kurtoglu, tolga↗

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

global air traffic optimization↗

An efficient algorithm for computing the crossovers in satellite altimetry

An efficient algorithm has been devised to compute the crossovers in satellite altimetry. The significance of the crossovers is twofold. First, they are needed to perform the crossover adjustment to remove the orbit error. Secondly, they yield important insight into oceanic variability. Nevertheless, there is no published algorithm to make this very time-consuming task easier, which is the goal of this report. The success of the algorithm is predicated on the ability to predict (by analytical means) the crossover coordinates to within 6 km and 1 sec of the true values. Hence, only one interpolation/extrapolation step on the data is needed to derive the crossover coordinates in contrast to the many interpolation/extrapolation operations usually needed to arrive at the same accuracy level if deprived of this information.

Tai, Chang-Kou↗

Numerical simulations of thermal detection of disbonds in lap joints

A 2D time-dependent FEM heat-transfer algorithm that is unconditionally stable and implicit is presently used to solve for the time-dependence of a structure's temperature. By examining data-reduction techniques in the framework of simulation data, the contrast enhancement afforded by a given technique can be evaluated without regard to experimental error. The present computational simulations demonstrate that the time-derivative technique can clearly delineate the substructure of lap-joint geometries; in addition, histograms of the front surface images are able to quantitatively measure contrast-enhancements for various inspection and data-reduction techniques.

Howell, P. A.↗

An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Third Revision

This paper presents an overview of the third major revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This algorithm is referred to as the Airborne Spacing for Terminal Arrival Routes version 11 (ASTAR11). This airborne self-spacing concept is trajectory-based, allowing for spacing operations prior to the aircraft being on a common path. Because this algorithm is trajectory-based, it also has the inherent ability to support required time-of-arrival (RTA) operations. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft.

Abbott, Terence S.↗

An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Fourth Revision

This paper presents an overview of the fourth major revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This airborne self-spacing concept is trajectory-based, allowing for spacing operations prior to the aircraft being on a common path. Because this algorithm is trajectory-based, it also has the inherent ability to support required-time-of-arrival (RTA) operations. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft. Revisions to this algorithm were based on a change to the expected operational environment.

Abbott, Terence S.↗

An Overview of a Trajectory-Based Solution for En Route and Terminal Area Self-Spacing: Fifth Edition

This paper presents an overview of the fifth revision to an algorithm specifically designed to support NASA's Airborne Precision Spacing concept. This algorithm is referred to as the Airborne Spacing for Terminal Arrival Routes version 12 (ASTAR12). This airborne self-spacing concept is trajectory-based, allowing for spacing operations prior to the aircraft being on a common path. Because this algorithm is trajectory-based, it also has the inherent ability to support required-time-of- arrival (RTA) operations. This algorithm was also designed specifically to support a standalone, non-integrated implementation in the spacing aircraft. This current revision to the algorithm includes a ground speed feedback term to compensate for slower than expected traffic aircraft speeds based on the accepted air traffic control tendency to slow aircraft below the nominal arrival speeds when they are farther from the airport.

Abbott, Terence S.↗

Unsteady Euler airfoil solutions using unstructured dynamic meshes

Two algorithms for the solution of the time-dependent Euler equations are presented for unsteady aerodynamic analysis of oscillating airfoils. Both algorithms were developed for use on an unstructured grid made up of triangles. The first flow solver involves a Runge-Kutta time-stepping scheme with a finite-volume spatial discretization that reduces to central differencing on a rectangular mesh. The second flow solver involves a modified Euler time-integration scheme with an upwind-biased spatial discretization based on the flux-vector splitting of Van Leer. The paper presents descriptions of the Euler solvers and dynamic mesh algorithm along with results which assess the capability.

Batina, John T.↗

Extremum-seeking control for an Ultrasonic/Sonic Driller/Corer (USDC) driven at high-power

Future NASA exploration missions will increasingly require sampling, in-situ analysis and possibly the return of material to Earth for further tests. One of the challenges to addressing this need is the ability to drill using for low axial loading while operating from light weight platforms (e.g., lander, rover, etc.) as well as operate at planets with low gravity. For this purpose, the authors developed the Ultrasonic/Sonic Driller/Corer (USDC) jointly with Cybersonics Inc. Studies of the operation of the USDC at high power have shown there is a critical need to self-tune to maintain the operation of the piezoelectric actuator at resonance. Performing such tuning is encountered with difficulties and to address them an extremum-seeking control algorithm is being investigated. This algorithm is designed to tune the driving frequency of a time-varying resonating actuator subjected to both random and high-power impulsive noise disturbances. Using this algorithm the performance of the actuator is monitored on a time-scale that is compatible with its slowly time-varying physical characteristics. The algorithm includes a parameter estimator, which estimates the coefficients of a function that characterizes the quality factor of the USDC. Since the parameter estimator converges sufficiently faster than the time-varying drift of the USDC's physical parameters, the proposed extremum-seeking estimation and control algorithm is potentially applicable for use as a closed-loop health monitoring system. Specifically, this system may be programmed to automatically adjust the duty-cycle of the sinusoidal driver signal to guarantee that the quality factor of the USDC does not fall below a user-defined set-point. Such fault-tolerant functionality is especially important in automated drilling applications where it is essential not to inadvertently drive the piezoelectric ceramic crystals of the USDC beyond their capacities. The details of the algorithm and experimental results will be described and discussed in this paper.

Peek-seeking estimation and control↗