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 631 records · Page 35

Autorotation flight control system

The present invention provides computer implemented methodology that permits the safe landing and recovery of rotorcraft following engine failure. With this invention successful autorotations may be performed from well within the unsafe operating area of the height-velocity profile of a helicopter by employing the fast and robust real-time trajectory optimization algorithm that commands control motion through an intuitive pilot display, or directly in the case of autonomous rotorcraft. The algorithm generates optimal trajectories and control commands via the direct-collocation optimization method, solved using a nonlinear programming problem solver. The control inputs computed are collective pitch and aircraft pitch, which are easily tracked and manipulated by the pilot or converted to control actuator commands for automated operation during autorotation in the case of an autonomous rotorcraft. The formulation of the optimal control problem has been carefully tailored so the solutions resemble those of an expert pilot, accounting for the performance limitations of the rotorcraft and safety concerns.

Bachelder, Edward N.↗

Real-Time Principal-Component Analysis

A recently written computer program implements dominant-element-based gradient descent and dynamic initial learning rate (DOGEDYN), which was described in Method of Real-Time Principal-Component Analysis (NPO-40034) NASA Tech Briefs, Vol. 29, No. 1 (January 2005), page 59. To recapitulate: DOGEDYN is a method of sequential principal-component analysis (PCA) suitable for such applications as data compression and extraction of features from sets of data. In DOGEDYN, input data are represented as a sequence of vectors acquired at sampling times. The learning algorithm in DOGEDYN involves sequential extraction of principal vectors by means of a gradient descent in which only the dominant element is used at each iteration. Each iteration includes updating of elements of a weight matrix by amounts proportional to a dynamic initial learning rate chosen to increase the rate of convergence by compensating for the energy lost through the previous extraction of principal components. In comparison with a prior method of gradient-descent-based sequential PCA, DOGEDYN involves less computation and offers a greater rate of learning convergence. The sequential DOGEDYN computations require less memory than would parallel computations for the same purpose. The DOGEDYN software can be executed on a personal computer.

Duong, Vu↗

Understanding Spacecraft Agility for Orbit Transfers on the Dawn Low-thrust Mission

Conventional maneuver design processes were inadequate. Long thrusting durations with the small force of SEP. Increased coupling between ACS and NAV teams. Definition of quantifiable constraints proved impractical. Specifically for the Dawn mission, because of the attitude steering algorithm. A time-efficient simulation tool, qSTAT, was developed and allowed fast verification of candidate thrust profile designs. This approach allowed Dawn to overcome the complications of low-thrust orbit transfers.

low-thrust↗

Recent Advancements in the Infrared Flow Visualization System for the NASA Ames Unitary Plan Wind Tunnels

The following details recent efforts undertaken at the NASA Ames Unitary Plan wind tunnels to design and deploy an advanced, production-level infrared (IR) flow visualization data system. Highly sensitive IR cameras, coupled with in-line image processing, have enabled the visualization of wind tunnel model surface flow features as they develop in real-time. Boundary layer transition, shock impingement, junction flow, vortex dynamics, and buffet are routinely observed in both transonic and supersonic flow regimes all without the need of dedicated ramps in test section total temperature. Successful measurements have been performed on wing-body sting mounted test articles, semi-span floor mounted aircraft models, and sting mounted launch vehicle configurations. The unique requirements of imaging in production wind tunnel testing has led to advancements in the deployment of advanced IR cameras in a harsh test environment, robust data acquisition storage and workflow, real-time image processing algorithms, and evaluation of optimal surface treatments. The addition of a multi-camera IR flow visualization data system to the Ames UPWT has demonstrated itself to be a valuable analyses tool in the study of new and old aircraft/launch vehicle aerodynamics and has provided new insight for the evaluation of computational techniques.

Infrared Thermography↗

Validation of High-Resolution MAIAC Aerosol Product over South America

Multiangle Implementation of Atmospheric Correction (MAIAC) is a new Moderate Resolution Imaging Spectroradiometer (MODIS) algorithm that combines time series approach and image processing to derive surface reflectance and atmosphere products, such as aerosol optical depth (AOD) and columnar water vapor (CWV). The quality assessment of MAIAC AOD at 1 km resolution is still lacking across South America. In the present study, critical assessment of MAIAC AOD(sub 550) was performed using ground-truth data from 19 Aerosol Robotic Network (AERONET) sites over South America. Additionally, we validated the MAIAC CWV retrievals using the same AERONET sites. In general, MAIAC AOD Terra/Aqua retrievals show high agreement with ground-based measurements, with a correlation coefficient (R) close to unity (R(sub Terra):0.956 and R(sub Aqua):0.949). MAIAC accuracy depends on the surface properties and comparisons revealed high confidence retrievals over cropland, forest, savanna, and grassland covers, where more than 2/3 (approximately 66%) of retrievals are within the expected error (EE = +/-(0.05 + 0.05 × AOD)) and R exceeding 0.86. However, AOD retrievals over bright surfaces show lower correlation than those over vegetated areas. Both MAIAC Terra and Aqua retrievals are similarly comparable to AERONET AOD over the MODIS lifetime (small bias offset approximately 0.006). Additionally, MAIAC CWV presents quantitative information with R approximatley 0.97 and more than 70% of retrievals within error (+/-15%). Nonetheless, the time series validation shows an upward bias trend in CWV Terra retrievals and systematic negative bias for CWV Aqua. These results contribute to a comprehensive evaluation of MAIAC AOD retrievals as a new atmospheric product for future aerosol studies over South America.

Martins, V. S.↗

Spectral Analysis of Integrated Pressures on Patches with Unsteady Pressure-Sensitive Paint Measurements

This paper describes the spectral analysis of integrated pressures on patches of the scale model of the Space Launch System (SLS) Block 1B crew vehicle with the Unsteady Pressure-Sensitive Paint (uPSP) measurements, which were collected in the ascent transient aerodynamics tests with the Unitary Plan Wind Tunnel 11-by-11-foot Transonic Wind Tunnel in September 2019 at NASA Ames Research Center. Recent research has demonstrated that uPSP can be an essential tool for the assessment of the unsteady, aerodynamic phenomena. The work described in this paper is a part of NASA’s development of a new state-of-the-art uPSP capability in production wind tunnels. In this paper, 108 patches are defined with x station values and azimuth angles of the scale model. For each patch, the polygons are determined from the surface cells of the grid of the model, clipped with the edges of the patch, and each of the polygons is divided into triangles. The inputs of the pressure integration algorithm are the time series of pressure coefficients on the vertices of the grid of the model, generated by the uPSP data processing program from the videos taken with 4 Phantom high-speed cameras during the wind tunnel tests. The integrated pressure of the patch is determined as the ratio of the sum of the forces on the triangles over the sum of the areas of the triangles. For each of the test cases, the Cross Power Spectral Density (CPSD) and Magnitude-Squared Coherence (msCohere) are computed for frequencies over 1/3 octave bands from the time series of the integrated pressures on the patches. The spectral analysis outputs of different cases of the wind tunnel tests are analyzed and the coherence of patches is investigated over frequencies, x station values, azimuth angles, Mach numbers and SLS vehicle attitudes. The pressure integration and spectral analysis described in this paper were executed on the NASA Pleiades supercomputer. Funding for this research was provided by the NASA Aeroscience Evaluation and Test Capabilities (AETC) Project.

Pressure-Sensitive Paint↗

Path-Adaptive Guidance Algorithm Trades for a Two-Stage Lunar Descent Vehicle

For the next generation of NASA’s missions, the necessity for path-adaptive guidance algorithms has become clear in order to provide the stability and customizability required for a safe and efficient descent to the lunar surface, while meeting specified program and vehicle constraints. Several descent algorithms have been tested and flown for single-stage landers through the Apollo and Altair programs, but thus far little analysis has been conducted involving the application of these algorithms for a two-stage descent vehicle. Due to the limited payload mass constraints of the existing fleet of launch vehicles, multi-stage descent architectures have become a viable course of action. This paper seeks to compare the performance of guidance configurations for a lunar lander system consisting of two stages, one of which separates partway through descent. Through development of this paper, an optimization suite has been written that is specifically designed for optimizing planetary non-atmospheric two-stage descent trajectories, and is used as a comparison baseline for the guidance algorithms tested. Time-to -go computational methods and ignition logic routines that may be employed in a lunar environment are also discussed. Further work is to be completed on trajectory design trades as well as the effects of modifying guidance targets in simulation based on trajectories that are optimized for different performance indices.

Jason M Everett↗

Artemis I Liftoff Measurements Issues and Corrections

The SLS rocket was instrumented to collect liftoff environment data during Artemis I launch. The instruments were microphones and pressure transducers. Most data were acceptable for analysis, but required corrections for port resonance, mean signal drift, data system delays, and data spikes. The data were all transmitted via telemetry and in this process some of the measurements experienced unexpectedly long gaps in the data stream. A time validated reconstruction algorithm failed when encountering the long gaps and required use of data from a simpler reconstruction process, with manually inserted data delay corrections. This paper discusses the issues and the corrections that were necessary for the launch data to determine the true physics of the acoustics occurring during launch.

environments↗

Artemis I Liftoff Measurements Issues and Corrections

The SLS rocket was instrumented to collect liftoff environment data during Artemis I launch. The instruments were microphones and pressure transducers. Most data were acceptable for analysis, but required corrections for port resonance, mean signal drift, data system delays, and data spikes. The data were all transmitted via telemetry and in this process some of the measurements experienced unexpectedly long gaps in the data stream. A time validated reconstruction algorithm failed when encountering the long gaps and required use of data from a simpler reconstruction process, with manually inserted data delay corrections. This paper discusses the issues and the corrections that were necessary for the launch data to determine the true physics of the acoustics occurring during launch.

environments↗

Temporal-adaptive Euler/Navier-Stokes algorithm for unsteady aerodynamic analysis of airfoils using unstructured dynamic meshes

A temporal adaptive algorithm for the time-integration of the two-dimensional Euler or Navier-Stokes equations is presented. The flow solver involves an upwind flux-split spatial discretization for the convective terms and central differencing for the shear-stress and heat flux terms on an unstructured mesh of triangles. The temporal adaptive algorithm is a time-accurate integration procedure which allows flows with high spatial and temporal gradients to be computed efficiently by advancing each grid cell near its maximum allowable time step. Results indicate that an appreciable computational savings can be achieved for both inviscid and viscous unsteady airfoil problems using unstructured meshes without degrading spatial or temporal accuracy.

Kleb, William L.↗

Temporal-adaptive Euler/Navier-Stokes algorithm for unsteady aerodynamic analysis of airfoils using unstructured dynamic meshes

A temporal adaptive algorithm for the time-integration of the two-dimensional Euler or Navier-Stokes equations is presented. The flow solver involves an upwind flux-split spatial discretization for the convective terms and central differencing for the shear-stress and heat flux terms on an unstructured mesh of triangles. The temporal adaptive algorithm is a time-accurate integration procedure which allows flows with high spatial and temporal gradients to be computed efficiently by advancing each grid cell near its maximum allowable time step. Results indicate that an appreciable computational savings can be achieved for both inviscid and viscous unsteady airfoil problems using unstructured meshes without degrading spatial or temporal accuracy.

Kleb, William L.↗

A NASA-Air Force Precipitation Analysis for Near-Real-Time Operations

This article describes a new precipitation analysis algorithm developed by NASA for time-sensitive operations at the United States Air Force. Implemented as part of the Land Information System—a land modeling and data assimilation software framework—this NASA–Air Force Precipitation Analysis (NAFPA) combines numerical weather prediction model outputs with rain gauge measurements and satellite estimates to produce global, gridded 3-h accumulated precipitation fields at approximately 10-km resolution. Input observations are subjected to quality control checks before being used by the Bratseth analysis algorithm that converges to optimal interpolation. NAFPA assimilates up to 3.5 million observations without artificial data thinning or selection. To evaluate this new approach, a multiyear reanalysis is generated and intercompared with eight alternative precipitation products across the contiguous United States, Africa, and the monsoon region of eastern Asia. NAFPA yields superior accuracy and correlation over low-latency (up to 14 h) alternatives (numerical weather prediction and satellite retrievals), and often outperforms high-latency (up to 3.5 months) products, although the details for the latter vary by region and product. The development of NAFPA offers a high-quality, near-real-time product for use in meteorological, land surface, and hydrological research and applications.

Africa↗

Linear system identification via backward-time observer models

This paper presents an algorithm to identify a state-space model of a linear system using a backward-time approach. The procedure consists of three basic steps. First, the Markov parameters of a backward-time observer are computed from experimental input-output data. Second, the backward-time observer Markov parameters are decomposed to obtain the backward-time system Markov parameters (backward-time pulse response samples) from which a backward-time state-space model is realized using the Eigensystem Realization Algorithm. Third, the obtained backward-time state space model is converted to the usual forward-time representation. Stochastic properties of this approach will be discussed. Experimental results are given to illustrate when and to what extent this concept works.

Juang, Jer-Nan↗

Trajectory optimization for real-time guidance. I - Time-varying LQR on a parallel processor

A key algorithmic element of a real-time trajectory optimization hardware/software implementation, the quadratic program (QP) solver element, is presented. The purpose of the effort is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter. Many methods of nonlinear programming require the solution of a QP at each iteration. In the trajectory optimization case the QP has a special dynamic programming structure, a LQR-like structure. QP algorithm speed is increased by taking advantage of this special structure and by parallel implementation.

Psiaki, Mark L.↗

REQUEST: A Recursive QUEST Algorithm for Sequential Attitude Determination

In order to find the attitude of a spacecraft with respect to a reference coordinate system, vector measurements are taken. The vectors are pairs of measurements of the same generalized vector, taken in the spacecraft body coordinates, as well as in the reference coordinate system. We are interested in finding the best estimate of the transformation between these coordinate system.s The algorithm called QUEST yields that estimate where attitude is expressed by a quarternion. Quest is an efficient algorithm which provides a least squares fit of the quaternion of rotation to the vector measurements. Quest however, is a single time point (single frame) batch algorithm, thus measurements that were taken at previous time points are discarded. The algorithm presented in this work provides a recursive routine which considers all past measurements. The algorithm is based on on the fact that the, so called, K matrix, one of whose eigenvectors is the sought quaternion, is linerly related to the measured pairs, and on the ability to propagate K. The extraction of the appropriate eigenvector is done according to the classical QUEST algorithm. This stage, however, can be eliminated, and the computation simplified, if a standard eigenvalue-eigenvector solver algorithm is used. The development of the recursive algorithm is presented and illustrated via a numerical example.

Bar-Itzhack, Itzhack Y.↗

The effect of the Earth's oblate spheroid shape on the accuracy of a time-of-arrival lightning ground strike locating system

The algorithm used in previous technology time-of-arrival lightning mapping systems was based on the assumption that the earth is a perfect spheroid. These systems yield highly-accurate lightning locations, which is their major strength. However, extensive analysis of tower strike data has revealed occasionally significant (one to two kilometer) systematic offset errors which are not explained by the usual error sources. It was determined that these systematic errors reduce dramatically (in some cases) when the oblate shape of the earth is taken into account. The oblate spheroid correction algorithm and a case example is presented.

Casper, Paul W.↗

Fast, Safe, Propellant-Efficient Spacecraft Motion Planning Under Clohessy-Wiltshire-Hill Dynamics

This paper presents a sampling-based motion planning algorithm for real-time and propellant-optimized autonomous spacecraft trajectory generation in near-circular orbits. Specifically, this paper leverages recent algorithmic advances in the field of robot motion planning to the problem of impulsively actuated, propellant- optimized rendezvous and proximity operations under the Clohessy-Wiltshire-Hill dynamics model. The approach calls upon a modified version of the FMT* algorithm to grow a set of feasible trajectories over a deterministic, low-dispersion set of sample points covering the free state space. To enforce safety, the tree is only grown over the subset of actively safe samples, from which there exists a feasible one-burn collision-avoidance maneuver that can safely circularize the spacecraft orbit along its coasting arc under a given set of potential thruster failures. Key features of the proposed algorithm include 1) theoretical guarantees in terms of trajectory safety and performance, 2) amenability to real-time implementation, and 3) generality, in the sense that a large class of constraints can be handled directly. As a result, the proposed algorithm offers the potential for widespread application, ranging from on-orbit satellite servicing to orbital debris removal and autonomous inspection missions.

spacecraft relative motio↗

Improved Results for Route Planning in Stochastic Transportation Networks

In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times are not determined by a fixed schedule but instead may be random. the problem requires more than standard shortest path techniques. In recent work, Datar and Ranade provide algorithms in the case where bus arrivals are assumed to be independent and exponentially distributed. We offer solutions to two important generalizations of the problem, answering open questions posed by Datar and Ranade. First, we provide a polynomial time algorithm for a much wider class of arrival distributions, namely those with increasing failure rate. This class includes not only exponential distributions but also uniform, normal, and gamma distributions. Second, in the case where bus arrival times are independent and geometric discrete random variable,. we provide an algorithm for transportation networks of buses and trains, where trains run according to a fixed schedule.

Boyan, Justin↗