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,531 records · Page 85
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions

Here we propose a manifold sampling algorithm for minimizing a nonsmooth composition $f= h\circ F$, where we assume $h$ is nonsmooth and may be inexpensively computed in closed form and $F$ is smooth but its Jacobian may not be available. We additionally assume that the composition $h\circ F$ defines a continuous selection. Manifold sampling algorithms can be classified as model-based derivative-free methods, in that models of $F$ are combined with particularly sampled information about $h$ to yield local models for use within a trust-region framework. We demonstrate that cluster points of the sequence of iterates generated by the manifold sampling algorithm are Clarke stationary. We consider the tractability of three particular subproblems generated by the manifold sampling algorithm and the extent to which inexact solutions to these subproblems may be tolerated. Numerical results demonstrate that manifold sampling as a derivative-free algorithm is competitive with state-of-the-art algorithms for nonsmooth optimization that utilize first-order information about $f$.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

BROOD: Bilevel and Robust Optimization and Outlier Detection for Efficient Tuning of High-Energy Physics Event Generators

The parameters in Monte Carlo (MC) event generators are tuned on experimental measurements by evaluating the goodness of fit between the data and the MC predictions. The relative importance of each measurement is adjusted manually in an often time-consuming, iterative process to meet different experimental needs. In this work, we introduce several optimization formulations and algorithms with new decision criteria for streamlining and automating this process. These algorithms are designed for two formulations: bilevel optimization and robust optimization. Both formulations are applied to the datasets used in the ATLAS A14 tune and to the dedicated hadronization datasets generated by the SHERPA generator, respectively. The corresponding tuned generator parameters are compared using three metrics. We compare the quality of our automatic tunes to the published ATLAS A14 tune. Moreover, we analyze the impact of a pre-processing step that excludes data that cannot be described by the physics models used in the MC event generators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1983

Structural optimization by multilevel decomposition

A method is described for decomposing an optimization problem into a set of subproblems and a coordination problem which preserves coupling between the subproblems. The method is introduced as a special case of multilevel, multidisciplinary system optimization and its algorithm is fully described for two level optimization for structures assembled of finite elements of arbitrary type. Numerical results are given for an example of a framework to show that the decomposition method converges and yields results comparable to those obtained without decomposition. It is pointed out that optimization by decomposition should reduce the design time by allowing groups of engineers, using different computers to work concurrently on the same large problem.

Sobieszczanski-Sobieski, J.↗
NASA NTRS2008

MACOS Version 3.31

Version 3.31 of Modeling and Analysis for Controlled Optical Systems (MACOS) has been released. MACOS is an easy-to-use computer program for modeling and analyzing the behaviors of a variety of optical systems, including systems that have large, segmented apertures and are aligned with the technology of wavefront sensing and control. Two previous versions were described in "Improved Software for Modeling Controlled Optical Systems" (NPO-19841) NASA Tech Briefs, Vol. 21, No. 12 (December 1997), page 42 and "Optics Program Modified for Multithreaded Parallel Computing" (NPO-40572) NASA Tech Briefs, Vol. 30, No. 1 (January 2006) page 13a. The present version incorporates the following enhancements over prior versions: a) A powerful system-optimization facility includes algorithms for linear, nonlinear, unconstrained, and constrained optimization of optical systems under a variety of settings. b) There is now enhanced capability to perturb optical components individually and on subsystem levels, and to optimize system performance by adjusting selected individual components as well as subsystems. c) Capabilities for modeling a variety of new optical aperture types have been added. d) Effects of multilayer thin-film coats on optical surfaces can now be taken into account when tracing polarized rays. e) Major software-engineering work was performed to make MACOS more reliable, flexible, and manageable for purposes of maintenance and further development.

Redding, David↗
DOE OSTI2023

Autonomous and dynamic precursor selection for solid-state materials synthesis

Abstract Solid-state synthesis plays an important role in the development of new materials and technologies. While in situ characterization and ab-initio computations have advanced our understanding of materials synthesis, experiments targeting new compounds often still require many different precursors and conditions to be tested. Here we introduce an algorithm (ARROWS 3 ) designed to automate the selection of optimal precursors for solid-state materials synthesis. This algorithm actively learns from experimental outcomes to determine which precursors lead to unfavorable reactions that form highly stable intermediates, preventing the target material’s formation. Based on this information, ARROWS 3 proposes new experiments using precursors it predicts to avoid such intermediates, thereby retaining a larger thermodynamic driving force to form the target. We validate this approach on three experimental datasets, containing results from over 200 synthesis procedures. In comparison to black-box optimization, ARROWS 3 identifies effective precursor sets for each target while requiring substantially fewer experimental iterations. These findings highlight the importance of domain knowledge in optimization algorithms for materials synthesis, which are critical for the development of fully autonomous research platforms.

36 MATERIALS SCIENCE↗
NASA NTRS2006

Stochastic Evolutionary Algorithms for Planning Robot Paths

A computer program implements stochastic evolutionary algorithms for planning and optimizing collision-free paths for robots and their jointed limbs. Stochastic evolutionary algorithms can be made to produce acceptably close approximations to exact, optimal solutions for path-planning problems while often demanding much less computation than do exhaustive-search and deterministic inverse-kinematics algorithms that have been used previously for this purpose. Hence, the present software is better suited for application aboard robots having limited computing capabilities (see figure). The stochastic aspect lies in the use of simulated annealing to (1) prevent trapping of an optimization algorithm in local minima of an energy-like error measure by which the fitness of a trial solution is evaluated while (2) ensuring that the entire multidimensional configuration and parameter space of the path-planning problem is sampled efficiently with respect to both robot joint angles and computation time. Simulated annealing is an established technique for avoiding local minima in multidimensional optimization problems, but has not, until now, been applied to planning collision-free robot paths by use of low-power computers.

Fink, Wolfgang↗
NASA NTRS2013

Mixed-Strategy Chance Constrained Optimal Control

This paper presents a novel chance constrained optimal control (CCOC) algorithm that chooses a control action probabilistically. A CCOC problem is to find a control input that minimizes the expected cost while guaranteeing that the probability of violating a set of constraints is below a user-specified threshold. We show that a probabilistic control approach, which we refer to as a mixed control strategy, enables us to obtain a cost that is better than what deterministic control strategies can achieve when the CCOC problem is nonconvex. The resulting mixed-strategy CCOC problem turns out to be a convexification of the original nonconvex CCOC problem. Furthermore, we also show that a mixed control strategy only needs to "mix" up to two deterministic control actions in order to achieve optimality. Building upon an iterative dual optimization, the proposed algorithm quickly converges to the optimal mixed control strategy with a user-specified tolerance.

Ono, Masahiro↗
NASA NTRS1988

Effect of model uncertainty on failure detection - The threshold selector

The performance of all failure detection, isolation, and accomodation (DIA) algorithms is influenced by the presence of model uncertainty. A unique framework is presented to incorporate a knowledge of modeling error in the analysis and design of failure detection systems. The tools being used are very similar to those in robust control theory. A concept is introduced called the threshold selector, which is a nonlinear inequality whose solution defines the set of detectable sensor failure signals. The threshold selector represents an innovative tool for analysis and synthesis of DIA algorithms. It identifies the optimal threshold to be used in innovations-based DIA algorithms. The optimal threshold is shown to be a function of the bound on modeling errors, the noise properties, the speed of DIA filters, and the classes of reference and failure signals. The size of the smallest detectable failure is also determined. The results are applied to a multivariable turbofan jet engine example, which demonstrates improvements compared to previous studies.

Emami-Naeini, Abbas↗
DOE OSTI2024

Optimization and Evaluation of Energy Savings for Connected and Autonomous Off-Road Vehicles

Off-road vehicles, such as wheel loaders, excavators, and harvesters, are extensively utilized across a wide range of industries, including construction, agriculture, and mining. These machines have become indispensable in supporting the day-to-day operational needs of a nation, playing a critical role in various sectors' infrastructure and productivity. However, despite their utility, off-road vehicles are significant consumers of fossil fuels, resulting in substantial emissions that contribute to environmental degradation. This highlights the pressing need for research and technological advancements aimed at improving their energy efficiency and reducing their carbon footprint. There are, however, two primary challenges that must be addressed to achieve these goals. First, off-road vehicles typically perform both driving and working tasks simultaneously, which introduces a high level of complexity into their overall dynamic systems. Analysis the interactions between these functions is challenging. Second, research into off-road vehicles is inherently interdisciplinary, demanding expertise across several domains such as fluid power systems, vehicle dynamics, control theory, optimization techniques, and real-world implementation. Recognizing these challenges, we proposed the project titled "Optimization and Evaluation of Energy Savings for Connected and Autonomous Off-Road Vehicles" as a comprehensive solution to enhance fuel efficiency while simultaneously improving productivity. This project specifically focuses on autonomous off-road vehicles, with particular attention to wheel loaders, and seeks to develop novel methods to optimize energy consumption without sacrificing operational performance. The project integrates real-time control algorithms, vehicle dynamics modeling, and co-optimization of powertrain system and vehicle system to achieve these goals. Our optimization strategy dynamically co-optimizes critical parameters at both the powertrain and vehicle levels, including vehicle speed, working tool movements, powertrain dynamics, and engine operations in real-time. To streamline this optimization process, we developed a vehicle model that captures the key dynamics while significantly enhancing computational efficiency. This allows the system to intelligently minimize fuel consumption, all while maintaining or even improving productivity through real-time calculations during various off-road operations. To validate the effectiveness of this energy optimization method, we introduced a state-of-the-art Hardware-in-the-Loop (HIL) testbed. This reconfigurable testbed seamlessly integrates the actual engine with virtual models of the wheel loader's subsystems, allowing for accurate emulation of real-world operational loads and environments. By simulating these conditions, the HIL testbed enables us to evaluate the wheel loader’s performance under diverse working scenarios, ensuring the developed solution is applicable in real-world operations. This testbed proved to be instrumental in validating the optimization algorithms and demonstrating the system's practical effectiveness. During the evaluation and testing phase, we employed the HIL testbed to rigorously assess the energy savings and productivity improvements generated by the optimized system. The results were highly encouraging, revealing that the automated wheel loader achieved over 30% fuel savings compared to traditional, human-operated cycles, with comparable or even enhanced levels of productivity. The insights gained from this HIL-based testing provided critical validation of our approach and highlighted the potential for deploying these optimized autonomous technologies in real-world off-road vehicles.

33 ADVANCED PROPULSION SYSTEMS↗
NASA NTRS1990

Constrained optimization using design of experiment surfaces

An algorithm for solving constrained optimization problems is presented. First, design of experiment techniques are used to survey the design space. After evaluating the objective and constraint functions, as specified by Taguchi orthogonal arrays, analytical models of these functions are generated using a least-squares regression analysis. Next, a nonlinear programming package is used to optimize the analytical model. Based on the optimization information, the design space is reduced so as to close in around the minimum, and the entire procedure is repeated until convergence. An important feature of the algorithm is that function gradients are not required; therefore, for problems in which gradients would have to be estimated using finite-differences the number of function evaluations required for the optimization is significantly reduced, when compared with traditional nonlinear programming techniques. In addition, there is no requirement that the gradients must be smooth and continuous.

Bolt, Marvin Vance↗
NASA NTRS1999

A Single-Lap Joint Adhesive Bonding Optimization Method Using Gradient and Genetic Algorithms

A natural process for any engineer, scientist, educator, etc. is to seek the most efficient method for accomplishing a given task. In the case of structural design, an area that has a significant impact on the structural efficiency is joint design. Unless the structure is machined from a solid block of material, the individual components which compose the overall structure must be joined together. The method for joining a structure varies depending on the applied loads, material, assembly and disassembly requirements, service life, environment, etc. Using both metallic and fiber reinforced plastic materials limits the user to two methods or a combination of these methods for joining the components into one structure. The first is mechanical fastening and the second is adhesive bonding. Mechanical fastening is by far the most popular joining technique; however, in terms of structural efficiency, adhesive bonding provides a superior joint since the load is distributed uniformly across the joint. The purpose of this paper is to develop a method for optimizing single-lap joint adhesive bonded structures using both gradient and genetic algorithms and comparing the solution process for each method. The goal of the single-lap joint optimization is to find the most efficient structure that meets the imposed requirements while still remaining as lightweight, economical, and reliable as possible. For the single-lap joint, an optimum joint is determined by minimizing the weight of the overall joint based on constraints from adhesive strengths as well as empirically derived rules. The analytical solution of the sin-le-lap joint is determined using the classical Goland-Reissner technique for case 2 type adhesive joints. Joint weight minimization is achieved using a commercially available routine, Design Optimization Tool (DOT), for the gradient solution while an author developed method is used for the genetic algorithm solution. Results illustrate the critical design variables as a function of adhesive properties and convergences of different joints based on the two optimization methods.

Smeltzer, Stanley S., III↗
DOE OSTI2022

A Hybrid Bulk Algorithm to Predict Turbulent Fluxes over Dry and Wet Bare Soils

Measurements made in the Columbia River basin (Oregon) in an area of irregular terrain during the second Wind Forecast Improvement Project (WFIP2) field campaign are used to develop an optimized hybrid bulk algorithm to predict the surface turbulent fluxes from readily measured or modeled quantities over dry and wet bare or lightly vegetated soil surfaces. The hybrid (synthetic) algorithm combines (i) an aerodynamic method for turbulent flow, which is based on the transfer coefficients (drag coefficient and Stanton number), roughness lengths, and Monin–Obukhov similarity; and (ii) a modified Priestley–Taylor (P-T) algorithm with physically based ecophysiological constraints, which is essentially based on the surface energy budget (SEB) equation. Soil heat flux in the latter case was estimated from measurements of soil temperature and soil moisture. In the framework of the hybrid algorithm, bulk estimates of the momentum flux and the sensible heat flux are derived from a traditional aerodynamic approach, whereas the latent heat flux (or moisture flux) is evaluated from a modified P-T model. Direct measurements of the surface fluxes (turbulent and radiative) and other ancillary atmospheric/soil parameters made during WFIP2 for different soil conditions (dry and wet) are used to optimize and tune the hybrid bulk algorithm. The bulk flux estimates are validated against the measured eddy-covariance fluxes. We also discuss the SEB closure over dry and wet surfaces at various time scales based on the modeled and measured fluxes. Although this bulk flux algorithm is optimized for the data collected during the WFIP2, a hybrid approach can be used for similar flux-tower sites and field campaigns.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1976

Set covering algorithm, a subprogram of the scheduling algorithm for mission planning and logistic evaluation

A computer program using Lemke, Salkin and Spielberg's Set Covering Algorithm (SCA) to optimize a traffic model problem in the Scheduling Algorithm for Mission Planning and Logistics Evaluation (SAMPLE) was documented. SCA forms a submodule of SAMPLE and provides for input and output, subroutines, and an interactive feature for performing the optimization and arranging the results in a readily understandable form for output.

Chang, H.↗
NASA NTRS2012

Highlights of TOMS Version 9 Total Ozone Algorithm

The fundamental basis of TOMS total ozone algorithm was developed some 45 years ago by Dave and Mateer. It was designed to estimate total ozone from satellite measurements of the backscattered UV radiances at few discrete wavelengths in the Huggins ozone absorption band (310-340 nm). Over the years, as the need for higher accuracy in measuring total ozone from space has increased, several improvements to the basic algorithms have been made. They include: better correction for the effects of aerosols and clouds, an improved method to account for the variation in shape of ozone profiles with season, latitude, and total ozone, and a multi-wavelength correction for remaining profile shape errors. These improvements have made it possible to retrieve total ozone with just 3 spectral channels of moderate spectral resolution (approx. 1 nm) with accuracy comparable to state-of-the-art spectral fitting algorithms like DOAS that require high spectral resolution measurements at large number of wavelengths. One of the deficiencies of the TOMS algorithm has been that it doesn't provide an error estimate. This is a particular problem in high latitudes when the profile shape errors become significant and vary with latitude, season, total ozone, and instrument viewing geometry. The primary objective of the TOMS V9 algorithm is to account for these effects in estimating the error bars. This is done by a straightforward implementation of the Rodgers optimum estimation method using a priori ozone profiles and their error covariances matrices constructed using Aura MLS and ozonesonde data. The algorithm produces a vertical ozone profile that contains 1-2.5 pieces of information (degrees of freedom of signal) depending upon solar zenith angle (SZA). The profile is integrated to obtain the total column. We provide information that shows the altitude range in which the profile is best determined by the measurements. One can use this information in data assimilation and analysis. A side benefit of this algorithm is that it is considerably simpler than the present algorithm that uses a database of 1512 profiles to retrieve total ozone. These profiles are tedious to construct and modify. Though conceptually similar to the SBUV V8 algorithm that was developed about a decade ago, the SBUV and TOMS V9 algorithms differ in detail. The TOMS algorithm uses 3 wavelengths to retrieve the profile while the SBUV algorithm uses 6-9 wavelengths, so TOMS provides less profile information. However both algorithms have comparable total ozone information and TOMS V9 can be easily adapted to use additional wavelengths from instruments like GOME, OMI and OMPS to provide better profile information at smaller SZAs. The other significant difference between the two algorithms is that while the SBUV algorithm has been optimized for deriving monthly zonal means by making an appropriate choice of the a priori error covariance matrix, the TOMS algorithm has been optimized for tracking short-term variability using month and latitude dependent covariance matrices.

Bhartia, Pawan↗
DOE OSTI2020

Joint Optimization of Well Completions and Controls for CO 2 Enhanced Oil Recovery and Storage

CO 2 storage through CO 2 enhanced oil recovery (EOR) is considered as one of the technologies to help promote larger scale deployment of CO 2 storage because of associated economic benefits through oil recovery, 45Q tax credits and the utilization of existing infrastructure. The objective of this study is to demonstrate how optimal reservoir management and operation strategies (including well completions and controls) can be used to optimize both CO 2 storage and oil recovery. The optimization problem was focused on jointly estimating the well completions (i.e., fraction of injection/production well perforations in each reservoir layer) and CO 2 injection/oil production controls that maximize the net present value (NPV) in a CO 2 EOR and storage operation. We utilized the newly developed StoSAG algorithm, one of the most efficient optimization algorithms in the reservoir management community, to solve the optimization problem. The performance of joint optimization approach was compared with the performance of well control only optimization approach. In addition, the performance of co-optimization of CO 2 storage and oil recovery approach was compared with the performances of maximization of only CO 2 storage and maximization of only oil recovery approaches. The optimization results showed that a joint optimization of well completions and well controls can achieve an 8.84% higher final NPV than the one obtained from the optimization of only well controls. It was observed that the NPV incremental for joint optimization is mainly due to the fact that the optimal well completions and controls approach results in efficient CO 2 storage and oil production from different reservoir layers depending on the differences in individual layer properties. Comparison of co-optimization (i.e., maximization of NPV) and maximization of only CO 2 storage or only oil recovery showed that the co-optimization and maximization of only oil recovery result in significantly higher final NPV than that obtained through maximization of only CO 2 storage approach while maximization of only CO 2 storage can achieve significantly higher CO 2 storage in the reservoir compared to the other two scenarios. The similar results for co-optimization and maximization of oil production are obtained because of the difference in oil revenue compared to CO 2 storage tax credit. To the best of our knowledge, this is the first study in oil/gas industry and CO 2 storage community to perform joint optimization of well completions and well controls in the fields. We expect that the proposed optimization framework will be a useful and efficient tool for field engineers to optimally manage CO 2 EOR projects to maximize revenue through oil recovery as well as CO 2 storage by taking advantage of the new 45Q tax law.

Artificial intelligence↗
NASA NTRS1976

Optimization of multi-constrained structures based on optimality criteria

A weight-reduction algorithm is developed for the optimal design of structures subject to several multibehavioral inequality constraints. The structural weight is considered to depend linearly on the design variables. The algorithm incorporates a simple recursion formula derived from the Kuhn-Tucker necessary conditions for optimality, associated with a procedure to delete nonactive constraints based on the Gauss-Seidel iterative method for linear systems. A number of example problems is studied, including typical truss structures and simplified wings subject to static loads and with constraints imposed on stresses and displacements. For one of the latter structures, constraints on the fundamental natural frequency and flutter speed are also imposed. The results obtained show that the method is fast, efficient, and general when compared to other competing techniques. Extensions to the generality of the method to include equality constraints and nonlinear merit functions is discussed.

Rizzi, P.↗
NASA NTRS1992

Parallel solver for trajectory optimization search directions

A key algorithmic element of a real-time trajectory optimization hardware/software implementation is presented, the search step solver. This is one piece of an algorithm whose overall goal is to make nonlinear trajectory optimization fast enough to provide real-time commands during guidance of a vehicle such as an aeromaneuvering orbiter or the National Aerospace Plane. Many methods of nonlinear programming require the solution of a quadratic program (QP) at each iteration to determine the search step. In the trajectory optimization case, the QP has a special dynamic programming structure. The algorithm exploits this special structure with a divide- and conquer type of parallel implementation. The algorithm solves a (p.N)-stage problem on N processors in O(p + log2 N) operations. The algorithm yields a factor of 8 speed-up over the fastest known serial algorithm when solving a 1024-stage test problem on 32 processors.

Psiaki, M. L.↗