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 1,009 records · Page 56

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 NASA’s 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 good option for computing wind-optimal trajectories for national and global air traffic system studies.

Ng, Hok K.↗

Attitude identification for SCOLE using two infrared cameras

An algorithm is presented that incorporates real time data from two infrared cameras and computes the attitude parameters of the Spacecraft COntrol Lab Experiment (SCOLE), a lab apparatus representing an offset feed antenna attached to the Space Shuttle by a flexible mast. The algorithm uses camera position data of three miniature light emitting diodes (LEDs), mounted on the SCOLE platform, permitting arbitrary camera placement and an on-line attitude extraction. The continuous nature of the algorithm allows identification of the placement of the two cameras with respect to some initial position of the three reference LEDs, followed by on-line six degrees of freedom attitude tracking, regardless of the attitude time history. A description is provided of the algorithm in the camera identification mode as well as the mode of target tracking. Experimental data from a reduced size SCOLE-like lab model, reflecting the performance of the camera identification and the tracking processes, are presented. Computer code for camera placement identification and SCOLE attitude tracking is listed.

Shenhar, Joram↗

Design Principles and Algorithms for Air Traffic Arrival Scheduling

This report presents design principles and algorithms for building a real-time scheduler of arrival aircraft based on a first-come-first-served (FCFS) scheduling protocol. The algorithms provide the conceptual and computational foundation for the Traffic Management Advisor (TMA) of the Center/terminal radar approach control facilities (TRACON) automation system, which comprises a set of decision support tools for managing arrival traffic at major airports in the United States. The primary objective of the scheduler is to assign arrival aircraft to a favorable landing runway and schedule them to land at times that minimize delays. A further objective of the scheduler is to allocate delays between high-altitude airspace far away from the airport and low-altitude airspace near the airport. A method of delay allocation is described that minimizes the average operating cost in the presence of errors in controlling aircraft to a specified landing time. This report is a revision of an earlier paper first presented as part of an Advisory Group for Aerospace Research and Development (AGARD) lecture series in September 1995. The authors, during vigorous discussions over the details of this paper, felt it was important to the air-trafficmanagement (ATM) community to revise and extend the original 1995 paper, providing more detail and clarity and thereby allowing future researchers to understand this foundational work as the basis for the TMA's scheduling algorithms.

Center TRACON↗

Reduction of matrix wavefront for NASTRAN

The three grid point resequencing algorithms most often run by NASTRAN users are compared for their ability to reduce matrix root-mean-square (rms) wavefront, which is the most critical parameter in determining matrix decomposition time in NASTRAN. The three algorithms are Cuthill-McKee (CM), Gibbs-Poole-Stockmeyer (GPS), and Levy. The first two (CM and GPS) are in the BANDIT program, and the Levy algorithm is in WAVEFRONT. Results are presented for a diversified collection of 30 test problems ranging in size from 59 to 2680 nodes. It is concluded that GPS is exceptionally fast and, for the conditions under which the test was made, the algorithm best able to reduce rms wavefront consistently well.

Everstine, G. C.↗

The use of random decrement technique for identification of structural modes of vibration

An algorithm is developed to obtain the free responses of a structure from its random responses due to some unknown or known random input or inputs, using the random-decrement technique without changing time correlation between signals. The algorithm is tested using random responses from a 'generalized payload' model and from the 'Space Shuttle' model. The resulting free responses are then used to identify the modal characteristics of the two systems.

Ibrahim, S. R.↗

Coagulation algorithms with size binning

The Smoluchowski equation describes the time evolution of an aerosol particle size distribution due to aggregation or coagulation. Any algorithm for computerized solution of this equation requires a scheme for describing the continuum of aerosol particle sizes as a discrete set. One standard form of the Smoluchowski equation accomplishes this by restricting the particle sizes to integer multiples of a basic unit particle size (the monomer size). This can be inefficient when particle concentrations over a large range of particle sizes must be calculated. Two algorithms employing a geometric size binning convention are examined: the first assumes that the aerosol particle concentration as a function of size can be considered constant within each size bin; the second approximates the concentration as a linear function of particle size within each size bin. The output of each algorithm is compared to an analytical solution in a special case of the Smoluchowski equation for which an exact solution is known . The range of parameters more appropriate for each algorithm is examined.

Statton, David M.↗

Small Body GN&C Research Report: A Guidance and Control Technique for Small-Body Proximity Operations with Guaranteed Guidance Resolvability and Required Thruster Silent Time

The guidance and control (G&C) algorithms for enabling small-body proximity operations are developed by using a model predictive control approach along with a convexification of the governing dynamics, control constraints, and trajectory/state constraints. The open-loop guidance is solved ahead of time or in a resolvable, real-time manner through the use of PWG (Pseudo Way-point Generation), a technique developed in this research. The PWG scheme ensures required thruster silent times during trajectory maneuvers. The feedback control is implemented to track the PWG trajectories in a manner that guarantees the resolvability for the open-loop problem, enabling the ability to update the G&C in a model-predictive manner. The schemes incorporate gravity models and thruster ring times into discrete dynamics that are solved as a optimal control problem to minimize fuel consumption or thruster energy expenditure. The optimal control problem is cast as an LMI (Linear Matrix Inequality) and then solved through Semi-Definite Programming techniques in a computationally efficient manner that provides convergence and constraint guarantees.

guidance and control (G&C)↗

Skin Temperature Analysis and Bias Correction in a Coupled Land-Atmosphere Data Assimilation System

In an initial investigation, remotely sensed surface temperature is assimilated into a coupled atmosphere/land global data assimilation system, with explicit accounting for biases in the model state. In this scheme, an incremental bias correction term is introduced in the model's surface energy budget. In its simplest form, the algorithm estimates and corrects a constant time mean bias for each gridpoint; additional benefits are attained with a refined version of the algorithm which allows for a correction of the mean diurnal cycle. The method is validated against the assimilated observations, as well as independent near-surface air temperature observations. In many regions, not accounting for the diurnal cycle of bias caused degradation of the diurnal amplitude of background model air temperature. Energy fluxes collected through the Coordinated Enhanced Observing Period (CEOP) are used to more closely inspect the surface energy budget. In general, sensible heat flux is improved with the surface temperature assimilation, and two stations show a reduction of bias by as much as 30 Wm(sup -2) Rondonia station in Amazonia, the Bowen ratio changes direction in an improvement related to the temperature assimilation. However, at many stations the monthly latent heat flux bias is slightly increased. These results show the impact of univariate assimilation of surface temperature observations on the surface energy budget, and suggest the need for multivariate land data assimilation. The results also show the need for independent validation data, especially flux stations in varied climate regimes.

Bosilovich, Michael G.↗

Simulations of transition and turbulence on the Navier-Stokes computer

The Navier-Stokes Computer (NSC) consists of multiple local memory parallel processors interconnected in a hypercube network. Efficient implementation of algorithms on the NSC thus requires the effective utilization of both the coarse and fine grain paralelism inherent in the architectural design. The basic approach to implementing an algorithm on the NSC is presented herein. The particular finite-difference algorithm considered was developed for performing transition and turbulence simulations by direct solution of the time-dependent incompressible Navier-Stokes equations. The suitability of this algorithm for performing simulations of the isotropic turbulence problem is verified from computations performed on a Cray 2. Projected timing results for the algorithm on the NSC itself are presented for both the isotropic turbulence and laminar turbulent transition problems.

Krist, S. E.↗

Efficient Jitter Analysis for Spacecraft

Typically in space missions, the science instruments require a specific degree of pointing accuracy as well as dynamical quietness. This dynamical quietness, which is needed to allow the instruments to make measurements (remote sensing applications) or perform other functions, is usually characterized in terms of jitter and stability specifications. In order to insure that the spacecraft meets the requirements of its instruments, several jitter analyses are performed throughout the design phase of the spacecraft and beyond as the models of the spacecraft, its components, and disturbances mature. Each such analysis involves the simulation of the spacecraft and instrument dynamical response to all known disturbance scenarios, followed by the computation of jitter values for each instrument based on the specified jitter time windows. The direct approach for computing jitter values by sweeping maxima and minima throughout the time history may be costly in the computational sense as the size and number of the time histories involved could be quite large. Keeping in mind that typical spacecraft simulation time histories may easily involve hundreds of thousands or millions of points, it is imperative that a jitter analysis algorithm be developed which is more efficient than the direct approach. This paper presents a vectorized algorithm for efficient computation of spacecraft jitter values. The algorithm identifies the extreme points in the time history, which are the points that may dominate the jitter values depending on the location of the jitter window along the time history. The span of influence of each extremum is then computed by the algorithm and used in an efficient and vectorized fashion to obtain the jitter values. The algorithm deals with the multiple jitter windows 2 sequentially, first computing jitter values for the smallest time window, then looping over the remaining time windows until all jitter values are computed. A numerical example is carried out to demonstrate the efficiency and feasibility of the proposed jitter analysis technique.

Maghami, Peiman G.↗

Integration of symbolic and algorithmic hardware and software for the automation of space station subsystems

Expert systems that require access to data bases, complex simulations and real time instrumentation have both symbolic and algorithmic needs. Both of these needs could be met using a general purpose workstation running both symbolic and algorithmic codes, or separate, specialized computers networked together. The later approach was chosen to implement TEXSYS, the thermal expert system, developed by the NASA Ames Research Center in conjunction with the Johnson Space Center to demonstrate the ability of an expert system to autonomously monitor the thermal control system of the space station. TEXSYS has been implemented on a Symbolics workstation, and will be linked to a microVAX computer that will control a thermal test bed. The integration options and several possible solutions are presented.

Gregg, Hugh↗

The fast decoding of Reed-Solomon codes using fermat theoretic transforms and continued fractions

It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform algorithm over finite fields GF(F sub n) where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

Welch, L. R.↗

The fast decoding of Reed-Solomon codes using Fermat theoretic transforms and continued fractions

It is shown that Reed-Solomon (RS) codes can be decoded by using a fast Fourier transform (FFT) algorithm over finite fields GF(F sub n), where F sub n is a Fermat prime, and continued fractions. This new transform decoding method is simpler than the standard method for RS codes. The computing time of this new decoding algorithm in software can be faster than the standard decoding method for RS codes.

Reed, I. S.↗

A New Objective Technique for Verifying Mesoscale Numerical Weather Prediction Models

This report presents a new objective technique to verify predictions of the sea-breeze phenomenon over east-central Florida by the Regional Atmospheric Modeling System (RAMS) mesoscale numerical weather prediction (NWP) model. The Contour Error Map (CEM) technique identifies sea-breeze transition times in objectively-analyzed grids of observed and forecast wind, verifies the forecast sea-breeze transition times against the observed times, and computes the mean post-sea breeze wind direction and speed to compare the observed and forecast winds behind the sea-breeze front. The CEM technique is superior to traditional objective verification techniques and previously-used subjective verification methodologies because: It is automated, requiring little manual intervention, It accounts for both spatial and temporal scales and variations, It accurately identifies and verifies the sea-breeze transition times, and It provides verification contour maps and simple statistical parameters for easy interpretation. The CEM uses a parallel lowpass boxcar filter and a high-order bandpass filter to identify the sea-breeze transition times in the observed and model grid points. Once the transition times are identified, CEM fits a Gaussian histogram function to the actual histogram of transition time differences between the model and observations. The fitted parameters of the Gaussian function subsequently explain the timing bias and variance of the timing differences across the valid comparison domain. Once the transition times are all identified at each grid point, the CEM computes the mean wind direction and speed during the remainder of the day for all times and grid points after the sea-breeze transition time. The CEM technique performed quite well when compared to independent meteorological assessments of the sea-breeze transition times and results from a previously published subjective evaluation. The algorithm correctly identified a forecast or observed sea-breeze occurrence or absence 93% of the time during the two- month evaluation period from July and August 2000. Nearly all failures in CEM were the result of complex precipitation features (observed or forecast) that contaminated the wind field, resulting in a false identification of a sea-breeze transition. A qualitative comparison between the CEM timing errors and the subjectively determined observed and forecast transition times indicate that the algorithm performed very well overall. Most discrepancies between the CEM results and the subjective analysis were again caused by observed or forecast areas of precipitation that led to complex wind patterns. The CEM also failed on a day when the observed sea- breeze transition affected only a very small portion of the verification domain. Based on the results of CEM, the RAMS tended to predict the onset and movement of the sea-breeze transition too early and/or quickly. The domain-wide timing biases provided by CEM indicated an early bias on 30 out of 37 days when both an observed and forecast sea breeze occurred over the same portions of the analysis domain. These results are consistent with previous subjective verifications of the RAMS sea breeze predictions. A comparison of the mean post-sea breeze winds indicate that RAMS has a positive wind-speed bias for .all days, which is also consistent with the early bias in the sea-breeze transition time since the higher wind speeds resulted in a faster inland penetration of the sea breeze compared to reality.

Case, Jonathan L.↗

Comparison of Visual and LiDAR SLAM Algorithms using NASA Flight Test Data

Simultaneous Localization and Mapping (SLAM) is a promising technique that provides localization information and precise mapping of the physical environment without having much prior knowledge of the surroundings. SLAM may have a vital role in aeronautics and aerospace, where vehicles and aircraft must operate in complex environments with traditional localization services that may be degraded or unavailable. This paper compares several pre-canned 3D SLAM algorithms based on vision and LiDAR, namely ORB-SLAM, ORB-SLAM2, LOAM, A-LOAM, and F-LOAM on NASA UAS (Unmanned Aircraft System) flight test data. The NASA ARC UAS flight test demonstrates preliminary SLAM algorithm results, which serve as a stepping stone to simulated AAM (Advanced Air Mobility) concepts. Conducting AFRC UAS flight test for simulated AAM approach and landing with SLAM algorithms provides an Alternative Precision Navigation and Timing solution based on distributed landmarks and fiducials in the landing zone. These algorithms use the telemetry data as ground truth for a baseline comparison. The criteria of the performance comparison include robustness, accuracy, re-localization, response to environmental changes, and real-time effectiveness, which are currently qualitative but to be quantitative in the future.

computer vision↗

Comparison of Visual and LiDAR SLAM Algorithms using NASA Flight Test Data

Simultaneous Localization and Mapping (SLAM) is a promising technique that provides localization information and precise mapping of the physical environment without having much prior knowledge of the surroundings. SLAM may have a vital role in aeronautics and aerospace, where vehicles and aircraft must operate in complex environments with traditional localization services that may be degraded or unavailable. This paper compares several pre-canned 3D SLAM algorithms based on vision and LiDAR, namely ORB-SLAM, ORB-SLAM2, LOAM, A-LOAM, and F-LOAM on NASA UAS (Unmanned Aircraft System) flight test data. The NASA ARC UAS flight test demonstrates preliminary SLAM algorithm results, which serve as a stepping stone to simulated AAM (Advanced Air Mobility) concepts. Conducting AFRC UAS flight test for simulated AAM approach and landing with SLAM algorithms provides an Alternative Precision Navigation and Timing solution based on distributed landmarks and fiducials in the landing zone. These algorithms use the telemetry data as ground truth for a baseline comparison. The criteria of the performance comparison include robustness, accuracy, re-localization, response to environmental changes, and real-time effectiveness, which are currently qualitative but to be quantitative in the future.

computer vision↗

Application of integration algorithms in a parallel processing environment for the simulation of jet engines

The application of Predictor corrector integration algorithms developed for the digital parallel processing environment are investigated. The algorithms are implemented and evaluated through the use of a software simulator which provides an approximate representation of the parallel processing hardware. Test cases which focus on the use of the algorithms are presented and a specific application using a linear model of a turbofan engine is considered. Results are presented showing the effects of integration step size and the number of processors on simulation accuracy. Real time performance, interprocessor communication, and algorithm startup are also discussed.

Krosel, S. M.↗

A Fast-Time Simulation Tool for Analysis of Airport Arrival Traffic

The basic objective of arrival sequencing in air traffic control automation is to match traffic demand and airport capacity while minimizing delays. The performance of an automated arrival scheduling system, such as the Traffic Management Advisor developed by NASA for the FAA, can be studied by a fast-time simulation that does not involve running expensive and time-consuming real-time simulations. The fast-time simulation models runway configurations, the characteristics of arrival traffic, deviations from predicted arrival times, as well as the arrival sequencing and scheduling algorithm. This report reviews the development of the fast-time simulation method used originally by NASA in the design of the sequencing and scheduling algorithm for the Traffic Management Advisor. The utility of this method of simulation is demonstrated by examining the effect on delays of altering arrival schedules at a hub airport.

Erzberger, Heinz↗