Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithmic Optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 523 records · Page 29

Automated Fiber Placement Through Thickness Defect Stacking Optimization

In its 2022 commercial market outlook, Boeing forecasted an 80% increase in the global fleet through 2041 compared to 2019 pre-pandemic levels. This sharp rise in demand will drive pressure onto airframe manufacturers to ramp up production and find more efficient ways to design and manufacture airplanes. Complicating this challenge is the industry’s recent transformation from traditional metal-based airframes towards hybrid composite-metal aircraft. While composites have been used in aviation for decades, aircraft manufacturers are still struggling to design and manufacture quality parts at a high rate. Automated Fiber Placement (AFP) is one of the main manufacturing techniques used to produce large-scale composite parts. After a design has been created, a manufacturing strategy has to be developed based on the working material, part geometry, and machine capabilities. This process planning stage is essential to the AFP workflow and currently requires a high level of manual input from an experienced process planner. In an effort to automate and optimize this stage, the Computer Aided Process Planning (CAPP) module was developed. CAPP assists process planners in identifying optimal starting point location and layup strategy for each ply of a laminate. This Ply-Level Optimization (PLO) phase operates on the quantification of ply quality through predictable geometry-based defects such as gaps, overlaps, angle deviation, and steering. As you move from PLO to Laminate-Level Optimization (LLO) the design space grows exponentially, emphasizing the need for automated optimization. The work presented in this thesis expands CAPP’s functionality by comparing the planned fiber paths through the thickness of the laminate to mitigate stacked area defects and achieve an optimal laminate-level manufacturing strategy. Within CAPP, predicted gap and overlap defects are imported from Vericut Composites Programming (VCP) and then discretized to streamline the through-thickness comparison. Two objective functions are used to score different combinations of ply layup strategies based on defect stacking both globally and locally. Four combinatorial optimization algorithms were coupled with these objective functions to investigate the laminate-level manufacturing strategy design space and converge on the optimal plan. These algorithms were evaluated based on accuracy and efficiency through virtual testing on a complex tool surface. A separate LLO approach was developed to achieve near-optimal laminates in significantly less time. The end result is a software package which greatly reduces the required input from process planners, shortening the design-build cycle time and improving part quality.

AFP↗

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Flexibility of the factorized form of the unitary coupled cluster Ansatz

The factorized form of the unitary coupled cluster Ansatz is a popular state preparation Ansatz for electronic structure calculations of molecules on quantum computers. It is often viewed as an approximation (based on the Trotter product formula) for the conventional unitary coupled cluster operator. In this work, we show that the factorized form is quite flexible, allowing one to range from a conventional configuration interaction, to conventional unitary coupled cluster, to efficient approximations that lie in between these two. The variational minimization of the energy often allows simpler factorized unitary coupled cluster approximations to achieve high accuracy, even if they do not accurately approximate the Trotter product formula. This is similar to how quantum approximate optimization algorithms can achieve high accuracy with a small number of levels.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗

Sizing and Layout Design of an Aeroelastic Wingbox Through Nested Optimization

The goals of this work are to 1) develop an optimization algorithm that can simultaneously handle a large number of sizing variables and topological layout variables for an aeroelastic wingbox optimization problem and 2) utilize this algorithm to ascertain the benefits of curvilinear wingbox components. The algorithm used here is a nested optimization, where the outer level optimizes the rib and skin stiffener layouts with a surrogate-based optimizer, and the inner level sizes all of the components via gradient-based optimization. Two optimizations are performed: one restricted to straight rib and stiffener components only, the other allowing curved members. A moderate 1.18% structural mass reduction is obtained through the use of curvilinear members.

Stanford, Bret K.↗

Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems

We develop a global variable substitution method that reduces n-variable monomials in combinatorial optimization problems to equivalent instances with monomials in fewer variables. We apply this technique to 3-SAT and analyze the optimal quantum unitary circuit depth needed to solve the reduced problem using the quantum approximate optimization algorithm. For benchmark 3-SAT problems, we find that the upper bound of the unitary circuit depth is smaller when the problem is formulated as a product and uses the substitution method to decompose gates than when the problem is written in the linear formulation, which requires no decomposition.

3-SAT↗

An overview of the operation architectures and energy management system for multiple microgrid clusters

The emerging novel energy infrastructures, such as energy communities, smart building-based microgrids, electric vehicles enabled mobile energy storage units raise the requirements for a more interconnective and interoperable energy system. It leads to a transition from simple and isolated microgrids to relatively large-scale and complex interconnected microgrid systems named multi-microgrid clusters. In order to efficiently, optimally, and flexibly control multi-microgrid clusters, cross-disciplinary technologies such as power electronics, control theory, optimization algorithms, information and communication technologies, cyber-physical, and big-data analysis are needed. This paper introduces an overview of the relevant aspects for multi-microgrids, including the outstanding features, architectures, typical applications, existing control mechanisms, as well as the challenges.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Online multi-objective particle accelerator optimization of the AWAKE electron beam line for simultaneous emittance and orbit control

Multi-objective optimization is important for particle accelerators where various competing objectives must be satisfied routinely such as, for example, transverse emittance vs bunch length. We develop and demonstrate an online multi-time scale multi-objective optimization algorithm that performs real time feedback on particle accelerators. We demonstrate the ability to simultaneously minimize the emittance and maintain a reference trajectory of a beam in the electron beamline in CERN’s Advanced Proton Driven Plasma Wakefield Acceleration Experiment.

43 PARTICLE ACCELERATORS↗

Simplifying Energy Efficiency for Homeowners - Results from a California Utility's Pilot Study of a Scalable Solution to Assess Retrofit and Solar Opportunities: Preprint

For homeowners, typical choices to reduce net energy use in their homes include: upgrading their home with a tailored efficiency retrofit or investing in roof-top solar. Determining the unique combination of these options that will provide the most cost-effective solution requires analysis for each home. This analysis needs to be presented in a simple and actionable way to homeowners. The solution should also be easily scalable to thousands of homes to enable utilities to better target efficiency program options and support solar installations. Sacramento Municipal Utility District (SMUD) piloted a new tool developed by Vistar Energy called XeroHome that automates the assessment of energy efficiency and solar opportunities in existing homes. XeroHome demonstrates an approach to using building energy modeling, energy use data analytics and homeowner engagement to identify and target energy efficiency opportunities at scale. XeroHome uses automation to build an EnergyPlus model for each home, based on information from public data sources such as property assessment records, building permit records, aerial/satellite photography, and template models derived from ResStock. Utilizing cloud computing, machine learning and optimization algorithms, energy upgrade packages are ranked by cost-effectiveness for each home and presented over an interactive web-portal. This paper discusses SMUD's pilot project using XeroHome to conduct analysis for 1,500 existing homes in Sacramento, CA. Development of XeroHome's advanced analytics capabilities are discussed in the context of applicability for utility programs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Simplifying Energy Efficiency for Homeowners - Results from a California Utility's Pilot Study of a Scalable Solution to Assess Retrofit and Solar Opportunities

For homeowners, typical choices to reduce net energy use in their homes include: upgrading their home with a tailored efficiency retrofit or investing in roof-top solar. Determining the unique combination of these options that will provide the most cost-effective solution requires analysis for each home. This analysis needs to be presented in a simple and actionable way to homeowners. The solution should also be easily scalable to thousands of homes to enable utilities to better target efficiency program options and support solar installations. Sacramento Municipal Utility District (SMUD) piloted a new tool developed by Vistar Energy called XeroHome that automates the assessment of energy efficiency and solar opportunities in existing homes. XeroHome demonstrates an approach to using building energy modeling, energy use data analytics and homeowner engagement to identify and target energy efficiency opportunities at scale. XeroHome uses automation to build an EnergyPlus model for each home, based on information from public data sources such as property assessment records, building permit records, aerial/satellite photography, and template models derived from ResStock. Utilizing cloud computing, machine learning and optimization algorithms, energy upgrade packages are ranked by cost-effectiveness for each home and presented over an interactive web-portal. This paper discusses SMUD's pilot project using XeroHome to conduct analysis for 1,500 existing homes in Sacramento, CA. Development of XeroHome's advanced analytics capabilities are discussed in the context of applicability for utility programs.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Numerical parameter optimizations of the Ignition and Growth model for a HMX plastic bonded explosive

We present here a novel method for optimizing parameters of the Ignition and Growth (I&G) reactive flow model for high explosives. The I&G model predicts the shock initiation response of explosives subjected to dynamic loading. However, calibrating the model is a time-consuming process because it has several parameters, typically requires multiple data sets, and there are no direct correlations between parameters and data. In this study, we couple a scalable optimization algorithm to simulations of shock initiation experiments in the multi-physics code ALE3D. We develop four I&G model parameter sets for the HMX (1,3,5,7-tetranitro-1,3,5,7-tetrazocane)-based explosive LX-07 [90 wt. % HMX, 10 wt. % Viton A] based on minimizing the difference between calculations and measurements at the embedded pressure gauges in 1D gun shock experiments. Our study shows that a cost function based on both shock time of arrival and pressure pulse shape demonstrates the best agreement with experimental data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Autonomous sputter synthesis of thin film nitrides with composition controlled by Bayesian optimization of optical plasma emission

Autonomous experimentation has emerged as an efficient approach to accelerate the pace of material discovery. Although instruments for autonomous synthesis have become popular in molecular and polymer science, solution processing of hybrid materials, and nanoparticles, examples of autonomous tools for physical vapor deposition are scarce yet important for the semiconductor industry. Here, we report the design and implementation of an autonomous workflow for sputter deposition of thin films with controlled composition, leveraging a highly automated sputtering reactor custom-controlled by Python, optical emission spectroscopy (OES), and a Bayesian optimization algorithm. We modeled film composition, measured by x-ray fluorescence, as a linear function of plasma emission lines monitored during co-sputtering from elemental Zn and Ti targets in an N 2 and Ar atmosphere. A Bayesian control algorithm, informed by OES, navigates the space of sputtering power to fabricate films with user-defined compositions by minimizing the absolute error between desired and measured optical emission signals. We validated our approach by autonomously fabricating Zn x Ti 1-x N y films that deviate from the targeted cation composition by a relative ±3.5%, even for 15 nm thin films, demonstrating that the proposed approach can reliably synthesize thin films with a specific composition and minimal human interference. Moreover, the proposed method can be extended to more difficult synthesis experiments where plasma intensity lines depend non-linearly on pressure, or the elemental sticking coefficients strongly depend on the substrate temperature.

36 MATERIALS SCIENCE↗

Approaching hydro-equivalent ignition in laser direct-drive via target design optimization using novel statistical modeling

Laser direct-drive offers significant advantages in terms of target simplicity, improved energy coupling, and large fuel masses over indirect drive. However, performance degradations from hydrodynamic and laser-plasma instabilities seeded and driven by the direct illumination pose limitations on the parameter space available for achieving ignition. In this paper, new design improvements are identified to forge a path forward for a hydro-equivalent ignition demonstration. The first is related to a new formulation of the statistical model (SM) used to accurately predict target performance directly from input parameters such as laser pulse shape and target specifications. This new SM formulation provides direct guidance on target dimensions and laser beam-to-target radius to achieve the highest fusion yield on the OMEGA laser. The second improvement comes from cooling the deuterium–tritium (DT) ice layer below the triple point right before shot time leading to lower DT vapor densities and higher convergence. Guided by these design improvements, a Bayesian optimization algorithm was used to design an implosion that is predicted to closely approach a Lawson triple product that hydrodynamically scales to ignition if equivalent laser–target coupling is achieved at laser energies typical of the National Ignition Facility.

Deuterium↗

Hybrid quantum-classical algorithms for approximate graph coloring

We show how to apply the recursive quantum approximate optimization algorithm (RQAOA) to MAX- k -CUT, the problem of finding an approximate k -vertex coloring of a graph. We compare this proposal to the best known classical and hybrid classical-quantum algorithms. First, we show that the standard (non-recursive) QAOA fails to solve this optimization problem for most regular bipartite graphs at any constant level p : the approximation ratio achieved by QAOA is hardly better than assigning colors to vertices at random. Second, we construct an efficient classical simulation algorithm which simulates level- 1 QAOA and level- 1 RQAOA for arbitrary graphs. In particular, these hybrid algorithms give rise to efficient classical algorithms, and no benefit arising from the use of quantum mechanics is to be expected. Nevertheless, they provide a suitable testbed for assessing the potential benefit of hybrid algorithm: We use the simulation algorithm to perform large-scale simulation of level- 1 QAOA and RQAOA with up to 300 qutrits applied to ensembles of randomly generated 3 -colorable constant-degree graphs. We find that level- 1 RQAOA is surprisingly competitive: for the ensembles considered, its approximation ratios are often higher than those achieved by the best known generic classical algorithm based on rounding an SDP relaxation. This suggests the intriguing possibility that higher-level RQAOA may be a potentially useful algorithm for NISQ devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An algorithm for control system design via parameter optimization

An algorithm for design via parameter optimization has been developed for linear-time-invariant control systems based on the model reference adaptive control concept. A cost functional is defined to evaluate the system response relative to nominal, which involves in general the error between the system and nominal response, its derivatives and the control signals. A program for the practical implementation of this algorithm has been developed, with the computational scheme for the evaluation of the performance index based on Lyapunov's theorem for stability of linear invariant systems.

Sinha, P. K.↗

Multi-scale and multi-physics analysis, design optimization, and experimental validation of heat exchangers utilizing high performance, non-round tubes

Air-to-refrigerant heat exchangers (HXs) are fundamental components in HVAC&R systems, and considerable research has been dedicated designing continually smaller, lighter, and more efficient HX designs. In recent years, researchers have leveraged advancements in Computational Fluid Dynamics (CFD), Finite Element Analysis (FEA), and optimization algorithms to consider primary tube shape and topology optimization to design highly compact, high performance HXs for a multitude of applications. In this research, we present a computationally efficient, comprehensive, multi-scale, and multi-physics analysis and optimization method for air-to-refrigerant HXs featuring automated CFD and FEA simulations and approximation-assisted optimization. This methodology was utilized to design HXs with shape-optimized, non-round tubes which outperform current state-of-the-art tube-fin HXs without compromising structural integrity. The optimal HXs were shown to deliver similar thermal performance to the baseline HXs while also achieving more than 20% reductions in airside pressure drop and core envelope volume and more than 30% reduction in internal volume. Comprehensive experimental validation of the optimization methodology was conducted through the testing of two prototypes in a standardized wind tunnel facility under multiple operating conditions. For prototype #1 under dry evaporator conditions, the predicted heat load agreed within ± 10% of measured values and the predicted airside pressure drop agreed within ± 30%, while for dehumidifying conditions, the predicted sensible and latent heat loads agreed within ± 10% and ± 20% of the measured values, respectively. For prototype #2, the predicted condenser heat load agreed within ± 3.0% of measured values, and the predicted airside pressure drop agreed within ± 27%. The acceptable agreement between simulation and experimental results for the present application highlights the flexibility of the novel optimization methodology to design next generation HXs with improved performance and reduced volume, weight, and environmental impact.

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↗

Generation of thermofield double states and critical ground states with a quantum computer

Significance Our experiment prepares two types of nontrivial quantum states on a trapped ion quantum computer: the thermofield double state of the transverse-field Ising model at arbitrary temperature and the quantum critical state of the zero-temperature model. We use techniques motivated by the quantum approximate optimization algorithm, and we implement a hybrid quantum–classical optimization loop to prepare the quantum critical state. Our results pave the way for exploring strongly correlated models at finite temperature and teleportation protocols inspired by black hole physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗