Search NASA⌕ Search

SEARCH · Search NASA

Results for “solution 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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1974

Analytical solution of the optimal three dimensional reentry problem using Chapman's exact equations

This paper presents the general solution for the optimal three dimensional aerodynamic control of a lifting vehicle entering a planetary atmosphere. A set of dimensionless variables is introduced, and the resulting exact equations of motion have the distinctive advantage that they are completely free of the physical characteristics of the vehicle. Furthermore, a general lift-drag polar is used to define the aerodynamic control. Hence, the results obtained apply to any type of vehicle of arbitrary weight, dimensions and shape, having an arbitrary polar and entering any planetary atmosphere.

Vinh, N. X.↗
DOE OSTI2025

Optimizing Power Line Undergrounding Decisions under Varying Wildfire Risk and Weather Scenarios

Abstract—The threat of wildfire ignitions from electric power equipment has led utilities to increasingly turn to preemptive power shutoffs, which, while effective in reducing grid-induced wildfire risk, can cause significant load loss. Undergrounding power lines is an alternative strategy for preventing grid-induced wildfires. However, undergrounding lines is costly, so an efficient undergrounding plan must balance reductions in wildfire risk and load loss with the cost of undergrounding lines. We propose a robust optimization model to identify which power lines to underground to maximize load served while limiting wildfire risk across a range of wildfire risk and weather scenarios. Since solving this problem may be computationally heavy for large power grids and many operating scenarios, we present a delayed constraint generation algorithm to iteratively add scenarios until an optimal solution is found. We evaluate the performance of this framework on the RTS-GMLC with scenarios representing a year of operating conditions and compare it with a stochastic programming formulation. Our results indicate that our undergrounding model is successful in reducing load shed and risk compared to baseline cases in which no mitigation action is taken and only power shutoffs are implemented (no undergrounding). The robust formulation also reduces more load shed than the stochastic formulation in the most extreme scenarios. Index Terms—grid resilience, optimization, transmission systems, underground power lines, wildfire risk.

Taylor, S. [Department of Electrical and Computer ↗
DOE OSTI2025

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↗
NASA NTRS2004

Application of Simulated Annealing and Related Algorithms to TWTA Design

Simulated Annealing (SA) is a stochastic optimization algorithm used to search for global minima in complex design surfaces where exhaustive searches are not computationally feasible. The algorithm is derived by simulating the annealing process, whereby a solid is heated to a liquid state and then cooled slowly to reach thermodynamic equilibrium at each temperature. The idea is that atoms in the solid continually bond and re-bond at various quantum energy levels, and with sufficient cooling time they will rearrange at the minimum energy state to form a perfect crystal. The distribution of energy levels is given by the Boltzmann distribution: as temperature drops, the probability of the presence of high-energy bonds decreases. In searching for an optimal design, local minima and discontinuities are often present in a design surface. SA presents a distinct advantage over other optimization algorithms in its ability to escape from these local minima. Just as high-energy atomic configurations are visited in the actual annealing process in order to eventually reach the minimum energy state, in SA highly non-optimal configurations are visited in order to find otherwise inaccessible global minima. The SA algorithm produces a Markov chain of points in the design space at each temperature, with a monotonically decreasing temperature. A random point is started upon, and the objective function is evaluated at that point. A stochastic perturbation is then made to the parameters of the point to arrive at a proposed new point in the design space, at which the objection function is evaluated as well. If the change in objective function values (Delta)E is negative, the proposed new point is accepted. If (Delta)E is positive, the proposed new point is accepted according to the Metropolis criterion: rho((Delta)f) = exp((-Delta)E/T), where T is the temperature for the current Markov chain. The process then repeats for the remainder of the Markov chain, after which the temperature is decremented and the process repeats. Eventually (and hopefully), a near-globally optimal solution is attained as T approaches zero. Several exciting variants of SA have recently emerged, including Discrete-State Simulated Annealing (DSSA) and Simulated Tempering (ST). The DSSA algorithm takes the thermodynamic analogy one step further by categorizing objective function evaluations into discrete states. In doing so, many of the case-specific problems associated with fine-tuning the SA algorithm can be avoided; for example, theoretical approximations for the initial and final temperature can be derived independently of the case. In this manner, DSSA provides a scheme that is more robust with respect to widely differing design surfaces. ST differs from SA in that the temperature T becomes an additional random variable in the optimization. The system is also kept in equilibrium as the temperature changes, as opposed to the system being driven out of equilibrium as temperature changes in SA. ST is designed to overcome obstacles in design surfaces where numerous local minima are separated by high barriers. These algorithms are incorporated into the optimal design of the traveling-wave tube amplifier (TWTA). The area under scrutiny is the collector, in which it would be ideal to use negative potential to decelerate the spent electron beam to zero kinetic energy just as it reaches the collector surface. In reality this is not plausible due to a number of physical limitations, including repulsion and differing levels of kinetic energy among individual electrons. Instead, the collector is designed with multiple stages depressed below ground potential. The design of this multiple-stage collector is the optimization problem of interest. One remaining problem in SA and DSSA is the difficulty in determining when equilibrium has been reached so that the current Markov chain can be terminated. It has been suggested in recent literature that simulating the thermodynamic properties opecific heat, entropy, and internal energy from the Boltzmann distribution can provide good indicators of having reached equilibrium at a certain temperature. These properties are tested for their efficacy and implemented in SA and DSSA code with respect to TWTA collector optimization.

Radke, Eric M.↗
DOE OSTI2026

Relaxations of the steady optimal gas flow problem for a non-Ideal gas

Natural gas ranks second in U.S. primary energy consumption. Because most production sites are remote, gas must be transported through pipeline networks equipped with compressors, valves, and other components. For both economic efficiency and system reliability, it is desirable to operate these networks optimally. The governing physics across pipeline components entails nonlinear, non-convex equality and inequality constraints, and the most general steady-flow operations problem is a Mixed-Integer Nonlinear Program (MINLP).This work focuses on one such steady-flow problem-the Optimal Gas Flow (OGF) for a natural gas pipeline network-which minimizes production cost subject to the steady-flow physics. For day-to-day operations, the ability to quickly compute a globally optimal solution and a strong lower bound for varying demand profiles is crucial. A promising strategy is to build tight relaxations of the OGF’s nonlinear constraints. However, many nonlinearities arising from non-ideal equations of state either lack relaxations or have relaxations that do not scale to realistic network sizes. We address this gap by combining recent advances in polyhedral relaxations for univariate functions to construct tight, computationally efficient relaxations of the OGF with a non-ideal equation of state. These relaxations solve within seconds on a standard laptop. In conclusion, we demonstrate their quality through extensive numerical experiments on very large-scale test networks from the literature and find that the proposed approach proves optimality in 92% of tested instances.

03 NATURAL GAS↗
DOE OSTI2025

A Smoothed Augmented Lagrangian Framework for Convex Optimization with Nonsmooth Constraints

Augmented Lagrangian (AL) methods have proven remarkably useful in solving optimization problems with complicated constraints. The last decade has seen the development of overall complexity guarantees for inexact AL variants. Yet, a crucial gap persists in addressing nonsmooth convex constraints. To this end, we present a smoothed augmented Lagrangian (AL) framework where nonsmooth terms are progressively smoothed with a smoothing parameter $\eta _k$ . The resulting AL subproblems are $\eta _k$ -smooth, allowing for leveraging accelerated schemes. By a careful selection of the inexactness level $\epsilon _k$ (for inexact subproblem resolution), the penalty parameter $\rho _k$ , and smoothing parameter $\eta _k$ at epoch k, we derive rate and complexity guarantees of $\tilde{\mathcal {O}}(1/{\varepsilon }^{3/2})$ and $\tilde{\mathcal {O}}(1/{\varepsilon })$ in convex and strongly convex regimes for computing an ${\varepsilon }$ -optimal solution, when $\rho _k$ increases at a geometric rate, a significant improvement over the best available guarantees for AL schemes for convex programs with nonsmooth constraints. Analogous guarantees are developed for settings with $\rho _k = \rho$ as well as $\eta _k = \eta$ . Preliminary numerics on a fused Lasso problem display promise.

augmented Lagrangian↗
NASA NTRS1996

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaption on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load imbalance among processors on a parallel machine. This paper describes the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution cost is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35% of the mesh is randomly adapted. For large-scale scientific computations, our load balancing strategy gives almost a sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remapper yields processor assignments that are less than 3% off the optimal solutions but requires only 1% of the computational time.

Biswas, Rupak↗
NASA NTRS1996

Global Load Balancing with Parallel Mesh Adaption on Distributed-Memory Systems

Dynamic mesh adaptation on unstructured grids is a powerful tool for efficiently computing unsteady problems to resolve solution features of interest. Unfortunately, this causes load inbalances among processors on a parallel machine. This paper described the parallel implementation of a tetrahedral mesh adaption scheme and a new global load balancing method. A heuristic remapping algorithm is presented that assigns partitions to processors such that the redistribution coast is minimized. Results indicate that the parallel performance of the mesh adaption code depends on the nature of the adaption region and show a 35.5X speedup on 64 processors of an SP2 when 35 percent of the mesh is randomly adapted. For large scale scientific computations, our load balancing strategy gives an almost sixfold reduction in solver execution times over non-balanced loads. Furthermore, our heuristic remappier yields processor assignments that are less than 3 percent of the optimal solutions, but requires only 1 percent of the computational time.

Biswas, Rupak↗
DOE OSTI2025

Conflict Detection in Open RAN with Recurrent Neural Networks Using Geometric Manifolds

Allowing third-party applications on Radio Access Network (RAN) Intelligent Controllers (RICs) within the OpenRAN (O-RAN) framework introduces conflicting interactions that are often difficult to detect in advance. These conflicts, occurring between third-party applications in the Near RealTime RIC (Near-RT RIC), known as xApps, can lead to performance degradation and instability in O-RAN if not identified early. Existing conflict detection and mitigation solutions in the literature assume that the conflicts are known beforehand, which is not always accurate due to the complex and often hidden relationships between control parameters and Key Performance Indicators (KPIs). In this paper, we propose a novel Recurrent Neural Network (RNN) to detect both known and unknown conflicts in O-RAN xApps as specified in the O-RAN standards. We model the xApps, control parameters, and KPIs with nodes and edges to create graph structures and use the hidden nonEuclidean geometric properties of the Riemannian manifold to train the RNN model. The performance of this proposed model is validated using evaluation metrics and compared with benchmarks. Results demonstrate that the proposed RNN model, leveraging Riemannian geometric properties, can achieve 100% of the F1-score provided by an optimal solution in just 20 iterations.

5G↗
DOE OSTI2025

Conflict Detection in Open RAN with Recurrent Neural Networks Using Geometric Manifolds

Allowing third-party applications on Radio Access Network (RAN) Intelligent Controllers (RICs) within the OpenRAN (O-RAN) framework introduces conflicting interactions that are often difficult to detect in advance. These conflicts, occurring between third-party applications in the Near RealTime RIC (Near-RT RIC), known as xApps, can lead to performance degradation and instability in O-RAN if not identified early. Existing conflict detection and mitigation solutions in the literature assume that the conflicts are known beforehand, which is not always accurate due to the complex and often hidden relationships between control parameters and Key Performance Indicators (KPIs). In this paper, we propose a novel Recurrent Neural Network (RNN) to detect both known and unknown conflicts in O-RAN xApps as specified in the O-RAN standards. We model the xApps, control parameters, and KPIs with nodes and edges to create graph structures and use the hidden nonEuclidean geometric properties of the Riemannian manifold to train the RNN model. The performance of this proposed model is validated using evaluation metrics and compared with benchmarks. Results demonstrate that the proposed RNN model, leveraging Riemannian geometric properties, can achieve 100% of the F1-score provided by an optimal solution in just 20 iterations.

5G↗
NASA NTRS2017

Controlling Tensegrity Robots through Evolution using Friction based Actuation

Traditional robotic structures have limitations in planetary exploration as their rigid structural joints are prone to damage in new and rough terrains. In contrast, robots based on tensegrity structures, composed of rods and tensile cables, offer a highly robust, lightweight, and energy efficient solution over traditional robots. In addition tensegrity robots can be highly configurable by rearranging their topology of rods, cables and motors. However, these highly configurable tensegrity robots pose a significant challenge for locomotion due to their complexity. This study investigates a control pattern for successful locomotion in tensegrity robots through an evolutionary algorithm. A twelve-rod hardware model is rapidly prototyped to utilize a new actuation method based on friction. A web-based physics simulation is created to model the twelve-rod tensegrity ball structure. Square-waves are used as control policies for the actuators of the tensegrity structure. Monte Carlo trials are run to find the most successful number of amplitudes for the square-wave control policy. From the results, an evolutionary algorithm is implemented to find the most optimized solution for locomotion of the twelve-rod tensegrity structure. The software pattern coupled with the new friction based actuation method can serve as the basis for highly efficient tensegrity robots in space exploration.

Tensegrit↗
DOE OSTI2025

Packages of Distributed Energy Technologies Demonstrating Demand Flexibility at Community Scale

The combination of increased electric load growth across all sectors, deferred electrical infrastructure investment, and other factors resulting in variable electric power supply, has created technical challenges to maintaining a resilient and reliable grid. Many federal, regional, and local efforts are in play to modernize the electric grid, including advancing building technologies and distributed energy resources (DERs) that are utilizing smarter controls to become responsive to both occupant and grid needs. This report reviews ten pilot projects demonstrating how groups of buildings combined with behind-the-meter (BTM) DERs such as electric vehicle (EV) charging, battery storage, flexible HVAC and domestic hot water systems, and photovoltaic systems can reliably and cost effectively provide grid services. Each of the ten pilot projects aim to deliver both energy efficiency and demand flexibility (DF) while supporting load growth. The ten demonstration teams are piloting flexible DER packages across diverse communities of residential and commercial buildings to address a variety of regional grid needs. The outcomes of these pilot projects will be used to inform future scaling through utility program development. This paper characterizes the ten teams, showcasing the decision-making process used by each group to develop their packages (Section 2), the grid services they plan to deliver (Section 3), the types of DER packages selected for deployment within building sectors (Section 4) and trends between building sector, DER types, and grid services In order to achieve community scale benefits, the pilot projects must utilize aggregated control mechanisms for coordinating buildings and DERs together. Several types of coordinated control architectures have evolved amongst the teams, influenced by use type, existing market conditions, and integration type. Three coordinated controls architectures have been characterized, highlighting their use cases, benefits, challenges, and tradeoffs in their design. These insights can aid utilities, control vendors, and developers in scaling community-level energy systems (Paul, 2024). Ultimately, the technology packages selected by the ten teams will be coordinated to provide power system services, also known as grid services. Insights from these demonstrations will be useful for grid operators, regulators, aggregators and other stakeholders as they look to deploy demand flexible resources as grid services in the future. The grid services that each team is targeting for demonstration are described in Section 3 and Section 4. Methods for evaluating the grid services have been described in the paper Metrics for Evaluating Grid Service Provision from Communities of Grid-interactive and Efficient Buildings and other DER (MacDonald, 2023). To identify technology packages for demonstration, Section 2 shows that project teams used a range of analysis approaches, including building energy modeling, AMI data analysis, cost-benefit frameworks, and utility pilot data. Some teams emphasized technical modeling to quantify grid impacts and demand reduction potential, while others prioritized economic evaluations, stakeholder input, or exploratory pilots to inform deployment decisions. This diversity reflects the need to tailor selection methods to project goals, available data, and organizational context. Section 5 discusses trends between the DER technologies deployed and the grid service provisions from each team. Residential buildings (multifamily and single family) lean towards technologies that enhance energy efficiency (e.g. weatherization upgrades, smart thermostats) and onsite power generation integration (e.g. solar PV). Commercial building demonstrations prioritize technologies that ensure operational reliability (e.g. battery storage) and centralized energy management systems and optimization solutions. Teams that are deploying controllable storage-based technologies are more likely to provide grid services that require a near real-time response. Teams incorporating load shifting technologies like smart thermostats with HEMs are likely to include energy markets participation and customer bill management offerings. Campus demonstrations are adopting diverse sets of DERs to emphasize renewable generation, paired with centralized control. This section also describes technologies that were considered during project planning but ultimately excluded from final deployment. These demonstrations reveal that effective DER package design should be tailored to building type, customer segment, and construction vintage. Multifamily buildings benefit from centralized HVAC upgrades and supervisory controls, while single-family homes are well-suited for individualized technologies like solar, storage, and smart home energy monitors. Commercial and campus settings prioritize EMIS integration and load optimization. New construction enables cost-effective integration of DER-ready infrastructure, whereas retrofits require deployments aligned with owner and tenant value streams. For utility program planners, early coordination with developers and building owners, paired with segmented and modular program offerings, can improve adoption, scalability, and grid impact.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS2022

Low-Earth Orbit Trajectory Optimization in the Presence of Atmospheric Uncertainty

The previous 20 to 25 years have seen a tremendous increase in space exploration, and with that an increase in the level of logistics planning needed to ensure mission success. For spacecraft that are designed to be periodically re-supplied, a key logistics consumable is propellant, as it constitutes the greatest up-mass on re-supply vehicles. A trajectory design strategy is therefore desired that minimizes propellant usage in order to ease the demand for propellant re-supply missions. This thesis develops such a strategy in three stages, and uses the International Space Station (ISS) as its testbed, as no other LEO spacecraft is more challenging from a space logistics standpoint. First, the ISS trajectory planning problem is formulated as a constrained burn optimization problem assuming a deterministic atmosphere. The cost function is total ∆v, with constraints imposed on longitude of ascending viii node (LAN) and semi-major axis (SMA) altitude. Analytic derivatives are constructed for both the cost and constraints, which are necessary given the 6-week to 2-year time frames being considered. A gradient-based optimizer is then utilized to find locally-optimal solutions to real-world ISS trajectory planning problems. Second, atmospheric uncertainty is addressed by constructing a probabilistic model of space weather data using Gaussian Processes (GPs). Bayesian inference is performed using the GP model to generate mean and covariance estimates for space weather predictions, whose pedigree is assessed against test data. The predictions are then mapped into atmospheric density via the analytic Jacchia-Roberts density model, and the effect of space weather uncertainty on orbital lifetime is examined. Third, an ISS burn execution uncertainty model is developed. This model, along with the space weather uncertainty model, are deployed in a linear covariance analysis to ascertain their combined effect on LAN and SMA altitude dispersions. The deterministic constraints from the original problem are re-formulated as stochastic constraints, where now the constraint uncertainty interval is required to fall within specified bounds. An updated optimization framework is constructed using the original ∆v cost function along with the stochastic constraints to solve the trajectory optimization problem under atmospheric uncertainty. Finally, the complete architecture is summarized for deployment in an operational setting.

Trajectory Optimization↗
NASA NTRS2018

Mars Planetary Network for Human Exploration Era – Potential Challenges and Solutions

During 2016-2017, a study was conducted under the sponsorship of the NASA’s Space Communications and Navigation (SCaN) Program to investigate the deep space communications capacity taking into account the needs of all the present and envisioned future missions toward 2030s. It was soon recognized that planning for human exploration to Mars would impose certain unprecedent challenges, both fiscal and technical, to the current space communications paradigm. Targeting the assumed missions concepts, i.e., Crewed Mission to Phobos (CMTP) and Mars Short Stay Mission (MSSM), a Mars Planetary Network for the human exploration era has been formulated. The activity modeling and network traffic simulation/modeling we performed gave some insight into the technical challenges in space communications for the envisioned human Mars exploration era. Chief among the potential challenges are: (1) the high demand on the deep space network (DSN) assets for achieving the high-rate links, both return and forward, from Mars farthest/farther distance (up to 2.67 AU); (2) the need for resilient, persistent communication coverage for crewed vehicles, on surface and in orbits; (3) the significant period of outage for the Mars-Earth link due to superior solar conjunction; (4) the need for on-demand, simultaneous access to the proximity link by multiple vehicles and astronauts in the exploration zone; (5) the capability of determining precise, real-time, positions of surface vehicles and astronauts by the deep space habitat and/or other tele-operations entities. Solution space to each of the above challenges has been explored and analyzed in the context of the individual problem domain and, more importantly, in conjunction with that for the other challenges. This has led to an end-to-end definition of a Mars Planetary Network that would feature: (1) the fusion of deep space Ka-band and optical communications for achieving Mars-Earth high-rate links taking advantage of the optical/RF hybrid 8m/34m antennas in DSN; (2) the integrated application of the Multiple Spacecraft Per Antenna (MSPA) technique, for return link data acquisition, and the Multiple Uplink Per Antenna (MUPA) technique, for forward link data trasnmission, to reduce the number of 34m beam-wave guide (BWG) antennas needed for the era; (3) the integration of three, arrayed, 34m beam-wave guide (BWG) antennas, to provide a high G/T aperture, with the MSPA/MUPA techniques, and a dual “trunk link”approach to cut down the needed G/T -- hence, reducing the number of 34m antennas, relative to that in the single trunk approach by 50%; (4) the deployment of two areostationary/areosynchronous Mars relay orbiters; one of them could also function as (or be served by) a notional Deep Space Habitat (DSH); (5) the opportunistic deployment of a science orbiter in a Pioneer-6 type orbit, equidistant Mars/Earth, that could also serve as an intermediary relay during the Mars superior solar conjunction perod; (6) the existence of the multi-function Mars proximity link that provides the demand-assigned, multiple access (DAMA) capability; and (7) the provision of tracking observables, by leveraging on the planned Mars orbiting and surface infrastructure, to enable the in-situ navigation for surface and orbiting vehicles. This paper provides the description of the proposed Mars Planetary Network in the human exploration era, the trade-off analysis for the various alternative architectures, and the optimal solutions to the key challenges in defining this end-to-end network.

Cheung, Kar-Ming↗
DOE OSTI2025

Global techno-economic and life cycle greenhouse gas emissions assessment of solar and wind based renewable hydrogen production

This study conducts a global assessment of renewable hydrogen production pathways, focusing on techno-economic performance and life cycle greenhouse gas (GHG) emissions. It evaluates standalone solar photovoltaic (PV), wind, and hybrid PV/wind systems, integrated with proton exchange membrane (PEM) electrolyzers, through multi-objective optimization and considering embodied emissions in manufacturing PV, wind and electrolyzers. Results identify optimal configurations to minimize levelized cost of hydrogen (LCOH) and carbon intensity (CI) of hydrogen, showing potential reductions of cost and CI by 2030. Standalone PV systems can achieve LCOH values smaller than 6.5 USD/kg H 2 and CI less than 2.5 kg CO 2 eq/kg H 2 in regions with high solar irradiance, such as North Africa, the Middle East and Chile. Wind systems in regions such as Middle East, North Africa, Australia and Central United States achieve LCOH below 5 USD/kg H 2 and CI under 1.5 kg CO 2 eq/kg H 2 . Hybrid systems emerge as the optimal solution for minimizing both the LCOH and CI by maximizing the use of renewable energy. Moreover, the results also indicate that, with the technological advancements, future reduction in the capital cost of renewable energy systems and the PEM electrolyzer as well as the trade of coproduct O 2 could drive the LCOH of all the RES-based hydrogen systems below 1 USD/kg H 2 and the CI below zero in different regions as Middle East, North Africa and Central United State

08 HYDROGEN↗
DOE OSTI2024

In Situ Velocity‐Strain Sensitivity Near the San Jacinto Fault Zone Analyzed Through Train Tremors

Abstract We utilize train tremors as P‐wave seismic sources to investigate velocity‐strain sensitivity near the San Jacinto Fault Zone. A dense nodal array deployed at the Piñon Flat Observatory is used to detect and identify repeating train energy emitted from a railway in the Coachella valley. We construct P‐wave correlation functions across the fault zone and estimate the spatially averaged dt / t versus strain sensitivity to be 6.25 × 10 4 . Through numerical simulations, we explore how the sensitivity decays exponentially with depth. The optimal solution reveals a subsurface sensitivity of 1.2 × 10 5 and a depth decay rate of 0.05 km −1 . This sensitivity aligns with previous findings but is toward the higher end, likely due to the fractured fault‐zone rocks. The depth decay rate, previously unreported, is notably smaller than assumed in empirical models. This raises the necessity of further investigations of this parameter, which is crucial to study stress and velocity variations at seismogenic depth.

Geology↗
DOE OSTI2024

Bayesian blacksmithing: discovering thermomechanical properties and deformation mechanisms in high-entropy refractory alloys

Finding alloys with specific design properties is challenging due to the large number of possible compositions and the complex interactions between elements. This study introduces a multi-objective Bayesian optimization approach guiding molecular dynamics simulations for discovering high-performance refractory alloys with both targeted intrinsic static thermomechanical properties and also deformation mechanisms occurring during dynamic loading. The objective functions are aiming for excellent thermomechanical stability via a high bulk modulus, a low thermal expansion, a high heat capacity, and for a resilient deformation mechanism maximizing the retention of the BCC phase after shock loading. Contrasting two optimization procedures, we show that the Pareto-optimal solutions are confined to a small performance space when the property objectives display a cooperative relationship. Conversely, the Pareto front is much broader in the performance space when these properties have antagonistic relationships. Density functional theory simulations validate these findings and unveil underlying atomic-bond changes driving property improvements.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Data-driven gradient optimization for field emission management in a superconducting radio-frequency linac

Field emission can cause significant problems in superconducting radio-frequency linear accelerators (linacs). When cavity gradients are pushed higher, radiation levels within the linacs may rise exponentially, causing degradation of many nearby systems. This research aims to utilize machine learning with uncertainty quantification to predict radiation levels at multiple locations throughout the linacs and ultimately optimize cavity gradients to reduce field emission-induced radiation while maintaining the total linac energy gain necessary for the experimental physics program. The optimized solutions show over 40% reductions for both neutron and gamma radiation from the standard operational settings. Published by the American Physical Society 2025

43 PARTICLE ACCELERATORS↗