Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2015

Dosimetric benefit of adaptive re-planning in pancreatic cancer stereotactic body radiotherapy

Stereotactic body radiotherapy (SBRT) shows promise in unresectable pancreatic cancer, though this treatment modality has high rates of normal tissue toxicity. This study explores the dosimetric utility of daily adaptive re-planning with pancreas SBRT. We used a previously developed supercomputing online re-planning environment (SCORE) to re-plan 10 patients with pancreas SBRT. Tumor and normal tissue contours were deformed from treatment planning computed tomographies (CTs) and transferred to daily cone-beam CT (CBCT) scans before re-optimizing each daily treatment plan. We compared the intended radiation dose, the actual radiation dose, and the optimized radiation dose for the pancreas tumor planning target volume (PTV) and the duodenum. Treatment re-optimization improved coverage of the PTV and reduced dose to the duodenum. Within the PTV, the actual hot spot (volume receiving 110% of the prescription dose) decreased from 4.5% to 0.5% after daily adaptive re-planning. Within the duodenum, the volume receiving the prescription dose decreased from 0.9% to 0.3% after re-planning. It is noteworthy that variation in the amount of air within a patient's stomach substantially changed dose to the PTV. Adaptive re-planning with pancreas SBRT has the ability to improve dose to the tumor and decrease dose to the nearby duodenum, thereby reducing the risk of toxicity.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2016

Validating the simulation of large-scale parallel applications using statistical characteristics

Simulation is a widely adopted method to analyze and predict the performance of large-scale parallel applications. Validating the hardware model is highly important for complex simulations with a large number of parameters. Common practice involves calculating the percent error between the projected and the real execution time of a benchmark program. However, in a high-dimensional parameter space, this coarse-grained approach often suffers from parameter insensitivity, which may not be known a priori. Moreover, the traditional approach cannot be applied to the validation of software models, such as application skeletons used in online simulations. In this work, we present a methodology and a toolset for validating both hardware and software models by quantitatively comparing fine-grained statistical characteristics obtained from execution traces. Although statistical information has been used in tasks like performance optimization, this is the first attempt to apply it to simulation validation. Lastly, our experimental results show that the proposed evaluation approach offers significant improvement in fidelity when compared to evaluation using total execution time, and the proposed metrics serve as reliable criteria that progress toward automating the simulation tuning process.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Restoring Distribution System Under Renewable Uncertainty Using Reinforcement Learning

Distributed energy resources (DERs) in distribution systems, including renewable generation, micro-turbine, and energy storage, can be used to restore critical loads following extreme events to increase grid resiliency. However, properly coordinating multiple DERs in the system for multi-step restoration process under renewable uncertainty and fuel availability is a complicated sequential optimal control problem. Due to its capability to handle system non-linearity and uncertainty, reinforcement learning (RL) stands out as a potentially powerful candidate in solving complex sequential control problems. Moreover, the offline training of RL provides excellent action readiness during online operation, making it suitable to problems such as load restoration, where in-time, correct and coordinated actions are needed. In this study, a distribution system prioritized load restoration based on a simplified single-bus system is studied: with imperfect renewable generation forecast, the performance of an RL controller is compared with that of a deterministic model predictive control (MPC). Our experiment results show that the RL controller is able to learn from experience, adapt to the imperfect forecast information and provide a more reliable restoration process when compared with the baseline controller.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2020

Restoring Distribution System Under Renewable Uncertainty Using Reinforcement Learning: Preprint

Distributed energy resources (DER) in distribution systems, including renewable generation, micro-turbine, and energy storage, can be used to restore critical loads following extreme events to increase grid resiliency. However, properly coordinating multiple DERs in the system for multi-step restoration process under renewable uncertainty and fuel availability is a complicated sequential optimal control problem. Due to its capability to handle system non-linearity and uncertainty, reinforcement learning (RL) stands out as a potentially powerful candidate in solving complex sequential control problems. Moreover, the offline training of RL provides excellent action readiness during online operation, making it suitable to problems such as load restoration, where in-time, correct and coordinated actions are needed. In this study, a distribution system prioritized load restoration based on a simplified single-bus system is studied: with imperfect renewable generation forecast, the performance of an RL controller is compared with that of a deterministic model predictive control (MPC). Our experiment results show that the RL controller is able to learn from experience, adapt to the imperfect forecast information and provide a more reliable restoration process when compared with the baseline MPC controller.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2021

Restoring Distribution System Under Renewable Uncertainty Using Reinforcement Learning

Distributed energy resources (DER) in distribution systems, including renewable generation, micro-turbine, and energy storage, can be used to restore critical loads following extreme events to increase grid resiliency. However, properly coordinating multiple DERs in the system for multi-step restoration process under renewable uncertainty and fuel availability is a complicated sequential optimal control problem. Due to its capability to handle system non-linearity and uncertainty, reinforcement learning (RL) stands out as a potentially powerful candidate in solving complex sequential control problems. Moreover, the offline training of RL provides excellent action readiness during online operation, making it suitable to problems such as load restoration, where in-time, correct and coordinated actions are needed. In this study, a distribution system prioritized load restoration based on a simplified single-bus system is studied: with imperfect renewable generation forecast, the performance of an RL controller is compared with that of a deterministic model predictive control (MPC). Our experiment results show that the RL controller is able to learn from experience, adapt to the imperfect forecast information and provide a more reliable restoration process when compared with the baseline MPC controller.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2023

Localized High–Concentration Electrolytes with Low–Cost Diluents Compatible with Both Cobalt–Free LiNiO 2 Cathode and Lithium–Metal Anode

High-nickel layered oxide cathodes and lithium-metal anode are promising candidates for next-generation battery systems due to their high energy density. Nevertheless, the instability of the electrode–electrolyte interphase is hindering their practical application. Localized high-concentration electrolytes (LHCEs) present a promising solution for achieving uniform lithium deposition and a stable cathode–electrolyte interphase. However, the limited choice of diluents and their high cost are restricting their implementation. Four novel cost-effective diluents and their performance with highly reactive LiNiO 2 cathode and Li-metal anode are reported here. The results show that all the LHCE cells exhibit a Coulombic efficiency of >99.38% in Li | Cu cells and a capacity retention of >85% in Li | LiNiO 2 cells after 250 cycles. Advanced characterizations unveil that the stable cell operation is due to well-tuned electrode–electrolyte interphases and Li deposition morphology. In addition, online electrochemical mass spectroscopy and differential scanning calorimetry reveal that the gas generation and heat-release are greatly reduced with the LHCEs presented. Altogether, the study provides new insights into the role of diluents in LHCEs and offers valuable guidance for further optimization of LHCEs for high energy density lithium-metal batteries.

25 ENERGY STORAGE↗
DOE OSTI2023

Engineering Active Surface Oxygen Sites of Cubic Perovskite Cobalt Oxides toward Catalytic Oxidation Reactions

Unraveling the role of surface oxygen sites in transition metal oxides during catalytic reactions has always been the focus of environmental and energy chemistry research. For this work, active surface oxygen sites of cubic perovskite cobalt oxide were engineered to comprehend their crucial role and catalytic mechanism at the molecular level. By removing those inert Sr/La–O termination layers, active oxygen sites were exposed on the Co terminated surface of Sr 0.6 La 0.4 CoO 3–δ that furnished the dominant catalytic process of CO oxidation via the Mars–van Krevelen (MvK) mechanism. The fabrication of five-coordinate cobalt ions and the enhanced covalency of Co–O bonds not only optimize the surface electronic structure of Co 3d–O 2p, but also supply active surface oxygen sites, which effectively oxidizes CO to CO 2 with a significantly improved oxidation performance and stability as evidenced by soft/hard XAS, XPS, and O 2 -TPD. Furthermore, online isotopic 18 O 2 mass spectrometry, in situ DRIFTS, and theoretical simulation demonstrate that the activity of surface oxygen sites enhances the kinetics of the MvK reaction, while unsaturated coordination sites from five-coordinate cobalt ions primarily contribute to the activated oxygen molecules and the stable catalytic cycle. The results reported here provide a deep insight into the comprehension of the relationships among active oxygen sites, surface electronic structure, and the reaction mechanism of transition metal oxides necessary for catalytic oxidation reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Unsupervised learning-enabled pulsed infrared thermographic microscopy of subsurface defects in stainless steel

Metallic structures produced with laser powder bed fusion (LPBF) additive manufacturing method (AM) frequently contain microscopic porosity defects, with typical approximate size distribution from one to 100 microns. Presence of such defects could lead to premature failure of the structure. In principle, structural integrity assessment of LPBF metals can be accomplished with nondestructive evaluation (NDE). Pulsed infrared thermography (PIT) is a non-contact, one-sided NDE method that allows for imaging of internal defects in arbitrary size and shape metallic structures using heat transfer. PIT imaging is performed using compact instrumentation consisting of a flash lamp for deposition of a heat pulse, and a fast frame infrared (IR) camera for measuring surface temperature transients. However, limitations of imaging resolution with PIT include blurring due to heat diffusion, sensitivity limit of the IR camera. We demonstrate enhancement of PIT imaging capability with unsupervised learning (UL), which enables PIT microscopy of subsurface defects in high strength corrosion resistant stainless steel 316 alloy. PIT images were processed with UL spatial–temporal separation-based clustering segmentation (STSCS) algorithm, refined by morphology image processing methods to enhance visibility of defects. The STSCS algorithm starts with wavelet decomposition to spatially de-noise thermograms, followed by UL principal component analysis (PCA), fine-tuning optimization, and neural learning-based independent component analysis (ICA) algorithms to temporally compress de-noised thermograms. The compressed thermograms were further processed with UL-based graph thresholding K-means clustering algorithm for defects segmentation. The STSCS algorithm also includes online learning feature for efficient re-training of the model with new data. For this study, metallic specimens with calibrated microscopic flat bottom hole defects, with diameters in the range from 203 to 76 µm, were produced using electro discharge machining (EDM) drilling. While the raw thermograms do not show any material defects, using STSCS algorithm to process PIT images reveals defects as small as 101 µm in diameter. To the best of our knowledge, this is the smallest reported size of a sub-surface defect in a metal imaged with PIT, which demonstrates the PIT capability of detecting defects in the size range relevant to quality control requirements of LPBF-printed high-strength metals.

36 MATERIALS SCIENCE↗
DOE OSTI2018

Distributed caching for processing raw arrays

As applications continue to generate multi-dimensional data at exponentially increasing rates, fast analytics to extract meaningful results is becoming extremely important. The database community has developed array databases that alleviate this problem through a series of techniques. In-situ mechanisms provide direct access to raw data in the original format---without loading and partitioning. Parallel processing scales to the largest datasets. In-memory caching reduces latency when the same data are accessed across a workload of queries. However, we are not aware of any work on distributed caching of multi-dimensional raw arrays. In this paper, we introduce a distributed framework for cost-based caching of multi-dimensional arrays in native format. Given a set of files that contain portions of an array and an online query workload, the framework computes an effective caching plan in two stages. First, the plan identifies the cells to be cached locally from each of the input files by continuously refining an evolving R-tree index. In the second stage, an optimal assignment of cells to nodes that collocates dependent cells in order to minimize the overall data transfer is determined. We design cache eviction and placement heuristic algorithms that consider the historical query workload. A thorough experimental evaluation over two real datasets in three file formats confirms the superiority -- by as much as two orders of magnitude -- of the proposed framework over existing techniques in terms of cache overhead and workload execution time.

Zhao, Weijie↗
NASA NTRS1991

The effect of model uncertainty on some optimal routing problems

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Mohanty, Bibhu↗
NASA NTRS2010

Goal Selection for Embedded Systems with Oversubscribed Resources

We describe an efficient, online goal selection algorithm and its use for selecting goals at runtime. Our focus is on the re-planning that must be performed in a timely manner on the embedded system where computational resources are limited. In particular, our algorithm generates near optimal solutions to problems with fully specified goal requests that oversubscribe available resources but have no temporal flexibility. By using a fast, incremental algorithm, goal selection can be postponed in a "just-in-time" fashion allowing requests to be changed or added at the last minute. This enables shorter response cycles and greater autonomy for the system under control.

Rabideau, Gregg↗
NASA NTRS2009

Tractable Goal Selection with Oversubscribed Resources

We describe an efficient, online goal selection algorithm and its use for selecting goals at runtime. Our focus is on the re-planning that must be performed in a timely manner on the embedded system where computational resources are limited. In particular, our algorithm generates near optimal solutions to problems with fully specified goal requests that oversubscribe available resources but have no temporal flexibility. By using a fast, incremental algorithm, goal selection can be postponed in a "just-in-time" fashion allowing requests to be changed or added at the last minute. This enables shorter response cycles and greater autonomy for the system under control.

Rabideau, Gregg↗
NASA NTRSDate not supplied

Implementation of a Six Degree of Freedom Precision Lunar Landing Algorithm Using Dual Quaternion Representation

In this study, a powered descent guidance algorithm using a unit dual quaternion represen- tation of the vehicle dynamics is implemented in a high-fidelity simulation and on representative flight hardware. This Dual-Quaternion Guidance (DQG) algorithm is applied to the precision lunar landing problem which levies complex constraints upon the trajectory, including state triggered attitude constraints to enable terrain-relative navigation and hazard detection as well as real-time requirements for landing site re-designation. The investigation explores DQG’s usefulness as a mission design tool as well as a real-time guidance algorithm and defines real-time performance requirements for the hazard detection and avoidance (HDA) re-targeting phase of precision lunar landing. The experiment is presented in two parts. First, DQG is implemented within a high-fidelity Monte Carlo simulation to tune the algorithm’s parameters for the simulated vehicle, to refine the mission design, and to develop guidance update timing requirements to perform the HDA maneuver. DQG generates trajectories online for the divert which are tracked by the vehicle’s inner-loop controllers to the targeted landing site. Second, DQG is run on representative hardware to demonstrate real-time operation through a divert maneuver. These results allow for rapid, flexible, optimal mission design satisfying complex constraints, and for the definition of real-time performance requirements for the HDA operations inherent in precision lunar landing. The HDA divert maneuver is found to require guidance trajectory updates in less than three seconds. DQG is found to be too slow to meet this update timing on the descent and landing computer (DLC) in its current implementation. DQG running on alternative hardware can meet the update rate requirement. Algorithm implementation improvements are also recommended which are expected to speed up computation sufficiently to meet requirements on the DLC.

GN&C↗
DOE OSTI2022

Online Learning and Pricing for Network Revenue Management with Reusable Resources

We consider a price-based network revenue management problem with multiple products and multiple reusable resources. Each randomly arriving customer requests a product (service) that needs to occupy a sequence of reusable resources (servers). We adopt an incomplete information setting where the firm does not know the price-demand function for each product and the goal is to dynamically set prices of all products to maximize the total expected revenue of serving customers. We propose novel batched bandit learning algorithms for finding near-optimal pricing policies, and show that they admit a near-optimal cumulative regret bound of $O(J\sqrt{XT})$, where J, X, and T, are the numbers of products, candidate prices, and service periods, respectively. As part of our regret analysis, we develop the first finite-time mixing time analysis of an open network queueing system (i.e., the celebrated Jackson Network), which could be of independent interest. Our numerical studies show that the proposed approaches perform consistently well.

42 ENGINEERING↗
DOE OSTI2020

Heterogeneous data-processing optimization with CLARA’s adaptive workflow orchestrator

The hardware landscape used in HEP and NP is changing from homogeneous multi-core systems towards heterogeneous systems with many different computing units, each with their own characteristics. To achieve maximum performance with data processing, the main challenge is to place the right computing on the right hardware. In this paper, we discuss CLAS12 charge particle tracking workflow orchestration that allows us to utilize both CPU and GPU to improve the performance. The tracking application algorithm was decomposed into micro-services that are deployed on CPU and GPU processing units, where the best features of both are intelligently combined to achieve maximum performance. In this heterogeneous environment, CLARA aims to match the requirements of each micro-service to the strength of a CPU or a GPU architecture. A predefined execution of a micro-service on a CPU or a GPU may not be the most optimal solution due to the streaming data-quantum size and the data-quantum transfer latency between CPU and GPU. So, the CLARA workflow orchestrator is designed to dynamically assign micro-service execution to a CPU or a GPU, based on the online benchmark results analyzed for a period of real-time data-processing.

Gyurjyan, Vardan↗
DOE OSTI2026

Optimization and stabilization of Fermilab Booster using hybrid Bayesian/RL framework

PIPII project will raise Fermilab Booster intensity and ramp rate. Beam losses will limit average power and are hard to simulate. Presently, Booster uses operator-guided empirical tuning. This task is challenging due to high dimensionality, multiple objectives, critical safety constraints, and drifts. We developed a synergistic suite of Bayesian optimization (BO) and reinforcement learning (RL) tools to optimize and stabilize beam losses. First, active learning was used to build a rough model. Data was collected parasitically using two novel safety constraint types – nonlinear input space restrictions (based on optics model), and uncertainty constraints (to stop bad steps/beam aborts). We then applied online multi-objective BO with scalarized objectives and fitting to improve/rebalance losses, increasing safety margins by 25%. Using BO model as a safety veto, we tried several on/off-policy RL agents for long term stabilization; SAC had best performance. We found that adding contextual (state) information further improved performance, eventually integrating key knobs like linac phase and temperature into the parameter space. Long term testing is ongoing to enable operational use.

Kuklev, Nikita [Fermilab]↗
DOE OSTI2020

Online Data-Enabled Predictive Control

We develop an online data-enabled predictive (ODeePC) control method for trajectory tracking of unknown systems, building upon the recently proposed DeePC. Our proposed ODeePC method leverages a primal-dual algorithm with real-time measurement feedback to iteratively compute the corresponding real-time optimal control policy as system conditions change. Specifically, our developed ODeePC: a) records data from the unknown system and updates the underlying primal-dual algorithm dynamically, b) can track changes in the system's operating point and adjust the control inputs, and c) is computationally efficient as it deploys a Fast Fourier Transform-based algorithm enabling the fast computation of the product of a non-square Hankel matrix with a vector. We provide theoretical guarantees regarding the asymptotic behavior of ODeePC and demonstrate its performance through a power system application.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2017

Online Measurement of the Energy Spread of Multi-Turn Beam in the Fermilab Booster at Injection

We have developed a computer program interfaced with the ACNET environment of Fermilab accelerators to measure energy spread of the proton beam from the LINAC at an injection into the Booster. It uses a digitizing oscilloscope and provides users an ability to configure the scope settings for optimal data acquisition from a resistive wall current monitor. When the program is launched, a) a one shot timeline is generated to initiate beam injection into the Booster, b) a gap of about 40 ns is produced in the injected beam using a set of fast kickers, c) collects line charge distribution data from the wall current monitor for the first 200 μs from the injection and d) performs complete data analysis to extract full beam energy spread of the beam. The program also gives the option to store the data for offline analyses. We illustrate a case with an example. We also present results on beam energy spread as a function of beam intensity from recent measurements.

43 PARTICLE ACCELERATORS↗