Search NASA⌕ Search

SEARCH · Search NASA

Results for “online 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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Autonomous online optimization of a closed-circuit reverse osmosis system

As freshwater becomes increasingly scarce, many industrial and municipal water utilities look at premise-scale water treatment and reuse to meet water demand. Closed-circuit reverse osmosis (CCRO) has been proposed as a promising process design to do so. This sequencing batch process enables operation at higher brine salinity levels by means of a recycle flow. Optimal operation requires that the maximum salinity level at the membrane surface represents an optimal trade-off between brine disposal costs and energy efficiency. This maximum salinity level may change over time as the feed water composition changes and electricity markets fluctuate. In this article, we present the results of the experimental evaluation of an automatic technique for continuous online optimization, known as extremum seeking control. This technique has a long history in the process control community but has received little traction so far in the water industry. We modify this technique to enable its use for online optimization of CCRO, specifically to account for its sequential batch operation. We challenge the optimization schemes through several experimental tests and illustrate the advantages and drawbacks of extremum-seeking control.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

Performance Optimization of the IOTA Duoplasmatron Proton Source

We present results from online optimization studies of a duoplasmatron ion source designed to produce 50~keV protons for acceleration to 2.5~MeV and subsequent injection into the Integrable Optics Test Accelerator (IOTA) at Fermilab. Using a Bayesian exploration technique, we developed multi-parameter models of the source s proton current and employed these models to optimize its performance. Depending on the spectrometer configuration used to isolate the proton beam and the chosen optimization objective, we identified three candidate operating points, achieving normalized 50~\% emittances between 0.57 and 1.3~\textmu m and a maximum proton current of $14.5 \pm 0.6$~mA.

Banerjee, Nilanjan [Fermilab] (ORCID:0000000344660↗
DOE OSTI2025

Stable Machine‐Learning Parameterization of Subgrid Processes in a Comprehensive Atmospheric Model Learned From Embedded Convection‐Permitting Simulations

Modern climate projections often suffer from inadequate spatial and temporal resolution due to computational limitations, resulting in inaccurate representations of sub-grid processes. A promising technique to address this is the multiscale modeling framework (MMF), which embeds a kilometer-resolution cloud-resolving model (CRM) within each atmospheric column of a host climate model to replace traditional convection and cloud parameterizations. Machine learning offers a unique opportunity to make MMF more accessible by emulating the embedded CRM and reducing its substantial computational cost. Although many studies have demonstrated proof-of-concept success of achieving stable hybrid simulations, it remains a challenge to achieve near operational-level success with real geography and comprehensive variable emulation that includes, for example, explicit cloud condensate coupling. In this study, we present a stable hybrid model capable of integrating for at least 5 years with near operational-level complexity, including coarse-grid geography, seasonality, explicit cloud condensate and wind predictions, and land coupling. Our model demonstrates skillful online performance, achieving a 5-year zonal mean tropospheric temperature bias within 2 K, water vapor bias within 1 g/kg, and a precipitation root mean square error of 0.96 mm/day. Key factors contributing to our online performance include an expressive U-Net architecture and physical thermodynamic constraints for microphysics. With microphysical constraints mitigating unrealistic cloud formation, our work is the first to demonstrate realistic multi-year cloud condensate climatology under the MMF framework. Despite these advances, online diagnostics reveal persistent biases in certain regions, highlighting the need for innovative strategies to further optimize online performance.

Hu, Zeyuan [NVIDIA Corporation, Santa Clara, CA (U↗
DOE OSTI2025

Online regularization of Poincaré map of storage rings with Shannon entropy

A measurable chaos indicator is used as the online optimization objective in tuning a complicated nonlinear system—the National Synchrotron Light Source-II storage ring. Through analyzing the Shannon entropy in measured Poincaré maps, not only can the commonly used nonlinear characterizations be extracted, but more importantly, the chaos can be quantified and then used for an online regularization of these maps. The method itself is general and applicable to other tunable nonlinear systems as well. Published by the American Physical Society 2025

36 MATERIALS SCIENCE↗
DOE OSTI2026

Online multi-objective Bayesian optimization of injection efficiency and beam lifetime with skew quadrupoles at NSLS-II

At NSLS-II, the vertical emittance of electron beam is typically blown up to ~30 pm with a coupling wave to increase beam lifetime during user operation. As more and more insertion devices are added to the storage ring, injection efficiency to the ring drops noticeably in certain machine states, apparently due to degraded dynamic apertures. To help alleviate this issue, we have recently performed online multi-objective Bayesian optimization to increase injection efficiency while maintaining beam lifetime, by adjusting the strengths of 15 skew quadrupoles in non-dispersive sections. We report the results of this optimization effort.

Hidaka, Yoshiteru [Brookhaven]↗
DOE OSTI2024

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

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

Moltex static salt reactor↗
DOE OSTI2024

Adaptive Online Model Update Algorithm for Predictive Control in Networked Systems

In this article, we introduce an adaptive on-line model update algorithm designed for predictive control applications in networked systems, particularly focusing on power distribution systems. Unlike traditional methods that depend on historical data for offline model identification, our approach utilizes real-time data for continuous model updates. This method integrates seamlessly with existing online control and optimization algorithms and provides timely updates in response to real-time changes. This methodology offers significant advantages, including a reduction in the communication network bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt after disturbances. Furthermore, our algorithm is tailored for non-linear convex models, enhancing its applicability to practical scenarios. The efficacy of the proposed method is validated through a numerical study, demonstrating improved control performance using a synthetic IEEE test case.

data-driven model predictive control↗
DOE OSTI2026

Adaptive Cybersecurity for Distributed Energy Resources (AdCyDER): Online Reinforcement Learning with Stackelberg-Optimized Defenses — Pipeline Architecture, Evaluation Methodology, and Findings from a Synthetic-Data Evaluation

This report documents the design and evaluation of an integrated online-learning pipeline developed within the AdCyDER project for Distributed Energy Resource (DER) cybersecurity. The pipeline couples a Reinforcement Learning (RL) attack classifier — which produces an attack-type probability distribution — with a Stackelberg game-theoretic (GT) defense selector that consumes those distributions alongside SME-encoded priors over (defense, attack) effectiveness pairings and perdefense costs to choose grid-health-preserving defenses. The objective is not attack classification per se but production of distributions that drive effective defense selection through the Stackelberg layer, learned from delayed grid-health feedback rather than labeled attack data. AdCyDER as a whole is broader than the work presented here; this report covers the specific RL/GT loop integration and its evaluation. We present the integrated pipeline (SCADA telemetry with Fronius inverter physics, Suricata IDS, time-windowed aggregation, per-facility LSTM classifier, Stackelberg optimizer, OpenC2 actuators), an experimental campaign of 28 eight-hour iterations across three baseline modes, and a pipeline-ordered diagnostic protocol. The protocol identifies two distinct failure modes within the loop: paired supervised ceilings on the same features establish that the deployed online RL classifier (macro F1 ≈ 0.07) sits at least 4.7× below a same-architecture supervised LSTM (≈ 0.34) and 10–11× below a linear feature-signal ceiling (≈ 0.70–0.79 depending on per-facility isolation), localizing the dominant failure to the training procedure; and the reward signal driving online updates carries weak directional coupling with classifier correctness in the methodology-expected direction (multi-lens convergent: top-decile P(true) records produce more frequent state changes and slightly larger improvements, top-vs-bot Cohen’s 𝑑 ≈ −0.19), but at effect magnitudes too small to drive gradient-based learning at the campaign sample size. The original learning hypothesis is not supported by the data. The primary contributions are the diagnostic methodology — proposed as a transferable falsification protocol for online RL/GT defense pipelines learning from delayed environmental reward — and the open, reproducible experimental infrastructure. We outline reward reformulation as the highest-priority aspirational next step given the underpowered-but-aligned Q6 reading, with hardware-in-the-loop evaluation as the broadest scope-expansion option.

Blakely, Benjamin [Argonne National Laboratory (AN↗
DOE OSTI2025

Risk-Aware Reinforcement Learning Framework for User-Centric O-RAN

The evolution of Open Radio Access Networks (O-RAN) presents an opportunity to enhance network performance by enabling dynamic orchestration of configuration and optimization parameters (COPs) through online learning methods. However, leveraging this potential requires overcoming the limitations of traditional cell-centric RAN architectures, which lack the necessary flexibility. On the other hand, despite their recent popularity, the practical deployment of online learning frameworks, such as Deep Reinforcement Learning (DRL)-based COP optimization solutions, remains limited due to their risk of deteriorating network performance during the exploration phase. In this article, we propose and analyze a novel risk-aware DRL framework for user-centric RAN (UC-RAN), which offers both the architectural flexibility and COP optimization to exploit this flexibility. We investigate and identify UC-RAN COPs that can be optimized via a soft actor-critic algorithm implementable as an O-RAN application (rApp) to jointly maximize latency satisfaction, reliability satisfaction, area spectral efficiency, and energy efficiency. We use the offline learning on UC-RAN to reliably accelerate DRL training, thus minimizing the risk of DRL deteriorating cellular network performance. Results show that our proposed solution approaches near-optimal performance in just a few hundred iterations with a decrease in risk score by a factor of ten.

6G and beyond↗
DOE OSTI2024

A Distributed Model Identification Algorithm for Multi-Agent Systems: Preprint

In this study, we investigate agent-based approach for system model identification with emphasis on power distribution system applications. Departing from conventional practices of relying on historical data for offline model identification, we adopt online update approach utilizing real-time data by employing the latest data points for gradient computation. This methodology offers advantages including a large reduction in the communication network's bandwidth requirements by minimizing the data exchanged at each iteration and enabling the model to adapt in real-time to disturbances. Furthermore, we extend our model identification process from linear frameworks to more complex non-linear convex models. This extension is validated through numerical studies demonstrating improved control performance for a synthetic IEEE test case.

data-driven control↗
DOE OSTI2026

Tula: Optimizing Time, Cost, and Generalization in Distributed Large-Batch Training

Distributed training increases the number of batches processed per iteration either by scaling-out (adding more nodes) or scaling-up (increasing the batch-size). However, the largest configuration does not necessarily yield the best performance. Horizontal scaling introduces additional communication overhead, while vertical scaling is constrained by computation cost and device memory limits. Thus, simply increasing the batch-size leads to diminishing returns: training time and cost decrease initially but eventually plateaus, creating a knee-point in the time/cost vs. batch-size pareto curve. The optimal batch-size therefore depends on the underlying model, data and available compute resources. Large batches also suffer from worse model quality due to the well-known “generalization gap”. In this paper, we present Tula, an online service that automatically optimizes time, cost, and convergence quality for large-batch training of convolutional models. It combines parallel-systems modeling with statistical performance prediction to identify the optimal batchsize. Tula predicts training time and cost within 7.5−14% error across multiple models, and achieves up to 20× overall speedup and improves test accuracy by ≈9% on average over standard large-batch training on various vision tasks, thus successfully mitigating the generalization gap and accelerating training at the same time.

Tyagi, Sahil [ORNL] (ORCID:0009000783144745)↗
DOE OSTI2026

Toward real-time optimization through model reduction and model discrepancy sensitivities

Optimization problems arise in a range of scenarios, from optimal control to model parameter estimation. In many applications, such as the development of digital twins, it is essential to solve these optimization problems within wall-clock-time limitations. However, this is often unattainable for complex systems, such as those modeled by nonlinear partial differential equations. One strategy for mitigating this issue is to construct a reduced-order model (ROM) that enables more rapid optimization. In particular, the use of nonintrusive ROMs—those that do not require access to the full-order model at evaluation time—is popular because they facilitate the computation of optimization solutions within the wall-clock time requirements. However, the optimization solution will be unreliable if the iterates move outside the ROM training data. This article proposes the use of hyper-differential sensitivity analysis with respect to model discrepancy (HDSA-MD) as a computationally efficient tool to augment ROM-constrained optimization and improve its reliability. The proposed approach consists of two phases: (i) an offline phase where several full-order model evaluations are computed to train the ROM, and (ii) an online phase where a ROM-constrained optimization problem is solved, a limited number of full-order model evaluations are computed, and HDSA-MD is used to enhance the optimization solution. Numerical results are demonstrated for two examples, atmospheric contaminant control and wildfire ignition location estimation, in which a ROM is trained offline using inaccurate atmospheric data. In conclusion, the HDSA-MD update yields a significant improvement in the ROM-constrained optimization solution using only one full-order model evaluation online with corrected atmospheric data.

PDE-constrained optimization↗
DOE OSTI2025

Efficient online quantum circuit learning with no upfront training

Optimization is a promising candidate for studying the utility of variational quantum algorithms (VQAs). However, evaluating cost functions using quantum hardware introduces runtime overheads that limit exploration. Surrogate-based methods can reduce calls to a quantum computer, yet existing approaches require hyperparameter pre-training and have been tested only on small problems. Here, we show that surrogate-based methods can enable successful optimization at scale, without pre-training, by using radial basis function interpolation (RBF) to construct an adaptive, hyperparameter-free surrogate. Using the surrogate as an acquisition function drives hardware queries to the vicinity of the true optima. For 16-qubit random 3-regular Max-Cut instances with the Quantum Approximate Optimization Algorithm (QAOA), our method outperforms state-of-the-art approaches, without considering their upfront training costs. Furthermore, we successfully optimize QAOA circuits for 127-qubit random Ising models on an IBM processor using 10 4 −10 5 measurements. Strong empirical performance demonstrates the promise of automated surrogate-based learning for large-scale VQA applications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

String instability mitigation of adaptive cruise control without modifying control laws: trajectory shaper and parameter estimation

Vehicle automation technologies equip vehicles with adaptive cruise control (ACC) systems, which relieve driving fatigue. However, recent studies have shown that the current ACC systems are string-unstable (i.e., exacerbate traffic congestion). To achieve string stability, most existing studies directly modify the control algorithms of ACC systems. Alternatively, this study proposes a trajectory shaper (TS)-based method, which only modifies the trajectory information of the predecessor vehicle, so that the ego vehicle driven by a string-unstable ACC system leverages the modified trajectory information to achieve string stability. To devise the TS-based method, an offline-online parameter estimation method integrating batch optimization and an extended Kalman filter is applied to estimate the parameters of an ACC system. The proposed TS-based method is cost-effective during implementation, as it avoids modifying existing ACC control algorithms (which entails a complex analysis of control systems and parameter tuning). In conclusion, the effectiveness of the proposed TS-based method is validated through extensive numerical experiments.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2025

pbd-industrial-limit-of-performance (PBD limit of performance) v1.0.0

Software repository that contains models used for a paper about Platform-Based Design with limit of performance analysis for an industrial pilot study. This repository contains process and control models in Modelica and IDAES and scripts to develop an ML based controller that computes the control function that maximizes the techno-economic performance of cost and energy computed by the model. This software is meant to be released to reproduce the work described in a Journal publication that is now drafted with the working title "Energy System Limit of Performance Analysis using an Online Machine Learning Multi-Resolution Optimization Framework".

Amusat, Oluwamayowa [Lawrence Berkeley National La↗
DOE OSTI2026

Applying Particle Swarm Optimization and Extended Kalman Filtering to Model Kaplan Generation Dynamics for Hydropower Systems

Variable renewable generation is increasing the need for hydropower plants to provide fast and flexible grid support, which places new demands on plant-level dynamic models used for monitoring, control, and operational decision-making. This need is especially important for hydroelectric systems, where turbine and generator dynamics are strongly coupled, nonlinear, and time-varying, making accurate real-time representation difficult. To address this problem, this paper develops a digital twin (DT) framework for a synchronous generator–Kaplan turbine system using an explicit separation of slow turbine dynamics and fast generator dynamics. The turbine subsystem is represented by a six-coefficient model, whose parameters are identified offline using particle swarm optimization, while the generator subsystem is updated online through an extended Kalman filter for real-time state and parameter estimation. These models are integrated within a closed-loop simulation that includes a proportional–integral–derivative–double-derivative governor and excitation system, allowing the DT to track plant behavior under realistic operating conditions. Unlike prior studies that treat turbine and generator modeling separately or rely mainly on simulated inputs, the proposed framework is validated using real operational data from a hydropower plant. Results show that the DT reproduces terminal voltage, active power, and reactive power with a normalized root mean square error of approximately 5%. This hybrid offline–online formulation constitutes the main contribution of the work, providing an adaptive and practically deployable DT for hydropower systems with direct relevance to control improvement, performance monitoring, and grid-support applications under high renewable penetration.

13 HYDRO ENERGY↗
DOE OSTI2025

LLGOMAX: Enhancing Industry-Standard Tools for AC Optimal Unit Commitment (CRADA Final Report)

This was a collaborative effort between Lawrence Livermore National Security, LLC ("LLNS"), as manager and operator of Lawrence Livermore National Laboratory ("LLNL") and ECCO International Inc. ("Participant"). The team designed and implemented a new approach for the Security-Constrained Alternating-Current Unit Commitment (SCACUC) problem. The SCACUC problem is a mathematical optimization problem that decides which generating units should be online and how much power should be produced (and consumed) at each point of the power grid. The decisions are made so as to minimize the total cost of supplying electricity while respecting technical constraints of the power grid, both under normal and emergency conditions. The team developed a solution for SCACUC as specified in the ARPA-E Grid Optimization Competition (GOC) Challenge 3, which put forth a forward-looking version of the problem, which many features not present in today’s electricity market specifications for SCACUC.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Guidance for Developing Digital Twins for Online Condition Monitoring of Nuclear Power Plant Components

Online condition monitoring is an area of active research that may enable optimized scheduling, maintenance, and safety of nuclear power plant components, reducing unnecessary derates while simultaneously improving operational capacity. Digital twins (DTs) are one avenue to conduct online condition monitoring and are currently being explored by national laboratories and universities alike. DTs for online condition monitoring are, in essence, state concurrent models that emulate a physical process which predicts a parameter and compares it against a measured value. The promise of DT is that they may provide additional insights by combining and interpreting various sources of information and may be used for preventative maintenance scheduling optimization or early fault detection. DTs for condition monitoring are projected to be valuable for meeting requirements under 10 CFR 50.55a and 10 CFR 50.65. However, DT technologies are still under significant development and the process for developing a DT for condition monitoring has not been formalized. Therefore, in this work, we present an initial framework for developing a DT, discuss and review the various challenges and considerations for DT deployment, and identify the opportunities that a DT can improve. Here, the presented framework is intended to help developers formulate a strategy when approaching DT development for condition monitoring. A DT use case for a reactor coolant pump is presented to demonstrate the proposed framework.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗