Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic differentiation”

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 235 records · Page 13
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 NTRS1994

Software for Data Analysis with Graphical Models

Probabilistic graphical models are being used widely in artificial intelligence and statistics, for instance, in diagnosis and expert systems, as a framework for representing and reasoning with probabilities and independencies. They come with corresponding algorithms for performing statistical inference. This offers a unifying framework for prototyping and/or generating data analysis algorithms from graphical specifications. This paper illustrates the framework with an example and then presents some basic techniques for the task: problem decomposition and the calculation of exact Bayes factors. Other tools already developed, such as automatic differentiation, Gibbs sampling, and use of the EM algorithm, make this a broad basis for the generation of data analysis software.

Buntine, Wray L.↗
NASA NTRSDate not supplied

Progress Towards a Common CERES Cloud Mask Algorithm for MODIS and VIIRS: Evaluation using CALIOP Data

For over two decades The Clouds and the Earth’s Radiant Energy System (CERES) project has endeavored to produce a long-term global climate data record for detecting changes in the Earth’s radiation budget and to improve understanding of how clouds contribute to those changes. CERES incorporates cloud information derived from passive narrowband satellite imaging radiometers, and over the course of the project different instruments have contributed to this effort, namely the Moderate Resolution Imaging Spectroradiometer (MODIS) and the Visible Infrared Imaging Radiometer Suite (VIIRS).Cloud properties have been derived from MODIS on the Aqua satellite for CERES since 2002,and VIIRS on the NOAA-20 satellite launched in 2017 will continue the cloud record once Aqua-MODIS reaches the end of its operational lifetime. However, MODIS and VIIRS have different spectral capabilities and characteristics which complicates our ability to seamlessly transition the record from MODIS to VIIRS. This study evaluates some of the recent algorithm modifications incorporated by the CERES Cloud Working Group towards developing a unified cloud mask algorithm for MODIS and VIIRS that utilizes a set of spectral bands common to both instruments. Cloud-Aerosol Lidar with Orthogonal Polarization (CALIOP) data products are used to evaluate MODIS and VIIRS regional cloud fraction estimates and identify areas where improvements can be made. The cloud mask algorithm relies on computed estimates of cloud-free top-of-atmosphere radiances to differentiate cloudy and cloud-free imager pixels. The unified cloud mask algorithm currently under development uses a reduced number of spectral bands common to both MODIS and VIIRS and so relies on the accuracy of these simulated cloud-free radiances more heavily than predecessor algorithms, i.e., the CERES Edition 4 cloud mask, which use as much spectral information as available on each imager with less consideration for cross-platform consistency. Our validation strategy using CALIOP data is also described. The CALIOP observations are critical for assessing cloud detection accuracies and for independently confirming cloud-free conditions which enables a more robust evaluation of the simulated cloud-free radiances for biases due to factors such as view angle and the spectral dependence of water vapor absorption. These effects are known to differ for the two satellite instruments. Comparisons of MODIS and VIIRS cloud fractions are presented in context with estimates from CALIOP and from the CERES Edition 4 cloud mask algorithm to gauge current progress in developing accurate and consistent MODIS and VIIRS cloud properties for CERES.

CERES↗
NASA NTRS1994

Data Analysis with Graphical Models: Software Tools

Probabilistic graphical models (directed and undirected Markov fields, and combined in chain graphs) are used widely in expert systems, image processing and other areas as a framework for representing and reasoning with probabilities. They come with corresponding algorithms for performing probabilistic inference. This paper discusses an extension to these models by Spiegelhalter and Gilks, plates, used to graphically model the notion of a sample. This offers a graphical specification language for representing data analysis problems. When combined with general methods for statistical inference, this also offers a unifying framework for prototyping and/or generating data analysis algorithms from graphical specifications. This paper outlines the framework and then presents some basic tools for the task: a graphical version of the Pitman-Koopman Theorem for the exponential family, problem decomposition, and the calculation of exact Bayes factors. Other tools already developed, such as automatic differentiation, Gibbs sampling, and use of the EM algorithm, make this a broad basis for the generation of data analysis software.

Buntine, Wray L.↗
NASA NTRS1991

An all digital implementation of a modified Hamming net for video compression with prediction and quantization circuits

The hardware and algorithms used to vector quantize (VQ) predicted pixel intensity differences for real-time video compression are described. The hardware is designed for rapid vector quantization performance, which entails the development of application-specific associative memory circuits. A modified DPCM algorithm is originally examined to determine how neural circuitry could enhance its operation. It was determined that quantization and encoding could be improved by consolidating these two functions into one, and by increasing the amount of information (i.e. number of pixels) quantized at a time. The result is a predictive scheme that vector quantizes differential values. Some of the disadvantages of VQ algorithms are solved using associative memories. The video compression algorithm and the associative memory design are described.

Kaul, Richard↗
NASA NTRS2001

Retrieval of Polar Stratospheric Cloud Microphysical Properties from Lidar Measurements: Dependence on Particle Shape Assumptions

A retrieval algorithm has been developed for the microphysical analysis of polar stratospheric cloud (PSC) optical data obtained using lidar instrumentation. The parameterization scheme of the PSC microphysical properties allows for coexistence of up to three different particle types with size-dependent shapes. The finite difference time domain (FDTD) method has been used to calculate optical properties of particles with maximum dimensions equal to or less than 2 mu m and with shapes that can be considered more representative of PSCs on the scale of individual crystals than the commonly assumed spheroids. Specifically. these are irregular and hexagonal crystals. Selection of the optical parameters that are input to the inversion algorithm is based on a potential data set such as that gathered by two of the lidars on board the NASA DC-8 during the Stratospheric Aerosol and Gas Experiment 0 p (SAGE) Ozone Loss Validation experiment (SOLVE) campaign in winter 1999/2000: the Airborne Raman Ozone and Temperature Lidar (AROTEL) and the NASA Langley Differential Absorption Lidar (DIAL). The 0 microphysical retrieval algorithm has been applied to study how particle shape assumptions affect the inversion of lidar data measured in leewave PSCs. The model simulations show that under the assumption of spheroidal particle shapes, PSC surface and volume density are systematically smaller than the FDTD-based values by, respectively, approximately 10-30% and approximately 5-23%.

Reichardt, J.↗
NASA NTRS1973

A square-root data array solution of the continuous-discrete filtering problem

The Dyer-McReynolds (1969) discrete square-root filtering algorithm is extended to accommodate continuous dynamics. Differential equations are given to represent the time evolution of the filter data array. These equations are nonlinear, but it is shown that the nonlinearities act to enhance the stability of the solution.

Bierman, G. J.↗
NASA NTRS1977

The separated turbulent boundary layer over a wavy wall

A study and application of the fourth order spline collocation procedure, numerical solution of boundary layer like differential equations, is presented. A simple inversion algorithm for the simultaneous solution of the resulting difference equations is given. Particular attention is focused on the boundary condition representation for the spline second derivative approximations. Solutions using the spline procedure, as well as the three point finite difference method, are presented for several model problems in order to assess and improve the spline numerical scheme. Application of the resulting algorithm to the incompressible laminar self similar boundary layer equations is presented.

Polak, A.↗
NASA NTRS1981

Some experiments on explicit boundary algorithms

Experiments done with the aim of improving the accuracy and efficiency of explicit boundary algorithms for quasilinear hyperbolic systems of partial differential equations in matrix form are described. Existing methods are criticized and a new approach to the problem is presented.

Forester, K.↗
NASA NTRS1978

A solution procedure for behavior of thick plates on a nonlinear foundation and postbuckling behavior of long plates

Approximate solutions for three nonlinear orthotropic plate problems are presented: (1) a thick plate attached to a pad having nonlinear material properties which, in turn, is attached to a substructure which is then deformed; (2) a long plate loaded in inplane longitudinal compression beyond its buckling load; and (3) a long plate loaded in inplane shear beyond its buckling load. For all three problems, the two dimensional plate equations are reduced to one dimensional equations in the y-direction by using a one dimensional trigonometric approximation in the x-direction. Each problem uses different trigonometric terms. Solutions are obtained using an existing algorithm for simultaneous, first order, nonlinear, ordinary differential equations subject to two point boundary conditions. Ordinary differential equations are derived to determine the variable coefficients of the trigonometric terms.

Stein, M.↗
NASA NTRS1984

A review of spectral methods

An outline for spectral methods for partial differential equations is presented. The basic spectral algorithm is defined, collocation are emphasized and the main advantage of the method, the infinite order of accuracy in problems with smooth solutions are discussed. Examples of theoretical numerical analysis of spectral calculations are presented. An application of spectral methods to transonic flow is presented. The full potential transonic equation is among the best understood among nonlinear equations.

Lustman, L.↗
NASA NTRS1986

On compactness of admissible parameter sets: Convergence and stability in inverse problems for distributed parameter systems

A series of numerical examples is reported and several algorithms compared for estimation of coefficients in differential equation models. Unconstrained, constrained and Tikhonov regularization methods are tested for their behavior with regard to both convergence (of approximation methods for the states and parameters) and stability (continuity of the estimates with respect to perturbations in the data or observed states).

Banks, H. T.↗
NASA NTRS1986

Concurrent processing in nonlinear structural stability

A concurrent processing algorithm is developed for materially nonlinear stability analysis of imperfect columns with biaxial partial rotational end restraints. The algorithm for solving the governing nonlinear ordinary differential equations is implemented on a multiprocessor computer called the 'Finite Element Machine', developed at the NASA Langley Research Center. Numerical results are obtained on up to nine concurrent processors. A substantial computational gain is achieved in using the parallel processing approach.

Darbhamulla, S. P.↗
NASA NTRS1991

Multiple shooting algorithms for jump-discontinuous problems in optimal control and estimation

Multiple shooting algorithms are developed for jump-discontinuous two-point boundary value problems arising in optimal control and optimal estimation. Examples illustrating the origin of such problems are given to motivate the development of the solution algorithms. The algorithms convert the necessary conditions, consisting of differential equations and transversality conditions, into algebraic equations. The solution of the algebraic equations provides exact solutions for linear problems. The existence and uniqueness of the solution are proved.

Mook, D. J.↗
NASA NTRS1992

Digital data registration and differencing compression system

A process for x ray registration and differencing results in more efficient compression is discussed. Differencing of registered modeled subject image with a modeled reference image forms a differential image for compression with conventional compression algorithms. Obtention of a modeled reference image includes modeling a relatively unrelated standard reference image upon a three dimensional model, which three dimensional model is also used to model the subject image for obtaining the modeled subject image. The registration process of the modeled subject image and modeled reference image translationally correlates such modeled images for resulting correlation thereof in spatial and spectral dimensions. Prior to compression, a portion of the image falling outside a designated area of interest may be eliminated, for subsequent replenishment with a standard reference image. The compressed differenced image may be subsequently transmitted and/or stored, for subsequent decompression and addition to a standard reference image so as to form a reconstituted or approximated subject image at either remote location and/or at a later moment in time. Overall effective compression ratios of 100:1 are possible for thoracic x ray digital images.

Ransford, Gary A.↗
NASA NTRS2020

Squash-Box Feasibility Driven Differential Dynamic Programming

Recently, Differential Dynamic Programming (DDP) and other similar algorithms have become the solvers of choice when performing non-linear Model Predictive Control (nMPC) with modern robotic devices. The reason is that they have a lower computational cost per iteration when compared with off-the-shelf Non-Linear Programming (NLP) solvers, which enables its online operation. However, they cannot handle constraints, and are known to have poor convergence capabilities. In this paper, we propose a method to solve the optimal control problem with control bounds through a squashing function (i.e., a sigmoid, which is bounded by construction). It has been shown that a naive use of squashing functions damage the convergence rate. To tackle this, we first propose to add a quadratic barrier that avoids the difficulty of the plateau produced by the sigmoid. Second, we add an outer loop that adapts both the sigmoid and the barrier; it makes the optimal control problem with the squashing function converge to the original control-bounded problem. To validate our method, we present simulation results for different types of platforms including a multi-rotor, a biped, a quadruped and a humanoid robot.

Navarro, Angel Santamaria↗