SEARCH · Engineering Papers
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.
This presentation describes an algorithm for applying machine learning to branching to speed up the solution of integer optimization problems. These problems are challenging and solved multiple times a day by power systems operators. We show that our approach speeds up a widely used open-source optimization solver.
The objective of this project is to reduce the cost and lead time of horizontal wind turbine blade mold tooling and blade transportation, while maintaining the highest standards of blade quality. The solution involves a smart-design family of modular molds that are easily transportable to fabrication sites near the place of service. Key innovations include the use of additive manufacturing (AM) to integrate conformal thermal management channels, offering enhanced control over the thermal profiles tailored to specific blade materials. This approach enables in-situ quality assurance during mold fabrication, significantly improves mold life, and allows for reuse across multiple production cycles. Ultimately, the solution aims to optimize both tooling and transportation costs, contributing to the scalability of wind turbine blade production. A significant barrier to scaling up the production of large wind turbine blades lies in the high costs associated with tooling and the transportation of blades. Traditional molds are expensive, bulky, and difficult to transport, adding considerable lead time and cost to the overall manufacturing process. Additionally, transporting blades to distant locations for final assembly further exacerbates these challenges. The project aims to address these inefficiencies by demonstrating a modularized, additive-manufactured mold that meets all necessary blade specification requirements, specifically for blade lengths between 120m and 150m.
The project addresses a critical gap in hydrogen infrastructure by integrating system-level energy models with atomic-scale material simulations in a unified Systems-to-Atoms (S2A) framework. The motivation stems from the need to develop efficient, cost-effective, and durable hydrogen transport and utilization technologies to support decarbonization of hard-to-electrify sectors such as heavy-duty transportation. Current system models lack awareness of material performance mechanisms, while material-scale models do not account for system-level usage and variability. To bridge this divide, the team developed a co-simulation capability linking techno-economic analyses, reactor/process-flow modeling, and molecular-scale catalysis simulations. Applied to hydrogen delivery in California, the framework enabled comparative evaluations of compressed, cryogenic, and liquid organic hydrogen carrier (LOHC) pathways, highlighting how catalyst operation and unit process efficiency influence overall performance. The results demonstrate that no single material or transport mode is universally optimal; instead, heterogeneous solutions tuned to specific operational contexts deliver better performance. The project delivers a new capability for cross-scale material co-design, advancing hydrogen infrastructure readiness and informing DOE and LLNL missions in climate and energy resilience.
A novel interface reconstruction strategy for volume of fluid (VOF) methods is introduced that represents the liquid-gas interface as two planes that co-exist within a single computational cell. In comparison to the piecewise linear interface calculation (PLIC), this new algorithm greatly improves the accuracy of the reconstruction, in particular when dealing with thin structures such as films. The placement of the two planes requires the solution of a non-linear optimization problem in six dimensions, which has the potential to be overly expensive. Further, an efficient solution to this optimization problem is presented here that exploits two key ideas: an algorithm for extracting multiple plane orientations from transported surface data, and an efficient and mass-conserving distance-finding algorithm that accounts for two planes with arbitrary orientation. Additionally, a simple and robust strategy is presented to accurately represent the surface tension forces produced at the interface of subgrid-thickness films. The performance of this new VOF reconstruction is demonstrated on several test cases that illustrate the capability to handle arbitrarily thin films.
Explore the source record for details and available documents.
A distributed method for concurrent traffic signal and routing control of traffic networks is proposed. The method is based on the multi-commodity store-and-forward model, in which the destinations are the commodities. The system benefits from the communication between vehicles and infrastructure, providing optimal signal timings to intersections and routes to vehicles on a link-by-link basis. Using the augmented Lagrangian to model the constraints into the objective, the baseline centralized problem is decomposed into a set of objective-coupled subproblems, one for each intersection, enabling the solution to be computed by a distributed- gradient projection algorithm. Further, the intersection agents only need to communicate and coordinate with neighboring intersections to ensure convergence to the optimal solution while tolerating suboptimal iterations that offer more flexibility, unlike other distributed approaches. Through microsimulation, we demonstrate the effectiveness of the proposed algorithm in traffic networks with time-varying demand. Computational analysis shows that the distributed problem is suitable for real-time applications. A robustness analysis show that the distributed formulation enables a graceful degradation of the system in case of failure.
The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024
Motivated by the design question of additional fuel needed to complete a task in an uncertain environment, this paper introduces metrics to quantify the maximal additional energy used by a control system in the presence of bounded disturbances, compared to a nominal, disturbance-free system. In particular, we consider the task of finite-time stabilization for a linear, time-invariant system. We compare the nominal energy required to achieve this task in the disturbance-free system to the worst-case energy over all feasible disturbances. Solving for the worst-case energy over all disturbances first leads to an optimal control problem with a least-squares solution, and then an infinite-dimensional optimization problem where we derive an upper bound on the solution. The comparison of energies is accomplished using additive and multiplicative metrics, for which we derive bounds. Simulation examples on an ADMIRE fighter jet model demonstrate the practicability of these metrics, and their variation with the distance of the initial condition from the origin and the task completion time.
The purpose of this project was to utilize computational tools to understand the relationships between processing, microstructure, and properties for additively manufactured (AM) aluminum alloys for automotive applications, and to provide an engineering solution for helping to optimize process conditions. The project leverages ORNL developments in computational modeling, including AM process modeling, phase-field based microstructure evolution predictions, and data analytics techniques for mapping process conditions to material outcomes. The project utilized an Al-Cu-Mn-Zr alloy as a model material for studying formation of defects and microstructural features in response to variations in process conditions. Based on both pre-existing experimental data and simulation results, statistical process maps were constructed to identify regions of process space with minimal defect formation and advantageous microstructures and properties. The software tools used for this purpose were successful disseminated to GM, who were able to successful compile the relevant HPC codes within their own computing ecosystem and perform initial calculations to reproduce ORNL results.
The interdiction defense (ID) problem solves a defender-attacker-defender model where the defender and attacker share the same set of components to harden and target. Here, we build upon the best response intersection (BRI) algorithm by developing the BRI with suboptimal solutions (BRI-SS) algorithm to solve the ID problem. The BRI-SS algorithm utilizes off-the-shelf optimization solvers that return suboptimal solutions at no additional computation cost. We derive novel cuts from suboptimal solutions, reducing the number of iterations required for the algorithm to converge while maintaining optimality guarantees. We also present a heuristic that utilizes all obtained suboptimal solutions to select the next defense to evaluate at each iteration. We perform computational experiments applied to power grid interdiction on standard test cases. Our results demonstrate that the BRI-SS algorithm consistently outperforms the BRI algorithm across all test cases.
Integrated energy systems (IESs) seek to minimize power generating costs in future power grids through the coupling of different energy technologies. To accommodate fluctuations in load demand due to the penetration of renewable energy sources, flexible operation capabilities must be fully exploited, and even power plants that are traditionally considered as base-load units need to be operated according to unconventional paradigms. Thermomechanical loads induced by frequent power adjustments can accelerate the wear and tear. If a unit is flexibly operated without respecting limits on materials, the risk of failures of expensive components will eventually increase, nullifying the additional profits ensured by flexible operation. In addition to the bounds on power variations (explicit constraints),the solution of the unit dispatch problem needs to meet the limits on the variation of key process variables, including temperature, pressure and flow rate (implicit constraints).The FARM (Feasible Actuator Range Modifier) module was developed to enable existing optimization algorithms to identify solutions to the unit dispatch problem that are both economically favorable and technologically sustainable. Thanks to the iterative dispatcher–validator scheme, FARM permits addressing all the imposed constraints without excessively increasing the computational costs. In this work, the algorithms constituting the module are described, and the performance was assessed by solving the unit dispatch problem for an IES composed of three units, i.e., balance of plant, gas turbine, and high-temperature steam electrolysis. Finally, the FARM module provides dedicated tools for visualizing the response of the constrained variables of interest during operational transients and a tool aiding the operator at making decisions. These techniques might represent the first step towards the deployment of an ecological interface design (EID) for IES units.
Electrolytes play a critical role in designing next-generation battery systems, by allowing efficient ion transfer, preventing charge transfer, and stabilizing electrode-electrolyte interfaces. In this work, we develop a differentiable geometric deep learning (GDL) model for chemical mixtures, DiffMix, which is applied in guiding robotic experimentation and optimization towards fast charging battery electrolytes. In particular, we extend mixture thermodynamic and transport laws by creating GDL-learnable physical coefficients. We evaluate our model with mixture thermodynamics and ion transport properties, where we show improved prediction accuracy and model robustness of Diff-Mix than its purely data-driven variants. Furthermore, with a robotic experimentation setup, Clio, we improve ionic conductivity of electrolytes by over 18.8% within 10 experimental steps, via differentiable optimization built on DiffMix gradients. By combining GDL, mixture physics laws, and robotic experimentation, DiffMix expands the predictive modeling methods for chemical mixtures and enables efficient optimization in large chemical spaces.
Optimizing wind farms is essential for designing efficient energy systems, especially as farms grow larger and span multiple sites. However, this optimization becomes increasingly challenging due to the rising computational cost associated with more turbines. Gradient‐based optimization methods scale better than gradient‐free approaches for large problems, but the most computationally expensive component remains the calculation of gradients for the objective function and constraint Jacobians. To address this, we propose leveraging sparsity to accelerate gradient evaluations and reduce the size of the constraint Jacobian. Wind farms naturally exhibit sparsity—many turbines do not influence each other under certain wind directions. However, unlike traditional sparse problems with fixed patterns, wind farm sparsity is dynamic, requiring new strategies to handle changing interactions efficiently. This paper presents a study of sparsity in wind farm optimization and introduces several methods to exploit it. These strategies are tested on multiple farms using the analytic Cumulative Curl model, with gradients computed via automatic differentiation (AD). The same sparsity‐aware techniques are also applicable to finite difference (FD) methods, where they can yield even greater speedups due to the high cost of directional evaluations. Results show that sparse methods achieve up to a 10x speedup with less than ± 5% variance in optimized wake losses compared to traditional methods. These findings suggest that sparsity‐aware optimization not only maintains solution quality but also scales efficiently with farm size, enabling more comprehensive design exploration at reduced computational cost.
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native constraints of quantum hardware, necessitating encoding strategies to map the original problem into a hardware-conformant form. While the classical overhead associated with such mappings is easily quantifiable and typically polynomial in problem size, it is much harder to quantify their overhead on the quantum algorithm, e.g., the transformation of the adiabatic timescale. In this work, we address this challenge on the concrete example of the encoding scheme proposed in [Nguyen , PRX Quantum , 010316 (2023)], which is designed to map optimization problems on arbitrarily connected graphs into Rydberg atom arrays. We consider the fundamental building blocks underlying this encoding scheme and determine the scaling of the minimum gap with system size along adiabatic protocols. Even when the original problem is trivially solvable, we find that the encoded problem can exhibit an exponentially closing minimum gap. We show that this originates from a quantum coherent effect, which gives rise to an unfavorable localization of the ground-state wave function. On the QuEra Aquila neutral atom machine, we observe such localization and its effect on the success probability of finding the correct solution to the encoded optimization problem. Finally, we propose quantum-aware modifications of the encoding scheme that avoid this quantum bottleneck and lead to an exponential improvement in the adiabatic performance. This highlights the crucial importance of accounting for quantum effects when designing strategies to encode classical problems onto quantum platforms. Published by the American Physical Society 2025
Algae-based wastewater treatment technologies can recover nutrients while generating algal biomass with diverse application potentials. While numerous bacteria have demonstrated the ability to enhance algal growth through symbiotic relationships in laboratory settings, scaling this benefit to larger applications remains challenging due to complex wastewater conditions and microbe-algae dynamics. This study explores the effectiveness of bioaugmentation with Azospirillum brasilense, a plant growth-promoting bacterium known for producing the phytohormone indole-3-acetic acid (IAA), in boosting algal productivity within an Algaewheel wastewater treatment system. Through a series of experiments conducted at lab-, pilot-, and full-scale levels, we evaluated the impact of bioaugmentation on algal growth and developed a bioaugmentation strategy for an Algaewheel system. The results indicate that a biweekly dosing, achieving a final bioaugmenting cell density of 0.2–4 × 10 9 cells/L, effectively doubles the biomass productivity in a residential subdivision wastewater treatment plant in Northern Illinois. The bacterial production of IAA was the primary mechanism driving this enhancement, as demonstrated by the similar growth and yield improvements observed with chemically supplemented IAA and bioaugmentation across all experimental scales. High-throughput sequencing of 18S rRNA genes revealed that the algal community in the bioaugmented tank exhibited more stable biodiversity than the control. Additionally, bioaugmentation improved nutrient removal efficiency during winter, highlighting its potential to enhance the overall performance and sustainability of algae-based wastewater systems. The developed bioaugmentation and chemical treatment methods offer further operational solutions for managing yield, optimizing biochemical profiles, and enhancing biofuel production potential.
Here, we present a newly implemented ray tracing algorithm in OpenMC for efficiently computing material volume fractions on superimposed meshes in complex geometries. By firing rays along each coordinate direction through the geometry, the approach accumulates track-length data in each mesh element, thereby determining the fractional composition of each material. Scaling studies on three different models—a random tetrahedra configuration, the Frascati Neutron Generator ITER dose rate benchmark, and a stellarator design—show excellent parallel performance, with nearly linear speedup on modern multi-threaded and distributed-memory systems. An analysis of the residual error relative to high-resolution reference solutions demonstrated that under optimal conditions it decreases as 1/R, where R is the number of rays fired, making it straightforward to achieve user-prescribed accuracy. This new functionality enables practical, mesh-based approaches for detailed nuclear analyses in production Monte Carlo workflows without resorting to expensive, fully conformal or unstructured meshing.
Power-over-Fiber (PoF) technology has been used extensively in settings where high voltages require isolation from ground and electromagnetic isolation is critical. In cryogenic environments, PoF offers a reliable power transmission technology, leveraging optical fibers to transfer power with minimal system degradation. PoF technology excels in maintaining low noise levels and isolation when delivering power to sensitive electronic systems operating in extreme temperature ranges and high voltage environments. Here, in a novel application of PoF for a HEP detector, power is provided to photon detector modules located on a surface at ~300 kV with respect to ground in the planned DUNE experiment. This summary paper of the PoF talk at the 16th PISA Meeting on Advanced Detectors highlights the R&D effort of PoF in extreme conditions and underscores its capacity to revolutionize power delivery and management in critical applications offering a dependable solution with low noise, optimal efficiency, and superior isolation. The DUNE (Abi et al., 2020) experiment will soon deploy large liquid argon (LAr) time projection chambers (TPC) to detect neutrino interactions and other particle physics phenomena. In addition to the particle tracking provided by the TPC, photon detectors, powered by a first ever PoF system, in the cryostat will leverage the high scintillation light yield of LAr to provide crucial timing and additional calorimetric information.