Search NASA⌕ Search

SEARCH · Search NASA

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 667 records · Page 37

Direct construction of optimized stellarator shapes. Part 2. Numerical quasisymmetric solutions

Quasisymmetric stellarators are appealing intellectually and as fusion reactor candidates since the guiding-centre particle trajectories and neoclassical transport are isomorphic to those in a tokamak, implying good confinement. Previously, quasisymmetric magnetic fields have been identified by applying black-box optimization algorithms to minimize symmetry-breaking Fourier modes of the field strength $B$ . Here, instead, we directly construct magnetic fields in cylindrical coordinates that are quasisymmetric to leading order in the distance from the magnetic axis, without using optimization. The approach involves solution of a one-dimensional nonlinear ordinary differential equation, originally derived by Garren & Boozer ( Phys. Fluids B, vol. 3, 1991, p. 2805). We illustrate the usefulness and accuracy of this optimization-free approach by providing the results of this construction as input to the codes VMEC and BOOZ_XFORM, confirming the purity and scaling of the magnetic spectrum. The space of magnetic fields that are quasisymmetric to this order is parameterized by the magnetic axis shape along with three other real numbers, one of which reflects the on-axis toroidal current density, and another one of which is zero for stellarator symmetry. The method here could be used to generate good initial conditions for conventional optimization, and its speed enables exhaustive searches of parameter space.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Technoeconomic Design Optimization for Fast Reactors. Part I: Workflow Development and Case Study for Small LFR District Energy Application

The nuclear industry is developing small reactor designs that can target a variety of deployment locations and energy products. Smaller nuclear designs have traditionally struggled to handle the steep trade-offs between size and cost that have historically incentivized large reactors. This motivates computational optimization of small reactors to minimize costs and quantify the trade-off between size and cost. In this paper, the cost/size trade-off for a small fast reactor is derived using a multi-objective genetic algorithm optimization, with steady-state, transient, and cost analysis of the fast reactor being performed. Specifically, the method is demonstrated on a small 10- to 120-MW(thermal) U-Pu-Zr–fueled lead-cooled fast reactor with a 10-year core life for district energy applications, which can have a thermal load compatible with this range. The results reinforced that fast reactor cores at the lower end of this power range suffer cost penalties due to critical mass considerations. It was found that high power density cores with strong reactivity swings and many control rods were favored over designing to minimize reactivity swing. Furthermore, this contrasts with some traditional configurations designed using engineering judgment and demonstrates that optimizers can find nontraditional but realistic solutions, along with demonstrating the value of incorporating cost functions into whole-reactor design optimization.

Fast reactor↗

Efficient state preparation for the Schwinger model with a theta term

We present a comparison of different quantum state preparation algorithms and their overall efficiency for the Schwinger model with a theta term. While adiabatic state preparation is proved to be effective, in practice it leads to large gate counts to prepare the ground state. The quantum approximate optimization algorithm (QAOA) provides excellent results while keeping the counts small by design, at the cost of an expensive classical minimization process. We introduce a “blocked” modification of the Schwinger Hamiltonian to be used in the QAOA that further decreases the length of the algorithms as the size of the problem is increased. The rodeo algorithm (RA) provides a powerful tool to efficiently prepare any eigenstate of the Hamiltonian, as long as its overlap with the initial guess is large enough. We obtain the best results when combining the blocked QAOA ansatz and the RA, as this provides an excellent initial state with a relatively short algorithm without the need to perform any classical steps for large problem sizes. Published by the American Physical Society 2025

Bazavov, Alexei (ORCID:0000000321411901)↗

Software for Optimizing Plans Involving Interdependent Goals

A computer program enables construction and optimization of plans for activities that are directed toward achievement of goals that are interdependent. Goal interdependence is defined as the achievement of one or more goals affecting the desirability or priority of achieving one or more other goals. This program is overlaid on the Automated Scheduling and Planning Environment (ASPEN) software system, aspects of which have been described in a number of prior NASA Tech Briefs articles. Unlike other known or related planning programs, this program considers interdependences among goals that can change between problems and provides a language for easily specifying such dependences. Specifications of the interdependences can be formulated dynamically and provided to the associated planning software as part of the goal input. Then an optimization algorithm provided by this program enables the planning software to reason about the interdependences and incorporate them into an overall objective function that it uses to rate the quality of a plan under construction and to direct its optimization search. In tests on a series of problems of planning geological experiments by a team of instrumented robotic vehicles (rovers) on new terrain, this program was found to enhance plan quality.

Estlin, Tara↗

Toward fusion plasma scenario planning for NSTX-U using machine-learning-accelerated models

One of the most promising devices for realizing power production through nuclear fusion is the tokamak. To maximize performance, it is preferable that tokamak reactors achieve advanced operating scenarios characterized by good plasma confinement, improved magnetohydrodynamic (MHD) stability, and a largely non-inductively driven plasma current. Such scenarios could enable steady-state reactor operation with high \emph{fusion gain} --- the ratio of produced fusion power to the external power provided through the plasma boundary. Precise and robust control of the evolution of the plasma boundary shape as well as the spatial distribution of the plasma current, density, temperature, and rotation will be essential to achieving and maintaining such scenarios. The complexity of the evolution of tokamak plasmas, arising due to nonlinearities and coupling between various parameters, motivates the use of model-based control algorithms that can account for the system dynamics. In this work, a learning-based accelerated model trained on data from the National Spherical Torus Experiment Upgrade (NSTX-U) is employed to develop planning and control strategies for regulating the density and temperature profile evolution around desired trajectories. The proposed model combines empirical scaling laws developed across multiple devices with neural networks trained on empirical data from NSTX-U and a database of first-principles-based computationally intensive simulations. The reduced execution time of the accelerated model will enable practical application of optimization algorithms and reinforcement learning approaches for scenario planning and control development. An initial demonstration of applying optimization approaches to the learning-based model is presented, including a strategy for mitigating the effect of leaving the finite validity range of the accelerated model. The approach shows promise for actuator planning between experiments and in real-time.

machine learning↗

Model-based Design Optimization to Achieve the Performance Goals (16.0 SEER/9.5 HSPF), Developing Heat Pump by Using Low-GWP Refrigerants and 5 mm Diameter Tubes

Usage of low-GWP refrigerants can reduce the Green House Gas (GHG) emission of HVAC systems. Our research in previous milestone report has shown that using heat exchangers with 5 mm diameter tubes instead of 9 mm diameter tubes is a promising solution to meet the performance goals of heat pump using low-GWP refrigerants. In addition, the 5mm tube heat exchangers can lead to lower system refrigerant charge and as a result, reduce environmental impact further. However, shifting to small tube diameters requires in-depth heat exchanger design optimization to adapt to the transition to low-GWP refrigerants. In the 2nd quarter of FY21, we conducted multi-objective optimizations using Particle Swarm Optimization algorithm on a residential 5-ton air source heat pump to investigate the potential system performance improvements and material savings. 4 low-GWP refrigerants, ARM20A, ARM20B, R454A and R454C are investigated in this study. The objectives of the optimization are to minimize the heat pump material cost and to maximize the system performance simultaneously. As a result, the HXs material cost is reduced by up to 77% according to the copper and aluminum material price in current market. Under heating mode operation, the smart 4-way valve guarantees that the optimal low-GWP systems maintain or outperform the heating performance of the R410A baseline system. The model-based design optimization yields 18.3-18.9 SEER and 10.6-11.9 HSPF for optimal systems using different low-GWP refrigerants. The initial performance goals (16.0 SEER/9.5 HSPF) are achieved. Furthermore, up to 50% system refrigerant charge reduction is possible in the optimized low-GWP heat pump system using ARM20B. And 91%-95% predicted life-time direct CO 2 emission reduction is achieved by using the optimal 5mm tube low-GWP heat pumps. The significant material saving, charge reduction and direct CO 2 emission reduction help in reducing the environmental impacts of heat pump systems. The optimal heat exchangers resulting from this research can fit into the original baseline indoor and outdoor fan-coil unit. This can reduce the retrofitting effort by minimizing the change in manufacturing and installation of the heat pumps and guarantee the compatibility with end-users’ house structure. Finally, the new products can be easily accepted by manufacturers and end-users.

42 ENGINEERING↗

Optimization of Air-Breathing Engine Concept

The design optimization of air-breathing propulsion engine concepts has been accomplished by soft-coupling the NASA Engine Performance Program (NEPP) analyzer with the NASA Lewis multidisciplinary optimization tool COMETBOARDS. Engine problems, with their associated design variables and constraints, were cast as nonlinear optimization problems with thrust as the merit function. Because of the large number of mission points in the flight envelope, the diversity of constraint types, and the overall distortion of the design space; the most reliable optimization algorithm available in COMETBOARDS, when used by itself, could not produce satisfactory, feasible, optimum solutions. However, COMETBOARDS' unique features-which include a cascade strategy, variable and constraint formulations, and scaling devised especially for difficult multidisciplinary applications-successfully optimized the performance of subsonic and supersonic engine concepts. Even when started from different design points, the combined COMETBOARDS and NEPP results converged to the same global optimum solution. This reliable and robust design tool eliminates manual intervention in the design of air-breathing propulsion engines and eases the cycle analysis procedures. It is also much easier to use than other codes, which is an added benefit. This paper describes COMETBOARDS and its cascade strategy and illustrates the capabilities of the combined design tool through the optimization of a high-bypass- turbofan wave-rotor-topped subsonic engine and a mixed-flow-turbofan supersonic engine.

Patnaik, Surya N.↗

Effect of Yagi–Uda nano-antenna element shape on the directivity and radiation efficiency

In this paper, different optimal designs of Yagi–Uda nano-antennas (NAs) are introduced and analyzed based on different element shapes to maximize the directivity and radiation efficiency. The studied element shapes include triangular, hexagonal, cube, square, rotated square, rectangular, ellipsoid, and elliptical cylinder shapes. The NAs parameters for each design are optimized using particle swarm optimization algorithm to achieve high directivity at a wavelength of 500 nm for wireless point-to-point applications. The designs are numerically analysed using 3-D finite difference time domain method (3-D FDTD) via Lumerical software package. To illustrate the performance of the proposed antennas, different radiation parameters such as radiation pattern, directivity, and radiation efficiency have been studied. Moreover, a tolerance of ± 5% is calculated to consider the imperfections that may appear in the fabrication process at a nanoscale. The optimized rectangular prism NA achieves the highest directivity of 24.21 with an efficiency of 50.74%. However, the optimized triangular prism NA has the highest efficiency of 73% with a directivity of 20.89. This enhancement is mainly attributed to the efficient coupling between array elements along with low side lobe level. However, a trade-off between directivity and radiation efficiency is obtained by the hexagonal prism NA with directivity of 21.9 and radiation efficiency of 69.1%.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

An Improved Genetic Algorithm approach to the Unit Commitment/Economic Dispatch problem

The deployment of new technologies, the importance of accurately modeling the dynamics of the generating units and the introduction of new policies are making the solution of the Unit Commitment/Economic Dispatch problem more and more complicated.In the present scenario, traditionally followed scheduling criteria might not lead to the optimal fleet configuration any more. In addition, most of the widely used techniques have limited capabilities at modeling the nonlinear dynamics of committed power plants. When realistic power systems comprising of several tens of generating units are modeled, the resulting optimization problem turns to be computationally intensive for the current computing capabilities. In this paper, an improved version of a GA-based optimization algorithm is presented. A detailed methodology aimed at obtaining a more efficient version of the GA, and a more detailed and accurate description of the flexible operation flexibility of the power plants is described.

genetic algorithm↗

The Uniform Methods Project: Smart Thermostat Evaluation Protocol

A smart thermostat is an internet-connected device that controls home heating, ventilation, and air-conditioning (HVAC) equipment and can automatically adjust temperature set points to optimize performance and achieve energy savings. Smart thermostat features often include two way communication, occupancy detection (such as geofencing and occupancy sensors), schedule learning, and seasonal optimization algorithms. Smart thermostats can control most conventional HVAC systems, including central air conditioners, heat pumps, and forced air furnaces. Several types of residential utility programs offer smart thermostats as replacements measures. Working with smart thermostat vendors, utilities can offer separate optimization programs to produce energy savings beyond those achieved by installing a smart thermostat. From an evaluation perspective, smart thermostat programs have several noteworthy features. First, the energy savings from a smart thermostat may change over the life of the device. As a smart thermostat is connected to the internet, original equipment manufacturers can update the thermostat software to improve the thermostat's energy efficiency. Likewise, users can adjust the thermostat settings and schedules over time in response to changes in weather, thermal comfort, energy prices, or preferences for energy efficiency. Additionally, many thermostat manufacturers offer seasonal optimization programs that recommend changes or make minor, automated adjustments to the thermostat settings to improve energy efficiency. These opt-in programs are now standard offerings for many smart thermostat manufacturers and provided at no additional cost to users. The potential for software updates and continuous optimization and the evolving nature of user interactions mean future energy savings may differ from first-year savings and the energy savings of smart thermostats may need to be evaluated more than once. Second, smart thermostats often have small unit energy savings relative to a home's total energy consumption, especially in comparison to whole- home retrofit programs. This can make it difficult to detect the smart thermostat savings in billing or advanced metering infrastructure (AMI) meter consumption data. For example, as cooling loads in many regions average about 20% of annual electricity consumption, smart thermostat savings of 10% of cooling energy use would equate to a 2% reduction in home electricity consumption. Evaluators should use regression analysis of whole-home billing consumption or advanced metering infrastructure (AMI) meter consumption data to evaluate smart thermostat savings because, as explained at greater length below , these data are usually available to evaluators and regression can control for the impacts of weather and other potentially confounding factors on a home's energy consumption. Finally, as with other energy efficiency programs, participation in smart thermostat programs is self-selective. As discussed at greater length below , smart thermostat participants tend to be, among other things, younger, higher-income, and more likely to adopt electric vehicles (EVs) and internet connected devices than nonparticipants. These differences are often unobservable to the evaluator and correlated with a home's energy consumption, creating the potential for bias in estimating savings. Due to the small unit savings of thermostats, errors and biases from self-selection that may not be very consequential when evaluating a whole- home retrofits (e.g., ±2% of home electricity consumption) can have a major impact when evaluating the savings and cost-effectiveness of smart thermostat programs. A percentage point change in the estimated savings could affect the cost-effectiveness of a program. This means it is important for evaluators to assess and to minimize the potential for error from selection bias in estimating smart thermostat program savings. The Uniform Methods Project provides model protocols for determining energy savings and demand reductions that result from specific energy efficiency measures implemented through state and utility programs. In most cases, the measure protocols are based on a particular option identified by the International Performance Verification and Measurement Protocol ; however, this work provides a more detailed approach to implementing that option. Each chapter is written by technical experts in collaboration with their peers, reviewed by industry experts, and subject to public review and comment. The UMP protocols can be used by utilities, program administrators, public utility commissions, evaluators, and other stakeholders for both program planning and evaluation.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Optimization of the moderators in the STS preliminary design

This report details the results for an optimization of the dimensions of the moderators in the preliminary design of the Spallation Neutron Source Second Target Station (STS). This study uses the optimization algorithms of Dakota and an unstructured mesh model for the moderators in MCNP. More details on the unstructured mesh model and the automated mesh generation can be found in [3]. Parallel to this effort, the same moderator geometries have been optimized using a constructive solid geometry (CSG) MCNP model. More details on this model and its results can be found in [4]. Three optimal designs are selected for each moderator: one that is optimized for maximum peak brightness, one for maximum time-integrated brightness, and one for a combination of peak and time-integrated brightness. The backbone of the optimization work flow is provided by Dakota. For each set of design parameters requested by Dakota, a new solid geometry is automatically built in Creo and SpaceClaim, and subsequently exported to Attila4MC to generate an unstructured mesh geometry for MCNP. After the MCNP calculation is finished, the objective function (e.g., brightness metric) is returned to Dakota. After the new design has been evaluated, a result-file is written, and Dakota proposes the next set of design parameters to be evaluated. The loop continues until a specified convergence criterion has been met. The design parameters of the cylindrical (upper) moderator include the hydrogen radius, the premoderator thickness (top, bottom, radial), the beryllium radius and the horizontal position of the moderator. The crucial design choice is the hydrogen radius. A radius of 62 mm is shown to provide the maximum time-integrated brightness. The maximum peak brightness occurs with a radius of 40 mm. A combined (middle) design, which balances peak and time-integrated brightnesses, is obtained with a hydrogen radius of 50 mm. The premoderator thicknesses and the beryllium radius are slightly larger in the design optimized for time-integrated brightness than in the design optimized for peak brightness. The sensitivity to these two parameters is relatively small close to the optimal configurations. The hydrogen vessel and vacuum vessel wall thicknesses are dependent on the radius of the liquid hydrogen due to structural integrity requirements. The increased wall thicknesses for larger vessels significantly penalize the time-integrated brightness, with the maximum obtainable value reduced by more than 10% relative to earlier studies which used fixed vessel wall thicknesses. The impact of the variable wall thicknesses is much less for the peak brightness and combined brightness designs. The design parameters of the tube (lower) moderator selected for the optimization are the tube length, the annular premoderator thickness, the beryllium radius and the horizontal position of the moderator. The tube length is the crucial parameter and is chosen large (210 mm) and small (125 mm) in the designs optimized for time-integrated and peak brightness respectively. A combined optimal design has a tube length of 170 mm. The premoderator thickness and the beryllium radius are chosen larger in the design optimized for time-integrated brightness.

42 ENGINEERING↗

Adaptive Online Model Update Algorithm for Predictive Control in Networked Systems

In this article, we introduce an adaptive on-line model update algorithm designed for predictive control applications in networked systems, particularly focusing on power distribution systems. Unlike traditional methods that depend on historical data for offline model identification, our approach utilizes real-time data for continuous model updates. This method integrates seamlessly with existing online control and optimization algorithms and provides timely updates in response to real-time changes. This methodology offers significant advantages, including a reduction in the communication network bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt after disturbances. Furthermore, our algorithm is tailored for non-linear convex models, enhancing its applicability to practical scenarios. The efficacy of the proposed method is validated through a numerical study, demonstrating improved control performance using a synthetic IEEE test case.

data-driven model predictive control↗

A gradient-based optimization approach for the detection of partially connected surfaces using vibration tests

The integrity of engineering structures is often compromised by embedded surfaces that result from incomplete bonding during the manufacturing process, or initiation of damage from fatigue or impact processes. Examples include delaminations in composite materials, incomplete weld bonds when joining two components, and internal crack planes that may form when a structure is damaged. In many cases the areas of the structure in question may not be easily accessible, thus precluding the direct assessment of structural integrity. In this paper, we present a gradient-based, partial differential equation (PDE)-constrained optimization approach for solving the inverse problem of interface detection in the context of steady-state dynamics. An objective function is defined that represents the difference between the model predictions of structural response at a set of spatial locations, and the experimentally measured responses. One of the contributions of our work is a novel representation of the design variables using a density field that takes values in the range [0, 1] and raised to an integer exponent that promotes solutions to be near the extrema of the range. The density field is combined with the penalty method for enforcing a zero gap condition and realizing partially bonded surfaces. Furthermore the use of the penalty method with a density field representation leads to objective functions that are continuously differentiable with respect to the unknown parameters, enabling the use of efficient gradient-based optimization algorithms. Numerical examples of delaminated plates are presented to demonstrate the feasibility of the approach.

42 ENGINEERING↗

Constrained Bayesian Optimization of Criticality Experiments [Slides]

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. We demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for criticality safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗

Constrained Bayesian Optimization of Criticality Experiments at LLNL [Slides]

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. We demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for critical ity safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗

Constrained Bayesian optimization of criticality experiments

The design of criticality experiments is typically an iterative process that employs a Monte Carlo transport code. The goal is to find a design that optimizes some variable, like the sensitivity of a response to a cross section, while simultaneously ensuring criticality. The high fidelity of the Monte Carlo code is a great asset, but it makes exploring the design space computationally expensive. Herein, we present how a constrained Bayesian optimization algorithm can be used to efficiently design a criticality experiment. It uses Gaussian processes as a surrogate model to probe the design space and to reduce the number of code executions that are needed to find the optimum. Furthermore, we demonstrate constrained Bayesian optimization with a Pu-239/polyethylene solution system and a TEX experiment that is designed for criticality safety validation of a nuclear waste model at the Hanford Site. For both systems, a global optimum was found within 75 Monte Carlo simulations.

42 ENGINEERING↗

Constrained minimization of smooth functions using a genetic algorithm

The use of genetic algorithms for minimization of differentiable functions that are subject to differentiable constraints is considered. A technique is demonstrated for converting the solution of the necessary conditions for a constrained minimum into an unconstrained function minimization. This technique is extended as a global constrained optimization algorithm. The theory is applied to calculating minimum-fuel ascent control settings for an energy state model of an aerospace plane.

Moerder, Daniel D.↗

A scalable matrix-free spectral element approach for unsteady PDE constrained optimization using PETSc/TAO

In this work, we provide a new approach for the efficient matrix-free application of the transpose of the Jacobian for the spectral element method for the adjoint-based solution of partial differential equation (PDE) constrained optimization. This results in optimizations of nonlinear PDEs using explicit integrators where the integration of the adjoint problem is not more expensive than the forward simulation. Solving PDE constrained optimization problems entails combining expertise from multiple areas, including simulation, computation of derivatives, and optimization. The Portable, Extensible Toolkit for Scientific computation (PETSc) together with its companion package, the Toolkit for Advanced Optimization (TAO), is an integrated numerical software library that contains an algorithmic/software stack for solving linear systems, nonlinear systems, ordinary differential equations, differential algebraic equations, and large-scale optimization problems and, as such, is an ideal tool for performing PDE-constrained optimization. This paper describes an efficient approach in which the software stack provided by PETSc/TAO can be used for large-scale nonlinear time-dependent problems. Time integration can involve a range of high-order methods, both implicit and explicit. The PDE-constrained optimization algorithm used is gradient-based and seamlessly integrated with the simulation of the physical problem.

97 MATHEMATICS AND COMPUTING↗