Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimization applications”

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,063 records · Page 59

Evaluation of Genetic Algorithm Concepts using Model Problems: Single-Objective Optimization - Part 1

A genetic-algorithm-based optimization approach is described and evaluated using a simple hill-climbing model problem. The model problem utilized herein allows for the broad specification of a large number of search spaces including spaces with an arbitrary number of genes or decision variables and an arbitrary number hills or modes. In the present study, only single objective problems are considered. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all problems attempted. The most difficult problems - those with large hyper-volumes and multi-mode search spaces containing a large number of genes - require a large number of function evaluations for GA convergence, but they always converge.

Holst, Terry L.↗

Evaluation of Genetic Algorithm Concepts Using Model Problems: Multi-Objective Optimization - Part 2

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of simple model problems. Several new features including 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. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all optimization problems attempted. The binning algorithm generally provides pareto front quality enhancements and moderate convergence efficiency improvements for most of the model problems. The gene-space transformation procedure provides a large convergence efficiency enhancement for problems with non-convoluted pareto fronts and a degradation in efficiency for problems with convoluted pareto fronts. The most difficult problems --multi-mode search spaces with a large number of genes and convoluted pareto fronts-- require a large number of function evaluations for GA convergence, but always converge.

Holst, Terry L.↗

Integration of analyses in an EMC control plan for avionics hardware in space applications

An EMC Control Plan is a very valuable tool for outlining the processes needed to suppress EMI and provide EMC for the avionics hardware used in space applications. The EMC Control Plan provides guidance to EMC engineers and avionics hardware designers on methods, procedures, and practices to achieve optimum EMC. The design of an EMC Control Plan for space avionics requires unique challenges due to the nature of the space missions and the space environment. An EMC Control Plan for avionics hardware in space applications can be optimized by the integration of reliability and margin analyses that are uniquely suitable to space applications and avionics hardware. The paper provides a description of the analyses and the rationale for the inclusion of such analyses in the EMC Control Plan, including some examples. The paper concludes by providing a detailed outlined of an EMC Control Plan for avionics hardware in space applications and how this approach fits well with the overall avionics hardware design and development cycle.

Perez, Reinaldo↗

Impact of Quad-core Cray XT4 System and Software Stack on Scientific Computation

An upgrade from dual-core to quad-core AMD processor on the Cray XT system at the Oak Ridge National Laboratory (ORNL) Leadership Computing Facility (LCF) has resulted in significant changes in the hardware and software stack, including a deeper memory hierarchy, SIMD instructions and a multi-core aware MPI library. In this paper, we evaluate impact of a subset of these key changes on large-scale scientific applications. We will provide insights into application tuning and optimization process and report on how different strategies yield varying rates of successes and failures across different application domains. For instance, we demonstrate that the vectorization instructions (SSE) provide a performance boost of as much as 50% on fusion and combustion applications. Moreover, we reveal how the resource contentions could limit the achievable performance and provide insights into how application could exploit Petascale XT5 system's hierarchical parallelism.

99 GENERAL AND MISCELLANEOUS↗

Application of direct inverse analogy method (DIVA) and viscous design optimization techniques

A direct-inverse approach to the transonic design problem was presented in its initial state at the First International Conference on Inverse Design Concepts and Optimization in Engineering Sciences (ICIDES-1). Further applications of the direct inverse analogy (DIVA) method to the design of airfoils and incremental wing improvements and experimental verification are reported. First results of a new viscous design code also from the residual correction type with semi-inverse boundary layer coupling are compared with DIVA which may enhance the accuracy of trailing edge design for highly loaded airfoils. Finally, the capabilities of an optimization routine coupled with the two viscous full potential solvers are investigated in comparison to the inverse method.

Greff, E.↗

Dual Channel Dual Staging: Hierarchical and Portable Staging for GPU-Based In-Situ Workflow

In-situ workflows have emerged as an attractive approach for addressing data movement challenges at very large scales. Since GPU-based architectures dominate the HPC landscapes, porting these in-situ workflows, and, specifically, the inter-application data exchange, to GPU-based systems can be challenging. Technologies such as GPUDirect RDMA (GDR), which is typically used for I/O in GPU applications as an optimization that circumvents the CPU overhead, can be leveraged to support bulk data exchanges between GPU applications. However, current GDR design often lacks performance portability across HPC clusters built with different hardware configurations. Furthermore, the local CPU may also be effectively used as an auxiliary communication mechanism to offload data exchanges. In this paper, we present a dual channel dual staging approach for efficient, scalable, and performance-portable inter-application data exchange for in-situ workflows. This approach exploits the data access pattern within in-situ workflows along with the inherent execution asynchrony to accelerate data exchanges and, at the same time, improve performance portability. Specifically, the dual channel dual staging method leverages both the local CPU and the remote data staging server to build a hierarchical joint staging area and uses this staging area to transform blocking inter-application bulk data exchanges into best-effort local data movements between GPU and CPU. The dual channel dual staging is implemented as a portability extension of the Dataspaces-GPU staging framework. We present an experimental evaluation of its performance, portability, and scalability using this implementation on three leadership GPU clusters. The evaluation results demonstrate that the dual channel dual staging method saves up to 75% in data-exchange time compared to host-based, GDR, and alternate portable designs, while maintaining scalability (up to 512 GPUs) and performance portability across the three platforms.

Zhang, Bo [University of Utah]↗

Two-Stage Estimation and Variance Modeling for Latency-Constrained Variational Quantum Algorithms

The quantum approximate optimization algorithm (QAOA) has enjoyed increasing attention in noisy, intermediate-scale quantum computing with its application to combinatorial optimization problems. QAOA has the potential to demonstrate a quantum advantage for NP-hard combinatorial optimization problems. As a hybrid quantum-classical algorithm, the classical component of QAOA resembles a simulation optimization problem in which the simulation outcomes are attainable only through a quantum computer. The simulation that derives from QAOA exhibits two unique features that can have a substantial impact on the optimization process: (i) the variance of the stochastic objective values typically decreases in proportion to the optimality gap, and (ii) querying samples from a quantum computer introduces an additional latency overhead. In this paper, we introduce a novel stochastic trust-region method derived from a derivative-free, adaptive sampling trust-region optimization method intended to efficiently solve the classical optimization problem in QAOA by explicitly taking into account the two mentioned characteristics. The key idea behind the proposed algorithm involves constructing two separate local models in each iteration: a model of the objective function and a model of the variance of the objective function. Exploiting the variance model allows us to restrict the number of communications with the quantum computer and also helps navigate the nonconvex objective landscapes typical in QAOA optimization problems. In conclusion, we numerically demonstrate the superiority of our proposed algorithm using the SimOpt library and Qiskit when we consider a metric of computational burden that explicitly accounts for communication costs.

Derivative-free Optimization↗

Mitigation of Gaseous Emissions from Swine Manure with the Surficial Application of Biochars

Environmental impact associated with odor and gaseous emissions from animal manure is one of the challenges for communities, farmers, and regulatory agencies. Microbe-based manure additives treatments are marketed and used by farmers for mitigation of emissions. However, their performance is difficult to assess objectively. Thus, comprehensive, practical, and low-cost treatments are still in demand. We have been advancing such treatments based on physicochemical principles. The objective of this research was to test the effect of the surficial application of a thin layer (¼ inches; 6.3 mm) of biochar on the mitigation of gaseous emissions (as the percent reduction, % R) from swine manure. Two types of biochar were tested: highly alkaline and porous (HAP) biochar made from corn stover and red oak (RO), both with different pH and morphology. Three 30-day trials were conducted with a layer of HAP and RO (2.0 & 1.65 kg∙m−2, respectively) applied on manure surface, and emissions of ammonia (NH3), hydrogen sulfide (H2S), greenhouse gases (GHG), and odorous volatile organic compounds (VOCs) were measured. The manure and biochar type and properties had an impact on the mitigation effect and its duration. RO significantly reduced NH3 (19–39%) and p-cresol (66–78%). H2S was mitigated (16~23%), but not significantly for all trials. The phenolic VOCs had relatively high % R in most trials but not significantly for all trials. HAP reduced NH3 (4~21%) and H2S (2~22%), but not significantly for all trials. Significant % R for p-cresol (91~97%) and skatole (74~95%) were observed for all trials. The % R for phenol and indole ranged from (60~99%) and (29~94%) but was not significant for all trials. The impact on GHGs, isobutyric acid, and the odor was mixed with some mitigation and generation effects. However, larger-scale experiments are needed to understand how biochar properties and the dose and frequency of application can be optimized to mitigate odor and gaseous emissions from swine manure. The lessons learned can also be applicable to surficial biochar treatment of gaseous emissions from other waste and area sources.

Meiirkhanuly, Zhanibek↗

Using Graph Coloring to Compute Total Derivatives More Efficiently in OpenMDAO

When they are applicable, gradient based optimization algorithms are the most efficient way to solve design optimization problems. Although gradient based methods are generally efficient, they can be made significantly more so through the usage of analytic techniques to compute the necessary total derivatives. The traditional forward (direct) and reverse (adjoint) analytic techniques have computational costs that scale linearly with the number of design variables and the number of constraints, respectively. In this work, we present an application of a graph coloring algorithm to the analytic techniques for computing total derivative Jacobians in order to achieve much better computational scaling than the pure analytic methods can provide alone. A detailed theoretical explanation of how coloring algorithms interact with analytic derivative methods is presented that illustrates specific types of sparsity patterns that must be present in total derivative Jacobians in order for this coloring technique to be effective. The new technique has been implemented as a feature in the OpenMDAO framework and the implementation is demonstrated on two example problems. The performance on the example problems up to 50% reduction in compute cost for optimizations with bi-directional coloring compared to traditional constraint aggregation. Additionally, the results show how coloring technique alleviates some of the numerical difficulties that constraint aggregation can cause, leading to the ability to solve larger problems. It is expected that the new method will have wide applicability to multidisciplinary optimization problems, and that its availability in OpenMDAO will offer significant computational savings for users without the need for them to implement the coloring algorithm themselves.

Trajectory↗

Solution algorithms for non-linear singularly perturbed optimal control problems

The applicability and usefulness of several classical and other methods for solving the two-point boundary-value problem which arises in non-linear singularly perturbed optimal control are assessed. Specific algorithms of the Picard, Newton and averaging types are formally developed for this class of problem. The computational requirements associated with each algorithm are analysed and compared with the computational requirement of the method of matched asymptotic expansions. Approximate solutions to a linear and a non-linear problem are obtained by each method and compared.

Ardema, M. D.↗

Multi-scale topology optimization of multi-material structures with controllable geometric complexity — Applications to heat transfer problems

This study presents a topology optimization method to design assemblies of periodic cellular materials with controllable geometric complexity. The framework is based on a novel multi-scale and multi-material design model in which the structure, the layout of the material subdomains, and their micro-structures are optimized concurrently. To allow a tight control over its geometrical complexity, the layout at the macro-scale is described by level-set fields, parameterized by geometric primitives. The micro-scale geometry is represented through a density approach. A nonlinear programming algorithm drives the optimization process using design sensitivities computed by the discrete adjoint method. The proposed design framework is studied with heat transfer problems. Practical design problems, such as a heat sink and a thermal storage unit with phase change are discussed. The macro-scale analysis model relies on a generalized transient diffusion equation. At the micro-scale, homogenization is used to compute equivalent material properties. The numerical examples in this study show that the optimized multi-scale multi-material layouts outperform the corresponding mono-scale structures while maintaining geometric simplicity at the macro-scale level.

42 ENGINEERING↗

Optimal Charging Profiles with Minimal Intercalation-Induced Stresses for Lithium-Ion Batteries Using Reformulated Pseudo 2-Dimensional Models

This paper illustrates the application of dynamic optimization in obtaining the optimal current profile for charging a lithium-ion battery by restricting the intercalation-induced stresses to a pre-determined limit estimated using a pseudo 2-dimensional (P2D). model. This paper focuses on the problem of maximizing the charge stored in a given time while restricting capacity fade due to intercalation-induced stresses. Conventional charging profiles for lithium-ion batteries (e.g., constant current followed by constant voltage or CC-CV) are not derived by considering capacity fade mechanisms, which are not only inefficient in terms of life-time usage of the batteries but are also slower by not taking into account the changing dynamics of the system. (C) The Author(s) 2014. Published by ECS. This is an open access article distributed under the terms of the Creative Commons Attribution Non-Commercial No Derivatives 4.0 License (CC BY-NC-ND, http://creativecommons.org/licenses/by-nc-nd/4.0/), which permits non-commercial reuse, distribution, and reproduction in any medium, provided the original work is not changed in any way and is properly cited. For permission for commercial reuse, please email: oa@electrochem.org. All rights reserved.

Suthar, B↗

Real-Time On-Ramp Merging Control of Connected and Automated Vehicles using Pseudospectral Convex Optimization

Highway on-ramp merging can be a challenging task for human drivers due to the complex vehicle negotiations and interactions in limited time and space. Connected and automated vehicles (CAVs) have great potential to address the problem and offer many benefits in terms of safety, traffic efficiency, and fuel economy. However, real-time optimal control of CAVs still faces many challenges, including nonlinear dynamics, complex inter-vehicle interactions, and a highly dynamic and uncertain traffic environment. To address these challenges, we develop a novel control approach that balances the solution optimality and computational efficiency to determine optimal merging speed profiles in real time. Specifically, by employing a pseudospectral method and a sequential convex programming approach, two algorithms are proposed and implemented within the model predictive control (MPC) framework to enable real-time generation of optimal solutions for potential on-vehicle applications. The convergence and optimality of the proposed algorithms are validated by comparing with a general-purpose solver under different traffic scenarios.

Shi, Yang↗

The preliminary SOL (Sizing and Optimization Language) reference manual

The Sizing and Optimization Language, SOL, a high-level special-purpose computer language has been developed to expedite application of numerical optimization to design problems and to make the process less error-prone. This document is a reference manual for those wishing to write SOL programs. SOL is presently available for DEC VAX/VMS systems. A SOL package is available which includes the SOL compiler and runtime library routines. An overview of SOL appears in NASA TM 100565.

Lucas, Stephen H.↗

Guidance and Control strategies for aerospace vehicles

A neighboring optimal guidance scheme was devised for a nonlinear dynamic system with stochastic inputs and perfect measurements as applicable to fuel optimal control of an aeroassisted orbital transfer vehicle. For the deterministic nonlinear dynamic system describing the atmospheric maneuver, a nominal trajectory was determined. Then, a neighboring, optimal guidance scheme was obtained for open loop and closed loop control configurations. Taking modelling uncertainties into account, a linear, stochastic, neighboring optimal guidance scheme was devised. Finally, the optimal trajectory was approximated as the sum of the deterministic nominal trajectory and the stochastic neighboring optimal solution. Numerical results are presented for a typical vehicle. A fuel-optimal control problem in aeroassisted noncoplanar orbital transfer is also addressed. The equations of motion for the atmospheric maneuver are nonlinear and the optimal (nominal) trajectory and control are obtained. In order to follow the nominal trajectory under actual conditions, a neighboring optimum guidance scheme is designed using linear quadratic regulator theory for onboard real-time implementation. One of the state variables is used as the independent variable in reference to the time. The weighting matrices in the performance index are chosen by a combination of a heuristic method and an optimal modal approach. The necessary feedback control law is obtained in order to minimize the deviations from the nominal conditions.

Hibey, J. L.↗

IsoWAN: A NASA Science and Engineering Information and Services Framework

We believe that the next evolutionary step in supporting wide-area application and services delivery to customers is a network framework that provides for collocation of applications and services at distinct sites in the network, an interconnection between these sites that is performance optimized for these applications, and value-added services for applications. We use the term IsoWAN to describe an advanced, isolated network interconnect services framework that will enable applications to be more secure, and able to access and be in use in both local and remote environments. The main functions of an IsoWAN are virtual localization of application services, an application service interface, coordinated delivery of applications and associated data to the customer, and supporting collaborative application development for customers. An initial pilot network between three NASA Centers: Ames Research Center, the Jet Propulsion Laboratory, and Marshall Space Flight Center, has been built and its properties will be discussed.

Korsmeyer, David J.↗

IsoWAN: A NASA Science and Engineering Information and Services Framework

We believe that the next evolutionary step in supporting wide-area application and services delivery to customers is a network framework that provides for collocation of applications and services at distinct sites in the network, an interconnection between these sites that is performance optimized for these applications, and value-added services for applications.

IsoWAN↗

Trajectory optimization for the National Aerospace Plane

The objective of this second phase research is to investigate the optimal ascent trajectory for the National Aerospace Plane (NASP) from runway take-off to orbital insertion and address the unique problems associated with the hypersonic flight trajectory optimization. The trajectory optimization problem for an aerospace plane is a highly challenging problem because of the complexity involved. Previous work has been successful in obtaining sub-optimal trajectories by using energy-state approximation and time-scale decomposition techniques. But it is known that the energy-state approximation is not valid in certain portions of the trajectory. This research aims at employing full dynamics of the aerospace plane and emphasizing direct trajectory optimization methods. The major accomplishments of this research include the first-time development of an inverse dynamics approach in trajectory optimization which enables us to generate optimal trajectories for the aerospace plane efficiently and reliably, and general analytical solutions to constrained hypersonic trajectories that has wide application in trajectory optimization as well as in guidance and flight dynamics. Optimal trajectories in abort landing and ascent augmented with rocket propulsion and thrust vectoring control were also investigated. Motivated by this study, a new global trajectory optimization tool using continuous simulated annealing and a nonlinear predictive feedback guidance law have been under investigation and some promising results have been obtained, which may well lead to more significant development and application in the near future.

Lu, Ping↗