Search NASA⌕ Search

SEARCH · Search NASA

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

Energy impact evaluation for eco-routing and charging of autonomous electric vehicle fleet: Ambient temperature consideration

This paper studies the heterogeneous energy cost and charging demand impact of autonomous electric vehicle(EV) fleet under different ambient temperature. A data-driven method is introduced to formulate a two-dimensional grid stochastic energy consumption model for electric vehicles. This model aids in analyzing EV energy cost and describing uncertainties under variable traffic and ambient temperature conditions. According to this energy consumption model, an optimal eco-routing and charging decision making framework is designed for autonomous EV fleet. This optimization framework can improve the capability of autonomous EV's energy management and help to find their minimum energy cost routes with consideration of charging demand and travel time requirements. Based on these promising models and technologies, comprehensive case studies are performed on a data-driven simulated transportation network in New York City. Detailed results show us the heterogeneous energy impact and charging demand under different ambient temperature. By giving the same travel demand and charging station information, there may be more than 20% difference of overall energy cost and 60% difference of charging demand in a specific charging station between low and high ambient temperature of a month. All these studies will help to construct sustainable infrastructure for autonomous electric vehicle fleet management.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Rheological Properties of Small-Molecular Liquids at High Shear Strain Rates

Molecular-scale understanding of rheological properties of small-molecular liquids and polymers is critical to optimizing their performance in practical applications such as lubrication and hydraulic fracking. We combine nonequilibrium molecular dynamics simulations with two unsupervised machine learning methods: principal component analysis (PCA) and t-distributed stochastic neighbor embedding (t-SNE), to extract the correlation between the rheological properties and molecular structure of squalane sheared at high strain rates (10 6 –10 10 s -1 ) for which substantial shear thinning is observed under pressures P ϵ 0.1–955 MPa at 293 K. Intramolecular atom pair orientation tensors of 435 × 6 dimensions and the intermolecular atom pair orientation tensors of 61 × 6 dimensions are reduced and visualized using PCA and t-SNE to assess the changes in the orientation order during the shear thinning of squalane. Dimension reduction of intramolecular orientation tensors at low pressures P = 0.1,100 MPa reveals a strong correlation between changes in strain rate and the orientation of the side-backbone atom pairs, end-backbone atom pairs, short backbone-backbone atom pairs, and long backbone-backbone atom pairs associated with a squalane molecule. At high pressures P ≥ 400 MPa, the orientation tensors are better classified by these different pair types rather than strain rate, signaling an overall limited evolution of intramolecular orientation with changes in strain rate. Dimension reduction also finds no clear evidence of the link between shear thinning at high pressures and changes in the intermolecular orientation. The alignment of squalane molecules is found to be saturated over the entire range of rates during which squalane exhibits substantial shear thinning at high pressures.

36 MATERIALS SCIENCE↗

Thermodynamic analysis of the W-Al{sub 2}O{sub 3} system near the melting temperature of Al{sub 2}O{sub 3}. I. Evolution of the system in the pressure range of 1 x 10{sup -1}-1 x 10{sup -4} bar

The changes in the main chemical reactions occurring upon the interaction between tungsten and the evaporation products of Al{sub 2}O{sub 3} melt are considered at a fixed temperature (2400 K). The concentrations of the components coexisting in equilibrium in a closed system under isobaric-isothermal conditions are determined by stochastic simulation for low (x 10{sup -1}-1 x 10{sup -3} bar) and high (1 x 10{sup -4} bar) vacuum. It is shown that the gas-liquid-solid system is in heterogeneous equilibrium for the basic component ratio W: Al{sub 2}O{sub 3} = 1: 1 in the entire pressure range under consideration. A detailed study of the chemistry of this system should facilitate the choice of the optimal conditions for growing leucosapphire crystals from melt.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Scalable branching on dual decomposition of stochastic mixed-integer programming problems

In this work, we present a scalable branching method for the dual decomposition of stochastic mixed-integer programming. Our new branching method is based on the branching method proposed by Caroe and Schultz that creates branching disjunctions on first-stage variables only. We propose improvements to the process for creating branching disjunctions, including (1) branching on the optimal solutions of the Dantzig-Wolfe reformulation of the restricted master problem and (2) using a more comprehensive (yet simple) measure for the dispersions associated with subproblem solution infeasibility. We prove that the proposed branching process leads to an algorithm that terminates finitely, and we provide conditions under which globally optimal solutions can be identified after termination. We have implemented our new branching method, as well as the Caroe-Schultz method and a branch-and-price method, in the open-source software package DSP. Using SIPLIB test instances, we present extensive numerical results to demonstrate that the proposed branching method significantly reduces the number of node subproblems and solution times.

97 MATHEMATICS AND COMPUTING↗

Eddy Current Probe Parameters Identification Using a Genetic Algorithm and Simultaneous Perturbation Stochastic Approximation

This study tries to identify the coil parameters using numerical methods. The eddy current testing (ECT) is used for evaluation of a crack with the aid of numerical simulations by utilizing the identification of these parameters. In this study, a comparison of the performance of the GA and SPSA algorithms to identify the parameter values of the coil sensors are presented. So, the optimization probe geometry is introduced in the simulation with Three-dimensional finite element simulations (FLUX finite element code) were conducted to obtain eddy current signals resulting from a crack in a plate made of aluminium. The simulation results are compared with experimental measurements for the defect present in a plate.

42 ENGINEERING↗

On Distributed PV Hosting Capacity Estimation, Sensitivity Study, and Improvement

This paper first studies the estimated distributed PV hosting capacities of seventeen utility distribution feeders using the Monte Carlo simulation based stochastic analysis, and then analyzes the sensitivity of PV hosting capacity to both feeder and photovoltaic system characteristics. Furthermore, an active distribution network management approach is proposed to maximize PV hosting capacity by optimally switching capacitors, adjusting voltage regulator taps, managing controllable branch switches and controlling smart PV inverters. The approach is formulated as a mixed-integer nonlinear optimization problem and a genetic algorithm is developed to obtain the solution. Multiple simulation cases are studied and the effectiveness of the proposed approach on increasing PV hosting capacity is demonstrated.

14 SOLAR ENERGY↗

Final Report, DOE Early Career Award: Predictive modeling of complex physical systems: new tools for statistical inference, uncertainty quantification, and experimental design

Predictive simulation of complex physical systems increasingly rests on the interplay of experimental observations with computational models. Key inputs, parameters, or structural aspects of models may be incomplete or unknown, and must be developed from indirect and limited observations. At the same time, quantified uncertainties are needed to qualify computational predictions in the support of design and decision-making. In this context, Bayesian statistics provides a foundation for inference from noisy and limited data, but at prohibitive computional expense. This project intends to make rigorous predictive modeling *feasible* in complex physical systems, via accelerated and scalable tools for uncertainty quantification, Bayesian inference, and experimental design. Specific objectives are as follows: 1. Develop adaptive posterior approximations and dimensionality reduction approaches for Bayesian inference in high-dimensional nonlinear systems. 2. Extend accelerated Bayesian methodologies to large-scale {\em sequential} data assimilation, fully treating nonlinear models and non-Gaussian state and parameter distributions. 3. Devise efficient surrogate-based methods for Bayesian model selection and the learning of model structure. 4. Develop scalable simulation/optimization approaches to nonlinear Bayesian experimental design, for both parameter inference and model selection. 5. Demonstrate these inferential tools on chemical kinetic models in reacting flow, constructing and refining thermochemical and electrochemical models from limited data. Demonstrate Bayesian filtering on canonical stochastic PDEs and in the dynamic estimation of inhomogeneous subsurface properties and flow fields.

97 MATHEMATICS AND COMPUTING↗

A Novel Deep Reinforcement Learning Approach to Traffic Signal Control with Connected Vehicles

The advent of connected vehicle (CV) technology offers new possibilities for a revolution in future transportation systems. With the availability of real-time traffic data from CVs, it is possible to more effectively optimize traffic signals to reduce congestion, increase fuel efficiency, and enhance road safety. The success of CV-based signal control depends on an accurate and computationally efficient model that accounts for the stochastic and nonlinear nature of the traffic flow. Without the necessity of prior knowledge of the traffic system’s model architecture, reinforcement learning (RL) is a promising tool to acquire the control policy through observing the transition of the traffic states. In this paper, we propose a novel data-driven traffic signal control method that leverages the latest in deep learning and reinforcement learning techniques. By incorporating a compressed representation of the traffic states, the proposed method overcomes the limitations of the existing methods in defining the action space to include more practical and flexible signal phases. The simulation results demonstrate the convergence and robust performance of the proposed method against several existing benchmark methods in terms of average vehicle speeds, queue length, wait time, and traffic density.

42 ENGINEERING↗

A Multistage Stochastic Transmission Expansion Algorithm for Wide-Area Planning under Uncertainty

The overall objective for this project was to develop and demonstrate a set of methods for solving the transmission investment problem for a large network considering many possible scenarios of future conditions and multiple decision points when investments can be made. Project sub-objectives achieved this goal through a succession of extending the methods to apply to problems with increasing complexity or additional features, including the number of decision points, whether generation and transmission are co-optimized, and whether AC or DC power flow is used. A transmission model was developed for the Western Electric Coordinating Council (WECC) region, the high-voltage transmission system that serves the western third of the continental U.S. Using a dataset provided by WECC and by researchers from John Hopkins University, we have validated and demonstrated the model and used it to compare the new method for solving multi-stage stochastic transmission planning to several state-of-the-art techniques. The project has resulted in several key outcomes and achievements: The covariance-based method for choosing a small set of hours to represent short-term variability has superior performance in terms of accuracy to existing methods, including K-means clustering and Importance Sampling; The combined partitioning method for long-term uncertainty with the nested clustering approach for choosing representative hours for each long-term group has superior accuracy for equivalent computational effort compared with existing methods; Using the partitioning/clustering method combined with Sample Average Approximation provides both statistical bounds on the quality of the solution and at the same time, a complete investment plan for all contingencies in the full uncertainty set; no existing methods can provide both at the same time; The method is demonstrated to work well for choosing both transmission and generation investments; A variant on the method allows for both scenario selection and simultaneous correction for the error from the DC power flow approximation to provide a tractable method for AC power flow-based transmission planning under uncertainty; The method applied to the WECC case study demonstrates the additional value to the system operator and the consumer of identifying flexible investment options in the near-term decisions. In particular, the case study exhibits significant option value in postponing some transmission additions that appear useful but in some long-term system states create new congestion problems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Robust volume calculations for Constructive Solid Geometry (CSG) components in Monte Carlo transport calculations

In this paper we consider a new generalized algorithm for the efficient calculation of component object volumes given their equivalent constructive solid geometry (CSG) definition. The new method relies on domain decomposition to recursively subdivide the original component into smaller pieces with volumes that can be computed analytically or stochastically, if needed. Unlike simpler brute-force approaches, the proposed decomposition scheme is guaranteed to be robust and accurate to within a user-defined tolerance. The new algorithm is also fully general and can handle any valid CSG component definition, without the need for additional input from the user. The new technique has been specifically optimized to calculate volumes of component definitions commonly found in models used for Monte Carlo particle transport simulations for criticality safety and reactor analysis applications. However, the algorithm can be easily extended to any application which uses CSG representations for component objects. The paper provides a complete description of the novel volume calculation algorithm, along with a discussion of the conjectured error bounds on volumes calculated within the method. In addition, numerical results comparing the new algorithm with a standard stochastic volume calculation algorithm are presented for a series of problems spanning a range of representative component sizes and complexities. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Bayesian estimation of Karhunen–Loève expansions; A random subspace approach

One of the most widely-used statistical procedures for dimensionality reduction of high dimensional random fields is Principal Component Analysis (PCA), which is based on the Karhunen-Lo eve expansion (KLE) of a stochastic process with finite variance. The KLE is analogous to a Fourier series expansion for a random process, where the goal is to find an orthogonal transformation for the data such that the projection of the data onto this orthogonal subspace is optimal in the L 2 sense, i.e, which minimizes the mean square error. In practice, this orthogonal transformation is determined by performing an SVD (Singular Value Decomposition) on the sample covariance matrix or on the data matrix itself. Sampling error is typically ignored when quantifying the principal components, or, equivalently, basis functions of the KLE. Furthermore, it is exacerbated when the sample size is much smaller than the dimension of the random field. In this paper, we introduce a Bayesian KLE procedure, allowing one to obtain a probabilistic model on the principal components, which can account for inaccuracies due to limited sample size. The probabilistic model is built via Bayesian inference, from which the posterior becomes the matrix Bingham density over the space of orthonormal matrices. We use a modified Gibbs sampling procedure to sample on this space and then build a probabilistic Karhunen-Lo eve expansions over random subspaces to obtain a set of low-dimensional surrogates of the stochastic process. We illustrate this probabilistic procedure with a finite dimensional stochastic process inspired by Brownian motion.

97 MATHEMATICS AND COMPUTING↗

Sparse-grid, reduced-basis Bayesian inversion: Nonaffine-parametric nonlinear equations

We extend the reduced basis (RB) accelerated Bayesian inversion methods for affine-parametric, linear operator equations which are considered in [16,17] to non-affine, nonlinear parametric operator equations. We generalize the analysis of sparsity of parametric forward solution maps in [20] and of Bayesian inversion in [48,49] to the fully discrete setting, including Petrov–Galerkin high-fidelity (“HiFi”) discretization of the forward maps. We develop adaptive, stochastic collocation based reduction methods for the efficient computation of reduced bases on the parametric solution manifold. The nonaffinity and nonlinearity with respect to (w.r.t.) the distributed, uncertain parameters and the unknown solution is collocated; specifically, by the so-called Empirical Interpolation Method (EIM). For the corresponding Bayesian inversion problems, computational efficiency is enhanced in two ways: first, expectations w.r.t. the posterior are computed by adaptive quadratures with dimension-independent convergence rates proposed in [49]; the present work generalizes [49] to account for the impact of the PG discretization in the forward maps on the convergence rates of the Quantities of Interest (QoI for short). Second, we propose to perform the Bayesian estimation only w.r.t. a parsimonious, RB approximation of the posterior density. Based on the approximation results in [49], the infinite-dimensional parametric, deterministic forward map and operator admit N-term RB and EIM approximations which converge at rates which depend only on the sparsity of the parametric forward map. In several numerical experiments, the proposed algorithms exhibit dimension-independent convergence rates which equal, at least, the currently known rate estimates for N-term approximation. We propose to accelerate Bayesian estimation by first offline construction of reduced basis surrogates of the Bayesian posterior density. The parsimonious surrogates can then be employed for online data assimilation and for Bayesian estimation. They also open a perspective for optimal experimental design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extended Simulations of Graphene Growth with Updated Rate Coefficients

New simulations of graphene growth in flame environments are presented. The simulations employ a kinetic Monte Carlo (KMC) algorithm coupled to molecular mechanics (MM) geometry optimization to track individual graphenic species as they evolve. Focus is given to incorporation of five-member rings and resulting curvature and edge defects. The model code has been re-written to be more computationally efficient enabling a larger set of simulations to be run, decreasing stochastic fluctuations in the averaged results. The model also includes updated rate coefficients for graphene edge reactions recently published in the literature. The new simulations are compared to results from the previous model as well as to hydrogen to carbon ratios recorded in experiment and calculated with alternate models.

30 DIRECT ENERGY CONVERSION↗

Multi-Stage Modeling With Recourse Decisions for Solving Stochastic Complementarity Problems With an Application in Energy

This paper presents a multi-stage model with recourse decisions for solving complementarity problems in a competitive electricity market under uncertainty, while also considering renewable energy technologies and battery storage utilization. The model is based on a Nash-Cournot formulation of imperfect competition among power producers. We analyze the value of variable renewable energy (VRE) and battery storage under different uncertainties, such as demand level and VRE availability. To illustrate the proposed model, we apply it to three- bus five-player model and analyze different cases varying costs, including a user-optimal perspective (with market power) and a system-optimal perspective (with central planning). We also consider the potential for congestion in the system by restricting the transmission capacity between a single interface that connects two buses. Our findings show that increasing the battery storage capacity results in a decrease in the need for perfect information about future uncertainties. Additionally, as the model allows for more uncertainty, it becomes more apparent that the stochastic mixed complementarity problem (MCP) has an advantage over a deterministic equivalent. We propose the use of the Value of the Stochastic Equilibrium Solution (VSES) as a quality metric to compare the stochastic MCP with its deterministic equivalent. Overall, expanding battery storage capacity can lower the maximum, mean, and variance values of delivered prices, but there are diminishing returns to this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Data-Driven Preemptive Voltage Monitoring and Control Using Probabilistic Voltage Sensitivities

Increased penetration levels of distributed variable renewable generation can cause random voltage fluctuations and violations at multiple nodes. Traditional methods of voltage control typically involve reactionary responses of capacitor banks, tap changers, and recently even smart inverters. But because of the lack of foresight in voltage violations, these controls are ineffective to completely mitigate the issue. Therefore, new methods of predicting voltage violations subject to random power injection changes in the distribution network are needed, which can be used to guide optimal and dynamic methods of voltage control. This work lays the foundation for such preemptive voltage monitoring and control by proposing an analytical and sensor data-driven voltage sensitivity analysis method. Driven by stochastic data and forecasts, the method can be used to develop probabilistic voltage sensitivities and consequently to predict system nodes with high likelihood of voltage limit violations. The effectiveness of this method is tested on IEEE 69-node distribution system integrated with distributed solar. The results demonstrate the proposed method's ability to successfully predict nodes with high probability of voltage violations for a specific time-series simulation. The results also demonstrate the ability to guide timely power injection control actions to mitigate future voltage violations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Scalable Second Order Optimization for Machine Learning

Many machine learning (ML) training tasks are essentially optimization processes that would at first glance appear eminently parallelizable and scalable. However, effective acceleration of these tasks with scalable parallel hardware has proven to be elusive. While standard methods for machine learning, e.g., stochastic gradient descent (SGD) for DNNs, tend to be resource efficient, they appear to be fundamentally sequential in nature.

97 MATHEMATICS AND COMPUTING↗

Data-Driven Preemptive Voltage Monitoring and Control Using Probabilistic Voltage Sensitivities: Preprint

Increased penetration of distributed variable re-newable generation may cause random voltage fluctuations and violations at multiple nodes. Traditional methods of voltage control typically involve reactionary responses of capacitor banks, tap changers, and recently even smart inverters. But due to the lack of foresight in voltage violations, these controls are ineffective to completely mitigate the issue. Therefore, new methods of predicting voltage violations subject to random power injection changes in the distribution network is needed, which can be used to guide optimal and dynamic methods of voltage control. This work lays the foundation for such preemptive voltage monitoring and control by proposing an analytical and sensor data-driven voltage sensitivity analysis method. Driven by stochastic data and forecasts, the method can be used to develop probabilistic voltage sensitivities and consequently to predict system nodes with high likelihood of voltage limit violations. The effectiveness of this method is tested on IEEE 69 node distribution system integrated with distributed solar. The results demonstrate the proposed method's ability to successfully predict nodes with high probability of voltage violations for a specific time series simulation. The results also demonstrate the ability to guide timely power injection control actions to mitigate future voltage violations.

24 POWER TRANSMISSION AND DISTRIBUTION↗