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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Optimal Wind Turbine Design for H2 Production

NREL and industrial partners GE and Nel seek to advance affordable green hydrogen production by optimizing wind turbine design specifically for hydrogen production and validating designs using NREL's ARIES facilities. This project will couple wind turbine, wind plant, solar plant, and electrolyzer models to predict hydrogen production from variable, renewable power sources. It will then use gradient-based optimization with exact-analytic gradients to optimize wind turbine rotor diameter, hub height, and power rating for optimal hydrogen production. Finally, it will validate the optimal turbine designs using the ARIES research platform, where it will compare a baseline turbine to the optimal design for a variety of scenarios and resources.

electrolyzer↗
DOE OSTI2022

Optimization control technology for building energy conservation

A simulation processor generates and stores a simulation model based on conditions associated with a physical structure, such as a building. A neural network processor implements a neural network, having an input layer coupled to receive sensor data from the structure and having an output layer coupled to supply control signals to the at least one electrically operable environmental control device. The neural network is trained using the simulation model. A particle swarm optimization processor programmed to receive the simulation results and perform particle swarm optimization, ascertains optimal parameters for controlling the at least one electrically operable environmental control device and supplies these optimal parameters to the neural network processor. The neural network processor uses the optimal parameters supplied by the particle swarm optimization processor to further train the neural network.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2023

Optimizing Perovskite Thin‐Film Parameter Spaces with Machine Learning‐Guided Robotic Platform for High‐Performance Perovskite Solar Cells

Abstract Simultaneously optimizing the processing parameters of functional thin films remains a challenge. The design and utilization of a fully automated platform called SPINBOT is presented for the engineering of solution‐processed functional thin films. The SPINBOT is capable of performing experiments with high sampling variability through the unsupervised processing of hundreds of substrates with exceptional experimental control. Through the iterative optimization process enabled by the Bayesian optimization (BO) algorithm, the SPINBOT explores an intricate parameter space, continuously improving the quality and reproducibility of the produced thin films. This machine learning (ML)‐guided reliable SPINBOT platform enables the acceleration of the optimization process of perovskite solar cells via a simple photoluminescence characterization of films. As a result, this study arrives at an optimal film that, when processed into a solar cell in an ambient atmosphere, immediately yields a champion power conversion efficiency (PCE) of 21.6% with satisfactory performance reproducibility. The unsealed devices retain 90% of their initial efficiency after 1100 h of continuous operation at 60–65 °C under metal‐halide lamps. It is anticipated that the integration of robotic platforms with the intelligent algorithm will facilitate the widespread adoption of effective autonomous experimentation to address the evolving needs and constraints within the materials science research community.

14 SOLAR ENERGY↗
DOE OSTI2024

Quantum optimization algorithms: Energetic implications

Since the dawn of quantum computing (QC), theoretical developments like Shor's algorithm proved the conceptual superiority of QC over traditional computing. However, such quantum supremacy claims are difficult to achieve in practice because of the technical challenges of realizing noiseless qubits. In the near future, QC applications will need to rely on noisy quantum devices that offload part of their work to classical devices. One way to achieve this is by using parameterized quantum circuits in optimization or even in machine learning tasks. The energy requirements of quantum algorithms have not yet been studied extensively. Here in this article, we explore several optimization algorithms using both theoretical insights and numerical experiments to understand their impact on energy consumption. Specifically, we highlight why and how algorithms like quantum natural gradient descent, simultaneous perturbation stochastic approximations or circuit learning methods, are at least 2x to 4x more energy efficient than their classical counterparts; why feedback-based quantum optimization is energy-inefficient; and how techniques like Rosalin can improve the energy efficiency of other algorithms by a factor of ≥2 0 x. Finally, we use the NchooseK high-level programming model to run optimization problems on both gate-based quantum computers and quantum annealers. Empirical data indicate that these optimization problems run faster, have better success rates, and consume less energy on quantum annealers than on their gate-based counterparts.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Eigenfrequency constrained topology optimization of finite strain hyperelastic structures

This paper incorporates hyperelastic materials, nonlinear kinematics, and preloads in eigenfrequency constrained density–based topology optimization. The formulation allows for initial finite deformations and subsequent small harmonic oscillations. The optimization problem is solved by the method of moving asymptotes, and the gradients are calculated using the adjoint method. Both simple and degenerate eigenfrequencies are considered in the sensitivity analysis. A well-posed topology optimization problem is formulated by filtering the volume fraction field. Numerical issues associated with excessive distortion and spurious eigenmodes in void regions are reduced by removing low volume fraction elements. The optimization objective is to maximize stiffness subject to a lower bound on the fundamental eigenfrequency. Numerical examples show that the eigenfrequencies drastically change with the load magnitude, and that the optimization is able to produce designs with the desired fundamental eigenfrequency.

42 ENGINEERING↗
DOE OSTI2023

Optimal mitigation and control over power system dynamics for stochastic grid resilience

Optimal mitigation planning for highly disruptive contingencies to a transmission-level power system requires optimization with dynamic power system constraints, due to the key role of dynamics in system stability to major perturbations. We formulate a generalized disjunctive program to determine optimal grid component hardening choices for protecting against major failures, with differential algebraic constraints representing system dynamics (specifically, differential equations representing generator and load behavior and algebraic equations representing instantaneous power balance over the transmission system). We optionally allow stochastic optimal pre-positioning across all considered failure scenarios, and optimal emergency control within each scenario. This novel formulation allows, for the first time, analyzing the resilience interdependencies of mitigation planning, preventive control, and emergency control. Using all three strategies in concert is particularly effective at maintaining robust power system operation under severe contingencies, as we demonstrate on the western system coordinating council 9-bus test system using synthetic multi-device outage scenarios.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2021

Lower bounds on circuit depth of the quantum approximate optimization algorithm

The quantum approximate optimization algorithm (QAOA) is a method of approximately solving combinatorial optimization problems. While QAOA is developed to solve a broad class of combinatorial optimization problems, it is not clear which classes of problems are best suited for it. One factor in demonstrating quantum advantage is the relationship between a problem instance and the circuit depth required to implement the QAOA method. As errors in noisy intermediate-scale quantum (NISQ) devices increase exponentially with circuit depth, identifying lower bounds on circuit depth can provide insights into when quantum advantage could be feasible. In this work, we identify how the structure of problem instances can be used to identify lower bounds for circuit depth for each iteration of QAOA and examine the relationship between problem structure and the circuit depth for a variety of combinatorial optimization problems including MaxCut and MaxIndSet. Specifically, we show how to derive a graph, G, that describes a general combinatorial optimization problem and show that the depth of circuit is at least the chromatic index of G. By looking at the scaling of circuit depth, we argue that MaxCut, MaxIndSet, and some instances of vertex covering and Boolean satisfiability problems are suitable for QAOA approaches while knapsack and traveling salesperson problems are not.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods

We explore novel approaches for solving nonlinear optimization problems with unrelaxable bound constraints, which must be satisfied before the objective function can be evaluated. Our method reformulates the unrelaxable bound-constrained problem as an unconstrained optimization problem that is amenable to existing unconstrained optimization methods. The reformulation relies on a domain warping to form a merit function; the choice of the warping determines the level of exactness with which the unconstrained problem can be used to find solutions to the bound-constrained problem, as well as key properties of the unconstrained formulation such as smoothness. We develop theory when the domain warping is a multioutput sigmoidal warping, and we explore the practical elements of applying unconstrained optimization methods to the formulation. Here, we develop an algorithm that exploits the structure of the sigmoidal warping to guarantee that unconstrained optimization algorithms applied to the merit function will find a stationary point to the desired tolerance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Extended convex hull-based distributed optimal energy flow of integrated electricity-gas systems

Integrated electricity and gas systems are constructed to facilitate the gas-fired generation, and the distributed operation of these integrated systems have received much attention due to the increased emphasis on data security and privacy between different agencies. This paper proposes an extended convex hull based method to address optimal energy flow problems for the integrated electricity and gas systems in a distributed manner. First, a multi-block electricity-gas system model is constructed by dividing the whole system into N blocks considering both physical and regional differences. This multi-block model is then convexified by replacing the nonconvex gas transmission equation with the extended convex hull-based constraints. The Jacobi-Proximal alternating direction method of multipliers algorithm is adopted to solve the convexified model and minimize its operation cost. Finally, the feasibility of the optimal solution for the convexified model is checked, and a sufficient condition is developed. If the sufficient condition is satisfied, the optimal solution for the original nonconvex problem can be recovered from that for the convexified problem. Simulation results demonstrate that the proposed method is tractable and effective in obtaining feasible optimal solutions for multi-block optimal energy flow problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2020

An error-in-constitutive equations strategy for topology optimization for frequency-domain dynamics

This paper presents a topology optimization formulation for frequency-domain dynamics to reduce solution dependence upon initial guess and considered loading conditions. Due to resonance phenomena in undamped steady-state dynamics, objectives measuring dynamic response possess many local minima that may represent poor solutions to a design problem, an issue exacerbated for design with respect to multiple frequencies. In this work, we propose an extension of the modified error-in-constitutive-equations (MECE) method, used previously in material identification inverse problems, as a new approach for frequency-domain dynamics topology optimization to mitigate these issues. The main idea of the proposed framework is to incorporate an additional penalty-like term in the objective function that measures the discrepancy in the constitutive relations between stresses and strains and between inertial forces and displacements. Then, the design problem is cast within a PDE-constrained optimization formulation in which we seek displacements, stresses, inertial forces, and a density-field solution that minimize our new objective subject to conservation of linear momentum plus some additional constraints. We show that this approach yields superior designs to conventional gradient-based optimization approaches that solely use a functional of displacements as the objective, while strictly enforcing the constitutive equations. The MECE strategy integrates into a density-based topology optimization scheme for void–solid or two-phase material structural design. We highlight the merits of our approach in a variety of scenarios for direct frequency response design, considering multiple frequency load cases and structural objectives.

42 ENGINEERING↗
DOE OSTI2023

Scalable Bayesian optimization with randomized prior networks

Several fundamental problems in science and engineering consist of global optimization tasks involving unknown high-dimensional (black-box) functions that map a set of controllable variables to the outcomes of an expensive experiment. Bayesian Optimization (BO) techniques are known to be effective in tackling global optimization problems using a relatively small number objective function evaluations, but their performance suffers when dealing with high-dimensional outputs. To overcome the major challenge of dimensionality, here we propose a deep learning framework for BO and sequential decision making based on bootstrapped ensembles of neural architectures with randomized priors. Using appropriate architecture choices, we show that the proposed framework can approximate functional relationships between design variables and quantities of interest, even in cases where the latter take values in high-dimensional vector spaces or even infinite-dimensional function spaces. In the context of BO, we augmented the proposed probabilistic surrogates with re-parameterized Monte Carlo approximations of multiple-point (parallel) acquisition functions, as well as methodological extensions for accommodating black-box constraints and multi-fidelity information sources. We test the proposed framework against state-of-the-art methods for BO and demonstrate superior performance across several challenging tasks with high-dimensional outputs, including a constrained multi-fidelity optimization task involving shape optimization of rotor blades in turbo-machinery.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Finite elements for Matérn-type random fields: Uncertainty in computational mechanics and design optimization

This work highlights an approach for incorporating realistic uncertainties into scientific computing workflows based on finite elements, focusing on prevalent applications in computational mechanics and design optimization. We leverage Matérn-type Gaussian random fields (GRFs) generated using the SPDE method to model aleatoric uncertainties, including environmental influences, variating material properties, and geometric ambiguities. Our focus lies on delivering practical GRF realizations that accurately capture imperfections and variations and understanding how they impact the predictions of computational models as well as the shape and topology of optimized designs. Here we describe a numerical algorithm based on solving a generalized SPDE to sample GRFs on arbitrary meshed domains. The algorithm leverages established techniques and integrates seamlessly with the open-source finite element library MFEM and associated scientific computing workflows, like those found in industrial and national laboratory settings. Our solver scales efficiently for large-scale problems and supports various domain types, including surfaces and embedded manifolds. We showcase its versatility through biomechanics and topology optimization applications, emphasizing the potential to influence these domains. The flexibility and efficiency of SPDE-based GRF generation empowers us to run large-scale optimization problems on 2D and 3D domains, including finding optimized designs on embedded surfaces, and to generate design features and topologies beyond the reach of conventional techniques. Moreover, these capabilities allow us to model and quantify geometric uncertainties on reconstructed submanifolds, such as the interpolated surfaces of cerebral aneurysms provided by postprocessing CT scans. In addition to offering benefits in these specific domains, the proposed techniques transcend specific applications and generalize to arbitrary forward and backward problems in uncertainty quantification involving finite elements.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A systems engineering framework for the optimization of food supply chains under circular economy considerations

The current linear “take-make-waste-extractive” model leads to the depletion of natural resources and environmental degradation. Circular Economy (CE) aims to address these impacts by building supply chains that are restorative, regenerative, and environmentally benign. This can be achieved through the re-utilization of products and materials, the extensive usage of renewable energy sources, and ultimately by closing any open material loops. Such a transition towards environmental, economic and social advancements requires analytical tools for quantitative evaluation of the alternative pathways. Here, in this work, we present a novel CE system engineering framework and decision-making tool for the modeling and optimization of food supply chains. First, the alternative pathways for the production of the desired product and the valorization of wastes and by-products are identified. Then, a Resource-Task-Network representation that captures all these pathways is utilized, based on which a mixed-integer linear programming model is developed. This approach allows the holistic modeling and optimization of the entire food supply chain, taking into account any of its special characteristics, potential constraints as well as different objectives. Considering that typically CE introduces multiple, often conflicting objectives, we deploy here a multi-objective optimization strategy for trade-off analysis. A representative case study for the supply chain of coffee is discussed, illustrating the steps and the applicability of the framework. Single and multi-objective optimization formulations under five different coffee-product demand scenarios are presented. The production of instant coffee as the only final product is shown to be the least energy and environmental efficient scenario. On the contrary, the production solely of whole beans sets a hypothetical upper bound on the optimal energy and environmental utilization. In both problems presented, the amount of energy generated is significant due to the utilization of waste generated for the production of excess energy.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2023

Parametric analysis on optimized design of hybrid solar power plants

There is increasing interest in utility-scale solar power plants with storage which can flexibly dispatch renewable energy to the grid. However, plant design possesses many degrees of freedom and non-obvious trade-offs in performance. Software tools can estimate or optimize the performance of a specific plant configuration under market and weather conditions of interest; the associated cost parameters and operating assumptions strongly influence estimates of plant performance and decisions regarding optimal sizing. We employ the National Renewable Energy Laboratory's Hybrid Optimization and Performance Platform, which incorporates optimal dispatch when evaluating plant performance, and investigate the sensitivity to weather and market conditions, operating limitations, and the presence of a capacity-based incentive. We demonstrate changes in plant performance and optimal sizing with respect to these inputs and discuss implications. Here results show that PV-with-battery designs are more profitable under our assumptions, but that designs including a concentrated solar power (CSP) system produce significantly greater annual energy; and that CSP-with-thermal energy storage designs maximizing the benefit-to-cost ratio have an input-dependent linear relationship between the CSP field solar multiple and the hours of storage as the project budget varies.

14 SOLAR ENERGY↗
DOE OSTI2024

Multivariate Bayesian Optimization of CoO Nanoparticles for CO 2 Hydrogenation Catalysis

The hydrogenation of CO 2 holds promise for transforming the production of renewable fuels and chemicals. However, the challenge lies in developing robust and selective catalysts for this process. Transition metal oxide catalysts, particularly cobalt oxide, have shown potential for CO 2 hydrogenation, with performance heavily reliant on crystal phase and morphology. Achieving precise control over these catalyst attributes through colloidal nanoparticle synthesis could pave the way for catalyst and process advancement. Yet, navigating the complexities of colloidal nanoparticle syntheses, governed by numerous input variables, poses a significant challenge in systematically controlling resultant catalyst features. We present a multivariate Bayesian optimization, coupled with a data-driven classifier, to map the synthetic design space for colloidal CoO nanoparticles and simultaneously optimize them for multiple catalytically relevant features within a target crystalline phase. The optimized experimental conditions yielded small, phase-pure rock salt CoO nanoparticles of uniform size and shape. These optimized nanoparticles were then supported on SiO 2 and assessed for thermocatalytic CO 2 hydrogenation against larger, polydisperse CoO nanoparticles on SiO 2 and a conventionally prepared catalyst. The optimized CoO/SiO 2 catalyst consistently exhibited higher activity and CH 4 selectivity (ca. 98%) across various pretreatment reduction temperatures as compared to the other catalysts. This remarkable performance was attributed to particle stability and consistent H* surface coverage, even after undergoing the highest temperature reduction, achieving a more stable catalytic species that resists sintering and carbon occlusion.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Risk-averse optimal control of semilinear elliptic PDEs

In this paper, we consider the optimal control of semilinear elliptic PDEs with random inputs. These problems are often nonconvex, infinite-dimensional stochastic optimization problems for which we employ risk measures to quantify the implicit uncertainty in the objective function. In contrast to previous works in uncertainty quantification and stochastic optimization, we provide a rigorous mathematical analysis demonstrating higher solution regularity (in stochastic state space), continuity and differentiability of the control-to-state map, and existence, regularity and continuity properties of the control-to-adjoint map. Our proofs make use of existing techniques from PDE-constrained optimization as well as concepts from the theory of measurable multifunctions. We illustrate our theoretical results with two numerical examples motivated by the optimal doping of semiconductor devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Inverse Biot–Savart Optimization for Superconducting Accelerator Magnets

Superconducting (SC) magnets for accelerator concepts are often synthesized by numerically optimizing magnetic field waveforms, a process that requires a subsequent solution of a constrained inverse problem to identify suitable SC magnet windings. When the desired field distribution is intuitive, the inverse process is facilitated by seeding preconceived coil distributions into design optimization methods for refinement. With more complex magnetic field distributions, an initial design may be unknown, and topology optimization tools are required to synthesize current distributions without a priori guidance from a subject matter expert. In this work, we develop a constrained inverse Biot-Savart topology optimization methodology that synthesizes optimal distributions of current density in racetrack-like SC coils. The problem structure is exploited through a computationally efficient quadratic programming formulation, and the method is applied to recently published magnetic field waveforms for a recirculating proton phase shifter, a proton therapy gantry, and dipole magnets with sharp field transitions. The method and results herein identify novel winding configurations that can help magnet designers bring accelerator concepts to fruition.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Binary Optimal Control of Single-Flux-Quantum Pulse Sequences

We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta (SFQ) control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. Here we model this process as an binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of O(p log(p)), where p is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelity’s better than 99.9%, in ≈ 25 trust-region iterations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗