Search NASA⌕ Search

SEARCH · Search NASA

Results for “Optimization algorithms”

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 703 records · Page 39

Analysis of core asymmetries in inertial confinement fusion implosions using three-dimensional hot-spot reconstruction

Three-dimensional effects play a crucial role during the hot-spot formation in inertial confinement fusion (ICF) implosions. A data analysis technique for 3D hot-spot reconstruction from experimental observables has been developed to characterize the effects of low modes on 3D hot-spot formations. In nuclear measurements, the effective flow direction, governed by the maximum eigenvalue in the velocity variance of apparent ion temperatures, has been found to agree with the measured hot-spot flows for implosions dominated by mode ℓ = 1. Asymmetries in areal-density (ρR) measurements were found to be characterized by a unique cosine variation along the hot-spot flow axis. In x-ray images, a 3D hot-spot x-ray emission tomography method was developed to reconstruct the 3D hot-spot plasma emissivity using a generalized spherical-harmonic Gaussian function. The gradient-descent algorithm was used to optimize the mapping between the projections from the 3D hot-spot emission model and the measured x-ray images along multiple views. Furthermore, this work establishes a platform to analyze 3D low-mode core asymmetries in ICF.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Analysis of Differential Financial Impacts of LWR Load-Following Operations. Revision 1

This document reports the application of HERON (Holistic Energy Resource Optimization Network), a newly-developed RAVEN (Risk Analysis Virtual ENvironment) plugin for grid and capacity optimization, to a case study conducted in collaboration with Arizona Public Service (APS). The study is a work in progress; this report presents a description of current models and corresponding results for a particular consideration. APS is anticipating several operational challenges. The first is rapid growth of Variable Renewable Energy (VRE) sources such as wind and solar power providing energy to the grid in the APS service region. This creates challenges for baseload operation of the Palo Verde Generating Station (PVGS), a nuclear power plant co-owned and operated by APS. The second challenge for APS is a change in the cooling water acquisition contract with the Sub Regional Operating Group (SROG). The existing contract is expiring soon, and a renewal is only available for a significantly higher price of water. These two challenges represent a difficulty in maintaining profitability for PVGS as local area demand is highly fluctuant and water prices may increase. Furthermore, excess production at PVGS is currently traded on the Palo Verde energy Hub (PVH), which occasionally offers very low or negative locational marginal prices (LMP) for electricity. This analysis considers the potential benefits of occasional curtailment of PVGS as a method to mitigate unprofitable production hours. Similar to load following, optional daily curtailment would allow APS to elect curtailment of PVGS as low as 70% of its nominal operating level between the hours of 08:00 and 16:00 provided local area demand is met and it is profitable to do so. This document reports a stochastic differential analysis of the Net Present Value (NPV) of PVGS as operated by NPS as a result of optional curtailment operation. To model this differential case, HERON has been designed from previous efforts in this study as a generic tool to accelerate the design and execution of RAVEN workflows for technoeconomic analysis of grid energy systems. HERON leverages both RAVEN and the CashFlow plugin for RAVEN to stochastically explore or optimize a response surface with energy grid system production capacities as inputs and mean NPV as a goal function. HERON performs these evaluations by stochastically sampling market, weather, and demand events using RAVEN’s ARMA reduced-order model capability to generate boundary conditions for dispatch optimization. The algorithm performs the dispatch optimization for each of the synthetic scenarios. For this case, HERON designs workflows to simulate behavior of the PVH, wind, solar, and APS local area demand, and use these synthetic scenarios to stochastically evaluate the differential benefit of optional curtailment for each scenario. While this study finds optional curtailment to be a potential source of revenue, the magnitude of the differential NPV is sufficiently small that it is unlikely a priority for increasing the profitability of PVGS. Further, the differential NPV shrinks throughout the simulated years, suggesting the long-term benefit of such operation given current assumptions is negligible.

14 SOLAR ENERGY↗

AEOLUS: Advances in Experimental Design, Optimal Control, and Learning for Uncertain Complex Systems

Sustained advances in the mathematics of modeling and simulation have resulted in the capability today for routine simulation of a number of large scale complex DOE-relevant systems. As remarkable as this capability for solving the so-called forward problem is, it is typically only the first step-an inner loop within an outer loop that explores the simulation model's parameter space and decision space to characterize uncertainty in the model's predictions, learn unknown model parameters from data, design the most informative experiments, determine optimal control strategies, and create optimal designs. Broadly, what unifies all of these outer loop problems is that they are, in one form or another, optimization problems over parameter/control/design space that are constrained by complex uncertain models. To fully realize the power of scientific simulation as a basis for scientific discovery, technological innovation, and rational decision-making, it is imperative to move beyond simulation to tackle the outer loop of optimization for learning from data, experimental design, and control with complex uncertain models. When the models under consideration are large-scale and complex, and when the optimization variable and uncertain parameter spaces are high (or infinite) dimensional, this constitutes a grand challenge of the highest order, and is intractable with conventional methods. To overcome these challenges, the AEOLUS Center was established to develop a unified mathematical, computational, and statistical framework for (1) Learning predictive models from complex data via Bayesian inference and optimization, and (2) Optimizing experiments, processes, and designs using the resulting uncertain models. These problems are intractable with conventional methods, for several reasons: (1) The simulation problems that govern the inner loops of the optimization problems are expensive to execute (due to severe nonlinearity, heterogeneity, multiphysics/multiscale coupling); (2) The optimization variable and uncertain parameter spaces are high dimensional, often stemming from discretizations of infinite dimensional fields such as initial conditions, sources, or material properties. We argue that the key to overcoming these challenges is to develop new mathematical, computational, and statistical methods that exploit the structure of the Bayesian inference and optimization problems mediated by their underlying complex uncertain models. This structure includes the regularity, sparsity, geometry, low intrinsic dimensionality, and multifidelity nature of the maps from uncertain parameter/optimization variable spaces to the specific objectives targeted: Bayesian inference, optimal experimental design, and optimal control design. Black box methods developed as generic tools are incapable of exploiting this structure. To be successful, we must create, integrate, and cross-fertilize ideas across multiple areas of applied math--including approximation theory, Bayesian inference, data science, experimental design, information theory, machine learning, model reduction, optimal control theory, parallel algorithms, PDE-constrained optimization, randomized algorithms, stochastic optimization, and uncertainty quantification--all while exploiting the structure of the problems at hand. With this goal in mind, we have marshaled a team of leading authorities in these areas. While the methods we develop will be broadly applicable across a wide spectrum of DOE problems in which experiments inform models and the systems those models describe must be optimized under uncertainty, we have chosen a specific area, advanced manufacturing and materials, to drive our work. AMM is characterized by complex models across multiple scales, and is a rich source of challenging problems in inference, experimental design, and optimal control, requiring multifaceted and integrated advances in applied mathematics. As such, AMM serves as an excellent vehicle to motivate and demonstrate the advances in applied mathematics developed by our center.

97 MATHEMATICS AND COMPUTING↗

Optimization-based, property-preserving algorithm for passive tracer transport

Here we present a new optimization-based property-preserving algorithm for passive tracer transport. The algorithm utilizes a semi-Lagrangian approach based on incremental remapping of the mass and the total tracer. However, unlike traditional semi-Lagrangian schemes, which remap the density and the tracer mixing ratio through monotone reconstruction or flux correction, we utilize an optimization-based remapping that enforces conservation and local bounds as optimization constraints. In so doing we separate accuracy considerations from preservation of physical properties to obtain a conservative, second-order accurate transport scheme that also has a notion of optimality. Moreover, we prove that the optimization-based algorithm preserves linear relationships between tracer mixing ratios. We illustrate the properties of the new algorithm using a series of standard tracer transport test problems in a plane and on a sphere.

97 MATHEMATICS AND COMPUTING↗

Control simulations of many-body quantum systems by a synergism of discrete real-time learning and optimal control theory

We present a self-consistent algorithm for optimal control simulations of many-body quantum systems. The algorithm features a two-step synergism that combines discrete real-time machine learning (DRTL) with Quantum Optimal Control Theory (QOCT) using the time-dependent Schrödinger equation. Specifically, in step (1), DRTL is employed to identify a compact working space (i.e., the important portion of the Hilbert space) for the time evolution of the many-body quantum system in the presence of a control field (i.e., the initial or previously updated field), and in step (2), QOCT utilizes the DRTL-determined working space to find a newly updated control field for a chosen objective. Steps 1 and 2 are iterated until a self-consistent control objective value is reached such that the resulting optimal control field yields the same targeted objective value when the corresponding working space is systematically enlarged. Furthermore, to demonstrate this two-step self-consistent DRTL-QOCT synergistic algorithm, we perform optimal control simulations of strongly interacting 1D as well as 2D Heisenberg spin systems. In both scenarios, only a single spin (at the left end site for 1D and the upper left corner site for 2D) is driven by the time-dependent control fields to create an excitation at the opposite site as the target. It is found that, starting from all spin-down zero excitation states, the synergistic method is able to identify working spaces and convergence of the desired controlled dynamics with just a few iterations of the overall algorithm. In the cases studied, the dimensionality of the working space scales only quasi-linearly with the number of spins.

Artificial neural networks↗

Prediction-Correction Algorithms for Time-Varying Constrained Optimization

This article develops online algorithms to track solutions of time-varying constrained optimization problems. Particularly, resembling workhorse Kalman filtering-based approaches for dynamical systems, the proposed methods involve prediction-correction steps to provably track the trajectory of the optimal solutions of time-varying convex problems. The merits of existing prediction-correction methods have been shown for unconstrained problems and for setups where computing the inverse of the Hessian of the cost function is computationally affordable. This paper addresses the limitations of existing methods by tackling constrained problems and by designing first-order prediction steps that rely on the Hessian of the cost function (and do not require the computation of its inverse). In addition, the proposed methods are shown to improve the convergence speed of existing prediction-correction methods when applied to unconstrained problems. Numerical simulations corroborate the analytical results and showcase performance and benefits of the proposed algorithms. A realistic application of the proposed method to real-time control of energy resources is presented.

97 MATHEMATICS AND COMPUTING↗

An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization

Abstract An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes ${\mathscr O}(\varepsilon ^{-3/2})$ iterations to drive the norm of the gradient of the objective function below a prescribed positive real number $\varepsilon $ and can take ${\mathscr O}(\varepsilon ^{-3})$ iterations to drive the leftmost eigenvalue of the Hessian of the objective above $-\varepsilon $. The proposed algorithm is a general framework that covers a wide range of techniques including quadratically and cubically regularized Newton methods, such as the Adaptive Regularization using Cubics (arc) method and the recently proposed Trust-Region Algorithm with Contractions and Expansions (trace). The generality of our method is achieved through the introduction of generic conditions that each trial step is required to satisfy, which in particular allows for inexact regularized Newton steps to be used. These conditions center around a new subproblem that can be approximately solved to obtain trial steps that satisfy the conditions. A new instance of the framework, distinct from arc and trace, is described that may be viewed as a hybrid between quadratically and cubically regularized Newton methods. Numerical results demonstrate that our hybrid algorithm outperforms a cubically regularized Newton method.

Mathematics↗

Decentralized Failure-Tolerant Optimization of Electric Vehicle Charging

We present a decentralized failure-tolerant algorithm for optimizing electric vehicle (EV) charging, using charging stations as computing agents. The algorithm is based on the alternating direction method of multipliers (ADMM) and it has the following features: (i) It handles capacity, peak demand, and ancillary services coupling constraints. (ii) It does not require a central agent collecting information and performing coordination (e.g. an aggregator), instead all agents exchange information and computations are carried out in a fully decentralized fashion. (iii) It can withstand the failure of any number of computing agents, as long as the remaining computing agents are in a connected communications network. We construct this algorithm by reformulating the optimal EV charging problem in a decomposable form, amenable to ADMM, and then developing efficient decentralized solution methods for the subproblems dealing with coupling constraints. We conduct numerical experiments on industry-scale synthetic EV charging datasets, with up to 1,152 charging stations, using a high performance computing cluster. The experiments demonstrate that the proposed algorithm can solve the optimal EV charging problem fast enough to permit the integration of EV charging with real-time electricity markets, even in the presence of failures.

42 ENGINEERING↗

Metaplectic geometrical optics for ray-based modeling of caustics: Theory and algorithms

The optimization of radio frequency-wave (RF) systems for fusion experiments is often performed using ray-tracing codes, which rely on the geometrical-optics (GO) approximation. However, GO fails at caustics such as cutoffs and focal points, erroneously predicting the wave intensity to be infinite. This is a critical shortcoming of GO, since the caustic wave intensity is often the quantity of interest, e.g., RF heating. Full-wave modeling can be used instead, but the computational cost limits the speed at which such optimizations can be performed. Here, we have developed a less expensive alternative called metaplectic geometrical optics (MGO). Instead of evolving waves in the usual x (coordinate) or k (spectral) representation, MGO uses a mixed X$\equiv$Ax+Bk representation. By continuously adjusting the matrix coefficients A and B along the rays, one can ensure that GO remains valid in the X coordinates without caustic singularities. The caustic-free result is then mapped back onto the original x space using metaplectic transforms. Here, we overview the MGO theory and review algorithms that will aid the development of an MGO-based ray-tracing code. We show how using orthosymplectic transformations leads to considerable simplifications compared to previously published MGO formulas. We also prove explicitly that MGO exactly reproduces standard GO when evaluated far from caustics (an important property that until now has only been inferred from numerical simulations), and we relate MGO to other semiclassical caustic-removal schemes published in the literature. Finally this discussion is then augmented by an explicit comparison of the computed spectrum for a wave bounded between two cutoffs.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

FORCE Update 2024

The Framework for Optimization of Resources and Economics (FORCE) tool suite is the U.S. Department of Energy’s Nuclear Integrated Energy Systems (IES) Program flagship tool suite for technoeconomic IES analysis of IES. This tool suite is useful for analysis designed to evaluate and improve the technoeconomics of energy production systems, particularly for systems including nuclear technology. In this report, we document the development activity for the FORCE tool suite to extend its capabilities as performed during fiscal year 2024. In addition to reliability and accessibility, capability is one of the three standards guiding the development of the FORCE tool suite and the software codes that are its constituent parts. Extending the capabilities of the FORCE tool suite allows analysis both within the IES program as well as industry, university, and laboratory partners to perform analysis with more accuracy, insight, and impactful narrative. Four areas of capability development were the focus of activity this year: economic parameter uncertainty quantification, multiresolution analysis, components-to-optimization workflow automation, and statespace construction workflows for real-time optimal control. In economic parameter uncertainty quantification, the ability of HERON to capture risk due to scenarios (weather and energy demand uncertainty) was expanded to also include uncertainties in financial parameters such as capital cost or operation and maintenance costs. By including these sources of uncertainty, which are sometimes very large compared with scenario uncertainty, HERON is better able to capture the risk posed by investment in various IES technology. Because of this, analysts can also consider the reduction in risks that can be realized by choice of some technologies. In multiresolution analysis, development activity extended on work completed previously. In fiscal year 2023, methods for decomposing time series signals, such as demand, solar and wind availability, and price profiles, were analyzed and down-selected to those most effective at splitting signals into different resolutions. These resolutions allow considering the influence of different energy demand and supply behaviors across different time scales. For example, energy demand might be divided into seasonal, weekly, and hourly profiles. In fiscal year 2024, this preliminary work was extended and implemented within the Risk Analysis Virtual Environment (RAVEN) risk and uncertainty analysis platform, which is used throughout the FORCE framework. This development of the “multi-resolution time series analysis” (MR-TSA) module in RAVEN allows training synthetic history generators on complex time series. These synthetic history generators can then be used in HERON for generating scenarios that represent possible market and weather scenarios that can be analyzed on different time scales. We envision completing this work in the future, implementing multiresolution dispatch optimization strategies that can make the most beneficial use of these stratified time histories. In components-to-optimization workflow development, workflows for translating user inputs of components into algorithms for algebraic optimization were selected and implemented. Similar algorithms within the Holistic Energy Resource Optimization Network (HERON) were separated from the main code base of HERON and gathered with the components-to-optimization workflows in the new Dispatch Optimization Variable Engine (DOVE) software library. This modularization allows FORCE users to analyze dispatch optimization and energy system duty cycles independently of HERON, which previously was a burdensome task. Additionally, these dispatch optimization algorithms, set up in an independent library, can now be used across all software applications within FORCE, especially including the real-time optimal control software Optimization of Real-time Capacity Allocation (ORCA). Allowing FORCE software to share dispatch optimization algorithms within a single library allows for improved software maintenance and reliability. In statespace characterization workflow development, alternative workflows for optimizing dispatch with additional technical accuracy was the focus, particularly to improve the real-time optimization decision making in ORCA. Using algorithms and workflows initially developed for the Feasible Actuator Range Modifier (FARM), workflows for determining the statespace representation of IES were identified and demonstrated. The resulting dispatch optimization required a more robust optimization algorithm than that originally used in HERON (and moved to DOVE), which required adding an alternate workflow to DOVE that can more accurately match the behavior of physical systems using a partial differential equation representation. In conclusion, capability developments in the FORCE tool suite in fiscal year 2024 have improved the ability of the FORCE tool suite to perform

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

On the Convergence of the Inexact Running Krasnosel'skii-Mann Method

This letter leverages a framework based on averaged operators to tackle the problem of tracking fixed points associated with maps that evolve over time. In particular, this letter considers the Krasnosel'skii-Mann (KM) method in a settings where: 1) the underlying map may change at each step of the algorithm, thus leading to a 'running' implementation of the KM method, and 2) an imperfect information of the map may be available. An imperfect knowledge of the maps can capture cases where processors feature a finite precision or quantization errors, or the case where (part of) the map is obtained from measurements. The analytical results are applicable to inexact running algorithms for solving optimization problems, whenever the algorithmic steps can be written in the form of (a composition of) averaged operators; examples are provided for inexact running gradient methods and the forward-backward splitting method. Convergence of the average fixed-point residual is investigated for the non-expansive case; linear convergence to a unique fixed-point trajectory is showen in the case of inexact running algorithms emerging from contractive operators.

97 MATHEMATICS AND COMPUTING↗

Optimizing Grain Boundary Structures with LAMMPS Using Evolutionary Algorithms

Grain boundary structure optimization is an important part of materials modeling. Current methods for grain boundary structure optimization involve inefficient, time-consuming processes that do not fully explore the interface parameter space. Evolutionary algorithms have recently been demonstrated to be effective at determining both stable and metastable grain boundary interface structures. In this work, we demonstrate the use of GBOpt, a grain boundary structure optimization software designed to use the Large-scale Atomic/Molecular Massively Parallel Simulation (LAMMPS) software to efficiently determine grain boundary structures. We demonstrate that a only a few manipulations, namely atom insertion, atom removal, and relative grain displacement, are sufficient to explore much of the grain boundary structure parameter space. The efficacy of this approach is demonstrated on an FCC Ni system, and a BCC Fe system. The computational cost is compared against the gamma-surface sampling approach to demonstrate performance improvement.

Evolutionary algorithms↗

Hybrid Particle Swarm-Interpolation Algorithm for Improved Critical Experiment Design

The typical goal of designing a critical experiment is twofold: a system that is both critical and optimized for some other value. This value could be an energy-integrated sensitivity, percent fissions in a certain energy range, or some other value that can be calculated by a transport code. By simulating different combinations of reflector, moderator, and fuel thicknesses a designer can identify such a desirable configuration. The domain of all possible combinations of these thicknesses is referred to as the experiment search space. As more dimensions are added, the search space increases in size exponentially. For a three-dimensional case, which includes three thickness values between zero and ten centimeters to the nearest tenth of a millimeter, a total of 1,000 3 , configurations exists. Rather than check each configuration individually, which would be extremely computationally expensive, it has been shown to be more efficient to use a conventional particle swarm optimization (PSO) algorithm to identify critical and optimal configurations. This work presents the theory and implementation of a novel hybrid PSO interpolation algorithm to perform these optimizations faster than a conventional PSO algorithm. To demonstrate this, an example optimization will be carried out by the conventional and hybrid PSO algorithms and their performances will be compared.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Optimization methodology for the global 10 Hz orbit feedback in RHIC

To combat beam oscillations induced by triplet vibrations at the Relativistic Heavy Ion Collider (RHIC), a global orbit feedback system was developed and applied at injection and top energy in 2011, and during beam acceleration in 2012. Singular Value Decomposition (SVD) was employed to determine the strengths and currents of the applied corrections. The feedback algorithm was optimized for different magnetic configurations (lattices) at fixed beam energies and during beam acceleration. While the orbit feedback performed well since its inception, corrector current transients and feedback-induced beam oscillations were observed during the polarized proton program in 2015. In this paper, we present the feedback algorithm, the optimization of the algorithm for various lattices and the solution adopted to mitigate the observed current transients during beam acceleration.

43 PARTICLE ACCELERATORS↗

Multiobjective Optimal Controlled Variable Selection for a Gas Turbine–Solid Oxide Fuel Cell System Using a Multiagent Optimization Platform

Hybrid gas turbine–fuel cell systems have immense potential for high efficiency in electrical power generation with cleaner emissions compared with fossil-fueled power generation. We report a systematic controlled variable (CV) selection method is deployed for a hybrid gas turbine–fuel cell system in the HyPer (hybrid performance) facility at the U.S. Department of Energy’s National Energy Technology Laboratory (NETL) for maximizing its economic and control performance. A three-stage approach is used for the CV selection comprising a priori analysis, multiobjective optimization, and a posteriori analysis. The a priori analysis helps to screen off several candidate CVs, thus reducing the size of the combinatorial optimization problem for multiobjective CV selection. For optimal CV selection, a transfer function model of the HyPer facility is identified. By considering several candidate models, the final transfer function model is selected using Akaike’s Final Prediction Error criterion. Experimental data from the HyPer facility are used to estimate the noise in the measurement data. For solving the combinatorial multiobjective optimization problem for CV selection, a multiagent optimization platform comprising simulated annealing, genetic algorithm, and efficient ant colony optimization algorithms is used. Pareto-optimal CV sets exhibit a high trade-off between the economic and control objective. The a posteriori analysis is undertaken for several top Pareto-optimal CV sets. An optimal CV set is selected that shows the best compromise between process economics and controllability under both nominal and off-design conditions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Comparison of Optimal Energy Management Strategies Using Dynamic Programming, Model Predictive Control, and Constant Velocity Prediction

Due to the recent advancements in autonomous vehicle technology, future vehicle velocity predictions are becoming more robust which allows fuel economy (FE) improvements in hybrid electric vehicles through optimal energy management strategies (EMS). A real- world highway drive cycle (DC) and a controls-oriented 2017 Toyota Prius Prime model are used to study potential FE improvements. We proposed three important metrics for comparison: (1) perfect full drive cycle prediction using dynamic programming, (2) 10-second prediction horizon model predictive control (MPC), and (3) 10-second constant velocity prediction. These different velocity predictions are put into an optimal EMS derivation algorithm to derive optimal engine torque and engine speed. The results show that the constant velocity prediction algorithm outperformed the baseline control strategy but underperformed the MPC strategy with an average 1.58% and 2.45% of FE improvement with highway and city-highway DC. Also, using a 10-second prediction window MPC strategy provided FE improvement results close to the full drive cycle prediction case. MPC has the potential to achieve 60%-65% and 70% - 80% of global FE improvement over highway and city-highway DC respectively.

Patel, Amol Arvind↗

Comparison of Optimal Energy Management Strategies Using Dynamic Programming, Model Predictive Control, and Constant Velocity Prediction

Due to the recent advancements in autonomous vehicle technology, future vehicle velocity predictions are becoming more robust which allows fuel economy (FE) improvements in hybrid electric vehicles through optimal energy management strategies (EMS). A realworld highway drive cycle (DC) and a controls-oriented 2017 Toyota Prius Prime model are used to study potential FE improvements. We proposed three important metrics for comparison: (1) perfect full drive cycle prediction using dynamic programming, (2) 10-second prediction horizon model predictive control (MPC), and (3) 10-second constant velocity prediction. These different velocity predictions are put into an optimal EMS derivation algorithm to derive optimal engine torque and engine speed. The results show that the constant velocity prediction algorithm outperformed the baseline control strategy but underperformed the MPC strategy with an average 1.58% and 2.45% of FE improvement with highway and city-highway DC. Also, using a 10-second prediction window MPC strategy provided FE improvement results close to the full drive cycle prediction case. MPC has the potential to achieve 60%-65% and 70% - 80% of global FE improvement over highway and city-highway DC respectively.

Patel, Amol Arvind↗

Refractory-based thermal energy storage for industrial process heat: one-dimensional modeling, control, and optimization

The variable and weather-dependent output of wind and solar power plants present a substantial challenge for planning and operating electricity-systems, particularly in the absence of cost-effective and dispatchable energy storage technologies. This study investigates a high-temperature, electrically heated, refractory-based thermal energy storage (RTES) system that stores electrical energy as sensible heat in dense ceramic bricks over the 950–1800 °C range. The stored heat can be discharged as a controlled hot-gas stream for industrial heating, fuel substitution in high-temperature processes, or electricity generation. The main novelty is a comprehensive modelling, control, mapping, and optimization framework that integrates one-dimensional transient gas–solid heat transfer, fan-assisted discharge, bypass-flow regulation, reheating logic, fan-power evaluation, insulation-loss assessment, and genetic-algorithm-based design optimization. The model uses feedback from outlet temperature and delivered power to regulate discharge, while a two-stage genetic algorithm optimizes brick-channel geometry, gas-flow operation, and multilayer insulation thicknesses. Storage capacities below 50 MWh and discharge powers of 5–30 MW are analyzed to evaluate hold time, thermal delivery, fan-power penalty, heat loss, state-of-charge evolution, and indicative capital cost. Results demonstrate that optimized and well-insulated refractory-based thermal energy storage units can provide stable, efficient, and repeatable heat delivery over multiple discharge cycles. The generated performance and cost maps support modular refractory thermal energy storage as a practical option for large-scale integration of wind and solar generation and for high-temperature industrial process heat.

25 ENERGY STORAGE↗