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 649 records · Page 36

New Angle on the Parton Distribution Functions: Self-Organizing Maps

Neural network (NN) algorithms have been recently applied to construct Parton Distribution Function (PDF) parametrizations, providing an alternative to standard global fitting procedures. Here we explore a novel technique using Self-Organizing Maps (SOMs). SOMs are a class of clustering algorithms based on competitive learning among spatially-ordered neurons. We train our SOMs with stochastically generated PDF samples. On every optimization iteration the PDFs are clustered on the SOM according to a user-defined feature and the most promising candidates are used as a seed for the subsequent iteration using the topology of the map to guide the PDF generating process. Our goal is a fitting procedure that, at variance with the standard neural network approaches, will allow for an increased control of the systematic bias by enabling user interaction in the various stages of the process.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Optimization of Distribution Feeder Topology: A Differential Programming Learning Approach

This paper presents a gradient based method for optimizing distribution feeder network topology under load un- certainty. We recast the optimal network reconfiguration problem as a learning problem where edge weights of a graph are learned to produce an optimized spanning tree for a distribution network. Using recent methods published on differentiable programming, we provide a data driven method for learning these weights. We test our method on 100 variations of an IEEE 15-bus test system. Our results show that our method outperforms more traditional mathematical programming-based approaches.

differentiable programming↗

Dynamic Resource Scheduling in Mobile Edge Cloud with Cloud Radio Access Network

Nowadays, by integrating the cloud radio access network (C-RAN) with the mobile edge cloud computing (MEC) technology, mobile service provider (MSP) can efficiently handle the increasing mobile traffic and enhance the capabilities of mobile devices. But the power consumption has become skyrocketing for MSP and it gravely affects the profit of MSP. Previous work often studied the power consumption in C-RAN and MEC separately while less work had considered the integration of C-RAN with MEC. In this paper, we present an unifying framework for the power-performance tradeoff of MSP by jointly scheduling network resources in C-RAN and computation resources in MEC to maximize the profit of MSP. To achieve this objective, we formulate the resource scheduling issue as a stochastic problem and design a new optimization framework by using an extended Lyapunov technique. Specially, because the standard Lyapunov technique critically assumes that job requests have fixed lengths and can be finished within each decision making interval, it is not suitable for the dynamic situation where the mobile job requests have variable lengths. To solve this problem, we extend the standard Lyapunov technique and design the VariedLen algorithm to make online decisions in consecutive time for job requests with variable lengths. Furthermore, our proposed algorithm can reach time average profit that is close to the optimum with a diminishing gap (1/V) for the MSP while still maintaining strong system stability and low congestion. With extensive simulations based on a real world trace, we demonstrate the efficacy and optimality of our proposed algorithm.

97 MATHEMATICS AND COMPUTING↗

Seismic Retrofit for Electric Power Systems

Our paper develops a two-stage stochastic program and solution procedure to optimize the selection of seismic retrofit strategies to increase the resilience of electric power systems against earthquake hazards. The model explicitly considers the range of earthquake events that are possible and, for each, an approximation of the distribution of damage experienced. Furthermore, this is important because electric power systems are spatially distributed and so their performance is driven by the distribution of component damage. We also test this solution procedure against the nonlinear integer solver in LINGO 13 and apply the formulation and solution strategy to the Eastern Interconnection, where seismic hazard stems from the New Madrid seismic zone.

58 GEOSCIENCES↗

A Two-Stage Stochastic Programming Approach for the Design of Renewable Ammonia Supply Chain Networks

This work considers the incorporation of renewable ammonia manufacturing sites into existing ammonia supply chain networks while accounting for ammonia price uncertainty from existing producers. We propose a two-stage stochastic programming approach to determine the optimal investment decisions such that the ammonia demand is satisfied and the net present cost is minimized. We apply the proposed approach to a case study considering deploying in-state renewable ammonia manufacturing in Minnesota’s supply chain network. We find that accounting for price uncertainty leads to supply chains with more ammonia demand met via renewable production and thus lower costs from importing ammonia from existing producers. These results show that the in-state renewable production of ammonia can act as a hedge against the volatility of the conventional ammonia market.

Mitrai, Ilias (ORCID:0000000289896864)↗

Data and Multistage Optimization for the New Grid

Three essential capabilities for using exascale computing resources on next generation power grid applications are: generating large renewable energy datasets, modeling damage and operations during and after extreme events, and employing multi-stage optimization for infrastructure planning. Powerscenarios, developed as part of the ExaSGD project, addresses these capabilities by enabling users to build synthetic wind farms for large test systems using numerical weather prediction-based data sources. We share examples of using Powerscenarios to build out wind farms on the ACTIVSg2000 test system, to enable simulated operations and emergency asset allocation during a hurricane strike, and to compute multi-stage infrastructure buildouts.

economic dispatch↗

Evolution of Scenario Generation Capabilities in the ExaSGD Project

High-fidelity renewable energy scenarios and rare-event high-impact contingencies are essential for modeling operations and infrastructure expansion of the next generation power grids using exascale computing resources. As the ExaSGD project progressed, our capabilities for generating scenarios for modeling wind power output at multiple wind farms significantly improved, evolving from the use of independent random perturbations to importance sampling-based techniques capturing representative spatial-temporal relations. Contingency generation also improved, evolving from standard N-1 techniques to probabilistic models of infrastructure damage resulting from extreme weather events. We review the developments in the realistic intermittent-energy scenario forecasting and extreme-event contingency creation as the ExaSGD project progressed and discuss the future work in these areas.

economic dispatch↗

TU-AB-303-01: A Feasibility Study for Dynamic Adaptive Therapy of Non-Small Cell Lung Cancer

Purpose: To compare plans for NSCLC optimized using Dynamic Adaptive Therapy (DAT) with conventional IMRT optimization. DAT adapts plans based on changes in the target volume by using dynamic programing techniques to consider expected changes into the optimization process. Information gathered during treatment, e.g. from CBCT, is incorporated into the optimization. Methods and materials: DAT is formulated using stochastic control formalism, which minimizes the total expected number of tumor cells at the end of a treatment course subject to uncertainty inherent in the tumor response and organs-at-risk (OAR) dose constraints. This formulation allows for non-stationary dose distribution as well as non-stationary fractional dose as needed to achieve a series of optimal plans that are conformal to tumor over time. Sixteen phantom cases with various sizes and locations of tumors, and OAR geometries were generated. Each case was planned with DAT and conventional IMRT (60Gy/30fx). Tumor volume change over time was obtained by using, daily MVCT-based, two-level cell population model. Monte Carlo simulations have been performed for each treatment course to account for uncertainty in tumor response. Same OAR dose constraints were applied for both methods. The frequency of plan modification was varied to 1, 2, 5 (weekly), and 29 (daily). The final average tumor dose and OAR doses have been compared to quantify the potential benefit of DAT. Results: The average tumor max, min, mean, and D95 resulted from DAT were 124.0–125.2%, 102.1–114.7%, 113.7–123.4%, and 102.0–115.9% (range dependent on the frequency of plan modification) of those from conventional IMRT. Cord max, esophagus max, lung mean, heart mean, and unspecified tissue D05 resulted from AT were 84–102.4%, 99.8–106.9%, 66.9–85.6%, 58.2–78.8%, and 85.2–94.0% of those from conventional IMRT. Conclusions: Significant tumor dose increase and OAR dose reduction, especially with parallel OAR with mean or dose-volume constraints, can be achieved using DAT.

60 APPLIED LIFE SCIENCES↗

Chapter Nine - Automated Optimal Control in Energy Systems: The Reinforcement Learning Approach

With the development of smart grid technologies an increasing number of new devices and participants have joined modern energy systems and are inevitably making them more complicated and interdependent than ever. Optimally controlling such a complex energy system and maintaining its operation in a high-efficient, secure, and resilient manner are challenging tasks to the system operators. Fortunately, the revolution in deep learning and artificial intelligence (AI), both from hardware and algorithms perspectives, has provided new ideas and solutions to many previously intractable problems. As a result, this advance in computer science also sparked great research interests in utilizing AI in solving engineering problems related to the modern energy systems. Among many AI techniques, deep reinforcement learning (DRL) has demonstrated great potential for solving sequential optimization problems, which are very common in the engineering domains. Its ability to handle nonlinearity and stochasticity in controlled systems has out-competed many traditional optimal control algorithms. Therefore in this chapter, we focus on the state-of-the-art of DRL concepts and related algorithms, compare their pros and cons with traditional optimal control approaches and discuss the typical workflow for leveraging RL in solving complex problems in modern energy systems.

artificial intelligence↗

Manifold learning for coarse-graining atomistic simulations: Application to amorphous solids

In this work, we introduce a generalized machine learning framework to probabilistically parameterize upper-scale models in the form of nonlinear PDEs consistent with a continuum theory, based on coarse-grained atomistic simulation data of mechanical deformation and flow processes. The proposed framework utilizes a hypothesized coarse-graining methodology with manifold learning and surrogate-based optimization techniques. Coarse-grained high-dimensional data describing quantities of interest of the multiscale models are projected onto a nonlinear manifold whose geometric and topological structure is exploited for measuring behavioral discrepancies in the form of manifold distances. A surrogate model is constructed using Gaussian process regression to identify a mapping between stochastic parameters and distances. Derivative-free optimization is employed to adaptively identify a unique set of parameters of the upper-scale model capable of rapidly reproducing the system's behavior while maintaining consistency with coarse-grained atomic-level simulations. The proposed method is applied to learn the parameters of the shear transformation zone (STZ) theory of plasticity that describes plastic deformation in amorphous solids as well as coarse-graining parameters needed to translate between atomistic and continuum representations. We show that the methodology is able to successfully link coarse-grained microscale simulations to macroscale observables and achieve a high-level of parity between the models across scales.

36 MATERIALS SCIENCE↗

Hybrid Simulation Framework

HYBRID is a modeling toolset to assess the economic viability of Nuclear-Renewable Integrated Energy Systems (N-R IES). The frameworks enabling this toolset are INL’s RAVEN, its CashFlow plugin and the Modelica language. The toolset includes sample RAVEN workflows performing economic assessments. These workflows consist of: generation of stochastic time series and application of probabilistic analysis and optimization algorithms (RAVEN); a library of Modelica models representing the physical behavior of N-R IES; and the CashFlow plugin mapping physical performance to economic performance. The toolset allows assembling existing and new models such as nuclear reactors, renewable energy sources, energy storage, gas turbines, industrial processes, etc. into an N-R IES. The toolset workflows evaluate the dynamics of the N-R IES responding to stochastic conditions (electricity demand, price, etc.) and optimize the dispatch economics as well as N-R IES capacity planning.

Epiney, Aaron↗

A Two-Stage Decomposition Approach for AC Optimal Power Flow

The alternating current optimal power flow (AC-OPF) problem is critical to power system operations and planning, but it is generally hard to solve due to its nonconvex and large-scale nature. Furthermore, this paper proposes a scalable decomposition approach in which the power network is decomposed into a master network and a number of subnetworks, where each network has its own AC-OPF subproblem. This formulates a two-stage optimization problem and requires only a small amount of communication between the master and subnetworks. The key contribution is a smoothing technique that renders the response of a subnetwork differentiable with respect to the input from the master problem, utilizing properties of the barrier problem formulation that naturally arises when subproblems are solved by a primal-dual interior-point algorithm. Consequently, existing efficient nonlinear programming solvers can be used for both the master problem and the subproblems. The advantage of this framework is that speedup can be obtained by processing the subnetworks in parallel, and it has convergence guarantees under reasonable assumptions. The formulation is readily extended to instances with stochastic subnetwork loads. Numerical results show favorable performance and illustrate the scalability of the algorithm which is able to solve instances with more than 11 million buses.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Stochastic Distribution Control Theory-Its Potential Application in Risk Management in Financial Systems

Stochastic Distribution Control (SDC) theory [1], originated by the author in 1996, aims at developing modeling and control strategies for dynamic and non-Gaussian stochastic systems by controlling the shape of the probability density functions of some concerned variables and parameters in stochastic systems. It generalizes the capability of standard stochastic differential equations and can therefore be applied to generic non-Gaussian systems. Since it was established in 1996, it has found a wide spectrum of applications in non-Gaussian stochastic system control, data mining, filtering and optimization for uncertain systems. In this short opinion article, discussions will be made on potential applications of SDC theory to financial systems in terms of risk analysis and management.

97 MATHEMATICS AND COMPUTING↗

Deep Generative Models that Solve PDEs: Distributed Computing for Training Large Data-Free Models

Recent progress in scientific machine learning (SciML) has opened up the possibility of training novel neural network architectures that solve complex partial differential equations (PDEs). Several (nearly data free) approaches have been recently reported that successfully solve PDEs, with examples including deep feed forward networks, generative networks, and deep encoder-decoder networks. However, practical adoption of these approaches is limited by the difficulty in training these models, especially to make predictions at large output resolutions (≥1024×1024). Here we report on a software framework for data parallel distributed deep learning that resolves the twin challenges of training these large SciML models - training in reasonable time as well as distributing the storage requirements. Our framework provides several out of the box functionality including (a) loss integrity independent of number of processes, (b) synchronized batch normalization, and (c) distributed higher-order optimization methods. We show excellent scalability of this framework on both cloud as well as HPC clusters, and report on the interplay between bandwidth, network topology and bare metal vs cloud. We deploy this approach to train generative models of sizes hitherto not possible, showing that neural PDE solvers can be viably trained for practical applications. We also demonstrate that distributed higher-order optimization methods are 2-3× faster than stochastic gradient-based methods and provide minimal convergence drift with higher batch-size.

PDEs↗

A feasibility study of dynamic adaptive radiotherapy for nonsmall cell lung cancer

Purpose: The final state of the tumor at the end of a radiotherapy course is dependent on the doses given in each fraction during the treatment course. This study investigates the feasibility of using dynamic adaptive radiotherapy (DART) in treating lung cancers assuming CBCT is available to observe midtreatment tumor states. DART adapts treatment plans using a dynamic programming technique to consider the expected changes of the tumor in the optimization process. Methods: DART is constructed using a stochastic control formalism framework. It minimizes the total expected number of tumor cells at the end of a treatment course, which is equivalent to maximizing tumor control probability, subject to the uncertainty inherent in the tumor response. This formulation allows for nonstationary dose distributions as well as nonstationary fractional doses as needed to achieve a series of optimal plans that are conformal to the tumor over time, i.e., spatiotemporally optimal plans. Sixteen phantom cases with various sizes and locations of tumors and organs-at-risk (OAR) were generated using in-house software. Each case was planned with DART and conventional IMRT prescribing 60 Gy in 30 fractions. The observations of the change in the tumor volume over a treatment course were simulated using a two-level cell population model. Monte Carlo simulations of the treatment course for each case were run to account for uncertainty in the tumor response. The same OAR dose constraints were applied for both methods. The frequency of replanning was varied between 1, 2, 5 (weekly), and 29 times (daily). The final average tumor dose and OAR doses have been compared to quantify the potential dosimetric benefits of DART. Results: The average tumor max, min, mean, and D95 doses using DART relative to these using conventional IMRT were 124.0%–125.2%, 102.1%–114.7%, 113.7%–123.4%, and 102.0%–115.9% (range dependent on the frequency of replanning). The average relative maximum doses for the cord and esophagus, mean doses for the heart and lungs, and D05 for the unspecified tissue resulting 84%–102.4%, 99.8%–106.9%, 66.9%–85.6%, 58.2%–78.8%, and 85.2%–94.0%, respectively. Conclusions: It is feasible to apply DART to the treatment of NSCLC using CBCT to observe the midtreatment tumor state. Potential increases in the tumor dose and reductions in the OAR dose, particularly for parallel OARs with mean or dose–volume constraints, could be achieved using DART compared to nonadaptive IMRT.

60 APPLIED LIFE SCIENCES↗

Bayesian sparse learning with preconditioned stochastic gradient MCMC and its applications

Deep neural networks have been successfully employed in an extensive variety of research areas, including solving partial differential equations. Despite its significant success, there are some challenges in effectively training DNN, such as avoiding overfitting in over-parameterized DNNs and accelerating the optimization in DNNs with pathological curvature. Here, we propose a Bayesian type sparse deep learning algorithm. The algorithm utilizes a set of spike-and-slab priors for the parameters in the deep neural network. The hierarchical Bayesian mixture will be trained using an adaptive empirical method. That is, one will alternatively sample from the posterior using preconditioned stochastic gradient Langevin Dynamics (PSGLD), and optimize the latent variables via stochastic approximation. The sparsity of the network is achieved while optimizing the hyperparameters with adaptive searching and penalizing. A popular SG-MCMC approach is Stochastic gradient Langevin dynamics (SGLD). However, considering the complex geometry in the model parameter space in nonconvex learning, updating parameters using a universal step size in each component as in SGLD may cause slow mixing. To address this issue, we apply a computationally manageable preconditioner in the updating rule, which provides a step-size parameter to adapt to local geometric properties. Moreover, by smoothly optimizing the hyperparameter in the preconditioning matrix, our proposed algorithm ensures a decreasing bias, which is introduced by ignoring the correction term in the preconditioned SGLD. According to the existing theoretical framework, we show that the proposed algorithm can asymptotically converge to the correct distribution with a controllable bias under mild conditions. Numerical tests are performed on both synthetic regression problems and learning solutions of elliptic PDE, which demonstrate the accuracy and efficiency of the present work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enterprise level fuel inventory management simulation and optimization.

The objective is to find the optimal fuel inventory management strategy roadmap for each supplier along the fuel delivery supply chain. SoSAT (System of Systems Analysis Toolset) Enterprise is a suite of software tools: State Model tool; Stochastic simulation tool; Advanced data visualization tools; and Optimization tools. Initially designed to provide DoDand supporting organizations the capability to analyze a System-of-Systems (SoS) and its various platforms: (1) Supporting multiple US Army Program Executive Office Integration (PEO-I) trade studies; (2) Supporting US Army Program Executive Office of Ground Combat Systems (PEO GCS) for Fleet Management and Modernization Planning initiative; and (3) Participating in formal Verification, Validation & Accreditation effort with Army Organizations (AMSAA and ATEC).

99 GENERAL AND MISCELLANEOUS↗

Modeling Flexible Generator Operating Regions via Chance- constrained Stochastic Unit Commitment

Here, we introduce a novel chance-constrained stochastic unit commitment model to address uncertainty in renewables' production uncertainty in power systems operation. For most thermal generators,underlying technical constraints that are universally treated as "hard" by deterministic unit commitment models are in fact based on engineering judgments, such that system operators can periodically request operation outside these limits in non-nominal situations, e.g., to ensure reliability. We incorporate this practical consideration into a chance-constrained stochastic unit commitment model, specifically by in-frequently allowing minor deviations from the minimum and maximum thermal generator power output levels. We demonstrate that an extensive form of our model is computationally tractable for medium-sized power systems given modest numbers of scenarios for renewables' production. We show that the model is able to potentially save significant annual production costs by allowing infrequent and controlled violation of the traditionally hard bounds imposed on thermal generator production limits. Finally, we conduct a sensitivity analysis of optimal solutions to our model under two restricted regimes and observe similar qualitative results.

42 ENGINEERING↗