Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “variational algorithms”

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 109 records · Page 6
All sourcesNASA NTRSDOE OSTI
NASA NTRS2006

Variational Assimilation of Global Microwave Rainfall Retrievals: Physical and Dynamical Impact on GEOS Analyses and Forecasts

Global microwave rainfall retrievals from a 5-satellite constellation, including TMI from TRMM, SSWI from DMSP F13, F14 and F15, and AMSR-E from EOS-AQUA, are assimilated into the NASA Goddard Earth Observing System (GEOS) Data Assimilation System (DAS) using a 1-D variational continuous assimilation (VCA) algorithm. The physical and dynamical impact of rainfall assimilation on GEOS analyses and forecasts is examined at various temporal and spatial scales. This study demonstrates that the 1-D VCA algorithm, which was originally developed and evaluated for rainfall assimilations over tropical oceans, can effectively assimilate satellite microwave rainfall retrievals and improve GEOS analyses over both the Tropics and the extratropics where the atmospheric processes are dominated by different large-scale dynamics and moist physics, and also over the land, where rainfall estimates from passive microwave radiometers are believed to be less accurate. Results show that rainfall assimilation renders the GEOS analysis physically and dynamically more consistent with the observed precipitation at the monthly-mean and 6-hour time scales. Over regions where the model precipitation tends to misbehave in distinctly different rainy regimes, the 1-D VCA algorithm, by compensating for errors in the model s moist time-tendency in a 6-h analysis window, is able to bring the rainfall analysis closer to the observed. The radiation and cloud fields also tend to be in better agreement with independent satellite observations in the rainfall-assimilation m especially over regions where rainfall analyses indicate large improvements. Assimilation experiments with and without rainfall data for a midlatitude frontal system clearly indicates that the GEOS analysis is improved through changes in the thermodynamic and dynamic fields that respond to the rainfall assimilation. The synoptic structures of temperature, moisture, winds, divergence, and vertical motion, as well as vorticity are more realistically captured across the front. Short-term forecasts using initial conditions assimilated with rainfall data also show slight improvements. 1

Lin, Xin↗
NASA NTRS2009

Linear Actuator Has Long Stroke and High Resolution

The term precision linear actuator, direct drive ( PLADD ) refers to a robust linear actuator designed to be capable of repeatedly performing, over a lifetime of the order of 5 to 10 years, positioning maneuvers that include, variously, submicron increments or slews of the order of a centimeter. The PLADD is capable of both long stroke (120 mm) and high resolution (repeatable increments of 20 nm). Unlike precise linear actuators of prior design, the PLADD contains no gears, levers, or hydraulic converters. The PLADD, now at the prototype stage of development, is intended for original use as a coarse-positioning actuator in a spaceborne interferometer. The PLADD could also be adapted to terrestrial applications in which there are requirements for long stroke and high resolution: potential applications include medical imaging and fabrication of semiconductor devices. The PLADD (see figure) includes a commercially available ball-screw actuator driven directly by a commercially available three-phase brushless DC motor. The ball-screw actuator comprises a spring-preloaded ball nut on a ball screw that is restrained against rotation as described below. The motor is coupled directly (that is, without an intervening gear train) to a drive link that, in turn, is coupled to the ball nut. By eliminating the gear train, the direct-drive design eliminates the complexity, backlash, and potential for misalignment associated with a gear train. To prevent inadvertent movement, there is a brake that includes flexured levers compressed against the drive link by preload springs. This is a power-off brake: There are also piezoelectric stacks that can be activated to oppose the springs and push the levers away from the drive link. Hence, power must be applied to the piezoelectric stacks to release the drive link from braking. To help ensure long operational life, all of the mechanical drive components are immersed in an oil bath within hermetically sealed bellows. The outer end of the bellows holds the outer end of the ball screw, thereby preventing rotation of the ball screw. Positioning is controlled by an electronic control system that includes digital and analog subsystems that interact with the motor and brake and with two sensor/encoder units: a Hall-effect-sensor rotation encoder and a linear glass-scale encoder. This system implements a proportional + integral + derivative control algorithm that results in variation of voltage commands to each of the three pairs of windings of the brushless DC motor. In one of two alternative control modes, the voltages are applied to the windings in a trapezoidal commutation scheme on the basis of timing signals obtained from the Hall-effect sensors; this scheme yields relatively coarse positioning - 24 steps per motor revolution. The second control mode involves a sinusoidal commutation scheme in which the output of the linear glass-scale encoder is transposed to rotational increments to yield much finer position feedback - more than 400,000 steps per revolution.

Cook, Brant T.↗
NASA NTRS2014

Real-Time Parameter Estimation Using Output Error

Output-error parameter estimation, normally a post- ight batch technique, was applied to real-time dynamic modeling problems. Variations on the traditional algorithm were investigated with the goal of making the method suitable for operation in real time. Im- plementation recommendations are given that are dependent on the modeling problem of interest. Application to ight test data showed that accurate parameter estimates and un- certainties for the short-period dynamics model were available every 2 s using time domain data, or every 3 s using frequency domain data. The data compatibility problem was also solved in real time, providing corrected sensor measurements every 4 s. If uncertainty corrections for colored residuals are omitted, this rate can be increased to every 0.5 s.

Grauer, Jared A.↗
NASA NTRS2005

Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

A genetic algorithm approach suitable for solving multi-objective problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding Pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the Pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide Pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

Holst, Terry L.↗
NASA NTRSDate not supplied

High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder

Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the QVAE has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the MODIS dataset. Further, we find real-world speedups compared to linear search and demonstrate memory-efficient scaling to half a billion data points.

Data mining, similarity search, quantum machine le↗
NASA NTRS1986

Performance analysis of image processing algorithms for classification of natural vegetation in the mountains of southern California

The earth's forests fix carbon from the atmosphere during photosynthesis. Scientists are concerned that massive forest removals may promote an increase in atmospheric carbon dioxide, with possible global warming and related environmental effects. Space-based remote sensing may enable the production of accurate world forest maps needed to examine this concern objectively. To test the limits of remote sensing for large-area forest mapping, we use Landsat data acquired over a site in the forested mountains of southern California to examine the relative capacities of a variety of popular image processing algorithms to discriminate different forest types. Results indicate that certain algorithms are best suited to forest classification. Differences in performance between the algorithms tested appear related to variations in their sensitivities to spectral variations caused by background reflectance, differential illumination, and spatial pattern by species. Results emphasize the complexity between the land-cover regime, remotely sensed data and the algorithms used to process these data.

Yool, S. R.↗
NASA NTRS2004

Genetic Algorithms Applied to Multi-Objective Aerodynamic Shape Optimization

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of aerodynamic shape optimization problems. Several new features including two variations of a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. A new masking array capability is included allowing any gene or gene subset to be eliminated as decision variables from the design space. This allows determination of the effect of a single gene or gene subset on the pareto optimal solution. Results indicate that the genetic algorithm optimization approach is flexible in application and reliable. The binning selection algorithms generally provide pareto front quality enhancements and moderate convergence efficiency improvements for most of the problems solved.

Holst, Terry L.↗
NASA NTRS1991

An upwind-biased space marching algorithm for supersonic viscous flow

The modifications are documented which were made to the Langley Aerothermodynamic Upwind Relaxation Algorithm which allow it to compute solutions in a space marching manner. The space marching flux is formulated to be either first- or second-order accurate, using Roe's upwind differencing or Symmetric Total Variation Diminishing differencing, respectively. The algorithm solves the thin layer Navier-Stokes equations, and is subject to the same flow restrictions as a parabolized Navier-Stokes solver. Each cross flow plane is locally iterated in time until converged, then marched in space to the next station. The algorithm is tested on a sphere-cone geometry and a geometry which models the windward side of the Space Shuttle Orbiter. Computational results for surface heating are compared to ground based experimental data. In addition, space marching predictions for surface pressure are compared against values from the original algorithm.

Greene, Francis A.↗
NASA NTRS1988

Generalized minimum shift-keying modulation techniques

The simultaneous data demodulation and phase tracking of an MSK signal using the Viterbi algorithm is described and two variations of MSK modulation are studied. The MSK with overlay is a dual rate modulation technique where low-and high-rate data are superimposed on an MSK signal. Here the demodulator uses the Viterbi algorithm to estimate both the low-and high-rate data simultaneously. The MSK with pseudorandom sequence spreading combats intentional or unintentional jamming. A simplified receiver for these spread spectrum MSK signals is found, which takes into consideration the effect of random phase perturbations. The performance of these demodulators is evaluated using transfer function bounds for the bit error probability. It is shown that with a reasonable short overlay period, at a relatively high signal-to-noise ratio (13 dB), there is a small (0.7 dB) loss of performance. For demodulation of the spread spectrum MSK signal, a simplified receiver is derived, and its performance in the presence of continuous jamming is evaluated.

Sadr, Ramin↗
NASA NTRS1994

Groundspeed filtering for CTAS

Ground speed is one of the radar observables which is obtained along with position and heading from NASA Ames Center radar. Within the Center TRACON Automation System (CTAS), groundspeed is converted into airspeed using the wind speeds which CTAS obtains from the NOAA weather grid. This airspeed is then used in the trajectory synthesis logic which computes the trajectory for each individual aircraft. The time history of the typical radar groundspeed data is generally quite noisy, with high frequency variations on the order of five knots, and occasional 'outliers' which can be significantly different from the probable true speed. To try to smooth out these speeds and make the ETA estimate less erratic, filtering of the ground speed is done within CTAS. In its base form, the CTAS filter is a 'moving average' filter which averages the last ten radar values. In addition, there is separate logic to detect and correct for 'outliers', and acceleration logic which limits the groundspeed change in adjacent time samples. As will be shown, these additional modifications do cause significant changes in the actual groundspeed filter output. The conclusion is that the current ground speed filter logic is unable to track accurately the speed variations observed on many aircraft. The Kalman filter logic however, appears to be an improvement to the current algorithm used to smooth ground speed variations, while being simpler and more efficient to implement. Additional logic which can test for true 'outliers' can easily be added by looking at the difference in the a priori and post priori Kalman estimates, and not updating if the difference in these quantities is too large.

Slater, Gary L.↗
NASA NTRS2014

Flight Testing of the Space Launch System (SLS) Adaptive Augmenting Control (AAC) Algorithm on an F/A-18

The Marshall Space Flight Center (MSFC) Flight Mechanics and Analysis Division developed an adaptive augmenting control (AAC) algorithm for launch vehicles that improves robustness and performance on an as-needed basis by adapting a classical control algorithm to unexpected environments or variations in vehicle dynamics. This was baselined as part of the Space Launch System (SLS) flight control system. The NASA Engineering and Safety Center (NESC) was asked to partner with the SLS Program and the Space Technology Mission Directorate (STMD) Game Changing Development Program (GCDP) to flight test the AAC algorithm on a manned aircraft that can achieve a high level of dynamic similarity to a launch vehicle and raise the technology readiness of the algorithm early in the program. This document reports the outcome of the NESC assessment.

Dennehy, Cornelius J.↗
NASA NTRSDate not supplied

Contact Multigraph Routing: Overview and Implementation

In Delay Tolerant Networking (DTN), the standard routing algorithm used to navigate time-varying networks has been Contact Graph Routing (CGR). In CGR, a globally distributed list of contacts, periods during which two DTN nodes may communicate, is used to construct a contact graph, in which contacts are vertices. A version of Dijkstra’s algorithm can then be used to find paths through this model of the timevarying network. However, since contact graphs may be large compared to the network, potentially growing with the square of the number of network nodes and linearly with the time interval represented, the resulting algorithm does not scale well with the size of the network or time. Any improvement to the routing algorithm will bring significant returns to scale. In a previous paper, we briefly introduced an alternative to the contact graph model for routing. This alternative model is based on a multigraph (a graph in which there may be multiple edges between a pair of vertices) where vertices represent network nodes instead of contacts. A version of Dijkstra’s algorithm in these multigraph models reduces the time needed to perform the same routing computations done in the existing CGR algorithm. Moreover, a modified version of Yen’s algorithm for multigraphs is included. Our variation of CGR, which we call Contact Multigraph Routing (CMR), provides an in-line replacement for the previously used pathfinding algorithms. This paper describes an implementation created based on the CMR approach, and experimental comparisons to traditional CGR are given. In addition, we explore some additional modifications to the routing pipeline traditionally assumed in CGR. These modifications range from the theoretical to the practical in terms of size and scope. We step forward our understanding of sheaftheoretic networking and describe how to model the routing pipeline using sheaves. We detail some enhanced route selection criteria that addresses some of the added complexity of DTNbased systems. We also include a future works section on future improvements and implementations that would be of service to the broader DTN community.

contact graph routing↗
NASA NTRS2002

TOMS UV Algorithm: Problems and Enhancements

Satellite instruments provide global maps of surface ultraviolet (UV) irradiance by combining backscattered radiance measurements with radiative transfer models. The models are limited by uncertainties in input parameters of the atmosphere and the surface. We evaluate the effects of possible enhancements of the current Total Ozone Mapping Spectrometer (TOMS) surface UV irradiance algorithm focusing on effects of diurnal variation of cloudiness and improved treatment of snow/ice. The emphasis is on comparison between the results of the current (version 1) TOMS UV algorithm and each of the changes proposed. We evaluate different approaches for improved treatment of pixel average cloud attenuation, with and without snow/ice on the ground. In addition to treating clouds based only on the measurements at the local time of the TOMS observations, the results from other satellites and weather assimilation models can be used to estimate attenuation of the incident UV irradiance throughout the day. A new method is proposed to obtain a more realistic treatment of snow covered terrain. The method is based on a statistical relation between UV reflectivity and snow depth. The new method reduced the bias between the TOMS UV estimations and ground-based UV measurements for snow periods. The improved (version 2) algorithm will be applied to re-process the existing TOMS UV data record (since 1978) and to the future satellite sensors (e.g., Quik/TOMS, GOME, OMI on EOS/Aura and Triana/EPIC).

Krotkov, Nickolay↗
NASA NTRS1991

The TOPSAR interferometric radar topographic mapping instrument

We have augmented the NASA DC-8 Airborne Synthetic Aperture Radar (AIRSAR) instrument with a pair of C-band antennas displaced across the track to form an interferometer sensitive to topographic variations of the Earth's surface. The antennas were developed by Alenia Spazio under the sponsorship of the Italian Space Agency (ASI), and the AIRSAR instrument and modifications to it supporting TOPSAR were sponsored by NASA. A new data processor was developed at JPL for producing the topographic maps. As of May 1991, one engineering flight line over San Francisco, CA was reduced to a cartographically rectified topographic map. Analysis of the results indicates that statistical errors are in the range of 2 to 4 m, while systematic effects due to aircraft motion are in the range of 6 to 12 m. Future aircraft motion compensation algorithms should reduce the systematic variations to near zero, while the statistical errors could likely be reduced to 2 m or less with some processor improvements.

Zebker, Howard A.↗
NASA NTRS1996

Land Surface Temperature Measurements form EOS MODIS Data

We have developed a physics-based land-surface temperature (LST) algorithm for simultaneously retrieving surface band-averaged emissivities and temperatures from day/night pairs of MODIS (Moderate Resolution Imaging Spectroradiometer) data in seven thermal infrared bands. The set of 14 nonlinear equations in the algorithm is solved with the statistical regression method and the least-squares fit method. This new LST algorithm was tested with simulated MODIS data for 80 sets of band-averaged emissivities calculated from published spectral data of terrestrial materials in wide ranges of atmospheric and surface temperature conditions. Comprehensive sensitivity and error analysis has been made to evaluate the performance of the new LST algorithm and its dependence on variations in surface emissivity and temperature, upon atmospheric conditions, as well as the noise-equivalent temperature difference (NE(Delta)T) and calibration accuracy specifications of the MODIS instrument. In cases with a systematic calibration error of 0.5%, the standard deviations of errors in retrieved surface daytime and nighttime temperatures fall between 0.4-0.5 K over a wide range of surface temperatures for mid-latitude summer conditions. The standard deviations of errors in retrieved emissivities in bands 31 and 32 (in the 10-12.5 micrometer IR spectral window region) are 0.009, and the maximum error in retrieved LST values falls between 2-3 K. Several issues related to the day/night LST algorithm (uncertainties in the day/night registration and in surface emissivity changes caused by dew occurrence, and the cloud cover) have been investigated. The LST algorithms have been validated with MODIS Airborne Simulator (MAS) dada and ground-based measurement data in two field campaigns conducted in Railroad Valley playa, NV in 1995 and 1996. The MODIS LST version 1 software has been delivered.

Wan, Zhengming↗
NASA NTRS2011

Observability and Estimation of Distributed Space Systems via Local Information-Exchange Networks

Spacecraft formation flying involves the coordination of states among multiple spacecraft through relative sensing, inter-spacecraft communication, and control. Most existing formation-flying estimation algorithms can only be supported via highly centralized, all-to-all, static relative sensing. New algorithms are proposed that are scalable, modular, and robust to variations in the topology and link characteristics of the formation exchange network. These distributed algorithms rely on a local information exchange network, relaxing the assumptions on existing algorithms. Distributed space systems rely on a signal transmission network among multiple spacecraft for their operation. Control and coordination among multiple spacecraft in a formation is facilitated via a network of relative sensing and interspacecraft communications. Guidance, navigation, and control rely on the sensing network. This network becomes more complex the more spacecraft are added, or as mission requirements become more complex. The observability of a formation state was observed by a set of local observations from a particular node in the formation. Formation observability can be parameterized in terms of the matrices appearing in the formation dynamics and observation matrices. An agreement protocol was used as a mechanism for observing formation states from local measurements. An agreement protocol is essentially an unforced dynamic system whose trajectory is governed by the interconnection geometry and initial condition of each node, with a goal of reaching a common value of interest. The observability of the interconnected system depends on the geometry of the network, as well as the position of the observer relative to the topology. For the first time, critical GN&C (guidance, navigation, and control estimation) subsystems are synthesized by bringing the contribution of the spacecraft information-exchange network to the forefront of algorithmic analysis and design. The result is a formation estimation algorithm that is modular and robust to variations in the topology and link properties of the underlying formation network.

Fathpour, Nanaz↗
NASA NTRS2020

Development of Global Operational Snow Analysis at the US Air Force 557th Weather Wing

The outdated SNODEP snow depth retrieval algorithm is replaced by the Foster et al. (1997; 2005) approach, which considers the effects of variations in forest cover. The simple blending algorithm (IDW) is replaced by the Bratseth scheme, a successive correction algorithm that converges to the solution provided by Optimal Interpolation (OI). Outdated quality control datasets are updated and quality control algorithms are reorganized to ensure the performance of the snow analysis. The spatial resolution of snow and ice estimates are increased from 25-km to 10-km.USAF-SI are fully integrated into the global operational land analysis configuration at the USAF 557th WW.

Yoon, Yeosang↗