Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “generalized algorithm”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 505 records · Page 28
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles

The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.

optimization↗
NASA NTRS2004

Ozone and Aerosol Retrieval from Backscattered Ultraviolet Radiation

In this presentation we will discuss the techniques to estimate total column ozone and aerosol absorption optical depth from the measurements of backscattered ultraviolet (buv) radiation. The total ozone algorithm has been used to create a unique record of the ozone layer, spanning more than 3 decades, from a series of instruments (BUV, SBUV, TOMS, SBUV/2) flown on NASA, NOAA, Japanese and Russian satellites. We will discuss how this algorithm can be considered a generalization of the well-known Dobson/Brewer technique that has been used to process data from ground-based instruments for many decades, and how it differs from the DOAS techniques that have been used to estimate vertical column densities of a host of trace gases from data collected by GOME and SCIAMACHY instruments. The BUV aerosol algorithm is most suitable for the detection of UV absorbing aerosols (smoke, desert dust, volcanic ash) and is the only technique that can detect aerosols embedded in clouds. This algorithm has been used to create a quarter century record of aerosol absorption optical depth using the BUV data collected by a series of TOMS instruments. We will also discuss how the data from the OM1 instrument launched on July 15,2004 will be combined with data from MODIS and CALIPSO lidar data to enhance the accuracy and information content of satellite-derived aerosol measurements. The OM1 and MODIS instruments are currently flying on EOS Aura and EOS Aqua satellites respectively, part of a constellation of satellites called the "A-train". The CALIPSO satellite is expected to join this constellation in mid 2005.

Bhartia, Pawan K.↗
NASA NTRS2012

Ozone and Aerosol Retrieval from Backscattered Ultraviolet Radiation

In this presentation we will discuss the techniques to estimate total column ozone and aerosol absorption optical depth from the measurements of back scattered ultraviolet (buv) radiation. The total ozone algorithm has been used to create a unique record of the ozone layer, spanning more than 3 decades, from a series of instruments (BUV, SBUV, TOMS, SBUV/2) flown on NASA, NOAA, Japanese and Russian satellites. We will discuss how this algorithm can be considered a generalization of the well-known Dobson/Brewer technique that has been used to process data from ground-based instruments for many decades, and how it differs from the DOAS techniques that have been used to estimate vertical column densities of a host of trace gases from data collected by GOME and SCIAMACHY instruments. The buv aerosol algorithm is most suitable for the detection of UV absorbing aerosols (smoke, desert dust, volcanic ash) and is the only technique that can detect aerosols embedded in clouds. This algorithm has been used to create a quarter century record of aerosol absorption optical depth using the buv data collected by a series of TOMS instruments. We will also discuss how the data from the OMI instrument launched on July 15, 2004 will be combined with data from MODIS and CALIPSO lidar data to enhance the accuracy and information content of satellite-derived aerosol measurements. The OMI and MODIS instruments are currently flying on EOS Aura and EOS Aqua satellites respectively, part of a constellation of satellites called the "A-train".

Bhartia, Pawan K.↗
NASA NTRS1982

A concept for a fuel efficient flight planning aid for general aviation

A core equation for estimation of fuel burn from path profile data was developed. This equation was used as a necessary ingredient in a dynamic program to define a fuel efficient flight path. The resultant algorithm is oriented toward use by general aviation. The pilot provides a description of the desired ground track, standard aircraft parameters, and weather at selected waypoints. The algorithm then derives the fuel efficient altitudes and velocities at the waypoints.

Collins, B. P.↗
NASA NTRS1999

The Structure and Evolution of LOCBURST: The BATSE Burst Location Algorithm

The gamma-ray burst (GRB) location algorithm used to produce the BATSE GRB locations is described. The general flow of control of the current location algorithm is presented, and the significant properties of the various physical inputs required are identified. The development of the burst location algorithm during the releases of the BATSE IB, 2B, and 3B GRB catalogs is presented so that the reasons for the differences in the positions and error estimates between the catalogs can be understood. In particular, differences between the 2B and 3B locations are discussed for events that have moved significantly and the reasons for the changes explained. The locations of bursts located independently by the interplanetary network (IPN) are used to illustrate the effect on burst location accuracy of various components of the algorithm. IPN data and locations from other gamma-ray instruments are used to calculate estimates of the systematic errors on BATSE burst locations.

Pendleton, Geoffrey N.↗
NASA NTRS1998

The Structure of Evolution LOCBURST: The BATSE Burst Location Algorithm

The gamma-ray bursts (GRB) location algorithm used to produce the BATSE GRB locations is described. The general flow of control of the current location algorithm is presented and the significant properties of the various physical inputs required are identified. The development of the burst location algorithm during the releases of the BATSE 1B, 2B, and 3B gamma-ray burst catalogs is presented so that the reasons for the differences in the positions and error estimates between the catalogs can be understood. In particular, differences between the 2B and 3B locations are discussed for events that have moved significantly and the reasons for the changes explained. The locations of bursts located independently by the interplanetary network are used to illustrate the effect on burst location accuracy of various components of the algorithm. IPN data as well as locations from other gamma-ray instruments are used to calculate estimates of the systematic errors on BATSE burst locations.

Pendleton, Geoffrey N.↗
NASA NTRSDate not supplied

Sheaf Theoretic Models for Routing in Delay Tolerant Networks

One key to communications scalability is routing; as such the goal of this paper is to build upon successful efforts towards general routing for space-based networks. With the ever-increasing accessibility of space, the number of assets is increasing, which becomes a critical communications burden in terms of scheduling, spectrum allocation, and resource allocation. In order to mitigate these concerns, a true networking approach is necessary; a standard approach for space systems is Delay Tolerant Networking (DTN). For DTN to be a meaningful answer to the Solar System Internet (SSI) question, DTN must offer meaningful routing solutions that span the heterogeneous collection of links and nodes. This, in turn, depends on the general structure of these disconnected networks -- a structure that remains largely unknown. In ground communications networks, routing decisions are made based on several pathfinding algorithms working in tandem. In previous work, we modeled Dijkstra's pathfinding algorithm using sheaves and provided a more general framework for determining paths using sheaves over graphs. Continuing our sheaf-theoretic approach, we introduce here an expansion of our pathfinding sheaf to handle more general information, and we expand on additional pathfinding algorithms that can be represented using sheaves. Moreover, we demonstrate means of combining multiple algorithms into a single sheaf structure so that changes of scale can be presented in the language of sheaves. In addition, space communications networks rely upon radio transmitter antennas which can establish broadcast and multicast communications options, rather than the primarily unicast options available to wired networks. Last year, we also introduced a multicast routing sheaf for presenting broadcast, unicast, and multicast communications over a graph. Extending that work, we also introduce queuing sheaves so that we can blend these communications options together to simulate a variety of routing options across space networks. In addition, we include examples to illustrate the applicability of this abstract theory to routing in disconnected networks.

Robert Short↗
NASA NTRS2015

Safety Case Patterns: Theory and Applications

We develop the foundations for a theory of patterns of safety case argument structures, clarifying the concepts involved in pattern specification, including choices, labeling, and well-founded recursion. We specify six new patterns in addition to those existing in the literature. We give a generic way to specify the data required to instantiate patterns and a generic algorithm for their instantiation. This generalizes earlier work on generating argument fragments from requirements tables. We describe an implementation of these concepts in AdvoCATE, the Assurance Case Automation Toolset, showing how patterns are defined and can be instantiated. In particular, we describe how our extended notion of patterns can be specified, how they can be instantiated in an interactive manner, and, finally, how they can be automatically instantiated using our algorithm.

Safety Assurance↗
NASA NTRS2022

A Unifying View of Estimation and Control Using Belief Propagation With Application to Path Planning

The use of estimation techniques on stochastic models to solve control problems is an emerging paradigm that falls under the rubric of Active Inference (AI) and Control as Inference (CAI). In this work, we use probability propagation on factor graphs to show that various algorithms proposed in the literature can be seen as specific composition rules in a factor graph. We show how this unified approach, presented both in probability space and in log of the probability space, provides a very general framework that includes the Sum-product, the Max-product, Dynamic programming and mixed Reward/Entropy criteria-based algorithms. The framework also expands algorithmic design options that lead to new smoother or sharper policy distributions. We propose original recursions such as: a generalized Sum/Max-product algorithm, a Smooth Dynamic programming algorithm and a modified versions of the Reward/Entropy algorithm. The discussion is carried over with reference to a path planning problem where the recursions that arise from various cost functions, although they may appear similar in scope, bear noticeable differences. We provide a comprehensive table of composition rules and a comparison through simulations, first on a synthetic small grid with a single goal with obstacles, and then on a grid extrapolated from a real-world scene with multiple goals and a semantic map.

Francesco A. N. Palmieri↗
NASA NTRS1989

A survey of upwind methods for flows with equilibrium and non-equilibrium chemistry and thermodynamics

Several versions of flux-vector split and flux-difference split algorithms were compared with regard to general applicability and complexity. Test computations were performed using curve-fit equilibrium air chemistry for an M = 5 high-temperature inviscid flow over a wedge, and an M = 24.5 inviscid flow over a blunt cylinder for test computations; for these cases, little difference in accuracy was found among the versions of the same flux-split algorithm. For flows with nonequilibrium chemistry, the effects of the thermodynamic model on the development of flux-vector split and flux-difference split algorithms were investigated using an equilibrium model, a general nonequilibrium model, and a simplified model based on vibrational relaxation. Several numerical examples are presented, including nonequilibrium air chemistry in a high-temperature shock tube and nonequilibrium hydrogen-air chemistry in a supersonic diffuser.

Grossman, B.↗
NASA NTRS1992

Sub-band/transform compression of video sequences

The progress on compression of video sequences is discussed. The overall goal of the research was the development of data compression algorithms for high-definition television (HDTV) sequences, but most of our research is general enough to be applicable to much more general problems. We have concentrated on coding algorithms based on both sub-band and transform approaches. Two very fundamental issues arise in designing a sub-band coder. First, the form of the signal decomposition must be chosen to yield band-pass images with characteristics favorable to efficient coding. A second basic consideration, whether coding is to be done in two or three dimensions, is the form of the coders to be applied to each sub-band. Computational simplicity is of essence. We review the first portion of the year, during which we improved and extended some of the previous grant period's results. The pyramid nonrectangular sub-band coder limited to intra-frame application is discussed. Perhaps the most critical component of the sub-band structure is the design of bandsplitting filters. We apply very simple recursive filters, which operate at alternating levels on rectangularly sampled, and quincunx sampled images. We will also cover the techniques we have studied for the coding of the resulting bandpass signals. We discuss adaptive three-dimensional coding which takes advantage of the detection algorithm developed last year. To this point, all the work on this project has been done without the benefit of motion compensation (MC). Motion compensation is included in many proposed codecs, but adds significant computational burden and hardware expense. We have sought to find a lower-cost alternative featuring a simple adaptation to motion in the form of the codec. In sequences of high spatial detail and zooming or panning, it appears that MC will likely be necessary for the proposed quality and bit rates.

Sauer, Ken↗
NASA NTRS1976

Flux-corrected transport techniques for transient calculations of strongly shocked flows

New flux-corrected transport algorithms are described for solving generalized continuity equations. These techniques were developed by requiring that the finite difference formulas used ensure positivity for an initially positive convected quantity. Thus FCT is particularly valuable for fluid-like problems with strong gradients or shocks. Repeated application of the same subroutine to mass, momentum, and energy conservation equations gives a simple solution of the coupled time-dependent equations of ideal compressible fluid dynamics without introducing an artificial viscosity. FCT algorithms span Eulerian, sliding-rezone, and Lagrangian finite difference grids in several coordinate systems. The latest FCT techniques are fully vectorized for parallel/pipeline processing.

Boris, J. P.↗
NASA NTRS2016

Moderate Resolution Imaging Spectroradiometer (MODIS) MOD21 Land Surface Temperature and Emissivity Algorithm Theoretical Basis Document

This document outlines the theory and methodology for generating the Moderate Resolution Imaging Spectroradiometer (MODIS) Level-2 daily daytime and nighttime 1-km land surface temperature (LST) and emissivity product using the Temperature Emissivity Separation (TES) algorithm. The MODIS-TES (MOD21_L2) product, will include the LST and emissivity for three MODIS thermal infrared (TIR) bands 29, 31, and 32, and will be generated for data from the NASA-EOS AM and PM platforms. This is version 1.0 of the ATBD and the goal is maintain a 'living' version of this document with changes made when necessary. The current standard baseline MODIS LST products (MOD11*) are derived from the generalized split-window (SW) algorithm (Wan and Dozier 1996), which produces a 1-km LST product and two classification-based emissivities for bands 31 and 32; and a physics-based day/night algorithm (Wan and Li 1997), which produces a 5-km (C4) and 6-km (C5) LST product and emissivity for seven MODIS bands: 20, 22, 23, 29, 31-33.

Hulley, G.↗
NASA NTRS2012

MODIS MOD21 Land Surface Temperature and Emissivity Algorithm Theoretical Basis Document

This document outlines the theory and methodology for generating the Moderate Resolution Imaging Spectroradiometer (MODIS) Level-2 daily daytime and nighttime 1-km land surface temperature (LST) and emissivity product using the Temperature Emissivity Separation (TES) algorithm. The MODIS-TES (MOD21_L2) product, will include the LST and emissivity for three MODIS thermal infrared (TIR) bands 29, 31, and 32, and will be generated for data from the NASA-EOS AM and PM platforms. This is version 1.0 of the ATBD and the goal is maintain a ‘living’ version of this document with changes made when necessary. The current standard baseline MODIS LST products (MOD11*) are derived from the generalized split-window (SW) algorithm (Wan and Dozier 1996), which produces a 1-km LST product and two classification-based emissivities for bands 31 and 32; and a physics-based day/night algorithm (Wan and Li 1997), which produces a 5-km (C4) and 6-km (C5) LST product and emissivity for seven MODIS bands: 20, 22, 23, 29, 31–33

Hughes, Christopher↗
NASA NTRS1989

Progress on a Taylor weak statement finite element algorithm for high-speed aerodynamic flows

A new finite element numerical Computational Fluid Dynamics (CFD) algorithm has matured to the point of efficiently solving two-dimensional high speed real-gas compressible flow problems in generalized coordinates on modern vector computer systems. The algorithm employs a Taylor Weak Statement classical Galerkin formulation, a variably implicit Newton iteration, and a tensor matrix product factorization of the linear algebra Jacobian under a generalized coordinate transformation. Allowing for a general two-dimensional conservation law system, the algorithm has been exercised on the Euler and laminar forms of the Navier-Stokes equations. Real-gas fluid properties are admitted, and numerical results verify solution accuracy, efficiency, and stability over a range of test problem parameters.

Baker, A. J.↗
NASA NTRS1987

A modern control theory based algorithm for control of the NASA/JPL 70-meter antenna axis servos

A digital computer-based state variable controller was designed and applied to the 70-m antenna axis servos. The general equations and structure of the algorithm and provisions for alternate position error feedback modes to accommodate intertarget slew, encoder referenced tracking, and precision tracking modes are descibed. Development of the discrete time domain control model and computation of estimator and control gain parameters based on closed loop pole placement criteria are discussed. The new algorithm was successfully implemented and tested in the 70-m antenna at Deep Space Network station 63 in Spain.

Hill, R. E.↗
NASA NTRS2019

Application of High-Dimensional Fuzzy K-Means Cluster Analysis to CALIOP/CALIPSO Version 4.1 Cloud-Aerosol Discrimination

This study applies fuzzy k-means (FKM) cluster analyses to a subset of the parameters reported in the CALIPSO lidar level 2 data products in order to classify the layers detected as either clouds or aerosols. The results obtained are used to assess the reliability of the cloud–aerosol discrimination (CAD) scores reported in the version 4.1 release of the CALIPSO data products. FKM is an unsupervised learning algorithm, whereas the CALIPSO operational CAD algorithm (COCA) takes a highly supervised approach. Despite these substantial computational and architectural differences, our statistical analyses show that the FKM classifications agree with the COCA classifications for more than 94 % of the cases in the troposphere. This high degree of similarity is achieved because the lidar-measured signatures of the majority of the clouds and the aerosols are naturally distinct, and hence objective methods can independently and effectively separate the two classes in most cases. Classification differences most often occur in complex scenes (e.g., evaporating water cloud filaments embedded in dense aerosol) or when observing diffuse features that occur only intermittently (e.g., volcanic ash in the tropical tropopause layer). The two methods examined in this study establish overall classification correctness boundaries due to their differing algorithm uncertainties. In addition to comparing the outputs from the two algorithms, analysis of sampling, data training, performance measurements, fuzzy linear discriminants, defuzzification, error propagation, and key parameters in feature type discrimination with the FKM method are further discussed in order to better understand the utility and limits of the application of clustering algorithms to space lidar measurements. In general, we find that both FKM and COCA classification uncertainties are only minimally affected by noise in the CALIPSO measurements, though both algorithms can be challenged by especially complex scenes containing mixtures of discrete layer types. Our analysis results show that attenuated backscatter and color ratio are the driving factors that separate water clouds from aerosols; backscatter intensity, depolarization, and mid-layer altitude are most useful in discriminating between aerosols and ice clouds; and the joint distribution of backscatter intensity and depolarization ratio is critically important for distinguishing ice clouds from water clouds.

Zeng, Shan↗
NASA NTRS1996

Absorption of Sunlight by Water Vapor in Cloudy Conditions: A Partial Explaination for the Cloud Absorption Anomaly

The atmospheric radiative transfer algorithms used in most global general circulation models underestimate the globally-averaged solar energy absorbed by cloudy atmospheres by up to 25 Wm(sup -2)...Here, a sophisticated atmospheric radiative transfer model was used to provide a more comprehensive description of the physical processes that contribute to the absorption of solar radiation by the Earth's atmosphere.

absorption transfer algorithms circulation models ↗