SEARCH · Engineering Papers

Results for “Bayesian 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Analytic Neural Network Gaussian Process Enabled Chance-Constrained Voltage Regulation for Active Distribution Systems with PVs, Batteries and EVs

This paper proposes an analytic neural network Gaussian process (NNGP)-based chance-constrained real-time voltage regulation method for active distribution systems with photovoltaics (PVs), batteries, and electric vehicles (EVs). NNGP can utilize historical measurement data to achieve real-time probabilistic node voltage estimation through Bayesian inference. Then, NNGP is fully analytically embedded into the optimal power flow model to perform voltage regulation and adapt to various topological changes. The uncertainties of voltage estimations are easily considered via the chance constraint, and it has been shown that the adoption of this chance constraint can significantly improve the reliability of voltage regulation under various scenarios. The comparison results with other methods, carried out on a real 759-node distribution system located in western Colorado, U.S., show that the proposed method can achieve accurate voltage estimation across different topologies and reliably perform voltage regulation considering PVs, batteries, and EVs.

active distribution systems↗

NASA NTRS1977

Modeling human decision making behavior in supervisory control

An optimal decision control model was developed, which is based primarily on a dynamic programming algorithm which looks at all the available task possibilities, charts an optimal trajectory, and commits itself to do the first step (i.e., follow the optimal trajectory during the next time period), and then iterates the calculation. A Bayesian estimator was included which estimates the tasks which might occur in the immediate future and provides this information to the dynamic programming routine. Preliminary trials comparing the human subject's performance to that of the optimal model show a great similarity, but indicate that the human skips certain movements which require quick change in strategy.

Tulga, M. K.↗

NASA NTRS2010

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗

DOE OSTI2020

GIS-Based Modeling of Contaminated Soil Volumes at Multiple Sites in the Formerly Utilized Sites Remedial Action Program - 20149

The remediation of hazardous, toxic, and radioactive waste (HTRW) sites produces cost-related risks associated with the estimation of contaminated soil or debris volumes. Historical risk-management techniques include cost contingencies to cover volume uncertainties that affect project budgeting and decision-making. The Buffalo District teamed with project partners to lessen volume uncertainty and reduce project risks at multiple HTRW sites managed under the Formerly Utilized Sites Remedial Action Program (FUSRAP). Historical remedial investigations under FUSRAP commonly identified the presence of radiological material in site media, the associated human health risk, and then areas of remediation. To manage remedial execution and reduce risk, pre-design or remediation-phase sampling essentially 'chased' contamination, which was not conducive to efficient predictive budgeting derived from Feasibility Study (FS) cost analyses. The Buffalo District first optimized their approach to better understand volume uncertainty by utilizing the Argonne National Laboratory's Bayesian Approaches for Adaptive Spatial Sampling (BAASS) software [1]. BAASS processed soft data (e.g., gamma walk-over data) and spatial sampling data to estimate the lateral extent of contaminated soil irrespective of depth (i.e., gross contamination extent) and define areas of contaminant uncertainty. The software performed a binary transformation of contaminant concentrations at all sampling points based upon remedial action goals or a sum of ratios approach (i.e., clean, impacted, or range of impacts in soil). The model produced two-dimensional (horizontal) contaminant probability contours and statistical uncertainty in the sampling coverage and resulting contaminant extents. This method was translated vertically by partitioning the sampling data into depth brackets that produced a stacked representation of contaminant extents and uncertainty in the subsurface (i.e., similar to construction lifts). The results commonly led to a better understanding of project uncertainty and the need for sampling strategies that produce high-confidence soil volumes, which control costs. The BAASS-based delineations were eventually replaced by Empirical Bayesian Kriging (EBK) methods available in ArcGIS Spatial or 3D Analysts [2]. The EBK method calculates contaminant probability zones derived from user-controlled semivariograms of the spatial datasets. The resulting probability zones (e.g., 50% or 80% of contaminant probability) represent the two-dimensional surface delineation of the overall horizontal remedial area, similarly to BAASS. However, unlike BAASS, the vertical sampling data within these probability zones became vertical control points to contour a subterranean surface that connects subsurface points to the land-surface delineations of contamination. The resulting representation of horizontal and vertical impacts within an enclosed envelop (volume) of soil included uncertainty distributions that are used to plan uncertainty-reduction sampling. These data-driven and math-based models of three-dimensional sampling results produced well-bounded remedial volumes for project planning and better uncertainty predictions during project budgeting. The EBK method was applied to several FUSRAP sites managed by the Buffalo District and compared to less rigorously modeled sites previously remediated by the District. The comparison of modeled to actual remediated volumes provide a basis for validating the volume-estimation method. This comparison is important to ensure modeled volumes match physical boundaries of site remediation. FUSRAP sites with denser investigative sampling and lesser volume uncertainty proved useful in remedial planning and contracting. The Buffalo District noted that historical sites with sparser sampling arrays had greater disparity between estimated volumes and final remedial volumes. The benefit achieved over the cost of detailed soil sampling appears positive for FUSRAP projects, especially where impacts vary widely and appear unbounded by investigation-phase sampling. The subsequent Empirical Bayesian Kriging of contamination coupled with vertical contouring for soil estimations reduces uncertainty in soil volumes or indicates where sampling is required to reduce uncertainty, which together optimize remedial planning and budgeting. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

DOE OSTI2021

Optimizing Carbon Cycle Parameters Drastically Improves Terrestrial Biosphere Model Underestimates of Dryland Mean Net CO 2 Flux and its Inter-Annual Variability

Drylands occupy ~40% of the land surface and are thought to dominate global carbon (C) cycle inter-annual variability (IAV). Therefore, it is imperative that global terrestrial biosphere models (TBMs), which form the land component of IPCC earth system models, are able to accurately simulate dryland vegetation and biogeochemical processes. However, compared to more mesic ecosystems, TBMs have not been widely tested or optimized using in situ dryland CO 2 fluxes. Here, for this work, we address this gap using a Bayesian data assimilation system and 89 site-years of daily net ecosystem exchange (NEE) data from 12 southwest US Ameriflux sites to optimize the C cycle parameters of the ORCHIDEE TBM. The sites span high elevation forest ecosystems, which are a mean sink of C, and low elevation shrub and grass ecosystems that are either a mean C sink or “pivot” between an annual C sink and source. We find that using the default (prior) model parameters drastically underestimates both the mean annual NEE at the forested mean C sink sites and the NEE IAV across all sites. Our analysis demonstrated that optimizing phenology parameters are particularly useful in improving the model's ability to capture both the magnitude and sign of the NEE IAV. At the forest sites, optimizing C allocation, respiration, and biomass and soil C turnover parameters reduces the underestimate in simulated mean annual NEE. Our study demonstrates that all TBMs need to be calibrated for dryland ecosystems before they are used to determine dryland contributions to global C cycle variability and long-term carbon-climate feedbacks.

59 BASIC BIOLOGICAL SCIENCES↗

NASA NTRS1974

On the design of optimal input signals in system identification

The problem of designing optimal inputs in the identification of linear systems with unknown random parameters is considered using a Bayesian approach. The information matrix, which is positive definite for the class of systems analyzed, gives a measure of performance for the system inputs. The computation of the optimal closed-loop input mappings is shown to be a nontrivial exercise in adaptive control. Deterministic optimal inputs are shown to be easily computable. Numerical examples are given. A Kalman filter is used to estimate the parameters. A necessary condition for the Kalman filter not to diverge when applying linear feedback is also given.

Lopez-Toledo, A. A.↗

DOE OSTI2023

A flexible event reconstruction based on machine learning and likelihood principles

Event reconstruction is a central step in many particle physics experiments, turning detector observables into parameter estimates; for example estimating the energy of an interaction given the sensor readout of a detector. A corresponding likelihood function is often intractable, and approximations need to be constructed. Here, in our work, we first show how the full likelihood for a many-sensor detector can be broken apart into smaller terms, and secondly how we can train neural networks to approximate all terms solely based on forward simulation. Our technique results in a fast, flexible, and close-to-optimal surrogate model proportional to the likelihood and can be used in conjunction with standard inference techniques allowing for a consistent treatment of uncertainties. We illustrate our technique for parameter inference in neutrino telescopes based on maximum likelihood and Bayesian posterior sampling. Given its great flexibility, we also showcase our method for geometry optimization enabling to learn optimal detector designs. Lastly, we apply our method to realistic simulation of a ton-scale water-based liquid scintillator detector.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2023

PipeSight: A High-Performance Computing Platform for Pipeline Integrity Management

The Phase I feasibility study completed as part of this project has led to a number of innovative technologies being developed and has laid the foundation for a successful Phase II effort to commercialize a platform for managing the integrity of pipelines for the damage mechanisms of the new, hybrid-energy based economy. To ground the development efforts and direction of the project, an extensive market research and customer discovery effort was undertaken early in Phase I. Through this effort, a number of pipeline owners and operators were interviewed, and the following key findings were discovered about the pipeline industry: • Small pipeline operators do not have the central engineering groups necessary to perform their own independent analysis of inspection data, but instead rely on summarized tally sheets provided to them by inspection service providers. • The time it takes to go from an inspection to a completed engineering assessment, even for small segments of pipeline, can take anywhere from 30-120 days. During this delay, critical threats can (and have been known to) cause failures. • Uncertainty is often not accounted for in the assessment of pipeline integrity. The tally sheets provided by third-party service providers are almost always deterministic in nature, identifying threats that present a concern only to the current (not the future) integrity of the pipeline. • It is uncommon to apply the latest technologies to perform advanced assessments of damaged pipelines. There is a desire to use more advanced analysis capabilities to assess threats. Many pipeline operators indicated that they would often excavate a pipeline to perform an inspection and find that the damage was not as bad as they anticipated, thus using limited resources unnecessarily. Companies are not consistent in their use of inspection data to determine corrosion rates, and those that do only calculate deterministic corrosion rates. • The industry has prominently relied on time-based inspections but has recently started to transition to risk-based inspections. However, there appears to be no uniform guidance on how to do so while properly accounting for all sources of uncertainty. • Companies are not storing inspection data in a manner that allows for the ready determination of temporal trends. • Predictive maintenance principles and practices are beginning to be used by early adopters • Some pipelines are being re-purposed to transport different process fluids than they were designed for, e.g., H 2 and CO 2 rich process streams to serve the new hybrid-energy based economy, which are presenting new integrity concerns for the existing pipeline network that crisscrosses the United States. As a result of these discoveries, we were able to target the development efforts in Phase I to best serve the needs of the industry. In Phase I, we developed a way to correlate multiple large-scale scans of the pipeline to determine a probabilistic corrosion rate that accounts for all sources of error and uncertainty in the inspection process. This probabilistic corrosion rate can be used to predict the future thickness distribution of the pipe wall. We demonstrate how this analysis may be performed in an analytical fashion and has been implemented in such a manner that it can be readily distributed using GPU computing through integration of the Kokkos programming model. We also make a very novel extension of the analytical corrosion rate model to Bayesian Networks (an explainable AI technique) that can account for non-parametric distributions of corrosion rates. With the predictions made above for the probabilistic corrosion rate and corresponding future distribution of the pipe wall thickness, we can assess the integrity of the pipeline through the use of a probabilistic engineering assessment. We developed a novel screening data analysis approach that can rapidly identify ‘hotspots’ (local thin areas) where the integrity of the pipeline is a concern. Once more, we implemented this screening approach in C++ to leverage GPU computing via the Kokkos programming model. After the critical hotspots are identified, we developed a program that can automatically generate an advanced finite element model of the damaged regions. Since the number of damaged regions that require advanced analysis can number in the thousands, we integrated an open-source container-native workflow engine for orchestrating parallel jobs on the cloud. Initially, these advanced numerical models were only designed to account for loading due to internal pressure. However, in a slight pivot from the initial Phase I proposal, we developed a complete pipe stress analysis program (called Simflex) which can simulate the complete pipeline and its response to thermal expansion, pressure, thermal bowing, weight, wind, earthquake, support displacement, support friction and external forces. This pipe stress analysis program was written generically, to handle any piping system, but contains the features needed to model long pipelines (i.e., it incorporates a model for soil mechanics and can account for the nonlinear boundary conditions necessary to simulate long underground pipelines). This pipe stress analysis program can simulate any segment of the pipeline (simple or complex) under any set of conditions and loads, to determine the supplemental loads (axial forces and bending moments) at the location of damage. This enables the most accurate state of stress to be accounted for in the pipeline, which can prove critical when evaluating the integrity of a damaged region. In the process of developing the technologies to perform the integrity assessment of the pipeline, we also extended one of the industry standard approaches for performing the assessment of local thin areas that extend more in the circumferential direction than the longitudinal direction of the pipeline. This approach was presented to the API 579-1/AS ME FFS-1 steering committee in November 2021 for consideration in the next edition of the industry standard for Fitness-For-Service (expected to be released in 2023). To help pipeline operators make decisions with the results on any integrity assessment, we developed a new approach to the life-cycle management of pipelines which uses a Bayesian Decision Network. The network is designed to help pipeline operators plan and prioritize inspection activities and ultimately make smarter, more cost-effective decisions. The Bayesian approach accounts for all sources of uncertainty and carries them through to the final optimal decisions, providing a probabilistic framework for optimizing inspection intervals. The proof-of-concept networks developed in the feasibility study are complete, verified, and are focused on a subset of the pipeline. To expand this novel approach to the scale necessary for an entire network of pipelines in Phase II, we will leverage the DOE-funded Bengi solver for industrial-scale decision making with Bayesian Networks [22]. Once implemented, we will be able to provide the pipeline industry with a much-needed tool for optimal inspection planning using truly explainable artificial intelligence (XAI). To handle all of these advanced capabilities into a cloud-based platform, the architecture of the Equity Engineering Cloud (EEC) was extended to include Argo Workflows, a framework capable of distributing and managing a massive number of jobs that consume their own resources, such that thousands of serial finite element simulations can be run in parallel. As part of this substantial undertaking, we also integrated Argo Continuous Delivery (CD) into the EEC, to aid with the rapid prototyping and iterations that will be imperative to the success of the PipeSight platform’s Agile development process in Phase II. As part of the pipe stress analysis program, we also developed a custom visualizer that leverages the DOE-funded VTK visualization library. We added custom contouring capabilities and a means for interacting visually with both the inputs and outputs of the pipe stress analysis program. We also developed routines for automating the post-processing of the finite element simulations to determine if any failure criteria are met and to visualize the deformations, stresses and strains in ParaView using the exodus II file format (a subset of netCDF).

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2019

Safer and optimized vulnerability scanning for operational technology through integrated and automated passive monitoring and active scanning

Vulnerability scanning of embedded sensors and controllers have a history of causing disruption and malfunction within operation technology environments. Traditional information technology vulnerability scanning generally consists of blunt exercising all or a large population of test conditions to understand how equipment responds. Often the large number and varied conditions of the tests are too much for embedded systems to handle. This paper presents a methodology and framework for integrating passive monitoring and active scanning techniques to optimize the type and amount of necessary active communication tests while achieving acceptable levels of device and vulnerability discovery. Bayesian probability and networks are leveraged for inference to drive the automation of the scanning actions to achieve confidence in discovery. Through inference, selecting the optimal active scans with the least risk and highest confidence impact is possible, thereby eliminating unnecessary scans with uncertain effects. Results of experimenting with real power systems and the following probabilities are provided.

Key Management, ICS, SCADA, Authentication↗

DOE OSTI2024

Projective Integral Updates for High-Dimensional Variational Inference

Variational inference is an approximation framework for Bayesian inference that seeks to improve quantified uncertainty in predictions by optimizing a simplified distribution over parameters to stand in for the full posterior. Capturing model variations that remain consistent with training data enables more robust predictions by reducing parameter sensitivity. This work introduces a fixed-point optimization for variational inference that is applicable when every feasible log density can be expressed as a linear combination of functions from a given basis. In such cases, the optimizer becomes a fixed-point of projective integral updates. When the basis spans univariate quadratics in each parameter, the feasible distributions are Gaussian mean-fields and the projective integral updates yield quasi-Newton variational Bayes (QNVB). Other bases and updates are also possible. Since these updates require high-dimensional integration, this work begins by proposing an efficient quasirandom sequence of quadratures for mean-field distributions. Each iterate of the sequence contains two evaluation points that combine to correctly integrate all univariate quadratic functions and, if the mean-field factors are symmetric, all univariate cubics. More importantly, averaging results over short subsequences achieves periodic exactness on a much larger space of multivariate polynomials of quadratic total degree. The corresponding variational updates require four loss evaluations with standard (not second-order) backpropagation to eliminate error terms from over half of all multivariate quadratic basis functions. Furthermore, this integration technique is motivated by first proposing stochastic blocked mean-field quadratures, which may be useful in other contexts. A PyTorch implementation of QNVB allows for better control over model uncertainty during training than competing methods. Experiments demonstrate superior generalizability for multiple learning problems and architectures.

Gaussian mean-field↗

DOE OSTI2020

Geometric Scale-up Experiments on Fluidization of Geldart B Glass Beads

The objective of this work is to provide a valuable database from controlled experiments for validating computational models. Recently, coarse-grained techniques such as particle-in-cell (PIC) or coarse-grained discrete element modeling (DEM) have gained popularity due to their computational efficiency while modeling large-scale systems; however, the influence of model parameters and their sensitivities at different geometric scales and flow conditions remain to be analyzed. These datasets are critical for the multiphase flow research community to assess predictive capability of modeling techniques as well as elucidate the hydrodynamic behavior in these systems. This study performed fluidization experiments using three different test sections with internal diameters of 2.5, 4, and 6 in. The operating conditions, bed material, and range of flow velocities at the inlet were constant in all the units, which were not hydrodynamically scaled. Glass beads having a Sauter Mean Diameter of 332 μm were used. Superficial velocity was varied from 2.97 to 5.35 times the minimum fluidization velocity and the initial static bed height was 0.1524 m. The order in which the experiments were performed was randomized and replicates were included to provide uncertainty in measurements. Statistics of differential pressure and bed height from these tests were reported. Future plans include validating PIC methodology in the open-source software, MFiX (Multiphase Flow with Interphase Exchanges) using results from this study. This could further be extended to determine optimal model parameters using inverse techniques such as deterministic calibration or Bayesian inference.

20 FOSSIL-FUELED POWER PLANTS↗

DOE OSTI2020

Geometric Scale-up Experiments on Fluidization of Geldart B Glass Beads

42 ENGINEERING↗

NASA NTRS1995

Computer-Simulation Surrogates for Optimization: Application to Trapezoidal Ducts and Axisymmetric Bodies

Engineering design and optimization efforts using computational systems rapidly become resource intensive. The goal of the surrogate-based approach is to perform a complete optimization with limited resources. In this paper we present a Bayesian-validated approach that informs the designer as to how well the surrogate performs; in particular, our surrogate framework provides precise (albeit probabilistic) bounds on the errors incurred in the surrogate-for-simulation substitution. The theory and algorithms of our computer{simulation surrogate framework are first described. The utility of the framework is then demonstrated through two illustrative examples: maximization of the flowrate of fully developed ow in trapezoidal ducts; and design of an axisymmetric body that achieves a target Stokes drag.

Otto, John C.↗

NASA NTRS1974

On the design of optimal input signals in system identification

The problem of designing optimal inputs in the identification of multi-input multi-output linear systems with unknown time-varying parameters is considered using a Bayesian approach. A sensitivity index gives a measure of performance for the closed-loop system inputs. The computation of the optimal closed-loop mappings is shown to be a nontrivial exercise in stochastic control with no analytic solution, but optimal open-loop and affine laws yield much more tractable problems. For time-invariant systems, the sensitivity index considered is shown to be equivalent to the trace of the (strictly positive definite) information matrix associated with the system. Numerical examples are given. A Kalman filter is used to estimate the parameters. A necessary condition for the Kalman filter not to diverge when applying linear feedback is also given.

Lopez-Toledo, A. A.↗

NASA NTRS1974

Sequential decision analysis for nonstationary stochastic processes

A formulation of the problem of making decisions concerning the state of nonstationary stochastic processes is given. An optimal decision rule, for the case in which the stochastic process is independent of the decisions made, is derived. It is shown that this rule is a generalization of the Bayesian likelihood ratio test; and an analog to Wald's sequential likelihood ratio test is given, in which the optimal thresholds may vary with time.

Schaefer, B.↗

DOE OSTI2020

Sequential ensemble transform for Bayesian inverse problems

In this work, we present the Sequential Ensemble Transform (SET) method, an approach for generating approximate samples from a Bayesian posterior distribution. The method explores the posterior distribution by solving a sequence of discrete optimal transport problems to produce a series of transport plans which map prior samples to posterior samples. We prove that the sequence of Dirac mixture distributions produced by the SET method converges weakly to the true posterior as the sample size approaches infinity. Furthermore, our numerical results indicate that, when compared to standard Sequential Monte Carlo (SMC) methods, the SET approach is more robust to the choice of Markov mutation kernels and requires less computational efforts to reach a similar accuracy when used to explore complex posterior distributions. Finally, we describe adaptive schemes that allow to completely automate the use of the SET method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1975

Optimal policies for identification of stochastic linear systems

The problem of designing closed-loop policies for identification of multiinput-multioutput linear discrete-time systems with random time-varying parameters is considered in this paper using a Bayesian approach. A sensitivity index gives a measure of performance for the closed-loop laws. The computation of the optimal laws is shown to be nontrivial, an exercise in stochastic control, but open-loop, affine, and open-loop feedback optimal inputs are shown to yield tractable problems. Numerical examples are given. For time-invariant systems, the criterion considered is shown to be related to the trace of the information matrix associated with the system.

Lopez-Toledo, A. A.↗

DOE OSTI2021

Bayesian learning for rapid prediction of lithium-ion battery-cycling protocols

Advancing lithium-ion battery technology requires the optimization of cycling protocols. A new data-driven methodology is demonstrated for rapid, accurate prediction of the cycle life obtained by new cycling protocols using a single test lasting only 3 cycles, enabling rapid exploration of cycling protocol design spaces with orders of magnitude reduction in testing time. We achieve this by combining lifetime early prediction with a hierarchical Bayesian model (HBM) to rapidly predict performance distributions without the need for extensive repetitive testing. The methodology is applied to a comprehensive dataset of lithium-iron-phosphate/graphite comprising 29 different fast-charging protocols. HBM alone provides high protocol-lifetime prediction performance, with 6.5% of overall test average percent error, after cycling only one battery to failure. Here, by combining HBM with a battery lifetime prediction model, we achieve a test error of 8.8% using a single 3-cycle test. In addition, the generalizability of the HBM approach is demonstrated for lithium-manganese-cobalt-oxide/graphite cells.

25 ENERGY STORAGE↗