Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimization”

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 595 records · Page 33

Outcomes and Insights From Simplified Analytic Trajectory Optimization for a Tethered Underwater Kite

This letter formulates and solves a periodic trajectory optimization problem for a tethered underwater kite. The goal is to maximize the average mechanical power harvested by the kite. The type of kite considered in this letter extracts electricity from ocean currents by moving cross-current as its reel away from its base station, and consumes electricity to reel back. The problem of optimizing this kite’s trajectory is challenging due to the high dimensionality and nonlinearity of its dynamics. To tackle this challenge, the literature often separates the problem into two subproblems focusing on optimizing the cross-current and the reel-in/reel-out components of the trajectory, respectively, which may be sub-optimal. In contrast, this letter solves for the combined cross-current and reel-in/reel-out trajectory by linearizing the dynamics of the kite around a zero-power reference equilibrium trajectory in spherical coordinates. This allows the trajectory optimization problem to be solved analytically for simple sinusoidal input perturbations from equilibrium. Here we use linear quadratic regulation to enable the nonlinear kite model to track the optimized trajectory. The result is a computationally efficient approach that achieves an attractive Loyd factor of 19.9%, while providing important insights into the nature of the optimal trajectory.

42 ENGINEERING↗

Improved Guarantees for Optimal Nash Equilibrium Seeking and Bilevel Variational Inequalities

We consider a class of hierarchical variational inequality (VI) problems that subsumes VI-constrained optimization and several other problem classes, including the optimal solution selection problem and the optimal Nash equilibrium (NE) seeking problem. Our main contribution is threefold. (i) We consider bilevel VIs with monotone and Lipschitz continuous mappings and devise a single-timescale iteratively regularized extragradient method, named IR-EG 𝚖,𝚖 . We improve the existing iteration complexity results for addressing both bilevel VI and VI-constrained convex optimization problems. (ii) Under the strong monotonicity of the outer-level mapping, we develop a method named IR-EG 𝚜,𝚖 and derive faster guarantees than those in (i). We also study the iteration complexity of this method under a constant regularization parameter. These results appear to be new for both bilevel VIs and VI-constrained optimization. (iii) To our knowledge, complexity guarantees for computing the optimal NE in nonconvex settings do not exist. Motivated by this lacuna, we consider VI-constrained nonconvex optimization problems and devise an inexactly projected gradient method, named IPR-EG, where the projection onto the unknown set of equilibria is performed using IR-EG 𝚜,𝚖 with a prescribed termination criterion and an adaptive regularization parameter. We obtain new complexity guarantees in terms of a residual map and an infeasibility metric for computing a stationary point. Here, we validate the theoretical findings using preliminary numerical experiments for computing the best and the worst NEs.

bilevel optimization↗

TRANSP-based Optimization Towards Tokamak Scenario Development

An optimization approach that incorporates the predictive transport code TRANSP is proposed for tokamak scenario development. Optimization methods are often employed to develop open-loop control strategies to aid access to high performance tokamak scenarios. In general, the optimization approaches use control-oriented models, i.e. models that are reduced in complexity and prediction accuracy as compared to physics-oriented transport codes such as TRANSP. In the presented approach, an optimization procedure using the TRANSP code to simulate the tokamak plasma is considered for improved predictive capabilities. As a test case, the neutral beam injection (NBI) power is optimized to develop a control strategy that maximizes the non-inductive current fraction during the ramp-up phase for NSTX-U. Simulation studies towards the achievement of non-inductive ramp up in NSTX-U have already been carried out with the TRANSP code. The optimization-based approach proposed in this work is used to maximize the non-inductive current fraction during ramp-up in NSTX-U, demonstrating that the scenario development task can be automated. An additional test case considers optimization of the current ramp rate in DIII-D for obtaining a stationary plasma characterized bya flat loop voltage profile in the flattop phase.

DIII-D↗

Binary Quantum Control Optimization with Uncertain Hamiltonians

Optimizing the controls of quantum systems plays a crucial role in advancing quantum technologies. The time-varying noises in quantum systems and the widespread use of inhomogeneous quantum ensembles raise the need for high-quality quantum controls under uncertainties. In this paper, we consider a stochastic discrete optimization formulation of a discretized binary optimal quantum control problem involving Hamiltonians with predictable uncertainties. We propose a sample-based reformulation that optimizes both risk-neutral and risk-averse measurements of control policies, and solve these with two gradient-based algorithms using sum-up-rounding approaches. Furthermore, we discuss the differentiability of the objective function and prove upper bounds of the gaps between the optimal solutions to binary control problems and their continuous relaxations. We conduct numerical simulations on various sized problem instances based on two applications of quantum pulse optimization; we evaluate different strategies to mitigate the impact of uncertainties in quantum systems. In conclusion, we demonstrate that the controls of our stochastic optimization model achieve significantly higher quality and robustness compared with the controls of a deterministic model.

conditional value-at-risk (CVaR)↗

Computational Approaches to Simulation and Optimization of Global Aircraft Trajectories

This study examines three possible approaches to improving the speed in generating wind-optimal routes for air traffic at the national or global level. They are: (a) using the resources of a supercomputer, (b) running the computations on multiple commercially available computers and (c) implementing those same algorithms into NASAs Future ATM Concepts Evaluation Tool (FACET) and compares those to a standard implementation run on a single CPU. Wind-optimal aircraft trajectories are computed using global air traffic schedules. The run time and wait time on the supercomputer for trajectory optimization using various numbers of CPUs ranging from 80 to 10,240 units are compared with the total computational time for running the same computation on a single desktop computer and on multiple commercially available computers for potential computational enhancement through parallel processing on the computer clusters. This study also re-implements the trajectory optimization algorithm for further reduction of computational time through algorithm modifications and integrates that with FACET to facilitate the use of the new features which calculate time-optimal routes between worldwide airport pairs in a wind field for use with existing FACET applications. The implementations of trajectory optimization algorithms use MATLAB, Python, and Java programming languages. The performance evaluations are done by comparing their computational efficiencies and based on the potential application of optimized trajectories. The paper shows that in the absence of special privileges on a supercomputer, a cluster of commercially available computers provides a feasible approach for national and global air traffic system studies.

global air traffic optimization↗

Wind-Optimal Trajectories for Multirotor eVTOL Aircraft on UAM Missions

Distributed electric propulsion powered electric vertical takeoff and landing aircraft are expected to enable urban air mobility. Low specific energy of onboard lithium-ion polymer batteries and wind conditions impose constraints on flight endurance. Therefore, from the safety and efficiency perspective, planning and flying minimum energy trajectories are important.The primary motivation for this paper is to determine if there is an operational benefit to flying wind-optimal trajectories for short flights (less than 60 miles) in the urban environment. This study employs wind-optimal trajectories for a NASA-proposed conceptual multirotor aircraft flight in the urban environment. The optimal control model presented includes a wind model for quantifying the effect of wind on the trajectory. The optimal control problem is numerically solved using the direct method. Energy consumption and flight duration flying wind-optimal trajectories between origins and destinations in a metropolitan area are compared with energy consumption and flight duration flying on the great-circle paths between the same origin and destination pairs to determine the operational benefit of wind-optimal routing for short flights.The flight duration results for different scenarios are validated using a simulation tool designed and developed by NASA for exploring advanced air traffic management concepts. In summary,this research study suggests that for short flights in an urban environment, the wind-optimal trajectories have a very slight (insignificant) operational advantage over the great-circle trajectories in terms of energy consumption and flight duration. As expected, headwinds and tailwinds along the route of flight have a significant impact on energy consumption and flight duration.

Urban Air Mobility↗

Copernicus-LinCov (COPCOV) Software Integration in Support of Robust Trajectory Optimization

Robust trajectory optimization is the process of optimizing a trajectory while accounting for system uncertainty due to a variety of potential error sources. This work highlights the development and features of a novel tool known as CopCov to support robust trajectory optimization efforts. CopCov acts as an interface between Copernicus, a generalized trajectory design and optimization tool, and LinCov, a linear covariance analysis tool. By having a direct interface between these two software packages, Copernicus can receive covariance information from LinCov through a direct feedback loop, thus enabling optimization of a trajectory that is robust to trajectory dispersions and navigation errors. This paper details the architecture of CopCov and its flexibility to operate under varying configurations, including with both tools running locally or alternatively with the tools communicating via a remote connection. Additionally, the CopCov tool is demonstrated on a simple Hohmann transfer reference trajectory with varying numbers of Trajectory Correction Maneuvers (TCMs) and varying problem formulations. This example scenario is used to highlight how the inclusion of the CopCov interface affects burn placement of both major burns and minor burns (i.e., TCMs) in the optimized solution. Results are compared against analytical solutions and against a Genetic Algorithm (GA) optimizer for independent verification and validation.

Copernicus↗

On The Incorporation of Both Function-Driven Requirements and Topology Optimization in The Development of Lunar Launch & Landing Pads

In the design of additively manufactured structures, there can be a constant battle between focusing on function-driven design and topology optimization in an attempt to improve a products ability to meet all requirements. Function-driven optimization is defined as the process of identifying the best design parameters that satisfy project functionality requirements. Function-driven optimization is typically implemented by a designer(s) who, instead of computational limitations, has human bias for the input or inputs determined. On the other hand, topology optimization is defined as a mathematical method that optimizes material layout within a given design space, for a given set of loads, boundary conditions, and constraints with the goal of maximizing the performance of the system. In topology optimization, the work is defined by the limited mathematical inputs and computationally available goals/restraints. If not evaluated simultaneously, these two approaches can result in fundamentally different design concepts meant to address the same requirements. NASA’s Artemis program includes the development of a base camp near the lunar South Pole. After site selection is made, one of the first infrastructure elements needed will be a launch and landing pad (LLP). The construction of such a pad will prevent damage to nearby structures from plume-surface interaction (PSI) while also providing a stable platform for the lander. These benefits reduce the required distance between the established landing zones and other settlement infrastructure. In this paper, the authors evaluate the requirements associated with lunar LLP development, application of both functional and topological optimization techniques, methodologies to combine the two techniques, and potential impacts on final design of such a pad.

In-situ↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms: Preprint

This paper presents a distributed approach to perform real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approach real-time control/optimization.

17 WIND ENERGY↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms

This paper presents a distributed approach to performing real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically, and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approaching real-time control/optimization.

17 WIND ENERGY↗

Developing a Drilling Optimization System for Improved Overall Rate of Penetration in Geothermal Wells

Geothermal energy is renewable, reliable and environmentally friendly source of energy. The major cost in the development of geothermal wells is the actual drilling of the wells. The main objective of this paper is to introduce a new real-time drilling optimization system designed for granite formation to reduce the overall drilling cost. In this study, a drilling optimization system is verified using drilling data from Utah-Forge well 58-32. The drilling optimization system used the Utah-Forge well 58-32 data to achieve real-time unconfined compressive strength (UCS). Based on the UCS value from the previous feet, the system simulates the ROP for the next drilling feet. The drilling optimization system utilizes the Differential Evolution Algorithm (DEA), which is a metaheuristic method to search the space of solution, to find the best operating parameters (i.e. WOB and RPM) for the next drilling foot. The optimization algorithm takes a maximum cutter temperature into account as a constraint and avoids the accelerated wear. The developed drilling optimization system improves ROP responses and reduces the drilling cost of geothermal wells. The simulated ROP results from the system show a good agreement with the ROP from Utah-Forge well 58-32 drilling data. The drilling time before and after optimization for both intervals were presented.

15 GEOTHERMAL ENERGY↗

Wind Turbine Rotor Design Using High-Fidelity Aerostructural Optimization

Large wind turbines yield more energy but demand careful aeroelastic blade design. Coupled multiphysics design strategies can reduce wind energy costs by exploiting fluid-structure interactions. This work presents the first high-fidelity aerostructural optimization study of a large wind turbine rotor. We use blade-resolved fluid dynamics and structural solvers in a monolithic gradient-based optimization framework to explore steady-state torque and blade mass tradeoffs. The coupled-adjoint approach computes gradients efficiently, enabling the optimization of over 100 structural and geometric parameters simultaneously. Our optimization study modifies a DTU 10 MW benchmark with a simplified structure and isotropic material properties. The tightly coupled optimizations increase torque by 14% while reducing rotor mass by 9% or reduce blade mass by 27% while maintaining torque. Blade-resolved models provide greater design freedom, enabling 5% higher mass reductions than conventional parameterizations at equal torque. This framework paves the way for more detailed high-fidelity optimization studies to complement conventional design approaches.

17 WIND ENERGY↗

aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture

High-fidelity complex engineering simulations are often predictive, but also computationally expensive and often require substantial computational efforts. The mitigation of computational burden is usually enabled through parallelism in high-performance cluster (HPC) architecture. Optimization problems associated with these applications is a challenging problem due to the high computational cost of the high-fidelity simulations. In this paper, an asynchronous parallel constrained Bayesian optimization method is proposed to efficiently solve the computationally expensive simulation-based optimization problems on the HPC platform, with a budgeted computational resource, where the maximum number of simulations is a constant. The advantage of this method are three-fold. Firstly, the efficiency of the Bayesian optimization is improved, where multiple input locations are evaluated parallel in an asynchronous manner to accelerate the optimization convergence with respect to physical runtime. This efficiency feature is further improved so that when each of the inputs is finished, another input is queried without waiting for the whole batch to complete. Second, the proposed method can handle both known and unknown constraints. Third, the proposed method samples several acquisition functions based on their rewards using a modified GP-Hedge scheme. The proposed framework is termed aphBO-2GP-3B, which means asynchronous parallel hedge Bayesian optimization with two Gaussian processes and three batches. The numerical performance of the proposed framework aphBO-2GP-3B is comprehensively benchmarked using 16 numerical examples, compared against other 6 parallel Bayesian optimization variants and 1 parallel Monte Carlo as a baseline, and demonstrated using two real-world high-fidelity expensive industrial applications. The first engineering application is based on finite element analysis (FEA) and the second one is based on computational fluid dynamics (CFD) simulations.

97 MATHEMATICS AND COMPUTING↗

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

Overall chilled water system energy consumption modeling and optimization

The emergence of increasingly affordable variable-speed drive technology has changed the approach used to control chilled water systems equipped with these drives. The purpose of this research was to develop an integrated chilled water modeling technique that can determine the optimal system setpoints and estimate the energy saving potential of chiller system. The chiller system equipped with Variable Frequency Drives (VFDs) on cooling tower fans and condenser water pumps. To accomplish the objective, physical component models of the centrifugal chiller, cooling tower and condenser water pump were established with the goal of incorporating the system’s condenser water flow rate and cooling tower fan speeds as optimization variables. Furthermore, a cooling load prediction algorithm was developed using a multiple non-linear regression model to approximate the building’s cooling load subject to a range of environmental conditions. The inputs and outputs of the individual component models were linked to estimate how adjusting the cooling tower fan and condenser water pump speed would influence the system’s comprehensive performance. Here, the overall system model was then optimized using a generalized reduced gradient optimization algorithm to determine the potential energy savings through speed control with VFDs and to ascertain a control logic strategy for the building automation system to operate the heating and cooling system. A case-study was performed on a single chiller system at a museum and the model was calibrated according to logged data collected over four months. Results showed that for the system analyzed, the energy saving of optimizing the cooling tower fan system was found to be 12–15%, while the energy saving potential of optimizing the condenser water pump with the cooling tower fan was negligible. Additionally, comparing different cooling tower fan control strategies showed that a wet-bulb approach-based cooling tower control strategy was shown to have the highest correlation to the optimized fan speed with an R 2 of 0.924.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Reliability-informed end-of-use decision making for product sustainability using two-stage stochastic optimization

The concept of circular economy has been diffused in recent decades to promote economic growth that does not add to the burden on natural resource extraction. Re-X options (e.g., reuse, repair, refurbish, remanufacture, recycle) have been gradually adopted in the product development process and optimized to reduce or eliminate waste and pollution. Although manufacturing incorporating Re-X options can be more environmentally friendly, it involves more sources of uncertainty than traditional manufacturing since the end-of-use products can be collected from multiple origins with various quantities and qualities, and the market demand for both new and remanufactured products cannot be forecasted perfectly. Thus, there is a need to optimize the Re-X policy to alleviate the negative impacts of the higher uncertainty. One option is using the reliability information of new products to estimate the end-of-use conditions and applying multi-stage stochastic optimization to capture multiple demand scenarios. This paper develops a two-stage stochastic optimization model to optimize the quality thresholds for reuse, recycling, and remanufacturing options. Our objective is to minimize the total cost, energy consumption, and environmental impact of producing and providing warranty service for a product family. The model employs reliability information of product components to estimate the warranty service cost and the end-of-use conditions of the returned resources. A case study on a general product family is implemented to illustrate the efficacy of the optimization model. Finally, results show that the two-stage optimization can achieve cost and environmental impact reduction for a hybrid manufacturing and remanufacturing process.

97 MATHEMATICS AND COMPUTING↗

Frhodo: A program for simulating chemical kinetic measurements and optimizing kinetic mechanisms

Chemical kinetic simulations are frequently used to extract kinetic and mechanistic information from experimental data by fitting simulations to the data. For simple systems of consecutive single channel reactions this is a relatively straightforward task. However, as the complexity of the system increases and particularly for systems involving competitive multi-channel reactions manually optimizing a mechanism to obtain the best fits to a range of experimental data quickly becomes a time-intensive and challenging process, especially when rate coefficients have pressure and temperature dependencies. There is considerable potential for exploiting automated optimization methods to rapidly screen reaction mechanisms and optimize the fit by adjusting rate coefficients within well-defined constraints. A new chemical kinetics simulation program, Frhodo, has been developed for this purpose. The program allows either manual simulation of individual experiments or fully automated optimization against a range of experimental data by adjusting user selected reactions within user defined constraints. Frhodo incorporates machine learning-based optimization routines that work by either minimizing standardized residuals or through Bayesian parameter estimation. Frhodo's optimization capabilities are demonstrated by reexamining two previously studied systems of relevance to combustion. Dissociation of diacetyl followed by recombination of methyl radicals is an example of a sequence of single channel, consecutive reactions. Pyrolysis of 2-methyl furan exemplifies multi-channel, unimolecular reactions that are often encountered and have temperature and pressure dependencies in the rate coefficients of the channels and branching ratios between them. For both systems the optimization routines resulted in solutions similar to the original studies. Finally, comments are made on the strengths and limitations of the approach.

0D simulation↗

Managing uncertainty in data-driven simulation-based optimization

Optimization using data from complex simulations has become an attractive decision-making option, due to ability to embed high-fidelity, non-linear understanding of processes within the search for optimal values. Due to lack of tractable algebraic equations, the link between simulations and optimization is oftentimes a surrogate metamodel. However, several forms of uncertainty exist within the cycle that links simulation data, to metamodels, to optimization. Uncertainty may originate from parameters of the simulation, or the form and fitted parameters of the metamodel. This paper reviews different literatures that are relevant to surrogate-based optimization and proposes different strategies for handling uncertainty, by combining machine learning with stochastic programming, robust optimization, and discrepancy modeling. We show that incorporating uncertainty management within simulation-based optimization leads to more robust solutions, which protect the decision-maker from infeasible solutions. Here, we present the results of our proposed approaches through a case study for direct-air capture through temperature swing adsorption.

42 ENGINEERING↗