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 487 records · Page 27

Engineering Microgrids Amid the Evolving Electrical Distribution System

Non-wires alternatives and microgrid technologies are maturing and present great opportunities for electric utilities to increase the benefits they offer to their customers. They have the potential to decrease the cost of resolving traditional electrical system loading issues, contribute to carbon emissions reductions, and improve the electrical distribution system’s resilience to extreme weather events. The authors of this manuscript present a review of the research on microgrids and their practical applications. This is leveraged with the past work of the authors of this manuscript and other authors to develop specific objectives for microgrids, practical criteria for engineers to consider when deploying microgrids, stochastic methods to optimize microgrid designs, and black start requirements. This guidance is then used for the design of actual networked microgrids being deployed with adaptive boundaries.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Cloud Fusion of Big Data and Multi-Physics Models using Machine Learning for Discovery, Exploration, and Development of Hidden Geothermal Resources

The primary goals of this project are identifying hidden geothermal resources in the USA and designing profitable enhanced geothermal systems (EGS). Many non-obvious processes and parameters could characterize geothermal resources and could control the ultimate energy potential of geothermal fields. Diverse datasets (e.g., geology, geochemistry, geophysics, satellite, airborne geophysics) are available to help characterize geothermal resources, but this data is sparse and multi-scale. This has hindered attempts to leverage the datasets for geothermal exploration and profitable EGS design. Recent advancements in machine learning (ML) give promise to overcome these issues. Modern ML methods and tools can (1) analyze large datasets, (2) assimilate model ensembles that include a multitude of inputs and outputs, (3) process sparse datasets, (4) perform transfer learning between sites with different data quality, (5) extract hidden geothermal signatures from field and simulation data, (6) label geothermal resources and processes, (7) identify high-value data acquisition targets, and (8) guide geothermal exploration and production by selecting optimal exploration, production, and drilling strategies. In this work, we implement ML-based geothermal exploration and an enhanced geothermal systems (EGS) design tool to achieve the above goals. Our exploration tool is GeoThermalCloud (GTC) EGS design tool is GeoDT-ML. GTC (github.com/SmartTensors/GeoThermalCloud.jl) utilizes a LANL unsupervised ML platform called SmartTensors (https://tensors.lanl.gov/) to automate data analyses and interpretations by extracting hidden signatures to identify geothermal prospects. It enables the identification of critical measurements needed to identify geothermal resource signatures. GeoDT-ML (github.com/SmartTensors/GeoThermalCloud.jl/tree/master/) adds coupling to GeoDT (https://github.com/GeoDesignTool/GeoDT.git) for stochastic EGS design optimization and performance prediction. GeoDT-ML leverages recent advances in deep learning and high-performance computing. Contributors to this effort include LANL, PNNL, Google, Stanford, and Julia Computing.

15 GEOTHERMAL ENERGY↗

The formation of correlated states and the increase in barrier transparency at a low particle energy in nonstationary systems with damping and fluctuations

We consider peculiarities in the formation of a coherent correlated state (CCS) of a particle in a periodically modulated harmonic oscillator with damping for various types of stochastic perturbation. It is shown that in the absence of stochastic perturbation, an optimal relation exists between the damping parameter (damping coefficient) and the modulation depth, for which the 'extrinsic' characteristics of the oscillator (amplitudes of 'classical' oscillation and the momentum of a particle) remain unchanged, while the correlation coefficient rapidly increases from |r| = 0 to |r|{sub max} Almost-Equal-To 1; this corresponds to a completely correlated coherent state. Under nonoptimal conditions, the formation of the CCS with a simultaneous increase in is accompanied by damping or excitation of the oscillator. It is shown that for a certain relation between the damping coefficient and the modulation depth, the presence of a stochastic external force acting on the nonstationary oscillator does not prevent the formation of a CCS with |r|{sub max} {yields} 1. A fundamentally different effect is observed under a stochastic influence on the nonstationary frequency of the oscillator; this effect always limits the value of vertical bar r vertical bar at a level |r|{sub max} < 1; a CCR cannot be formed with an unlimited increase in its intensity, and |r|{sub max} {yields} 0. The influence of the CCS formation on the averaged probability Left-Pointing-Angle-Bracket D Right-Pointing-Angle-Bracket of the tunnel effect (transparency of the potential barrier) is considered for a particle in an oscillator with damping both in the absence and in the presence of a stochastic force. It is shown using a specific example that complete clearing of the potential barrier and the increase in the barrier transparency from the initial value Left-Pointing-Angle-Bracket D{sub r=0} Right-Pointing-Angle-Bracket 10{sup -80} to Left-Pointing-Angle-Bracket D Right-Pointing-Angle-Bracket Almost-Equal-To 1 can occur over a comparatively short time interval in both these cases. These effects can be used to obtain highly efficient nuclear fusion at a low energy of interacting particles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Gradient-based Optimization for Regression in the Functional Tensor-Train Format

We consider the task of low-multilinear-rank functional regression, i.e., learning a low-rank parametric representation of functions from scattered real-valued data. Our first contribution is the development and analysis of gradient-based optimization procedures, including stochastic gradient descent and quasi-Newton methods, for learning the parameters of a functional tensor-train (FT) that yields improved accuracy over standard alternating least squares methods. The functional tensor-train uses the tensor-train (TT) representation of low-rank arrays as an ansatz for a class of low-multilinear-rank functions. The FT is represented by a set of matrix-valued functions that contain a set of univariate functions, and the regression task is to learn the parameters of these univariate functions. Our second contribution demonstrates that using nonlinearly parameterized univariate functions, e.g., symmetric kernels with moving centers, within each core can outperform the standard approach of using a linear expansion of basis functions. Our final contributions are new rank adaptation and group-sparsity regularization procedures to minimize overfitting. We use several benchmark problems to demonstrate at least an order of magnitude lower accuracy with gradient-based optimization methods than ALS in the low-sample number regime. We also demonstrate an order of magnitude reduction in accuracy on a test problem resulting from nonlinear parameterizations over linear parameterizations. Finally we compare regression performance with 22 other nonparametric and parametric regression methods on 10 real-world data sets. We achieve top-five accuracy for seven of the data sets and best accuracy for two of the data sets. These rankings are the best amongst parametric models and competetive with the best non-parametric methods.

97 MATHEMATICS AND COMPUTING↗

Characterization of latent image of electron beam resist via critical-dimension resonant soft X-ray scattering

Metrology plays a crucial role in semiconductor manufacturing by providing accurate and precise measurement and characterization of critical parameters. With the development of high-resolution extreme ultraviolet lithography (EUVL) processes, critical dimensions are shrinking to sub-10 nm. Resist materials encounter the challenge of providing heightened sensitivity and a handle on exacerbating stochastic variations. A comprehensive understanding of the chemical profile of the latent image is pivotal for mitigating stochastic effects and optimizing pattern quality. However, the subtle differences in chemistry between the exposed and unexposed regions of the resists make it extremely challenging to characterize the latent images with sub-nanometer precision. Here, we develop the metrology with critical-dimension resonant soft X-ray scattering (CD-RSoXS) to probe the chemical profiles of latent images stored in resist after exposure. The combination of absorption spectroscopy and enhanced scattering contrast makes it possible to characterize the subtle structural and chemical variations in the latent image. Moreover, the results of the measurements are compared with the simulations with a finite element method–based Maxwell solver to extract a detailed profile of the latent and developed images. We demonstrate that the CD-RSoXS technique can provide valuable insights into the high spatial resolution and local chemical sensitivity simultaneously, which is crucial to understanding the resolution limits and stochastic effects in EUVL processes.

36 MATERIALS SCIENCE↗

Optimal reducibility of all W states equivalent under stochastic local operations and classical communication

We show that all multipartite pure states that are stochastic local operation and classical communication (SLOCC) equivalent to the N-qubit W state can be uniquely determined (among arbitrary states) from their bipartite marginals. We also prove that only (N-1) of the bipartite marginals are sufficient and that this is also the optimal number. Thus, contrary to the Greenberger-Horne-Zeilinger (GHZ) class, W-type states preserve their reducibility under SLOCC. We also study the optimal reducibility of some larger classes of states. The generic Dicke states |GD{sub N}{sup l}> are shown to be optimally determined by their (l+1)-partite marginals. The class of ''G'' states (superposition of W and W) are shown to be optimally determined by just two (N-2)-partite marginals.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Marine energy supported multi-energy system planning and operation optimization for sustainable coastal community

The growing need for sustainable energy solutions in coastal areas necessitates the development of integrated systems that leverage abundant marine resources. In this study, a standalone Marine Energy Supported Multi-Energy System (MRE-MES) is designed for sustainable coastal community development, utilizing renewable marine resources, including offshore wind, wave, and solar energy, to address the energy needs of electricity, heat, freshwater, and hydrogen. The proposed MRE-MES incorporates a co-optimization model that simultaneously balances capacity planning and operational efficiency to minimize costs and environmental impacts. The system is tested under different renewable energy penetration levels and demand uncertainties, using a two-stage stochastic programming to account for variability in renewable resources and consumption needs. The experimental results indicate that in the optimal system capacity configuration, the percentage of total renewable energy generation is around 80 %, with or without capacity limitation constraints on PV, water tank, and hydrogen storage. Compared to the worst-case scenario in Monte Carlo experiments, two-stage stochastic optimization results in a more robust decision that effectively mitigates the risks posed by future uncertain demand conditions. In conclusion, the findings highlight the viability of marine energy for providing a resilient, comprehensive energy solution to coastal communities.

Capacity planning↗

Formulation and solution approach for calibrating activity-based travel demand model-system via microsimulation

This study addresses the problem of calibrating utility-maximizing nested logit activity-based travel demand model-systems. After estimation, it is common practice to use aggregate measurements to calibrate the estimated model-system’s parameters prior to their application in transportation planning, policy making, and operations. However, calibration of activity-based model-systems has received much less attention. Existing calibration approaches are myopic heuristics in the sense that they do not consider the fundamental inter-dependencies among choice-models and do not have a systematic way to adjust model parameters. Also, other purely simulation-based approaches do not perform well in large-scale applications. In this study, we focus on utility-maximizing nested logit activity-based model-systems and calibrating aggregate statistics such as activity shares, mode shares, time-dependent & mode-specific OD flows, and time-dependent & mode-specific sensor counts. We formulate the calibration problem as a simulation-based optimization problem and propose a stochastic gradient-based solution procedure to solve it. The solution procedure relies on microsimulation to calculate expectations of the aggregate statistics of interest to the calibration problem. Additionally, we derive approximate analytical expressions for the gradient of the objective function —that are evaluated through microsimulation on mini-batches of the population. The proposed solution procedure is sensitive to the fundamental structure of the activity-based model-system and is non-myopic in considering the dependencies across its model components. The formulated optimization problem is non-convex, highly nonlinear, and potentially has multiple-minima. Lastly, we show —through a real-world application— that the proposed solution procedure outperforms other state-of-the-art purely simulation-based optimization approaches in terms of computational efficiency, stability, and convergence. We also compare various gradient-based solution algorithms to determine the best algorithm to update the parameters. This work has the potential to facilitate wider and easier application of activity-based model-systems.

97 MATHEMATICS AND COMPUTING↗

Continuous-Time Mean-Variance Portfolio Selection with Random Horizon

This paper examines the continuous-time mean-variance optimal portfolio selection problem with random market parameters and random time horizon. Treating this problem as a linearly constrained stochastic linear-quadratic optimal control problem, I explicitly derive the efficient portfolios and efficient frontier in closed forms based on the solutions of two backward stochastic differential equations. Some related issues such as a minimum variance portfolio and a mutual fund theorem are also addressed. All the results are markedly different from those in the problem with deterministic exit time. A key part of my analysis involves proving the global solvability of a stochastic Riccati equation, which is interesting in its own right.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A statistical model to predict ignition probability

Ignition capability is a critical design constraint for aeronautical gas turbines. However the current trend toward overall lean burn is detrimental to the engine ignition and relight and the ignition system must be adapted to ensure a fast and reliable light-round in all circumstances. As ignition is a stochastic phenomenon, the optimization of an ignition system requires to build ignition probability maps, which is difficult and costly with either experiment or numerical simulation as both require many tests. Here, this work proposes a model to predict the ignition probability map, knowing only flow statistics in non-reacting conditions, i.e., with only one test. The originality of the model is to construct statistics of the flame kernel trajectory, which are then combined with local flow indicators to evaluate the ignition probability at the considered sparking location. Application to a swirled burner operated in premixed, non-premixed and spray combustion modes illustrates the model concepts and demonstrates its ability to recover the experimental ignition map with good accuracy.

42 ENGINEERING↗

Gradient-based optimization for regression in the functional tensor-train format

Predictive analysis of complex computational models, such as uncertainty quantification (UQ), must often rely on using an existing database of simulation runs. In this paper we consider the task of performing low-multilinear-rank regression on such a database. Specifically we develop and analyze an efficient gradient computation that enables gradient-based optimization procedures, including stochastic gradient descent and quasi-Newton methods, for learning the parameters of a functional tensor-train (FT). We compare our algorithms with 22 other nonparametric and parametric regression methods on 10 real-world data sets and show that for many physical systems, exploiting low-rank structure facilitates efficient construction of surrogate models. Here, we use a number of synthetic functions to build insight into behavior of our algorithms, including the rank adaptation and group-sparsity regularization procedures that we developed to reduce overfitting. Finally we conclude the paper by building a surrogate of a physical model of a propulsion plant on a naval vessel.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Locating PHEV exchange stations in V2G

Plug-in hybrid electric vehicle (PREV) is an environment friendly modem transportation method and has been rapidly penetrate the transportation system. Renewable energy is another contributor to clean power but the associated intermittence increases the uncertainty in power generation. As a foreseen benefit of a vchicle-to-grid (V2G) system, PREV supporting infrastructures like battery exchange stations can provide battery service to PREV customers as well as being plugged into a power grid as energy sources and stabilizer. The locations of exchange stations are important for these two objectives under constraints from both ,transportation system and power grid. To model this location problem and to understand and analyze the benefit of a V2G system, we develop a two-stage stochastic program to optimally locate the stations prior to the realizations of battery demands, loads, and generation capacity of renewable power sources. Based on this model, we use two data sets to construct the V2G systems and test the benefit and the performance of these systems.

25 ENERGY STORAGE↗

Battery Model Parameterization Using Manufacturer Datasheet and Field Measurement for Real-Time HIL Applications

Here, this paper presents a novel battery model parameterization method using actual field measurement and manufacturer datasheet for real-time hardware-in-the-loop (HIL) applications. It is critical that real-time HIL models can accurately reproduce field test results so that tests can be conducted on HIL testbeds instead of in the field. In the past, numerical heuristic optimization algorithms were often used to derive parameters for battery models. However, the deterministic algorithms often reach a locally optimal solution and stochastic heuristic searching strategies suffer from low searching efficiency. Therefore, in this paper, we propose a global-local searching enhanced genetic algorithm (GL-SEGA). By applying the generalized opposition-based learning mechanism, GL-SEGA can efficiently explore the global solution space. By using the trust-region-reflective method to perform the local search, the GL-SEGA can improve the accuracy and convergence in its local exploitations. Field measurements and manufactory datasheets are used to test and validate the accuracy and robustness of the GL-SEGA algorithm.

25 ENERGY STORAGE↗

SU-G-201-09: Evaluation of a Novel Machine-Learning Algorithm for Permanent Prostate Brachytherapy Treatment Planning

Purpose: A novel, automated, algorithm for permanent prostate brachytherapy (PPB) treatment planning has been developed. The novel approach uses machine-learning (ML), a form of artificial intelligence, to substantially decrease planning time while simultaneously retaining the clinical intuition of plans created by radiation oncologists. This study seeks to compare the ML algorithm against expert-planned PPB plans to evaluate the equivalency of dosimetric and clinical plan quality. Methods: Plan features were computed from historical high-quality PPB treatments (N = 100) and stored in a relational database (RDB). The ML algorithm matched new PPB features to a highly similar case in the RDB; this initial plan configuration was then further optimized using a stochastic search algorithm. PPB pre-plans (N = 30) generated using the ML algorithm were compared to plan variants created by an expert dosimetrist (RT), and radiation oncologist (MD). Planning time and pre-plan dosimetry were evaluated using a one-way Student’s t-test and ANOVA, respectively (significance level = 0.05). Clinical implant quality was evaluated by expert PPB radiation oncologists as part of a qualitative study. Results: Average planning time was 0.44 ± 0.42 min compared to 17.88 ± 8.76 min for the ML algorithm and RT, respectively, a significant advantage [t(9), p = 0.01]. A post-hoc ANOVA [F(2,87) = 6.59, p = 0.002] using Tukey-Kramer criteria showed a significantly lower mean prostate V150% for the ML plans (52.9%) compared to the RT (57.3%), and MD (56.2%) plans. Preliminary qualitative study results indicate comparable clinical implant quality between RT and ML plans with a trend towards preference for ML plans. Conclusion: PPB pre-treatment plans highly comparable to those of an expert radiation oncologist can be created using a novel ML planning model. The use of an ML-based planning approach is expected to translate into improved PPB accessibility and plan uniformity.

60 APPLIED LIFE SCIENCES↗

Plateau Phenomenon in Gradient Descent Training of RELU Networks: Explanation, Quantification, and Avoidance

The ability of neural networks to provide ‘best in class’ approximation across a wide range of applications is well-documented. Nevertheless, the powerful expressivity of neural networks comes to naught if one is unable to effectively train (choose) the parameters defining the network. In general, neural networks are trained by gradient descent type optimization methods,a stochastic variant thereof. In practice, such methods result in the loss function decreases rapidly at the beginning of training but then, after a relatively small number of steps, significantly slow down. The loss may even appear to stagnate over the period of a large number of epochs, only to then suddenly start to decrease fast again for no apparent reason. This so-called plateau phenomenon manifests itself in many learning tasks. The present work aims to identify and quantify the root causes of plateau phenomenon.analysis is carried out in the setting of univariate ReLU networks. No assumptions are made on the number of neurons relative to the number of training data, and our results hold for both the lazy and adaptive regimes. Here, the main findings are: plateaux correspond to periods during which activation patterns remain constant, where activation pattern refers to the number of data points that activate a given neuron; quantification of convergence of the gradient flow dynamics; and, characterization stationary points in terms solutions of local least squares regression lines over subsets of the training data. Based on these conclusions, we propose a new iterative training method, the Active Neuron Least Squares (ANLS), characterised by the explicit adjustment of the activation pattern at each step, which is designed to enable a quick exit from a plateau. Illustrative numerical examples are included throughout.

97 MATHEMATICS AND COMPUTING↗

ProgressiveHedging.jl

Implementation of the Progressive Hedging algorithm written in Julia utilizing JuMP. This is used to solve multistage optimization problems (e.g. Stochastic programs or capacity expansion models). The user uses the StructJuMP extension of JuMP to create the model and build up the scenario tree.

Sigler, Devon↗

DEEP Solar: Data DrivEn Modeling and Analytics for Enhanced System Layer ImPlementation

Realizing the SETO 2030 mission of reducing solar energy costs to 3-5 c/kWh will require innovative enabling research on effective, cost-efficient integration of local PV within distribution systems. However, the intermittent and variable nature of PVs compels operators to impose conservative hosting capacity constraints. Given the extremely high variability of (intermittent and unpredictable) solar energy generation, relaxing the capacity constraints (which are currently around 15%) and achieving 100% or greater integration of renewables will require a fundamental transformation of the power grid via the utilization of exponentially larger amounts of AMI enabled fine-grained data. To address the challenges in increasing the penetration of renewable energy based DERs, this project envisions an Enhanced System Layer (ESL) at the distribution network level that is reliable, cost-effective and scalable to millions of Distributed Energy Resources (DERs)/devices. This includes developing: 1) Transformative and highly scalable machine learning based predictive analytics tools that plug into distribution system planning and provide real-time situational awareness at the distribution level for short and long-term operational planning. The tools will be built using novel data-driven energy models of millions of active nodes with AMI, 2) Adaptive stochastic analysis and optimization algorithms for real-time grid operations, 3) Dynamic Scenario Analysis using parallel Cloudenabled implementations with < 1 minute computational cycle times.

14 SOLAR ENERGY↗

Dynamic Network Analysis of Nuclear Science Literature for Research Influence Assessment

Analyzing nuclear science literature via data-driven methods is a critical step for assessing research influence and technology advancements. Indicators of scholarly activities may be buried in large volumes of nuclear research publications and collaboration networks over time. Mining for relevant scholarly influence trends in large volumes of text can be computationally challenging; however, open-source information on research collaborations over time can offer opportunities to extract meaningful insights. While network centrality analysis of scholarly research provides topology-based insights, additional emphasis on dynamics associated with the diffusion of information through these networks is important. Here this paper represents a step in that direction through the development of a novel dynamic network analysis framework and computational engine to identify key entities and capabilities over time within global scholarly nuclear science collaboration networks. Network theoretic, stochastic simulation, and optimization methods are leveraged to address variability in scholarly interactions, influence propagation, and collaboration patterns via network connections. A topic-aware influence maximization algorithm is developed to address the goal of identifying key influential authors in diverse research topics over time. Efficient parallelized implementation of the algorithm is applied to reduce computational costs. A proof-of-concept case study using open-source Scopus data with 33,517 published nuclear research papers from 2000-2019 is presented and representative analytic insights are generated. Broad implications of these insights are discussed and future research directions are also identified.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗