Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Stochastic 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 1,099 records · Page 61
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

An Adaptive Optimizer for Measurement-Frugal Variational Algorithms

Variational hybrid quantum-classical algorithms (VHQCAs) have the potential to be useful in the era of near-term quantum computing. However, recently there has been concern regarding the number of measurements needed for convergence of VHQCAs. Here, we address this concern by investigating the classical optimizer in VHQCAs. We introduce a novel optimizer called individual Coupled Adaptive Number of Shots (iCANS). This adaptive optimizer frugally selects the number of measurements (i.e., number of shots) both for a given iteration and for a given partial derivative in a stochastic gradient descent. We numerically simulate the performance of iCANS for the variational quantum eigensolver and for variational quantum compiling, with and without noise. In all cases, and especially in the noisy case, iCANS tends to out-perform state-of-the-art optimizers for VHQCAs. We therefore believe this adaptive optimizer will be useful for realistic VHQCA implementations, where the number of measurements is limited.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Guiding the Design of Heterogeneous Electrode Microstructures for Li-Ion Batteries: Microscopic Imaging, Predictive Modeling, and Machine Learning

Electrochemical and mechanical properties of lithium-ion battery materials are heavily dependent on their 3D microstructure characteristics. A quantitative understanding of the role played by stochastic microstructures is critical for the prediction of material properties and for guiding synthesis processes. Furthermore, tailoring microstructure morphology is also a viable way of achieving optimal electrochemical and mechanical performances of lithium-ion cells. To facilitate the establishment of microstructure-resolved modeling and design methods, a review covering spatially and temporally resolved imaging of microstructure and electrochemical phenomena, microstructure statistical characterization and stochastic reconstruction, microstructure-resolved modeling for property prediction, and machine learning for microstructure design is presented here. The perspectives on the unresolved challenges and opportunities in applying experimental data, modeling, and machine learning to improve the understanding of materials and identify paths toward enhanced performance of lithium-ion cells are presented.

25 ENERGY STORAGE↗
DOE OSTI2021

An adaptive Hessian approximated stochastic gradient MCMC method

Bayesian approaches have been successfully integrated into training deep neural networks. One popular family is stochastic gradient Markov chain Monte Carlo methods (SG-MCMC), which have gained increasing interest due to their ability to handle large datasets and the potential to avoid overfitting. Although standard SG-MCMC methods have shown great performance in a variety of problems, they may be inefficient when the random variables in the target posterior densities have scale differences or are highly correlated. Here, we present an adaptive Hessian approximated stochastic gradient MCMC method to incorporate local geometric information while sampling from the posterior. The idea is to apply stochastic approximation (SA) to sequentially update a preconditioning matrix at each iteration. The preconditioner possesses second-order information and can guide the random walk of a sampler efficiently. Instead of computing and saving the full Hessian of the log posterior, we use limited memory of the samples and their stochastic gradients to approximate the inverse Hessian-vector multiplication in the updating formula. Moreover, by smoothly optimizing the preconditioning matrix via SA, our proposed algorithm can asymptotically converge to the target distribution with a controllable bias under mild conditions. To reduce the training and testing computational burden, we adopt a magnitude-based weight pruning method to enforce the sparsity of the network. Our method is user-friendly and demonstrates better learning results compared to standard SG-MCMC updating rules. The approximation of inverse Hessian alleviates storage and computational complexities for large dimensional models. Numerical experiments are performed on several problems, including sampling from 2D correlated distribution, synthetic regression problems, and learning the numerical solutions of heterogeneous elliptic PDE. The numerical results demonstrate great improvement in both the convergence rate and accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Sparse Control Synthesis for Uncertain Responsive Loads With Stochastic Stability Guarantees

In this report, recent studies have demonstrated the potential of flexible loads in providing frequency response services, predominantly due to their availability and cost-effectiveness. However, uncertainty and variability in various weather-related and end-use behavioral factors often impact the reliability of demand-side control performance. This work addresses this problem with the design of a demand-side control to achieve frequency response under load uncertainties. Our approach involves modeling the load uncertainties via stochastic processes that appear as both multiplicative and additive in the power system dynamics. Recently developed mean square exponential stability (MSES) results for continuous-time linear stochastic systems are applied to pose the control synthesis problem which results in an LMI-based optimization problem. Additional costs and constraints are added to the LMI-based controller synthesis to ensure MSES, improve closed-loop transient performance, maximize tolerable uncertainties, and promote sparsity in the controller. Additionally, the fundamental limitations between the tolerable uncertainties and control efforts while ensuring MSES are discussed. Further, the control synthesis problem for the case of the full-state measurement is generalized to the case of partial-state measurements. The proposed control synthesis is illustrated on an IEEE 39 bus system with rigorous studies to demonstrate the role of sparsity, closed-loop transient performance, tolerable uncertainties, and control efforts while ensuring MSES and achieving frequency response.

42 ENGINEERING↗
DOE OSTI2023

Stochastic generation of electrolyzer anode catalyst layers

Here, we introduce a stochastic methodology to reproduce the complex pore structure observed in commercial iridium catalyst layers. This method preserves the α pore (pores smaller than 250 nm) and β pore (pores greater than or equal to 250 nm) regions of the catalyst layer. The morphology of the generated materials was validated by comparing the pore size distributions of generated materials against those obtained from commercial materials imaged using x-ray nano computed tomography. We further demonstrate that the pore size distributions of the generated materials are statistically indistinguishable from the imaged catalyst layers, indicating that the stochastic methodology is capable of accurately reproducing catalyst layer morphology. Pore network modelling was conducted on the generated catalyst materials to simulate single-phase permeability, electrical conductivity, and ionic conductivity, and these properties were found to be within experimentally measured ranges for electrolyzer catalyst layers. Additionally, simulations were performed on the generated materials with varying ionomer and iridium catalyst loadings. As the ionomer loading is added, proton conductivity increases exponentially, which demonstrates the importance of optimizing ionomer loading, considering that these effects will be exacerbated in the hydration and temperature conditions of operating electrolyzers. The stochastic material generation method presented in this work is a powerful tool for the development of novel low loading catalyst layers, where the effect of various structural parameters on electrolyzer performance characteristics can be explored.

36 MATERIALS SCIENCE↗
DOE OSTI2016

TU-H-CAMPUS-JeP3-05: Adaptive Determination of Needle Sequence HDR Prostate Brachytherapy with Divergent Needle-By-Needle Delivery

Purpose: To develop a new method which adaptively determines the optimal needle insertion sequence for HDR prostate brachytherapy involving divergent needle-by-needle dose delivery by e.g. a robotic device. A needle insertion sequence is calculated at the beginning of the intervention and updated after each needle insertion with feedback on needle positioning errors. Methods: Needle positioning errors and anatomy changes may occur during HDR brachytherapy which can lead to errors in the delivered dose. A novel strategy was developed to calculate and update the needle sequence and the dose plan after each needle insertion with feedback on needle positioning errors. The dose plan optimization was performed by numerical simulations. The proposed needle sequence determination optimizes the final dose distribution based on the dose coverage impact of each needle. This impact is predicted stochastically by needle insertion simulations. HDR procedures were simulated with varying number of needle insertions (4 to 12) using 11 patient MR data-sets with PTV, prostate, urethra, bladder and rectum delineated. Needle positioning errors were modeled by random normally distributed angulation errors (standard deviation of 3 mm at the needle’s tip). The final dose parameters were compared in the situations where the needle with the largest vs. the smallest dose coverage impact was selected at each insertion. Results: Over all scenarios, the percentage of clinically acceptable final dose distribution improved when the needle selected had the largest dose coverage impact (91%) compared to the smallest (88%). The differences were larger for few (4 to 6) needle insertions (maximum difference scenario: 79% vs. 60%). The computation time of the needle sequence optimization was below 60s. Conclusion: A new adaptive needle sequence determination for HDR prostate brachytherapy was developed. Coupled to adaptive planning, the selection of the needle with the largest dose coverage impact increases chances of reaching the clinical constraints. M. Borot de Battisti is funded by Philips Medical Systems Nederland B.V.; M. Moerland is principal investigator on a contract funded by Philips Medical Systems Nederland B.V.; G. Hautvast and D. Binnekamp are fulltime employees of Philips Medical Systems Nederland B.V.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2020

Constrained Deep Reinforcement Learning for Energy Sustainable Multi-UAV Based Random Access IoT Networks With NOMA

In this paper, we apply the Non-Orthogonal Multiple Access (NOMA) technique to improve the massive channel access of a wireless IoT network where solar-powered Unmanned Aerial Vehicles (UAVs) relay data from IoT devices to remote servers. Specifically, IoT devices contend for accessing the shared wireless channel using an adaptive p-persistent slotted Aloha protocol; and the solar-powered UAVs adopt Successive Interference Cancellation (SIC) to decode multiple received data from IoT devices to improve access efficiency. To enable an energy-sustainable capacity-optimal network, we study the joint problem of dynamic multi-UAV altitude control and multi-cell wireless channel access management of IoT devices as a stochastic control problem with multiple energy constraints. We first formulate this problem as a Constrained Markov Decision Process (CMDP), and propose an online model-free Constrained Deep Reinforcement Learning (CDRL) algorithm based on Lagrangian primal-dual policy optimization to solve the CMDP. Extensive simulations demonstrate that our proposed algorithm learns a cooperative policy in which the altitude of UAVs and channel access probability of IoT devices are dynamically controlled to attain the maximal long-term network capacity while ensuring energy sustainability of UAVs, outperforming baseline schemes. The proposed CDRL agent can be trained on a small network, yet the learned policy can efficiently manage networks with a massive number of IoT devices and varying initial states, which can amortize the cost of training the CDRL agent.

42 ENGINEERING↗
DOE OSTI2025

Jensen–Shannon divergence based novel loss functions for Bayesian neural networks

Bayesian neural networks (BNNs) are state-of-the-art machine learning methods that can naturally regularize and systematically quantify uncertainties using their stochastic parameters. Kullback–Leibler (KL) divergence-based variational inference used in BNNs suffer from unstable optimization and challenges in approximating light-tailed posteriors due to the unbounded nature of the KL divergence. To resolve these issues, we formulate a novel loss function for BNNs based on a new modification to the generalized Jensen–Shannon (JS) divergence, which is bounded. In addition, we propose a Geometric JS divergence-based loss, which is computationally efficient since it can be evaluated analytically. We found that the JS divergence-based variational inference is intractable, and hence employed a constrained optimization framework to formulate these losses. Our theoretical analysis and empirical experiments on multiple regression and classification data sets suggest that the proposed losses perform better than the KL divergence-based loss, especially when the data sets are noisy or biased. Specifically, there are approximately 5% and 8% improvements in accuracy for a noise-added CIFAR-10 dataset and a regression dataset, respectively. There is about 13% reduction in false negative predictions of a biased histopathology dataset. Additionally, we quantify and compare the uncertainty metrics for the regression and classification tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Extracting Grain Orientations from EBSD Patterns of Polycrystalline Materials Using Convolutional Neural Networks

Abstract We present a deep learning approach to the indexing of electron backscatter diffraction (EBSD) patterns. We design and implement a deep convolutional neural network architecture to predict crystal orientation from the EBSD patterns. We design a differentiable approximation to the disorientation function between the predicted crystal orientation and the ground truth; the deep learning model optimizes for the mean disorientation error between the predicted crystal orientation and the ground truth using stochastic gradient descent. The deep learning model is trained using 374,852 EBSD patterns of polycrystalline nickel from simulation and evaluated using 1,000 experimental EBSD patterns of polycrystalline nickel. The deep learning model results in a mean disorientation error of 0.548° compared to 0.652° using dictionary based indexing.

Materials Science↗
DOE OSTI2015

Radionuclide gas transport through nuclear explosion-generated fracture networks

Underground nuclear weapon testing produces radionuclide gases which may seep to the surface. Barometric pumping of gas through explosion-fractured rock is investigated using a new sequentially-coupled hydrodynamic rock damage/gas transport model. Fracture networks are produced for two rock types (granite and tuff) and three depths of burial. The fracture networks are integrated into a flow and transport numerical model driven by surface pressure signals of differing amplitude and variability. There are major differences between predictions using a realistic fracture network and prior results that used a simplified geometry. Matrix porosity and maximum fracture aperture have the greatest impact on gas breakthrough time and window of opportunity for detection, with different effects between granite and tuff simulations highlighting the importance of accurately simulating the fracture network. In particular, maximum fracture aperture has an opposite effect on tuff and granite, due to different damage patterns and their effect on the barometric pumping process. From stochastic simulations using randomly generated hydrogeologic parameters, normalized detection curves are presented to show differences in optimal sampling time for granite and tuff simulations. In conclusion, seasonal and location-based effects on breakthrough, which occur due to differences in barometric forcing, are stronger where the barometric signal is highly variable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

A shared-mobility-based framework for evacuation planning and operations under forecast uncertainty

To meet evacuation needs from carless populations who need personalized assistance to evacuate safely, in this article we propose a ridesharing-based evacuation program that recruits volunteer drivers before a disaster strikes, and then matches volunteer drivers with evacuees once demand is realized. Here we optimize resource planning and evacuation operations under uncertain spatiotemporal demand, and construct a two-stage stochastic mixed-integer program to ensure high demand fulfillment rates. We consider three formulations to improve the number of evacuees served, by minimizing an expected penalty cost, imposing a probabilistic constraint, and enforcing a constraint on the conditional value at risk of the total number of unserved evacuees, respectively. We discuss the benefits and disadvantages of the different risk measures used in the three formulations, given certain carless population sizes and the variety of evacuation modes available. We also develop a heuristic approach to provide quick, dynamic and conservative solutions. We demonstrate the performance of our approaches using five different networks of varying sizes based on regions of Charleston County, South Carolina, an area that experienced a mandatory evacuation order during Hurricane Florence, and utilize real demographic data and hourly traffic count data to estimate the demand distribution.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

Algorithm For The Discrete-O timal-Output-Feedback Problem

Change in cost function due to change in feedback gain calculated. Algorithm for feedback control systems considers stochastic, infinite-time, discrete-output-feedback problem for time-invariant linear systems. Optimal-output-feedback problem formulates modern control-law-design problem in which only selected number of plant-state variables used.

Halyo, Nesim↗
NASA NTRS2020

Adaptive Stress Testing: Finding Likely Failure Events with Reinforcement Learning

Finding the most likely path to a set of failure states is important to the analysis of safety-critical systems that operate over a sequence of time steps, such as aircraft collision avoidance systems and autonomous cars. In many applications such as autonomous driving, failures cannot be completely eliminated due to the complex stochastic environment in which the system operates.As a result, safety validation is not only concerned about whether a failure can occur, but also discovering which failures are most likely to occur. This article presents adaptive stress testing (AST), a framework for finding the most likely path to a failure event in simulation. We consider a general black box setting for partially observable and continuous-valued systems operating in an environment with stochastic disturbances. We formulate the problem as a Markov decision process and use reinforcement learning to optimize it. The approach is simulation-based and does not require internal knowledge of the system, making it suitable for black-box testing of large systems. We present different formulations depending on whether the state is fully observable or partially observable. In the latter case, we present a modified Monte Carlo tree search algorithm that only requires access to the pseudorandom number generator of the simulator to overcome partial observability. We also present an extension of the framework, called differential adaptive stress testing (DAST), that can find failures that occur in one system but not in another. This type of differential analysis is useful in applications such as regression testing, where we are concerned with finding areas of relative weakness compared to a baseline. We demonstrate the effectiveness of the approach on an aircraft collision avoidance application, where a prototype aircraft collision avoidance system is stress tested to find the most likely scenarios of near mid-air collision.

Verification and Validation↗
NASA NTRS2015

Integration of Uncertain Ramp Area Aircraft Trajectories and Generation of Optimal Taxiway Schedules at Charlotte Douglas (CLT) Airport

The integration of aircraft maneuver characteristics into an optimal taxiway scheduling solution is challenging due to the uncertainties that are intrinsic to ramp area aircraft trajectories. To address the challenge, we build a stochastic model of ramp area aircraft trajectories that is used to generate a probabilistic measure of conflict within the Charlotte Douglas International Airport (CLT) ramp area. Parameters of the conflict distributions are estimated and passed to a Mixed Integer Linear Program that solves for an optimal taxiway schedule constrained to be conflict free in the presence of trajectory uncertainties. Here we extend our previous research by accounting for departing and arriving aircraft whereas our prior formulation only accounted for departing aircraft.

taxiway schedule↗
NASA NTRS1973

A constrained discrete optimal guidance strategy for low-thrust space flight

A low-thrust guidance algorithm suitable for operational use is formulated. Using linear stochastic control theory, a linear feedback control law is obtained for a minimum terminal miss performance criterion. The control variables are restricted to constant values over specified time intervals and are explicitly limited. Both fixed and variable time-of-arrival guidance are considered. Guidance equations are presented in deterministic (operational) and in statistical form; and computational procedures necessary for implementation are outlined. The performance of the guidance algorithm is evaluated by applying it to the approach phase of the 1980 rendezvous mission with the comet Encke.

Jacobson, R. A.↗
DOE OSTI2014

Aperiodic signals processing via parameter-tuning stochastic resonance in a photorefractive ring cavity

Based on solving numerically the generalized nonlinear Langevin equation describing the nonlinear dynamics of stochastic resonance by Fourth-order Runge-Kutta method, an aperiodic stochastic resonance based on an optical bistable system is numerically investigated. The numerical results show that a parameter-tuning stochastic resonance system can be realized by choosing the appropriate optical bistable parameters, which performs well in reconstructing aperiodic signals from a very high level of noise background. The influences of optical bistable parameters on the stochastic resonance effect are numerically analyzed via cross-correlation, and a maximum cross-correlation gain of 8 is obtained by optimizing optical bistable parameters. This provides a prospective method for reconstructing noise-hidden weak signals in all-optical signal processing systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Charging Decision Making for Automated Electric Vehicles

Abstract: Overview/Significance With the emerging of autonomous driving and its application in electric vehicles, the charging decision making should be taken over by the vehicles. Autonomous electric vehicles will require the capability to make charging decisions according to the battery energy state, the travel demand and also the available charging infrastructure. The introduction of autonomous driving technology would remove the challenge of co-locating charging infrastructure with driver destinations and presents a driver-free method for EVs to reach nearby charging stations. This will significantly change the charging behavior of electric vehicles. EV driver will no longer need to be present at charging stations for charging actions. Automated EVs can drive to nearby charging stations to perform charging actions by themselves when necessary. Meanwhile, connected vehicles technology makes electric vehicles have the capability to sense and obtain pertinent information from nearby charging station networks and then calculate the corresponding costs and availability for charging. All these promising capabilities bring new opportunities to construct an automatic charging decision making system and improve energy efficiency of charging actions for automatic electric vehicles. Abstract: Methodology This research introduces optimization tools and case studies on charging decision making for automated electric vehicles under personal usage scenario. The designed optimization tools aim to provide charging strategies, i.e. the optimal choice of charging station outside home and the amount of charged energy, by considering constraints from personal daily itineraries and existing charging infrastructure. Abundant real world EV data is utilized to construct stochastic energy consumption prediction model under realistic driving conditions. Advanced dynamic programming technology is utilized to model and solve the potential multi-stage decision making process by considering realistic uncertainties of EV energy cost and dynamics of itinerary information. Large-scale simulation studies using Chicago itinerary data are demonstrated to illustrate energy benefits from automatic charging decision making for future autonomous EVs. Abstract: Results/Conclusions Optimal automatic charging decision making and its energy benefits have been studied for personal automated electric vehicles. A data-driven method based on large amount of real-world data and the corresponding real-time update algorithm have been proposed to construct multi-channel stochastic energy consumption prediction model. Based on the energy cost prediction, dynamic multi-stage charging decision-making models are established for optimal strategies during a daily itinerary. Derived charging strategies can minimize the monetary and energy cost of charging actions for autonomous vehicles. Simulations and case studies show the potential ability of autonomous electric vehicles to reduce the range anxiety and charging infrastructure dependency. Automatic charging decision making can mitigate the pain from electric vehicle charging necessity outside home. In conclusion, automated electric vehicles equipped with an appropriate automatic charging decision making system will help EV driver to relieve from heavy time cost of recharging, reduce the energy cost of performing charging actions and improve the energy efficiency in future electrified transportation system.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

Learning and meta-learning of stochastic advection–diffusion–reaction systems from sparse measurements

Physics-informed neural networks (PINNs) were recently proposed in [18] as an alternative way to solve partial differential equations (PDEs). A neural network (NN) represents the solution, while a PDE-induced NN is coupled to the solution NN, and all differential operators are treated using automatic differentiation. Here, we first employ the standard PINN and a stochastic version, sPINN, to solve forward and inverse problems governed by a non-linear advection–diffusion–reaction (ADR) equation, assuming we have some sparse measurements of the concentration field at random or pre-selected locations. Subsequently, we attempt to optimise the hyper-parameters of sPINN by using the Bayesian optimisation method (meta-learning) and compare the results with the empirically selected hyper-parameters of sPINN. In particular, for the first part in solving the inverse deterministic ADR, we assume that we only have a few high-fidelity measurements, whereas the rest of the data is of lower fidelity. Hence, the PINN is trained using a composite multi-fidelity network, first introduced in [12], that learns the correlations between the multi-fidelity data and predicts the unknown values of diffusivity, transport velocity and two reaction constants as well as the concentration field. For the stochastic ADR, we employ a Karhunen–Loève (KL) expansion to represent the stochastic diffusivity, and arbitrary polynomial chaos (aPC) to represent the stochastic solution. Correspondingly, we design multiple NNs to represent the mean of the solution and learn each aPC mode separately, whereas we employ a separate NN to represent the mean of diffusivity and another NN to learn all modes of the KL expansion. For the inverse problem, in addition to stochastic diffusivity and concentration fields, we also aim to obtain the (unknown) deterministic values of transport velocity and reaction constants. The available data correspond to 7spatial points for the diffusivity and 20 space–time points for the solution, both sampled 2000 times. We obtain good accuracy for the deterministic parameters of the order of 1–2% and excellent accuracy for the mean and variance of the stochastic fields, better than three digits of accuracy. In the second part, we consider the previous stochastic inverse problem, and we use Bayesian optimisation to find five hyper-parameters of sPINN, namely the width, depth and learning rate of two NNs for learning the modes. Here, we obtain much deeper and wider optimal NNs compared to the manual tuning, leading to even better accuracy, i.e., errors less than 1% for the deterministic values, and about an order of magnitude less for the stochastic fields.

97 MATHEMATICS AND COMPUTING↗