SEARCH · Engineering Papers
Results for “optimized”
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.
COBRA (Co-Optimized Bluntbody Re-entry Analysis): A mission optimization process by which an entry system is co-optimized along with its trajectories, thermal protection system, structures, and subsystems to satisfy a set of stakeholder objectives
Explore the source record for details and available documents.
Optimizing Irregular Communication with Neighborhood Collectives and Locality-Aware Parallelism
Irregular communication often limits both the performance and scalability of parallel applications. Typically, applications individually implement irregular communication as point-to-point, and any optimizations are integrated directly into the application. As a result, these optimizations lack portability. It is difficult to optimize point-to-point messages within MPI, as the interface for single messages provides no information on the collection of all communication to be performed. However, the persistent neighbor collective API, released in the MPI 4 standard, provides an interface for portable optimizations of irregular communication within MPI libraries. This paper presents methods for implementing existing optimizations for irregular communication within neighborhood collectives, analyzes the impact of replacing point-to-point communication in existing codebases such as Hypre BoomerAMG with neighborhood collectives, and finally shows up to a 1.38x speedup on sparse matrix-vector multiplication communication within a BoomerAMG solve through the use of our optimized neighbor collectives. Here, the authors analyze three implementations of persistent neighborhood collectives for Alltoallv: an unoptimized wrapper of standard point-to-point communication, and two locality-aware aggregating methods. The second locality-aware implementation exposes an non-standard interface to perform additional optimization, and the authors present the additional 0.07x speedup from the extended interface. All optimizations are available in an open-source codebase, MPI Advance, which sits on top of MPI, allowing for optimizations to be added into existing codebases regardless of the system MPI install.
Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization
The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.
Stochastic Learning Approach for Binary Optimization: Application to Bayesian Optimal Design of Experiments
Here, we present a novel stochastic approach to binary optimization suited for optimal experimental design (OED) for Bayesian inverse problems governed by mathematical models such as partial differential equations. The OED utility function, namely, the regularized optimality criterion, is cast into a stochastic objective function in the form of an expectation over a multivariate Bernoulli distribution. The probabilistic objective is then solved by using a stochastic optimization routine to find an optimal observational policy. This formulation (a) is generally applicable to binary optimization problems with soft constraints and is ideal for OED and sensor placement problems; (b) does not require differentiability of the original objective function (e.g., a utility function in OED applications) with respect to the design variable, and thus it enables direct employment of sparsity-enforcing penalty functions such as $\ell_0$, without needing to utilize a continuation procedure or apply a rounding technique; (c) exhibits much lower computational cost than traditional gradient-based relaxation approaches; and (d) can be applied to both linear and nonlinear OED problems with proper choice of the utility function. The proposed approach is analyzed from an optimization perspective with detailed convergence analysis of the optimization approach and is also analyzed from a machine learning perspective with correspondence to policy gradient reinforcement learning. The approach is demonstrated numerically by using an idealized two-dimensional Bayesian linear inverse problem and validated by extensive numerical experiments carried out for sensor placement in a parameter identification setup.
Optimal Strategies for Hybrid Battery‐Storage Systems Design
As stationary hybrid energy‐storage systems (HESS) for power systems applications have recently drawn interest due to their enhanced performance and decreasing cost, developing systematic approaches for HESS design while considering controls is gaining traction. Herein, a method is presented to optimally design hybrid battery storage by proposing a mathematical modeling framework, formulated as a mixed integer linear programming model. The optimization is capable of handling multiple subsystems of batteries, considering their economic and technological performance. Decisions involve sizing of the batteries, optimal temporal and strategic dispatch to end uses, and energy sources for charging each battery. The applicability of the model is tested on four case studies for three battery chemistries representing distinct objectives: high‐power, high‐energy, and second life. Compared to traditionally designed battery storage with a homogeneous battery, optimally designed hybrid systems can save 12%–26% of system costs, depending on the nature of the dispatch profile. Findings point to design preference toward the second life battery supplemented with some high‐power or high‐energy battery capacity, or both. With the utilized electricity price structure, customers can experience approximately 10%–35% reduction in their bills.
Fuel-Optimal Trajectory Optimization of Mach 0.745 Transonic Truss-Braced Wing with Variable Camber Continuous Trailing Edge Flap
This paper describes a fuel-optimal trajectory optimization of the Mach 0.745 Transonic Truss-Braced Wing with the variable camber continuous trailing edge flaps (VCCTEF) capable of changing the chordwise pressure distribution and spanwise lift distribution to minimize drag. The trajectory optimization is posed as a minimization of the fuel burn over a fixed cruise range. The trajectory optimization is formulated by the adjoint method which results in a two-point boundary value problem. A numerical shooting method is implemented to solve the minimum-fuel trajectory optimization. The results indicates a fuel burn reduction of 793 lbs or 5.5% for a cruise range of 3000 miles. An approximate trajectory optimization is proposed using a single adjoint variable. This leads to a greatly simplified analytical solution of the adjoint solution. The results of the approximate trajectory optimization are in excellent agreement with those obtained by the shooting method. The approximate trajectory optimization produces a fuel burn reduction of 615 lbs or 4.3%.
Adaptive Optimization for System Performance and Combined Bernstein Polynomial, Optimal Reciprocal Collision Avoidance, Differential Dynamic Programming for Trajectory Replanning and Collision Avoidance for UAM Vehicles
The emerging urban air mobility (UAM) sector in aerospace is driving development of unconventional multi-modal vehicle configurations and autonomous flight. The combination of multi-modal vehicle dynamics, complex environment, requirements to deal with flight contingencies in an efficient and safe manner, as well as necessity for precise trajectory following and performance, are the driving influence behind adaptive optimization for system performance. We are interested in trajectory optimization algorithm that would system parameter estimation and identifying the optimal switching time between modes of hybrid dynamical systems. This presentation discusses a parameterized optimal control trajectory optimization algorithm that is an extended and generalized version of Differential Dynamic Programming (DDP), titled Parameterized Differential Dynamic Programming (PDDP). DDP is an efficient trajectory optimization algorithm relying on second order approximations of a system’s dynamics and cost function and has recently been applied to optimize systems with time invariant parameters. Experiments are presented applying PDDP to solve model predictive control (MPC) and moving horizon estimation (MHE) tasks simultaneously. In particular, PDDP is used to determine the optimal transition point between flight regimes of a complex urban air mobility (UAM) class vehicle exhibiting multiple phases of flight and to identify and compensate for actuation faults.
Designing Monte Carlo Simulation and an Optimal Machine Learning to Optimize and Model Space Missions
This paper investigates applying artificial intelligence (AI) algorithms to attitude control system of satellites to optimally tune the controller using high performance computing. This methodology is applied to the Virtual Telescope for X-ray Observation mission, which is a precise formation of two separate spacecraft observing multiple objects in the space in the X-ray domain. The mission is divided into phases based on the instrumentation and the mission goal. To reach an stable precise formation robust to stochastic slew and slew rate (i.e., Euler angles and angular velocities) in a minimal constrained time T , consumed energy of the attitude control system, denoted as E, and root-mean-square state error of attitude control system, denoted as e, are minimized. Monte-Carlo simulation is used for the sensitivity analysis of optimization and designing a controller. Deep neural networks (DNN), Gaussian processes (GP), and support vector regression (SVR) learn this optimization as a surrogate model, while their hyperparameters are optimized in a novel approach. THETA supercomputer at Argonne Leadership Computing Facility (ALCF) is used for optimizing the hyperparameters of DNN. The surrogate model meets the requirements of the mission, and it shows a better performance over the optimization and Monte-Carlo. The optimal DNN can satisfy the mission requirements e and T while reducing E for 90% compared to the other given methods.
Optimal Power System Black start using Inverter-Based Generation
Power system black start readiness is part of the system planning. Utility planners perform periodic studies to assess if their power system is capable of total restoration following a black out. Hydro and diesel generators are the most commonly used black start capable resources by power utilities. However, with increasing penetration of solar generation, inverter-based resources can be considered to provide black start capability. Since the solar inverters can be located at multiple locations throughout the power system, and in view of their unique characteristics, an optimal real-time capable plan is helpful for system operators for faster black start. Black start optimization is a multi stage mixed-integer non-linear optimization which is extremely hard to solve. In this paper, we propose an optimal black start methodology that is easier to solve and scalable in real-time. We demonstrate the proposed methodology on two test systems and illustrate how inverter-based resources can contribute and improve power system restoration.
Minimizing the Electromechanical Stresses in Poloidal Field Coils by Optimizing their Numbers and Locations using FREDA Framework
Poloidal field (PF) and central solenoid (CS) coils play a crucial role in sustaining the equilibrium and preserving the shape of highly confined tokamak plasmas. Ensuring that PF coil current and mechanical stress stay within superconducting and structural limitations is an important check in the design assessment. Minimizing the PF coil currents and mechanical stresses influences reliability, cost, and performance. A free-boundary MHD equilibrium code—FreeGS is employed within the fusion reactor design and assessment (FREDA) whole facility modeling (WFM) framework to construct the plasma equilibrium based on the configuration and currents in the PF coils. Here, we present the capability of the FreeGS code to minimize the currents, forces, and electromagnetic stresses on the PF coils by optimizing their number, sizes, structures, and locations while maintaining an MHD stable plasma configuration with a large confinement factor. The workflow is initialized with a configuration of plasma parameters and coils’ locations from the 0-D tokamak build systems code in the FREDA framework. Then, FreeGS is called to calculate the initial equilibrium at the minimum total current in PF coils. Thereafter, FreeGS’s internal optimizer minimizes the currents and hoop and central forces on the PF coils while maintaining the reference equilibrium. Finally, the input configuration is updated with the optimized parameters for equilibria over the ramp-up phase of a burning-plasma operation. FREDA’s whole facility optimization capability, which includes all magnetic field coil systems, blanket, vacuum vessel (VV), first wall, divertor, etc., is under development and out of the scope for this study.
A Mixed Integer Efficient Global Optimization Algorithm with Multiple Infill Strategy - Applied to a Wing Topology Optimization Problem
With the advancement in high performance computing and numerical optimization techniques,engineering design optimization problems are becoming more complex, larger scale,higher fidelity, and computationally more demanding, requiring longer run times than ever before. There exists methodologies and techniques that can address some of these challenges but very few can address all, and most are limited in the extent that these concerns can be addressed. With the goal of addressing such challenging engineering problems, we developed anew optimization framework, named AMIEGO, that combines concepts from surrogate-based optimization approaches, gradient-based numerical methods, Partial Least Squares, evolutionary algorithms, and Branch-and-Bound, providing newer capabilities that were not previouslyperceived. However, the original version of this framework, in the process of adaptive samplingto explore and exploit the design space, finds only a single sample point per iteration. The efforthere builds upon this previously developed optimization framework to include multiple infillsampling capability that combines the concept of generalized expected improvement function,unsupervised learning, and multi-objective evolutionary technique. To demonstrate, AMIEGOwith the multiple infill capability (called AMIEGO-MIMOS) solves a series of increasingly difficultengineering design optimization problems. The results reveal the performance of the newapproach is problem dependent. When applied to a ten-bar truss problem, the newly proposedmultiple infill strategy consistently leads to a better design solutions when compared to theexisting CPTV method (implemented with the context of the AMIEGO framework). On theother hand, when applied to a mixed-integer high fidelity wing topology optimization problem- MIMOS, despite showing a steeper convergence at the start, eventually leads to an inferiorsolution as compared to CPTV approach. These results also reveal that a small number ofstarting points, in general, are sufficient to lead to a good overall solution.
A parallel variable population multi-objective optimizer for accelerator beam dynamics optimization
The simultaneous optimization of multiple objective functions is needed in many particle accelerator applications. In this paper, we present a parallel evolution based multi-objective optimizer that uses a variable population from generation to generation and an external storage to save good solutions. Two heuristic optimization methods, one uses the unified differential evolution and the other uses the real-coded genetic algorithm, are included in the optimizer to generate next generation candidate solutions, and are compared in the test examples. Finally, as an application, we applied this optimizer to the beam dynamics design optimization of a photoinjector and attained the optimal front solutions after 200 generations with the unified differential evolution offspring production scheme.
Coupled Low-thrust Trajectory and System Optimization via Multi-Objective Hybrid Optimal Control
The optimization of low-thrust trajectories is tightly coupled with the spacecraft hardware. Trading trajectory characteristics with system parameters ton identify viable solutions and determine mission sensitivities across discrete hardware configurations is labor intensive. Local independent optimization runs can sample the design space, but a global exploration that resolves the relationships between the system variables across multiple objectives enables a full mapping of the optimal solution space. A multi-objective, hybrid optimal control algorithm is formulated using a multi-objective genetic algorithm as an outer loop systems optimizer around a global trajectory optimizer. The coupled problem is solved simultaneously to generate Pareto-optimal solutions in a single execution. The automated approach is demonstrated on two boulder return missions.
Rotorcraft Optimization Tools: Incorporating Rotorcraft Design Codes into Multi-Disciplinary Design, Analysis, and Optimization
One of the goals of NASA's Revolutionary Vertical Lift Technology Project (RVLT) is to provide validated tools for multidisciplinary design, analysis and optimization (MDAO) of vertical lift vehicles. As part of this effort, the software package, RotorCraft Optimization Tools (RCOTOOLS), is being developed to facilitate incorporating key rotorcraft conceptual design codes into optimizations using the OpenMDAO multi-disciplinary optimization framework written in Python. RCOTOOLS, also written in Python, currently supports the incorporation of the NASA Design and Analysis of RotorCraft (NDARC) vehicle sizing tool and the Comprehensive Analytical Model of Rotorcraft Aerodynamics and Dynamics II (CAMRAD II) analysis tool into OpenMDAO-driven optimizations. Both of these tools use detailed, file-based inputs and outputs, so RCOTOOLS provides software wrappers to update input files with new design variable values, execute these codes and then extract specific response variable values from the file outputs. These wrappers are designed to be flexible and easy to use. RCOTOOLS also provides several utilities to aid in optimization model development, including Graphical User Interface (GUI) tools for browsing input and output files in order to identify text strings that are used to identify specific variables as optimization input and response variables. This paper provides an overview of RCOTOOLS and its use
Understanding Resilience Optimization Architectures With an Optimization Problem Repository
Optimizing a system’s resilience can be challenging, especially when it involves considering both the inherent resilience of a robust design and the active resilience of a health management system to a set of computationally-expensive hazard simulations. While prior work has developed specialized architectures to effectively and efficiently solve combined design and resilience optimization problems, the comparison of these architectures has been limited to a single case study. To further study resilience optimization formulations, this work develops a problem repository which includes previously-developed resilience optimization problems and additional problems presented in this work: a notional system resilience model, a pandemic response model, and a cooling tank hazard prevention model. This work then uses models in the repository at large to understand the characteristics of resilience optimization problems and study the applicability of optimization architectures and decomposition strategies. Based on the comparisons in the repository, applying an optimization architecture effectively requires understanding the alignment and coupling relationships between the design and resilience models, as well as the efficiency characteristics of the algorithms. While alignment determines the necessity of a surrogate of resilience cost in the upper-level design problem, coupling determines the overall applicability of a sequential, alternating, or bilevel structure. Additionally, the application of decomposition strategies is dependent on there being limited interactions between variable sets, which often does not hold when a resilience policy is parameterized in terms of actions to take in hazardous model states rather than specific given scenarios.
Bayesian Optimization for Reactor Design Optimization
This study present a test case in which the Bayesian Optimization method is applied to a simulation-based reactor core design optimization problem. The test case aims to showcase the potential of an automated design optimization algorithm for reactor designs by streamlining the reactor core design workflow, given the high computational cost of simulations. The contributions of this work are threefold. First, the existing HTGR model is converted into a simulation-based design optimization test case by developing a pipeline that enables modification of key design parameters and evaluates design performance based on simulation outputs. Second, Bayesian Optimization is implemented and adapted to demonstrate the feasibility of automatic design optimization for nuclear reactor core. Proposed approach leverages Gaussian Process models to characterize the relationship between design variables and performance metrics, while incorporating novel acquisition functions that balance exploration of the design space with exploitation of promising configurations. This implementation lays the foundation for the future developments of reactor design optimization algorithms.
Technoeconomic Design Optimization for Fast Reactors. Part II: Impact of Technoeconomic Constraints on Optimal Design
There is a current drive toward optimizing reactors, particularly small/micro reactors to minimize cost and maximize performance. Previous work has investigated the development of technoeconomic workflows for the design optimization of pool-type fast reactors that aim to deploy into district energy grids. Initial scoping studies verified that the workflow was capable of capturing design trends throughout a variety of design configurations and problem formulations while remaining sufficiently flexible. In this paper, this methodology is applied to understand how cost functions and technoeconomic constraints can drive optimal reactor design. Specifically, the UPu10Zr-fueled fast reactor model from Part I is adapted to include changes in the fissile content limits, control rod worth limits, control rod drive cost, and assumed fuel form. In the case of constraint relaxation at fixed power (fissile content and control rod worth limits), cost sensitivities of 5% to 10% were uncovered. Multi-objective optimization at varying reactor power levels with individualized control rod drives for each assembly (as opposed to one operational and one safety drive) increased cost by $\$10$ to $\$25$ million and substantially altered the optimal core geometry, favoring geometries with substantially fewer control rod placements relative to baseline optimization. Finally, a multi-objective optimization was performed at varying power levels with the fuel form overhauled to metallic, high-assay low-enriched uranium–based U10Zr with more refined fuel cost models. In the case of uranium fueling, the costs increased by at least $50 million relative to the baseline case. Furthermore, economic fuel zoning and lower reactivity swing cores were recovered. Each case serves to demonstrate the value of applying technoeconomic workflows to initial reactor design scoping studies to better understand the trade-off for a proposed concept between different design options.