Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization 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 1,315 records · Page 73
All sourcesNASA NTRSDOE OSTI
NASA NTRS1998

Optimal Design of General Stiffened Composite Circular Cylinders for Global Buckling with Strength Constraints

A design strategy for optimal design of composite grid-stiffened cylinders subjected to global and local buckling constraints and, strength constraints is developed using a discrete optimizer based on a genetic algorithm. An improved smeared stiffener theory is used for the global analysis. Local buckling of skin segments are assessed using a Rayleigh-Ritz method that accounts for material anisotropy. The local buckling of stiffener segments are also assessed. Constraints on the axial membrane strain in the skin and stiffener segments are imposed to include strength criteria in the grid-stiffened cylinder design. Design variables used in this study are the axial and transverse stiffener spacings, stiffener height and thickness, skin laminate stacking sequence, and stiffening configuration, where herein stiffening configuration is a design variable that indicates the combination of axial, transverse, and diagonal stiffener in the grid-stiffened cylinder. The design optimization process is adapted to identify the best suited stiffening configurations and stiffener spacings for grid-stiffened composite cylinder with the length and radius of the cylinder, the design in-plane loads, and material properties as inputs. The effect of having axial membrane strain constraints in the skin and stiffener segments in the optimization process is also studied for selected stiffening configuration.

Jaunky, Navin↗
NASA NTRS2009

Detection, Identification, Location, and Remote Sensing Using SAW RFID Sensor Tags

The Electromagnetic Systems Branch (EV4) of the Avionic Systems Division at NASA Johnson Space Center in Houston, TX is studying the utility of surface acoustic wave (SAW) radiofrequency identification (RFID) tags for multiple wireless applications including detection, identification, tracking, and remote sensing of objects on the lunar surface, monitoring of environmental test facilities, structural shape and health monitoring, and nondestructive test and evaluation of assets. For all of these applications, it is anticipated that the system utilized to interrogate the SAW RFID tags may need to operate at fairly long range and in the presence of considerable multipath and multiple-access interference. Towards that end, EV4 is developing a prototype SAW RFID wireless interrogation system for use in such environments called the Passive Adaptive RFID Sensor Equipment (PARSED) system. The system utilizes a digitally beam-formed planar receiving antenna array to extend range and provide direction-of-arrival information coupled with an approximate maximum-likelihood signal processing algorithm to provide near-optimal estimation of both range and temperature. The system is capable of forming a large number of beams within the field of view and resolving the information from several tags within each beam. The combination of both spatial and waveform discrimination provides the capability to track and monitor telemetry from a large number of objects appearing simultaneously within the field of view of the receiving array. In this paper, we will consider the application of the PARSEQ system to the problem of simultaneous detection, identification, localization, and temperature estimation for multiple objects. We will summarize the overall design of the PARSEQ system and present a detailed description of the design and performance of the signal detection and estimation algorithms incorporated in the system. The system is currently configured only to measure temperature (jointly with range and tag ID), but future versions will be revised to measure parameters other than temperature as SAW tags capable of interfacing with external sensors become available. It is anticipated that the estimation of arbitrary parameters measured using SAW-based sensors will be based on techniques very similar to the joint range and temperature estimation techniques described in this paper.

Barton, Richard J.↗
NASA NTRS1974

Recursive estimation of prior probabilities using the mixture approach

The problem of estimating the prior probabilities q sub k of a mixture of known density functions f sub k(X), based on a sequence of N statistically independent observations is considered. It is shown that for very mild restrictions on f sub k(X), the maximum likelihood estimate of Q is asymptotically efficient. A recursive algorithm for estimating Q is proposed, analyzed, and optimized. For the M = 2 case, it is possible for the recursive algorithm to achieve the same performance with the maximum likelihood one. For M 2, slightly inferior performance is the price for having a recursive algorithm. However, the loss is computable and tolerable.

Kazakos, D.↗
NASA NTRS1986

Automated Design Synthesis

Automated Design Synthesis (ADS) program is general-purpose numerical optimization program containing wide variety of algorithms. Assumed user prepares analysis problem capable of computing objective function and constraints. Program able to accept as part of input design variable quantities. Optimization process carried out by ADS coupled with user's program. ADS used for constrained and unconstrained function minimization. Solution of general problem separated into three basic levels: Strategy, Optimizer, and One-Dimensional Search. Already significant applications in area of structural synthesis (minimum-weight design).

Vanderplaats, G. N.↗
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↗
NASA NTRSDate not supplied

Remote Sensing of Atmospheric Temperature, Water Vapor, Trace Gases, Cloud, and Surface Properties on Daily and Decadal Time Scales

Hyperspectral IR sounders such as AIRS on Aqua, CrIS on S-NPP, NOAA20 and JPSS-2, IASI on Metop A, B, and C provide high-quality atmospheric temperature, water, vapor, and greenhouse gas vertical profiles. Additionally, they provide atmospheric cloud properties, surface emissivity, and surface skin temperatures. We have developed two algorithms which can consistently derive these products from multiple IR sounders. The first one is a Single Field-of-view Sounder Atmospheric Product (SIFSAP) algorithm and the second one is a Climate Fingerprinting Sounder Product (ClimFiSP) algorithm. The SiFSAP algorithm performs one retrieval for each FOV using an all-sky optimal estimation approach. The core of the SiFSAP algorithm is an accurate and fast Principal Component-based Radiative Transfer Model (PCRTM), which can calculate hyperspectral radiance spectra under both clear and cloudy conditions. The PCRTM was developed in the past decade using consistent reference line-by-line radiative transfer model and spectroscopy for hyperspectral sounders such as AIRS, CrIS, IASI, NAST-I, and S-HIS. The ClimFiSP algorithm, which performs retrievals from spatiotemporally averaged L1 hyperspectral radiances directly, will be orders of magnitude faster than traditional method. he ClimFiSP algorithm uses consistent radiative kernels and a robust spectral fingerprinting method. It provides accurate data climate data fusion products from multiple satellite sensors. Both SiFSAP and ClimFiSP will be available at NASA GES DISC data center for public access.

Xu Liu↗
NASA NTRSDate not supplied

Development of Radiative Transfer Models and Retrieval Algorithms for Satellite Remote Sensors

Hyperspectral IR sounders such as AIRS on Aqua, CrIS on S-NPP, NOAA20 and JPSS-2, IASI on Metop A, B, and C provide high-quality atmospheric temperature, water, vapor, and greenhouse gas vertical profiles. Additionally, they provide atmospheric cloud properties, surface emissivity, and surface skin temperatures. We have developed two algorithms which can consistently derive these products from multiple IR sounders. The first one is a Single Field-of-view Sounder Atmospheric Product (SIFSAP) algorithm and the second one is a Climate Fingerprinting Sounder Product (ClimFiSP) algorithm. The SiFSAP algorithm performs one retrieval for each FOV using an all-sky optimal estimation approach. The core of the SiFSAP algorithm is an accurate and fast Principal Component-based Radiative Transfer Model (PCRTM), which can calculate hyperspectral radiance spectra under both clear and cloudy conditions. The PCRTM was developed in the past decade using consistent reference line-by-line radiative transfer model and spectroscopy for hyperspectral sounders such as AIRS, CrIS, IASI, NAST-I, and S-HIS. The ClimFiSP algorithm, which performs retrievals from spatiotemporally averaged L1 hyperspectral radiances directly, will be orders of magnitude faster than traditional method. he ClimFiSP algorithm uses consistent radiative kernels and a robust spectral fingerprinting method. It provides accurate data climate data fusion products from multiple satellite sensors. Both SiFSAP and ClimFiSP will be available at NASA GES DISC data center for public access.

Xu Liu↗
NASA NTRS2002

Number Partitioning via Quantum Adiabatic Computation

We study both analytically and numerically the complexity of the adiabatic quantum evolution algorithm applied to random instances of combinatorial optimization problems. We use as an example the NP-complete set partition problem and obtain an asymptotic expression for the minimal gap separating the ground and exited states of a system during the execution of the algorithm. We show that for computationally hard problem instances the size of the minimal gap scales exponentially with the problem size. This result is in qualitative agreement with the direct numerical simulation of the algorithm for small instances of the set partition problem. We describe the statistical properties of the optimization problem that are responsible for the exponential behavior of the algorithm.

Smelyanskiy, Vadim N.↗
NASA NTRS1984

An algorithm for maximum likelihood estimation using an efficient method for approximating sensitivities

An algorithm for maximum likelihood (ML) estimation is developed primarily for multivariable dynamic systems. The algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). The method determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort compared with integrating the analytically determined sensitivity equations or using a finite-difference method. Different surface-fitting methods are discussed and demonstrated. Aircraft estimation problems are solved by using both simulated and real-flight data to compare MNRES with commonly used methods; in these solutions MNRES is found to be equally accurate and substantially faster. MNRES eliminates the need to derive sensitivity equations, thus producing a more generally applicable algorithm.

Murphy, P. C.↗
NASA NTRS2006

Implementing Scientific Simulation Codes Highly Tailored for Vector Architectures Using Custom Configurable Computing Machines

The motivation for this work comes from an observation that amidst the push for Massively Parallel (MP) solutions to high-end computing problems such as numerical physical simulations, large amounts of legacy code exist that are highly optimized for vector supercomputers. Because re-hosting legacy code often requires a complete re-write of the original code, which can be a very long and expensive effort, this work examines the potential to exploit reconfigurable computing machines in place of a vector supercomputer to implement an essentially unmodified legacy source code. Custom and reconfigurable computing resources could be used to emulate an original application's target platform to the extent required to achieve high performance. To arrive at an architecture that delivers the desired performance subject to limited resources involves solving a multi-variable optimization problem with constraints. Prior research in the area of reconfigurable computing has demonstrated that designing an optimum hardware implementation of a given application under hardware resource constraints is an NP-complete problem. The premise of the approach is that the general issue of applying reconfigurable computing resources to the implementation of an application, maximizing the performance of the computation subject to physical resource constraints, can be made a tractable problem by assuming a computational paradigm, such as vector processing. This research contributes a formulation of the problem and a methodology to design a reconfigurable vector processing implementation of a given application that satisfies a performance metric. A generic, parametric, architectural framework for vector processing implemented in reconfigurable logic is developed as a target for a scheduling/mapping algorithm that maps an input computation to a given instance of the architecture. This algorithm is integrated with an optimization framework to arrive at a specification of the architecture parameters that attempts to minimize execution time, while staying within resource constraints. The flexibility of using a custom reconfigurable implementation is exploited in a unique manner to leverage the lessons learned in vector supercomputer development. The vector processing framework is tailored to the application, with variable parameters that are fixed in traditional vector processing. Benchmark data that demonstrates the functionality and utility of the approach is presented. The benchmark data includes an identified bottleneck in a real case study example vector code, the NASA Langley Terminal Area Simulation System (TASS) application.

Rutishauser, David↗
NASA NTRS1989

Numerical optimization in Hilbert space using inexact function and gradient evaluations

Trust region algorithms provide a robust iterative technique for solving non-convex unstrained optimization problems, but in many instances it is prohibitively expensive to compute high accuracy function and gradient values for the method. Of particular interest are inverse and parameter estimation problems, since function and gradient evaluations involve numerically solving large systems of differential equations. A global convergence theory is presented for trust region algorithms in which neither function nor gradient values are known exactly. The theory is formulated in a Hilbert space setting so that it can be applied to variational problems as well as the finite dimensional problems normally seen in trust region literature. The conditions concerning allowable error are remarkably relaxed: relative errors in the gradient error condition is automatically satisfied if the error is orthogonal to the gradient approximation. A technique for estimating gradient error and improving the approximation is also presented.

Carter, Richard G.↗
NASA NTRSDate not supplied

Learning Based Edge Computing in Air-to-Air Communication Network

This paper studies learning-based edge computing and communication in a dynamic Air-to-Air Ad-hoc Network (AAAN). Due to spectrum scarcity, we assume the number of Air-to-Air (A2A) communication links is greater than that of the available frequency channels, such that some communication links have to share the same channel, causing co-channel interference. We formulate the joint channel selection and power control optimization problem to maximize the aggregate spectrum utilization efficiency under resource and fairness constraints. A distributed deep Q learning-based edge computing and communication algorithm is proposed to find the optimal solution. In particular, we design two different neural network structures and each communication link can converge to the optimal operation by exploiting only the local information from its neighbors, making it scalable to large networks. Finally, experimental results demonstrate the effectiveness of the proposed solution in various AAAN scenarios.

Zhe Wang↗
NASA NTRS2000

Reinforcement Learning in Distributed Domains: Beyond Team Games

Distributed search algorithms are crucial in dealing with large optimization problems, particularly when a centralized approach is not only impractical but infeasible. Many machine learning concepts have been applied to search algorithms in order to improve their effectiveness. In this article we present an algorithm that blends Reinforcement Learning (RL) and hill climbing directly, by using the RL signal to guide the exploration step of a hill climbing algorithm. We apply this algorithm to the domain of a constellations of communication satellites where the goal is to minimize the loss of importance weighted data. We introduce the concept of 'ghost' traffic, where correctly setting this traffic induces the satellites to act to optimize the world utility. Our results indicated that the bi-utility search introduced in this paper outperforms both traditional hill climbing algorithms and distributed RL approaches such as team games.

Wolpert, David H.↗
NASA NTRS1992

Optimal mapping of neural-network learning on message-passing multicomputers

A minimization of learning-algorithm completion time is sought in the present optimal-mapping study of the learning process in multilayer feed-forward artificial neural networks (ANNs) for message-passing multicomputers. A novel approximation algorithm for mappings of this kind is derived from observations of the dominance of a parallel ANN algorithm over its communication time. Attention is given to both static and dynamic mapping schemes for systems with static and dynamic background workloads, as well as to experimental results obtained for simulated mappings on multicomputers with dynamic background workloads.

Chu, Lon-Chan↗
NASA NTRS1990

Optical neural network system for pose determination of spinning satellites

An optical neural network architecture and algorithm based on a Hopfield optimization network are presented for multitarget tracking. This tracker utilizes a neuron for every possible target track, and a quadratic energy function of neural activities which is minimized using gradient descent neural evolution. The neural net tracker is demonstrated as part of a system for determining position and orientation (pose) of spinning satellites with respect to a robotic spacecraft. The input to the system is time sequence video from a single camera. Novelty detection and filtering are utilized to locate and segment novel regions from the input images. The neural net multitarget tracker determines the correspondences (or tracks) of the novel regions as a function of time, and hence the paths of object (satellite) parts. The path traced out by a given part or region is approximately elliptical in image space, and the position, shape and orientation of the ellipse are functions of the satellite geometry and its pose. Having a geometric model of the satellite, and the elliptical path of a part in image space, the three-dimensional pose of the satellite is determined. Digital simulation results using this algorithm are presented for various satellite poses and lighting conditions.

Lee, Andrew↗
NASA NTRS1979

Application of trajectory optimization principles to minimize aircraft operating costs

This paper summarizes various applications of trajectory optimization principles that have been or are being devised by both government and industrial researchers to minimize aircraft direct operating costs (DOC). These costs (time and fuel) are computed for aircraft constrained to fly over a fixed range. Optimization theory is briefly outlined, and specific algorithms which have resulted from application of this theory are described. Typical results which demonstrate use of these algorithms and the potential savings which they can produce are given. Finally, need for further trajectory optimization research is presented.

Sorensen, J. A.↗
NASA NTRS2020

Optimization of Low Reynolds Number Airfoils for Martian Rotor Applications Using an Evolutionary Algorithm

The Mars Helicopter (MH) will be flying on the NASA Mars 2020 rover mission scheduled to launch in July of 2020. Research is being performed at the Jet Propulsion Laboratory (JPL) and NASA Ames Research Center to extend the current capabilities and develop the Mars Science Helicopter (MSH) as the next possible step for Martian rotorcraft. The low atmospheric density and the relatively small-scale rotors result in very low chord-based Reynolds number flows over the rotor airfoils. The low Reynolds number regime results in rapid performance degradation for conventional airfoils due to laminar separation without reattachment. Unconventional airfoil shapes with sharp leading edges are explored and optimized for aerodynamic performance at representative Reynolds-Mach combinations for a concept rotor. Sharp leading edges initiate immediate flow separation, and the occurrence of large-scale vortex shedding is found to contribute to the relative performance increase of the optimized airfoils, compared to conventional airfoil shapes. The oscillations are shown to occur independent from laminar-turbulent transition and therefore result in sustainable performance at lower Reynolds numbers. Comparisons are presented to conventional airfoil shapes and peak lift-to-drag ratio increases between 17% and 41% are observed for similar section lift.

Koning, Witold J.↗
NASA NTRS2011

Principal Component Noise Filtering for NAST-I Radiometric Calibration

The National Polar-orbiting Operational Environmental Satellite System (NPOESS) Airborne Sounder Testbed- Interferometer (NAST-I) instrument is a high-resolution scanning interferometer that measures emitted thermal radiation between 3.3 and 18 microns. The NAST-I radiometric calibration is achieved using internal blackbody calibration references at ambient and hot temperatures. In this paper, we introduce a refined calibration technique that utilizes a principal component (PC) noise filter to compensate for instrument distortions and artifacts, therefore, further improve the absolute radiometric calibration accuracy. To test the procedure and estimate the PC filter noise performance, we form dependent and independent test samples using odd and even sets of blackbody spectra. To determine the optimal number of eigenvectors, the PC filter algorithm is applied to both dependent and independent blackbody spectra with a varying number of eigenvectors. The optimal number of PCs is selected so that the total root-mean-square (RMS) error is minimized. To estimate the filter noise performance, we examine four different scenarios: apply PC filtering to both dependent and independent datasets, apply PC filtering to dependent calibration data only, apply PC filtering to independent data only, and no PC filters. The independent blackbody radiances are predicted for each case and comparisons are made. The results show significant reduction in noise in the final calibrated radiances with the implementation of the PC filtering algorithm.

Tian, Jialin↗