Engineering Papers⌕ Search

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.

At least 775 records · Page 43

An energy storage dispatch optimization for demand-side management in industrial facilities

An energy storage (ES) dispatch optimization was implemented to test lithium-ion battery ES, supercapacitor ES, and compressed air ES on two different industrial facilities – one intermittent process facility and one continuous process facility. The model first shows the capability of optimizing the size of a single technology on a single industrial facility to maximize the return on investment. Then, for the same profile, the model identifies significant differences in the optimal size for different technologies based on their performance parameters. Third, the model identifies differences in the optimal size for each technology based on the facilities profile. Here the results show compressed air ES yields the highest return on investment for both facilities and provides insight for future development of ES systems.

25 ENERGY STORAGE↗

Co-optimization of fuel properties, combustion system geometry, and injection strategy for conventional diesel fuel

Here, studies have shown that fuel properties can impact an engine’s operation in several ways, including ignition delay, sooting tendency, mixture formation, and combustion temperature. In mixing-controlled compression ignition (MCCI) engines, the fuel system design and piston bowl geometry significantly affect combustion performance and emissions. Based on current information, it is difficult to draw conclusions about fuel property effects and sensitivities. The central fuel hypothesis approach used in the US Department of Energy Co-Optima program has worked well for spark ignition fuels: identifying critical fuel property ranges is sufficient to screen fuel blends that are expected to maximize efficiency and reduce pollutant emissions. However, for MCCI-relevant fuels, the information gained from past studies is not sufficient to build such a merit function or to allow for performing a similar screening of fuel blends. It is hypothesized that a co-optimization of a fuel’s physical and chemical properties, combustion system geometry, and injection strategy could leverage synergies between the effects of the fuel properties and geometries, resulting in improved performance over state-of-the-art. A machine learning–assisted unconstrained global optimization algorithm was used to explore a design space comprising 23 independent variables. The results show that physical property effects were minimal even for large variations in fuel properties, and the only interaction effect that was observed was the effect of varied fuel density parameters on fuel/air mixture formation. Nevertheless, these interactions were not sufficient in magnitude to significantly affect optimization results. Therefore, analysis of the results suggests that fuel physical properties cannot be leveraged in a co-optimization context to increase engine efficiency.

33 ADVANCED PROPULSION SYSTEMS↗

Resilient Design of Continuous-time Distributed Optimization Algorithm in the Presence of Cyber-attacks

This paper presents a continuous-time resilient distributed optimization algorithm based on competitive interaction design method on connected graphs in the presence of adversaries. Here, the competitive interaction method allows us to design a network that protects the multi-agent systems from adversaries without requiring high network connectivity. In addition, the proposed algorithm does not require the global information about the number of adversaries. First, we show that the proposed distributed algorithm solves the resilient distributed optimization problem with no attack on the communication links. Second, we show that the proposed continuous-time distributed optimization algorithm on connected graphs converges to the small neighborhood of the optimal solution in the presence of cyber-attacks onto the communication channel. Simulations are presented to illustrate our theoretical results.

97 MATHEMATICS AND COMPUTING↗

Cost optimization of high recovery single stage gap membrane distillation

Estimating the cost of membrane distillation (MD) processes at scale is confounded by the vast array of possible process configurations, module configurations, and operating conditions and the extreme sensitivity of MD costs to these parameters. This work develops a comprehensive MD cost optimization framework for minimizing the levelized cost of water (LCOW) as a function of feed salinity and temperature. Our single stage gap MD model fully captures solution properties, heat transfer, and mass transfer relationships in the modules to determine the cost optimal design as a function of multiple decision variables, including process configuration (feed location and connectivity between the hot and cold-side), the gap type (air, permeate, conductive), equipment sizes (membrane, heater, chiller, and heat exchanger units), and operating conditions (flow rates, hot and cold side temperatures, and heating and cooling duties). We estimate that the minimum LCOW of conductive gap MD ranges between $\$$10 and $\$$16 per m 3 for feed salinities of 25 g/L to 200 g/L and water recoveries of 30%–75%. Further, we update several heuristic assumptions for cost optimal system operation, including: increased thermal conductivity of the gap decreases system costs; cost optimal MD operates at the highest allowable temperature; and the LCOW is a strong function of brine salinity. Finally, we find that improving membrane properties and lowering heating and cooling costs will provide only modest reductions in costs (<25%).

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Coupled beam-target-moderator optimization for the Second Target Station

To support the design of the Second Target Station, that aims to provide the world’s highest peak brightness of cold neutrons, studies that optimize the dimensions of the target and moderators are invaluable. In this work, we investigate the influence of the target dimensions and beam profile on the performance and optimal size of the moderators. We perform optimization runs with detailed MCNP6.2 simulations using high-fidelity unstructured mesh geometries generated from parametrized CAD models. We demonstrate that small changes in target height do not influence the moderator performance if the beam dimensions are chosen adequately. We quantify the effect of beam footprint and target width on the moderator performance and show that the optimal moderator dimensions are insensitive to limited changes in target and beam profile.

Dakota↗

Optimization with the OpenACC-to-FPGA framework on the Arria 10 and Stratix 10 FPGAs

The reconfigurable computing paradigm with field programmable gate arrays (FPGAs) has received renewed interest in the high-performance computing field due to FPGAs’ unique combination of performance and energy efficiency. However, difficulties in programming and optimizing FPGAs have prevented them from being widely accepted as general-purpose computing devices. In accelerator-based heterogeneous computing, portability across diverse heterogeneous devices is also an important issue, but the unique architectural features in FPGAs make this difficult to achieve. To address these issues, a directive-based, high-level FPGA programming and optimization framework was previously developed. In this work, developed optimizations were combined holistically using the directive-based approach to show that each individual benchmark requires a unique set of optimizations to maximize performance. We perform this exploration on Intel Arria 10 and Stratix 10 FPGAs. We also explored the relationships between performance, resource usages, and compilation times, and investigated implications for performance portability. Finally, we present an initial evaluation of a real-world proxy application, LULESH.

97 MATHEMATICS AND COMPUTING↗

Reinforcement learning for adaptive maintenance policy optimization under imperfect knowledge of the system degradation model and partial observability of system states

Maintenance policy optimization usually is faced with challenges that arise from an imperfect knowledge of system degradation models and from the partial observability of system degradation states. Here, this paper proposes a reinforcement learning method to address these two challenges for a class of maintenance problems with Markov degradation processes. The reinforcement learning approach consists of a learning component and a planning component. Using sequentially collected observations, at each step of decision-making the learning component improves the knowledge of system degradation in terms of the probability distributions of the transition rates based on sequential Bayesian inference. Using the updated transition rates, at each step of decision-making the maintenance policy optimization problem is then formulated as a partially observable Markov decision problem, and the planning component computes the optimal maintenance policy that maximizes the expected cumulative reward. The proposed method is illustrated using a numerical example with repair and inspection maintenance actions. The result shows that as more observations are collected, the learning component progressively learns the true system degradation process, and the planning component adjusts the optimal maintenance policy accordingly as well, which leads to increased reward.

42 ENGINEERING↗

Bayesian Optimized Deep Ensemble for Uncertainty Quantification of Deep Neural Networks: a System Safety Case Study on Sodium Fast Reactor Thermal Stratification Modeling

Deep neural networks (DNNs) are increasingly important to scientific computing and engineering system simulations. Accurate uncertainty quantification (UQ) for DNNs is critical in safety-sensitive engineering domains. Traditional Deep Ensemble (DE) methods, while easy to implement, frequently suffer from poorly calibrated uncertainty estimates and limited predictive accuracy due to reliance on fixed architectures with varied weight initializations. To address these issues, we introduce a workflow that combines Bayesian Optimization (BO) and DE. The workflow is modular, scalable, and integrates parallel BO initialized with Sobol sequences to individually optimize the hyperparameters of each ensemble member. This method enhances ensemble diversity, improves predictive accuracy, and provides reliable uncertainty estimates. We evaluate the proposed BODE approach in a sodium fast reactor thermal stratification modeling case study, where we used a densely connected convolutional neural network to predict turbulent viscosity during the reactor transient with consideration of data noise. We benchmark its performance against several optimization approaches, including baseline deep ensemble, evolutionary algorithm-optimized ensemble, ensemble formed via random search combined with greedy selection, and a BO ensemble using random initialization. Here, our results demonstrate superior performance of the developed BODE approach. In noise-free scenarios, BODE notably reduces incorrect aleatoric uncertainty and significantly enhances predictive accuracy. Under conditions of 5% and 10% Gaussian noise, BODE adaptively quantifies uncertainty proportional to data noise, achieving up to an 80% reduction in root mean square error compared to baseline methods and producing well-calibrated prediction intervals.

Bayesian optimization↗

Operation and Optimization of Microwave-Heated Continuous-Flow Microfluidics

Microwave (MW) technology can be powerful for electrification and process intensification but limited fundamental understanding of scalability and design principles hinders its effective use. In this work, we build a continuous-flow microreactor inside a commercial single-mode MW applicator and the corresponding computational fluid dynamics model to simulate the temperature profile. The model is in good agreement with experiments for various microreactor dimensions and operating conditions. The model indicates that MW heating is greatly influenced by reactor geometry as well as the operating parameters. We observe a strong correlation between parameters and develop a gradient boost regression tree model to predict the outlet temperature accurately. This model is then applied to optimize the dimensions and operating conditions to maximize the outlet temperature and energy efficiency, resulting in a Pareto optimal. We demonstrate computationally and experimentally that it is possible to surpass the Pareto optimal and achieve an energy efficiency of ~90% or greater at temperatures relevant for liquid-phase chemistry via salting of the solvent. The present methodology can be applied to other complex MW reactors. Lastly, the combined numerical and experimental approach provides insights into and a framework for scale-up and optimization.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Drive-pressure optimization in ramp-wave compression experiments through differential evolution

Ramp-wave dynamic-compression experiments are used to examine quasi-isentropic loading paths in materials. The gradual and continuous increase in pressure created by ramp waves make these types of experiments ideal for studying nonequilibrium material behavior, such as solidification kinetics. In ramp-wave compression experiments, the input drive pressure to the experimental setup may be exerted through one of a number of different mechanisms (e.g., magnetic fields, gas-gun-driven impactors, or high-energy lasers) and is generally required for simulating such experiments. Yet, regardless of the specific mechanism, this drive pressure cannot be measured directly (measurements are generally taken at a location near the back of the experimental setup through a transparent window), leading to an inverse problem where one must determine the drive pressure at the front of the experimental setup (i.e., the input) that corresponds to the particle velocity (the output) measured near the back of the experimental setup. Furthermore, we solve this inverse problem using a heuristic optimization algorithm, known as differential evolution, coupled with a multiphysics, hydrodynamics code that simulates the compression of the experimental setup. By running many rounds of forward simulations of the experimental setup, our optimization process iteratively searches for a drive pressure that is optimized to closely reproduce the experimentally measured particle velocity near the back of the experimental setup. While our optimization methodology requires a significant number of hydrodynamics simulations to be conducted, many of these can be performed in parallel, which greatly reduces the time cost of our methodology. One novel aspect of our method for determining the drive pressure is that it does not require physical modeling of the drive mechanism and can thus be broadly applied to many types of ramp-compression experiments, regardless of the drive mechanism.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Gaussian process based surrogate approach for the optimization of cylindrical targets

Simulating direct-drive inertial confinement experiments presents significant computational challenges, both due to the complexity of the codes required for such simulations and the substantial computational expense associated with target design studies. Machine learning models, and in particular, surrogate models, offer a solution by replacing simulation results with a simplified approximation. In this study, we apply surrogate modeling and optimization techniques that are well established in the existing literature to one-dimensional simulation data of a new cylindrical target design containing deuterium–tritium fuel. These models predict yields without the need for expensive simulations. We find that Bayesian optimization with Gaussian process surrogates enhances sampling efficiency in low-dimensional design spaces but becomes less efficient as dimensionality increases. Nonetheless, optimization routines within two-dimensional and five-dimensional design spaces can identify designs that maximize yield, while also aligning with established physical intuition. Optimization routines, which ignore constraints on hydrodynamic instability growth, are shown to lead to unstable designs in 2D, resulting in yield loss. However, routines that utilize 1D simulations and impose constraints on the in-flight aspect ratio converge on novel cylindrical target designs that are stable against hydrodynamic instability growth in 2D and achieve high yield.

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↗

Stochastic Optimization to Find Optimum Beginning-of-Life Core Configuration of Stable Salt Reactor with Online Refueling

A stochastic optimization method has been developed to find an optimum equilibrium cycle core configuration of the waste-burning stable salt reactor, which is a fast-spectrum molten salt reactor with frequent online refueling. An optimum core configuration was determined with the goal of minimizing radial power peaking. Because of the vast number of potential candidate core configurations, stochastic optimization was applied based on simulated annealing and an additional acceleration method, which screened out unpromising core configurations. It has been demonstrated that the developed stochastic optimization method successfully finds the optimal core configuration regardless of the initial guess and outperforms the gradient descent approach. In addition, it has been observed that the use of a so-called out-in core configuration as the initial guess speeds up convergence of the iterative solution more than five times. Based on the searched optimum equilibrium cycle core configuration, new beginning-of-life (BOL) core configurations have been developed. In conclusion, the new BOL core configurations will be used in developing optimum refueling strategies.

Moltex static salt reactor↗

Bilevel optimization, deep learning and fractional Laplacian regularization with applications in tomography

Here we consider a generalized bilevel optimization framework for solving inverse problems. We introduce fractional Laplacian as a regularizer to improve the reconstruction quality, and compare it with the total variation regularization. We emphasize that the key advantage of using fractional Laplacian as a regularizer is that it leads to a linear operator, as opposed to the total variation regularization which results in a nonlinear degenerate operator. Inspired by residual neural networks, to learn the optimal strength of regularization and the exponent of fractional Laplacian, we develop a dedicated bilevel optimization neural network with a variable depth for a general regularized inverse problem. We illustrate how to incorporate various regularizer choices into our proposed network. As an example, we consider tomographic reconstruction as a model problem and show an improvement in reconstruction quality, especially for limited data, via fractional Laplacian regularization. We successfully learn the regularization strength and the fractional exponent via our proposed bilevel optimization neural network. We observe that the fractional Laplacian regularization outperforms total variation regularization. This is specially encouraging, and important, in the case of limited and noisy data.

97 MATHEMATICS AND COMPUTING↗

Optimization of simulated high-field side lower hybrid current drive coupling using machine learning predictions of scrape-off layer density

Lower hybrid current drive (LHCD) is a potential source of non-inductive off-axis current drive (CD) for tokamaks. Although LHCD has been successfully deployed on a number of tokamaks, it is highly sensitive to the scrape-off layer (SOL) conditions local to the LHCD launcher. Large gaps between the launcher and plasma core, SOL turbulence, or edge density perturbations due to edge-localized modes can hamper CD or cause large reflected power. These coupling issues in part motivated the installation of an LHCD launcher on the high-field side (HFS) of DIII-D. On the HFS, the SOL is less turbulent and more controllable compared to the low-field side. This quiescence may result in more predictable edge conditions and thus a more predictable CD. Here, in this work, HFS SOL reflectometry measurements are predicted from global plasma parameters using machine learning models. The SOL predictions coupled with the full-wave simulation of the LHCD launcher allow for the prediction of reflected power, directivity, and arcing risk before the discharge. Launcher performance is then optimized using multi-objective Bayesian optimization, finding the shot parameters that result in an optimal SOL density that maximizes CD while minimizing the risk of arcing. The predictions and optimizations of LHCD performance are then accelerated using a surrogate model of the full-wave LHCD simulation.

Bayesian optimization↗

Direct optimization of neoclassical ion transport in stellarator reactors

Abstract We directly optimize stellarator neoclassical ion transport while holding neoclassical electron transport at a moderate level, creating a scenario favorable for impurity expulsion and retaining good ion confinement. Traditional neoclassical stellarator optimization has focused on minimizing ϵ eff , the geometric factor that characterizes the amount of radial transport due to particles in the 1 / ν regime. Under expected reactor-relevant conditions, core electrons will be in the 1 / ν regime and core fuel ions will be in the ν regime. Traditional optimizations thus minimize electron transport and rely on the radial electric field ( E r ) that develops to confine the ions. This often results in an inward-pointing E r that drives high- Z impurities into the core, which may be troublesome in future reactors. In this work, we increase the ratio of the thermal transport coefficients L 11 e / L 11 i , which previous research has shown can create an outward-pointing E r . This effect is very beneficial for impurity expulsion. We obtain self-consistent density, temperature, and E r profiles at reactor-relevant conditions for an optimized equilibrium. This equilibrium is expected to enjoy significantly improved impurity transport properties.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers

With current semiconductor technology reaching its physical limits, special-purpose hardware has emerged as an option to tackle specific computing-intensive challenges. Optimization in the form of solving quadratic unconstrained binary optimization problems, or equivalently Ising spin glasses, has been the focus of several new dedicated hardware platforms. These platforms come in many different flavors, from highly-efficient hardware implementations on digital-logic of established algorithms to proposals of analog hardware implementing new algorithms. In this work, we use a mapping of a specific class of linear equations whose solutions can be found efficiently, to a hard constraint satisfaction problem (three-regular three-XORSAT, or an Ising spin glass) with a 'golf-course' shaped energy landscape, to benchmark several of these different approaches. We perform a scaling and prefactor analysis of the performance of Fujitsu's digital annealer unit (DAU), the D-Wave advantage quantum annealer, a virtual MemComputing machine, Toshiba's simulated bifurcation machine (SBM), the SATonGPU algorithm from Bernaschi et al, and our implementation of parallel tempering. We identify the SATonGPU and DAU as currently having the smallest scaling exponent for this benchmark, with SATonGPU having a small scaling advantage and in addition having by far the smallest prefactor thanks to its use of massive parallelism. Furthermore, our work provides an objective assessment and a snapshot of the promise and limitations of dedicated optimization hardware relative to a particular class of optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Physics makes the difference: Bayesian optimization and active learning via augmented Gaussian process

Abstract Both experimental and computational methods for the exploration of structure, functionality, and properties of materials often necessitate the search across broad parameter spaces to discover optimal experimental conditions and regions of interest in the image space or parameter space of computational models. The direct grid search of the parameter space tends to be extremely time-consuming, leading to the development of strategies balancing exploration of unknown parameter spaces and exploitation towards required performance metrics. However, classical Bayesian optimization (BO) strategies based on the Gaussian process (GP) do not readily allow for the incorporation of the known physical behaviors or past knowledge. Here we explore a hybrid optimization/exploration algorithm created by augmenting the standard GP with a structured probabilistic model of the expected system’s behavior. This approach balances the flexibility of the non-parametric GP approach with a rigid structure of physical knowledge encoded into the parametric model. The fully Bayesian treatment of the latter allows additional control over the optimization via the selection of priors for the model parameters. The method is demonstrated for a noisy version of a standard univariate test function used to evaluate optimization algorithms and further extended to physical lattice models. This methodology is expected to be universally suitable for injecting prior knowledge in the form of physical models and past data in the BO framework.

42 ENGINEERING↗