A Sparse Quadrature Approach for Stochastic Optimization in Power Grid Models.
Abstract not provided.
SEARCH · Search NASA
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.
Abstract not provided.
Explore the source record for details and available documents.
Abstract not provided.
Explore the source record for details and available documents.
Abstract not provided.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Explore the source record for details and available documents.
Abstract not provided.
Abstract not provided.
Explore the source record for details and available documents.
With increasing electric vehicle (EV) adoption, managing public fast-charging demand effectively is crucial to avoid grid strain. This study investigates the potential of using dynamic pricing schemes to address this challenge. Presented in this study is a scalable agent-based simulation framework, which is applied to a case study in Richmond, Virginia, that assumes a 50% EV adoption rate in 2040. Two pricing schemes are compared: (1) a dynamic-pricing scheme based on station utilization and (2) a dynamic-pricing scheme based on peak power at the station. These schemes are compared to two baseline scenarios: (1) unscheduled first-come, first-served and (2) scheduled with constant price. The study’s results suggest that dynamic pricing has the potential to influence EV charging behavior, inducing both spatial and temporal shifts, but does so at the cost of inducing inconvenience to EV drivers. The results suggest the peak-power dynamic pricing scheme has the potential to mitigate peak demand pressures on the grid with minimal inconvenience, offering a promising approach for sustainable EV charging infrastructure expansion.
We combined descriptor-based analytical models for stiffness-matrix and elastic-moduli with mean-field methods to accelerate assessment of technologically useful properties of high-entropy alloys, such as strength and ductility. Model training for elastic properties uses Sure-Independence Screening (SIS) and Sparsifying Operator (SO) method yielding an optimal analytical model, constructed with meaningful atomic features to predict target properties. Computationally inexpensive analytical descriptors were trained using a database of elastic properties determined from density functional theory for binary and ternary subsets of Nb-Mo-Ta-W-V refractory alloys. The optimal Elastic-SISSO models, extracted from an exponentially large feature space, give an extremely accurate prediction of target properties, similar to or better than other models, with some verified from existing experiments. Here we also show that electronegativity variance and elastic-moduli can directly predict trends in ductility and yield strength of refractory HEAs, and reveals promising alloy concentration regions.
Machine learning (ML) techniques with the genetic algorithm (GA) have been applied to determine a polarizable force field parameters using only ab initio data from quantum mechanics (QM) calculations of molecular clusters at the MP2/6-31G(d,p), DFMP2(fc)/jul-cc-pVDZ, and DFMP2(fc)/jul-cc-pVTZ levels to predict experimental condensed phase properties (i.e., density and heat of vaporization). The performance of this ML/GA approach is demonstrated on 4943 dimer electrostatic potentials and 1250 cluster interaction energies for methanol. Excellent agreement between the training data set from QM calculations and the optimized force field model was achieved. Our results were further improved by introducing an offset factor during the machine learning process to compensate for the discrepancy between the QM calculated energy and the energy reproduced by optimized force field, while maintaining the local “shape” of the QM energy surface. Throughout the machine learning process, experimental observables were not involved in the objective function, but were only used for model validation. The best model, optimized from the QM data at the DFMP2(fc)/jul-cc-pVTZ level, appears to perform even better than the original AMOEBA force field (amoeba09.prm), which was optimized empirically to match liquid properties. The present effort shows the possibility of using machine learning techniques to develop descriptive polarizable force field using only QM data. The ML/GA strategy to optimize force fields parameters described here could easily be extended to other molecular systems.
Reconstruction of the structure and parameters of an Ising model from binary samples is a problem of practical importance in a variety of disciplines, ranging from statistical physics and computational biology to image processing and machine learning. The focus of the research community shifted toward developing universal reconstruction algorithms that are both computationally efficient and require the minimal amount of expensive data. Here, we introduce a new method, interaction screening, which accurately estimates model parameters using local optimization problems. The algorithm provably achieves perfect graph structure recovery with an information-theoretically optimal number of samples, notably in the low-temperature regime, which is known to be the hardest for learning. Here, the efficacy of interaction screening is assessed through extensive numerical tests on synthetic Ising models of various topologies with different types of interactions, as well as on real data produced by a D-Wave quantum computer. Finally, this study shows that the interaction screening method is an exact, tractable, and optimal technique that universally solves the inverse Ising problem.
This paper studies the optimal multiple-stopping problem arising in the context of the timing option to withdraw from a project in stages. The profits are driven by a general spectrally negative Lévy process. This allows the model to incorporate sudden declines of the project values, generalizing greatly the classical geometric Brownian motion model. We solve the one-stage case as well as the extension to the multiple-stage case. The optimal stopping times are of threshold-type and the value function admits an expression in terms of the scale function. A series of numerical experiments are conducted to verify the optimality and to evaluate the efficiency of the algorithm.