Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “fast algorithm”

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 271 records · Page 15
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Grid-Interactive Multi-Zone Building Control Using Reinforcement Learning with Global-Local Policy Search: Preprint

In this paper, we develop a grid-interactive multi-zone building controller based on a deep reinforcement learning (RL) approach. The controller is designed to facilitate building operation during normal conditions and demand response events, while ensuring occupants comfort and energy efficiency. We leverage a continuous action space RL formulation, and devise a two-stage global-local RL training framework. In the first stage, a global fast policy search is performed using a gradient-free RL algorithm. In the second stage, a local fine-tuning is conducted using a policy gradient method. In contrast to the state-of-the-art model predictive control (MPC) approach, the proposed RL controller does not require complex computation during real-time operation and can adapt to non-linear building models. We illustrate the controller performance numerically using a five-zone commercial building.

30 DIRECT ENERGY CONVERSION↗
DOE OSTI2024

Third-integer Resonant Extraction Regulation System for Mu2e

A third-integer resonant slow extraction system is being developed for Fermilab's Delivery Ring to deliver protons to the upcoming Mu2e experiment. The timescale of the extraction (or spill) duration is 43 milliseconds, which is extremely short and unprecedented. Additionally, the experiment's strict and challenging requirements on the quality of the spill at this time scale has led to the development of a new Spill Regulation System (SRS) design. The SRS primarily consists of three components - slow regulation, fast regulation, and harmonic content suppressor. Contributions to the first two components of the SRS, i.e., Slow Regulation and Fast Regulation subsystems, will be presented in which new adaptive learning algorithm schemes for the slow regulation of the spill -- validated using particle tracking simulations -- shall be described. In addition to these novel methods for the enhancement of the spill regulation system, results of employing Machine Learning in enhancing the performance of the resonant extraction are also presented. At the forefront of applying ML techniques to solve non-linear accelerator control problems, this work includes optimizing the PID gains as well as the replacement of the traditional PID controller using Recurrent Neural Networks and Gated Recurrent Unit (GRU) ML models to achieve efficiencies greater than a PID controller. Cutting-edge on-going Reinforcement Learning efforts, including an actor-critic family of learning algorithms, to regulate the spill rate will be reviewed, as well as present analytical calculations pertaining the transit time of particles in a third-integer resonant extraction. Detailed numerical investigations and validations of such calculations, the model of which could be exported and reliably used in future analytical modeling of any resonant extraction, are discussed.

43 PARTICLE ACCELERATORS↗
DOE OSTI2021

Phase-space sensitivity (weight functions) of 3 MeV proton diagnostics

Abstract The weight function W ( X ) is a diagnostic sensitivity to phase-space variables X that relates the measured signal C to the distribution function F ( X ) through the equation C = ∫ W ( X ) F ( X ) d X . In the present work, an algorithm to calculate W for a diagnostic that measures 3 MeV protons produced in d(d,p)t fusion reactions between a fast ion and a thermal deuteron is developed. The emitted protons escape the tokamak on curved orbits and are detected. These curved orbits constitute effective diagnostic ‘sightlines’. The presented algorithm accounts for the complications associated with these curved sightlines. An initial calculation of time-reversed proton orbits computes effective solid angles and sightlines for the relevant range of incident proton velocity vectors. These precomputed orbits are then used within the framework of FIDASIM (2020 Plasma Phys. Cont. Fusion 62 105008) to calculate the reactivity averaged over the thermal distribution of the ‘target’ deuterons and the probability that a fast ion of specified energy and pitch has a gyroangle that is consistent with the kinematic equations along each of the sightlines. Comparisons with analytic formulas and with independent calculations for the Mega Amp Spherical Tokamak 3 MeV proton diagnostic verify the algorithm.

Physics↗
DOE OSTI2022

Implementation of an Orificing Optimization Algorithm in the DASSH Subchannel Analysis Code

The Ducted Assembly Steady-State Heat transfer code (DASSH) performs full-core subchannel thermal hydraulics calculations in liquid metal fast reactors. One of the applications of subchannel codes is to optimize coolant flow orificing. As a design activity, the primary task is to determine the best way to divide assemblies into groups and distribute coolant flow rates among them. This report documents an algorithm implemented in DASSH to automatically optimize coolant orificing. Over the course of multiple iterations, DASSH determines the orifice grouping and flow distribution that minimizes peak coolant, clad, or fuel temperatures across all timesteps for a user-specified number of assembly groups. The total coolant flow rate in the reactor is constrained to achieve the specified core-average outlet temperature. The flow rate to each orifice group may also be constrained by the allowable pressure drop. The distribution of coolant flow among groups is accelerated using a predictor-corrector algorithm based on interpolated results from single-assembly parametric calculations. The assembly orificing grouping is initially predicted based on assembly power but can be refined if results demonstrate that an assembly would fit better in another group. The algorithm is demonstrated with two case studies. The first is a simple model for a reactor core consisting of just fuel assemblies; the pin power distributions are specified to create a situation where the initial assembly grouping prediction is suboptimal. This example is used to describe the initial grouping, demonstrate convergence over multiple iterations, and highlight the impact of regrouping. Then, the algorithm is applied to minimize peak clad and fuel temperatures in an example sodium-cooled fast reactor, the Versatile Test Reactor. The multicycle optimization confirms prior calculations for the reference core design. The example highlights how optimizing for different peak temperatures affects the results and demonstrates the use of the pressure drop constraint to limit the maximum flow rate.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2021

Towards an Agent-Based Blackboard System for Reactor Design Optimization

The field of reactor design is rich with opportunities for applications of computational optimization algorithms; these applications can range from preliminary core design to reactor shuffling patterns. Many of these schemes rely on sets of previously generated solutions (sometimes referred to as “generations”) to inform future decisions. While it is important to build upon prior knowledge, this process requires a full generation of solutions to be formed before future solutions can be examined. Rather than relying on a generational scheme to perform an optimization, we propose using an agent-based approach in conjunction with a blackboard framework for performing reactor design optimizations. Utilizing an agent-based approach allows agents to perform tasks independently, while retaining the ability to build off of previous solutions. We develop an agent-based blackboard system (ABBS) for determining the Pareto front (PF) in sodium fast reactor design optimization problems and compared this with the Non-Dominated Sorting Genetic Algorithm II (NSGA-II). Our goal is to evaluate the viability of the ABBS in producing a PF that is comparable with the NSGA-II algorithm. The design space consists of the fuel height, fuel smear, and plutonium fraction in the core, and we seek to minimize the reactivity swing and plutonium mass, while maximizing the burnup. The diversity, coverage, and spread of the PFs generated by the two methods are examined, and the ABBS is able to converge to the same PF as the NSGA-II algorithm. These results show that the ABBS is able to find optimal designs that are similar to those found by the NSGA-II algorithm. We conclude our study by applying the ABBS to the design of a sodium-cooled fast reactor to dispose of weapons-grade plutonium. The ABBS finds a core design that can burn upwards of 17.5 kg of weapons-grade plutonium per year and degrade an additional 195 kg of weapons-grade plutonium per year into non-weapons-grade material.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2024

Foundations of automatic feature extraction at LHC–point clouds and graphs

Abstract Deep learning algorithms will play a key role in the upcoming runs of the Large Hadron Collider (LHC), helping bolster various fronts ranging from fast and accurate detector simulations to physics analysis probing possible deviations from the Standard Model. The game-changing feature of these new algorithms is the ability to extract relevant information from high-dimensional input spaces, often regarded as “replacing the expert” in designing physics-intuitive variables. While this may seem true at first glance, it is far from reality. Existing research shows that physics-inspired feature extractors have many advantages beyond improving the qualitative understanding of the extracted features. In this review, we systematically explore automatic feature extraction from a phenomenological viewpoint and the motivation for physics-inspired architectures. We also discuss how prior knowledge from physics results in the naturalness of the point cloud representation and discuss graph-based applications to LHC phenomenology.

Bhardwaj, Akanksha↗
DOE OSTI2020

Agent-Based Coordination Scheme for PV Integration (ABC4PV)

Renewables and especially photovoltaics (PV) have benefitted significantly from a host of incentives and policies targeted toward enhanced integration and adoption of specific energy technologies. However, with the push to move forward into a subsidy-free market framework, behind-the-meter residential PV applications have generally struggled to retain their value (unlike utility scale and commercial projects) [1]. This project focused on developing control-theoretic solutions aimed at improving the integration and interaction of behind-the-meter residential PV with other distribution system assets (controllable and non-controllable) to enhance the integrated value of residential PV. To this end, a suite of decentralized control methodologies have been developed to enable effective coordination and control of behind-the-meter residential load customers’ PV, battery storage systems (BSS), controllable loads and other similar assets within a distribution feeder. This interaction aims at procuring energy savings and, thus, energy bill savings. The main source of savings is drawn from reducing the effect of demand charge pricing and is realized at the feeder level, assuming community level interaction and management among the aforementioned assets. Optimal control of the assets is implemented with a distributed optimization methodology, leveraging consensus-based algorithms. The results gathered from the optimal control simulations demonstrates that the savings can be duly achieved and the algorithm decision times (to dynamically control asset set points, for example) are fast. As for the overall efficiency of PV+BSS systems, to procure energy savings from curtailment of the demand charge pricing effects, the optimal control is set up so as to minimize the variance of the load for all customers, throughout a feeder and throughout time in a rolling horizon scheduling with model predictive control. The control takes into account inter-temporal electrochemical storage (battery) degradation costs: specifically, we have developed a long-term lifetime model for the BSS that weighs in the effect of the degradation factor in the dispatch formulations, thus, a considerable operating cost that affects energy decision making. The levelized cost of energy (LCOE – redefined for the purpose of quantifying asset integration effectiveness through the customers’ energy cost) is shown to be below the threshold set for the combined PV+BSS topology of $ 0.14/kWh for multiple cases of PV penetration all the way up to 50%, provided that a policy of shared ownership of and savings is in place. Further, the LCOE calculated for the case before the deployment PV+BSS systems is also achievable, i.e. the deployment of PV+BSS, if planned and scheduled optimally. will have no effect on customers’ energy costs. From the control methodology viewpoint, the developed consensus-based algorithms are shown to converge for a wide range of problem cases (spanning normal operating scenarios and contingencies), guaranteeing dispatch solutions under forecasting errors, communication break-downs and cyber-security attacks. The proposed control solutions are scalable and real-time implementable, with dispatch computations and device set-point updates converging in less than 2s in most practical instances of the above events.

14 SOLAR ENERGY↗
DOE OSTI2022

Automated Crystal Orientation Mapping in py4DSTEM using Sparse Correlation Matching

Crystalline materials used in technological applications are often complex assemblies composed of multiple phases and differently oriented grains. Robust identification of the phases and orientation relationships from these samples is crucial, but the information extracted from the diffraction condition probed by an electron beam is often incomplete. We have developed an automated crystal orientation mapping (ACOM) procedure which uses a converged electron probe to collect diffraction patterns from multiple locations across a complex sample. We provide an algorithm to determine the orientation of each diffraction pattern based on a fast sparse correlation method. We demonstrate the speed and accuracy of our method by indexing diffraction patterns generated using both kinematical and dynamical simulations. We have also measured orientation maps from an experimental dataset consisting of a complex polycrystalline twisted helical AuAgPd nanowire. From these maps we identify twin planes between adjacent grains, which may be responsible for the twisted helical structure. All of our methods are made freely available as open source code, including tutorials which can be easily adapted to perform ACOM measurements on diffraction pattern datasets.

36 MATERIALS SCIENCE↗
DOE OSTI2021

Distributed State Estimation Over Time-Varying Graphs: Exploiting the Age-of-Information

Here, we study the problem of designing a distributed observer for an LTI system over a time-varying communication graph. The limited existing work on this topic imposes various restrictions either on the observation model or on the sequence of communication graphs. In contrast, we propose a single-time-scale distributed observer that works under mild assumptions. Specifically, our communication model only requires strong-connectivity to be preserved over non-overlapping, contiguous intervals that are even allowed to grow unbounded over time. We show that under suitable conditions that bound the growth of such intervals, joint observability is sufficient to track the state of any discrete-time LTI system exponentially fast, at any desired rate. We also develop a variant of our algorithm that is provably robust to worst-case adversarial attacks, provided the sequence of graphs is sufficiently connected over time. The key to our approach is the notion of a "freshness-index" that keeps track of the age-of-information being diffused across the network. Such indices enable nodes to reject stale estimates of the state, and, in turn, contribute to stability of the error dynamics.

42 ENGINEERING↗
DOE OSTI2021

Implicit-Explicit Multirate Infinitesimal GARK Methods

This work focuses on the development of a new class of high-order accurate methods for multirate time integration of systems of ordinary differential equations. Unlike other recent work in this area, the proposed methods support mixed implicit-explicit (IMEX) treatment of the slow time scale. In addition to allowing this slow time scale flexibility, the proposed methods utilize a so-called infinitesimal formulation for the fast time scale through definition of a sequence of modified “fast" initial-value problems that may be solved using any viable algorithm. We name the proposed class as implicit-explicit multirate infinitesimal generalized-structure additive Runge--Kutta (IMEX-MRI-GARK) methods. In addition to defining these methods, we prove that they may be viewed as specific instances of GARK methods and derive a set of order conditions on the IMEX-MRI-GARK coefficients to guarantee both third and fourth order accuracy for the overall multirate method. Additionally, we provide three specific IMEX-MRI-GARK methods, two of order three and one of order four. We conclude with numerical simulations on two multirate test problems, demonstrating the methods' predicted convergence rates and comparing their efficiency against both legacy IMEX multirate schemes and recent third and fourth order implicit MRI-GARK methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Predictive Data Analytics Framework Using Advanced Test Reactor Acoustic Data

Although a nuclear reactor is a hostile environment for sensing and electrical communications, the reactor core is amenable to acoustic communication. An acoustic measurement infrastructure (AMI) has been installed at the Advanced Test Reactor (ATR) nozzle trench area to record acoustic signals that has the ability to capture different operating regime of the reactor. This AMI includes ATR in-pile structural components, coolant, acoustic receivers, primary coolant pumps (PCP) as signal sources, a data acquisition system, and signal-processing algorithms, enabling real-time. This report will discusses development of recursive Fast Fourier Transform approach to process in real-time acoustic signals, application of short time Fast Fourier Transform to the ATR brush data to understand the vibration level and to develop spectrograms for different primary coolant pump combinations. The combination of primary coolant pumps for normal and power axial locator mechanism of ATR are different and generates different signatures. These acoustic signatures were used to develop machine learning approaches to automatically classify different operating regimes. This lay the foundation for predictive analytic framework that can be leverage by ATR to optimize their operation and maintenance. The path forward involves continued engagement with ATR and expanded implementation of AMI and predictive framework at ATR and other facilities within INL and at other experimental reactors.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Web-Based Tools for Data-Informed Remedy Optimization: Software Theory and User Guide

This report documents the development and application of two web-based decision-support tools for pump-and-treat (P&T) groundwater remediation systems: PTOLEMY (Pump-and-Treat Optimized Location Evaluation to Maximize Yields) and OPTIMA (Optimization for Pump-and-Treat Implementation, Management, & Assessment). These tools enhance remedy design and management by leveraging advanced computational methods – specifically deep learning and multi-objective optimization – within a user-friendly platform. By integrating data-driven models with established hydrogeological knowledge, PTOLEMY and OPTIMA enable more efficient evaluation of well placement and operational strategies, helping site managers balance multiple remediation objectives under complex conditions. Both tools are implemented as modules within the SOCRATES (Suite Of Comprehensive Rapid Analysis Tools for Environmental Sites) web platform, which provides data access, visualization, and analytics to support remedy optimization across sites in the U.S. Department of Energy Office of Environmental Management complex. PTOLEMY is a rapid screening module designed to identify promising locations for new extraction wells. It employs a multi-channel three-dimensional convolutional neural network (MC3D-CNN) trained on high-fidelity simulation data to predict the relative performance (in terms of contaminant mass recovery) of potential well sites. Through an interactive web interface, PTOLEMY visualizes the probability of high performance across a site, highlighting areas where an extraction well is likely to yield above-threshold contaminant removal over a multi-year period. PTOLEMY’s map-based displays and exportable results support transparent communication of screening analyses. By focusing attention on the most favorable candidate locations, the tool augments traditional engineering judgment and physics-based modeling, providing a data informed basis for subsequent detailed evaluations. OPTIMA is a multi objective optimization module designed to find wellfield layouts and operating schedules that meet various cleanup goals. It quickly evaluates thousands of candidate setups – combinations of well locations, timing, and rates – and returns a small set of best trade-off options for comparison. At its core, OPTIMA uses a U-Net-based surrogate model – a deep-learning emulator of a groundwater flow and transport simulator – to dramatically accelerate scenario evaluations. Coupling this fast surrogate with the NSGA-II (Non-dominated Sorting Genetic Algorithm II) evolutionary algorithm, OPTIMA explores a wide decision space of well locations and schedules to identify Pareto-optimal solutions that trade off key objectives (e.g., minimizing cleanup time, maximizing contaminant mass removal, and minimizing plume extent). The tool outputs a family of optimal configurations and visualizes their trade-offs (Pareto frontiers of cleanup metrics and maps of optimized well placements). Site managers can use these results to understand the range of viable strategies and to select candidate designs for more detailed verification. OPTIMA is currently under active development and not yet fully released; this guide provides early documentation to support planning and gather user feedback.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2026

Optimized Gear Selection to Maximize Energy Savings in Electric Traction Drives for Medium and Heavy Duty Vehicles

Multi‑gear transmission systems are commonly used in electric traction drives for medium and heavy‑duty vehicles, while most passenger‑vehicle electric drivetrains rely on a single fixed ratio to reduce cost, weight, and complexity. Using multiple gear ratios can enable downsizing of the motor and inverter while still meeting performance requirements. Additionally, appropriately chosen ratios allow the motor to operate more frequently in high‑efficiency regions, improving overall energy usage and reducing operating costs over the drive cycle. This paper presents a systematic approach for selecting optimal gear ratios for electric drive systems. A neural‑network model is first developed to represent motor losses across the full torque–speed range using data generated from finite element analysis. This model enables fast, accurate evaluation of motor efficiency under varying operating conditions. A genetic‑algorithm‑based optimization framework is then applied to identify gear ratios that maximize energy cost savings over the drive cycle, with the resulting optimal ratios stored for real‑time implementation.

Gadiyar, Nishanth [ORNL] (ORCID:0000000348267524)↗
DOE OSTI2026

The Primary Interaction Compton Couple algorithm for sorting GRETINA/GRETA interaction points

The Primary Interaction Compton Couple (PICC) algorithm is presented in this work. The algorithm is used to determine the first-interaction-point position for $γ$-ray events in GRETINA. The first-interaction-point position is crucial for in-beam $γ$-ray spectroscopy experiments with fast beams due to the effect of Doppler broadening on the in-beam energy resolution. The development of the algorithm and its performance compared to a tracking algorithm and the Main Interaction assumption is presented. The PICC algorithm is demonstrated with real data to outperform the $γ$-ray energy tracking algorithm used for comparison here and the Main Interaction assumption in first-interaction-point determinations.

GRETINA↗
DOE OSTI2025

Fast and robust strategies for large-scale mixed-integer SCOPF

This project develops scalable, computationally efficient algorithms to solve realistic large-scale power system optimization problems, including systems with more than 8,000 buses, as part of a larger series of competitions run by ARPA-E. These problems are critical because the secure and reliable operation of the power grid is becoming increasingly challenging, especially under conditions of increased uncertainty and variability. The economic feasibility of our methods is high, given that they are purely software-based solutions designed to operate power grids more efficiently. The technical effectiveness balances heuristics and approximations to provide a trade-off between speed and accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2024

Using Fiducial Markers for Pose Estimation of an OSWEC in a Wave Tank: Preprint

In this study, we consider a novel method of sensing the motion of a wave energy converter during testing in a wave flume under the influence of incoming waves. The wave energy converter considered in our research is an oscillating surge wave energy converter, which is a hinged paddle that responds to incoming waves. Motion sensing is normally done with inertial sensors, which can hinder the motion due to suspended cables that carry power and transmit signals. Our proposed method is contactless and can be implemented economically. A camera is used to record different marker patterns affixed to the moving paddle and the motion deduced by pose estimation algorithms. Fiducial markers are commonly used for robot localization and in augmented reality. There are many types of fiducial markers, including ArUco-type markers which are accurate, fast and robust. The system consists of markers attached to the paddle element and recorded using a machine vision camera. A pose estimation algorithm is then applied to the detected markers to estimate the tilt of the paddle. In this work, we examine the challenges of image acquisition and calibration for underwater targets, compare the motion obtained by this new system with a calibrated tilt sensor and identify areas where the new system may be superior.

computer vision↗
DOE OSTI2023

Fast Multigrid Reduction-in-Time for Advection via Modified Semi-Lagrangian Coarse-Grid Operators

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs) but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the application of the multigrid reduction-in-time (MGRIT) algorithm to linear advection PDEs. Here, the key to efficient time integration with this method is using a coarse-grid operator that provides a sufficiently accurate approximation to the so-called ideal coarse-grid operator. For certain classes of semi-Lagrangian discretizations, we present a novel semi-Lagrangian-based coarse-grid operator that leads to fast and scalable multilevel time integration of linear advection PDEs. The coarse-grid operator is composed of a semi-Lagrangian discretization followed by a correction term, with the correction designed so that the leading-order truncation error of the composite operator is approximately equal to that of the ideal coarse-grid operator. Parallel results show substantial speed-ups over sequential time integration for variable-wave-speed advection problems in one and two spatial dimensions, and using high-order discretizations up to order five. The proposed approach establishes the first practical method that provides small and scalable MGRIT iteration counts for advection problems.

97 MATHEMATICS AND COMPUTING↗