Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization methods”

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 127 records · Page 7

Coordinated PEV Charging for Distribution System Management

Plug-in electric vehicles (PEVs) can help to reduce worldwide dependence on petroleum and carbon emissions. In the past a few years, PEVs have received considerable attention as an eco-friendly and cost-effective alternative to conventional gasoline vehicles. PEVs consume higher power from the grid during charging compared to conventional residential loads. Therefore, the emerging fleet of PEVs will introduce a considerable amount of additional load on power system. On the other hand, majority of PEVs are parked for more than 90% of the time, making them ideal for providing various services through Electric Vehicle Supply Equipment (EVSE), a.k.a. charging stations which are PEVs’ connection points to the power system. In this project, coordinated PEV charging are developed to provide distribution system services, considering PEV characteristics, realistic travel pattern, charging behaviors, and EVSE power rating and availability. The main efforts and contributions are summarized as follows. • Mobility models and EVSE charging capability/availability are indispensable for evaluating PEV charging coordination strategies and developing PEV charging control. Many existing studies utilize simplified mobility models assuming that the entire vehicle fleet returns home in the evening and is parked at home until the next morning. Some other PEV models better represent diversified home arrival and departure time, but cannot capture varying charging flexibility and capability at different locations, and therefore are not appropriate to study the impacts of public EVSE on PEV load and utilization. In this work, a mobility and charging flexibility model is proposed to better represent the temporal availability and varying charging capability from PEV onboard charger and EVSE. • Based on the mobility model, a generalized optimization method is proposed to evaluate different PEV charging coordination strategies. In existing literature, different algorithms and methods need to be designed to evaluate each charging strategy from both vehicle owners’ and system’s perspective. With the optimization method proposed in this work, different charging control strategies can be studied and compared by only updating objective functions. Moreover, optimization tricks are provided to convert the optimization problems to equivalent linear programming problems, which can be efficiently solved with existing solvers. • An innovative scheduling and control framework is proposed to enable smart PEV charging for grid services while meeting PEV owners’ travel needs. In the proposed framework, each set of EVSE is equipped with a controller that estimates charging power and energy flexibility based on vehicle characteristics, EVSE power rating, battery energy state, and upcoming trip information. With the simplified charging flexibility model received from each EVSE controller, the central coordinator determines the optimal power allocation for a look-ahead time window for the given grid services. The proposed charging control can help reduce the computational complexity and communication requirement compared with existing methods. It is also scalable to the expanding PEV fleet and robust to uncertainties in upcoming vehicle trips and future system condition. • The proposed charging strategy evaluation and smart charging control methods are applied to one of the prototypical feeders developed by the Pacific Northwest National Laboratory (PNNL) for case studies. Detailed trip information extracted from the National Household Travel Survey (NHTS) is used to represent travel and parking patterns. Different scenarios are simulated to evaluate the performance of the proposed methods and understand how PEV mobility and public EVSE availability affect PEV load and potential grid services.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Bayesian optimization of the beam injection process into a storage ring

We have evaluated the data-efficient Bayesian optimization method for the specific task of injection tuning in a circular accelerator. In this paper, we describe the implementation of this method at the Karlsruhe Research Accelerator with up to nine tuning parameters, including the determination of the associated hyperparameters. We show that the Bayesian optimization method outperforms manual tuning and the commonly used Nelder-Mead optimization algorithm in both simulation and experiment. The algorithm was also successfully used to ease the commissioning phase after the installation of new injection magnets and is regularly used during accelerator operations. We demonstrate that the introduction of context variables that include intrabunch scattering effects, such as the Touschek effect, further improves the control and robustness of the injection process.

43 PARTICLE ACCELERATORS↗

Introduction to Mixed Variable Optimization (MVO) [Slides]

Mixed Variable Optimization (MVO) is an optimization method that uses discrete (categorical) and continuous variables in its optimization process. This method of optimization is applicable to highly nonlinear problems where the information used in the optimization is of poor quality of has minor inaccuracies in the data sets.

97 MATHEMATICS AND COMPUTING↗

Global Optimization of Chemical Cluster Structures: Methods, Applications, and Challenges

Chemical clusters are relevant to many applications in catalysis, separations, materials, and energy sciences. Experimentally, the structure of clusters is difficult to determine, but it is very important in understanding their chemistry and properties. Computational methods can be used to examine cluster structure, however finding the most stable structure is not simple, particularly as the cluster size increases. Global optimization techniques have long been used to tackle the problem of the most stable structure, but such approaches would have to look for a global minimum, while sampling local minima over the whole potential energy surface as well. In this review, the state-of-the-art theory of global optimization theory is summarized. First, the definition, significance, relation to experiments, and a brief history of global optimization is presented. We then discuss, in more detail, three versatile global optimization methods: the basin hopping, the artificial bee colony algorithm, and the genetic algorithm. We close with some representative application examples of global optimization of clusters since 2016 and the challenges, open questions and opportunities in this field.

Global optimization, Chemical clusters, Artificial↗

Non-trivial symmetries in quantum landscapes and their resilience to quantum noise

Very little is known about the cost landscape for parametrized Quantum Circuits (PQCs). Nevertheless, PQCs are employed in Quantum Neural Networks and Variational Quantum Algorithms, which may allow for near-term quantum advantage. Such applications require good optimizers to train PQCs. Recent works have focused on quantum-aware optimizers specifically tailored for PQCs. However, ignorance of the cost landscape could hinder progress towards such optimizers. In this work, we analytically prove two results for PQCs: (1) We find an exponentially large symmetry in PQCs, yielding an exponentially large degeneracy of the minima in the cost landscape. Alternatively, this can be cast as an exponential reduction in the volume of relevant hyperparameter space. (2) We study the resilience of the symmetries under noise, and show that while it is conserved under unital noise, non-unital channels can break these symmetries and lift the degeneracy of minima, leading to multiple new local minima. Based on these results, we introduce an optimization method called Symmetry-based Minima Hopping (SYMH), which exploits the underlying symmetries in PQCs. Our numerical simulations show that SYMH improves the overall optimizer performance in the presence of non-unital noise at a level comparable to current hardware. Overall, this work derives large-scale circuit symmetries from local gate transformations, and uses them to construct a noise-aware optimization method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mathematical methods for optimal polynomial recovery of high-dimensional systems from noisy data

The goal of our Early Career Research Project (ECRP) is to establish a modern mathematical foundation that will enable next-generation computational methods for polynomial approximation of high-dimensional systems, having a certain set of constraints, from a limited amount of noisy data. Such a foundation is critical to realizing the future potential of the DOE user facilities, and will ultimately empower scientists to address a fundamental question, namely, “how many realizations of a nonlinear manifold are required to recover the entire high-dimensional solution map, with optimal approximation guarantees and minimal computational cost?” The central theme of this effort aims to conquer this challenge by pioneering the development of extraordinarily innovative theoretical analysis and transformational non-intrusive computational methodologies. Such approaches will enable the reconstruction of the entire high-dimensional solution map, with accuracy comparable to the best approximation, while utilizing an optimal number of samples. During this reporting period we have made significant progress on four thrusts.

97 MATHEMATICS AND COMPUTING↗

An Incremental Gradient Method for Optimization Problems With Variational Inequality Constraints

We consider minimizing a sum of agent-specific nondifferentiable merely convex functions over the solution set of a variational inequality (VI) problem in that each agent is associated with a local monotone mapping. This problem finds an application in computation of the best equilibrium in nonlinear complementarity problems arising in transportation networks. We develop an iteratively regularized incremental gradient method where at each iteration, agents communicate over a directed cycle graph to update their solution iterates using their local information about the objective and the mapping. The proposed method is single-timescale in the sense that it does not involve any excessive hard-to-project computation per iteration. We derive nonasymptotic agent-wise convergence rates for the suboptimality of the global objective function and infeasibility of the VI constraints measured by a suitably defined dual gap function. Finally, the proposed method appears to be the first fully iterative scheme equipped with iteration complexity that can address distributed optimization problems with VI constraints over cycle graphs.

convergence↗

LA17-V-InverseRadTransportProblem-PD2Kb. Final Project Report

In the inverse radiation transport problem, a radiation signal emanating from an unknown object is used to reconstruct geometric and material parameters of the object , e.g., the mass of special nuclear material (SNM), the isotopic composition of the SNM (e.g., the enrichment of 235U), the thickness of shielding, etc. The inverse radiation transport problem is one of the most fundamental and important in the emergency response mission, and has been addressed in previous NA-22 and NA-42/84 investments by using derivative-free optimization methods. Our project was aimed at (i) consolidating previous work by applying polynomial chaos expansion (PCE) for reducing significantly the number of forward model simulations required by derivative-free optimization methods; (ii) developing a general-purpose framework and stand-alone software for solving the inverse radiation transport problem by applying a new “predictive modeling” methodology (predictive modeling of coupled multi-physics systems, PM_CMPS) which enables the fusing of experimental and computational information; and (iii) developing several benchmarks (for unscattered gamma rays) for demonstrating the quantification of non-Gaussian features (e.g., skewness and kurtosis, which characterize asymmetries and long tails) of response distributions by deterministically and efficiently propagating parameter uncertainties (covariances and higher-order moments, where available) using high-order sensitivities computed by the recently developed comprehensive adjoint sensitivity analysis methodology (C-ASAM). With regard to (i), application of PCE, the most significant accomplishment of this project was an implementation of PCE into INVERSE that significantly reduced computation time for the DiffeRential Evolution Adaptive Metropolis (DREAM) and Differential Evolution (DE) methods. For inverse transport problems with measurements of neutron leakage, neutron multiplication, and neutron-induced gamma-rays, the solution times for the DREAM and DE methods were reduced by factors of 30-300, reducing run times from hours to minutes while maintaining the same accuracy as the standard (non-PCE) DREAM and DE. Speedups were further improved by exploring sparse grid quadrature sets using the Toolkit for Adaptive Stochastic Modeling and Non-Intrusive ApproximatioN (Tasmanian) toolset. An initial exploration of sparse grids indicated that further speedups factors of 5-10 are obtainable. The implementation of PCE in INVERSE is not in a form that users can easily access. With regard to (ii), solving the inverse problem using a predictive modeling paradigm, the most significant accomplishment of this project were the derivation and implementation of adjoint-based second derivatives in neutron and photon transport theory. There are two codes that compute these derivatives. SENSPG computes them for uncollided gamma rays and SENSMG computes them for neutron leakage. SENSMG is open-source code available on github. Other significant accomplishments included a stand-alone code, MULTI-PRED, that implements the predictive modeling paradigm, along with a detailed manual. The code was implemented in the existing INVERSE code for inverse problems, but a head-to-head comparison of inverse methods was not achieved. We also derived and implemented the capability to compute sensitivities for multiplicity measurements into the SENSMG code, and this capability was used in a data assimilation application, but it was not used for solving inverse problems. With regard to (iii), developing benchmarks to demonstrate the importance of high-order sensitivity and uncertainty analysis, the most significant accomplishment of this project were two test problems that showed how important second-order sensitivities are.

07 ISOTOPE AND RADIATION SOURCES↗

Optimized purification methods for metallic contaminant removal from directly recycled Li-ion battery cathodes

Metallic contaminants pose a significant challenge to the viability of directly recycling Li-ion batteries. To date, few strategies exist to selectively remove metallic impurities from mixtures of shredded end-of-life material (black mass; BM) without concurrently damaging the structure and electrochemical performance of the target active material. We herein present tailored methods to selectively ionize two major contaminants—Al and Cu—while retaining a representative cathode (LiNi 0.33 Mn 0.33 Co 0.33 O 2 ; NMC-111) intact. This BM purification process is conducted at moderate temperatures in a KOH-based solution matrix. We rationally evaluate approaches to increase both the kinetic corrosion rate and the thermodynamic solubility of Al 0 and Cu 0 , and evaluate the impact of these treatment conditions on the structure, chemistry, and electrochemical performance of NMC. Specifically, we explore the impacts of chloride-based salts, a strong chelating agent, elevated temperature, and sonication on the rate and extent of contaminant corrosion, while concurrently evaluating the effects on NMC. The reported BM purification process is then demonstrated on samples of “simulated BM” containing a practically relevant 1 wt% concentration of Al or Cu. Increasing the kinetic energy of the purifying solution matrix through elevated temperature and sonication accelerates the corrosion of metallic Al and Cu, such that ∼100% corrosion of 75 μm Al and Cu particles is achieved within 2.5 hr. Further, we determine that effective mass transport of ionized species critically impacts the efficacy of Cu corrosion, and that saturated Cl – hinders rather than accelerates Cu corrosion by increasing solution viscosity and introducing competitive pathways for Cu surface passivation. The purification conditions do not induce bulk structural damage to NMC, and electrochemical capacity is maintained in half-cell format. Testing in full cells suggests that a limited quantity of residual surface species are present after treatment, which initially disrupt electrochemical behavior at the graphite anode but are subsequently consumed. Process demonstration on simulated BM suggests that contaminated samples—which prior to treatment show catastrophic electrochemical performance—can be recovered to pristine electrochemical capacity. The reported BM purification method offers a compelling and commercially viable solution to address contamination, particularly in the “fine” fraction of BM where contaminant sizes are on the same order of magnitude as NMC and where traditional separation approaches are unfeasible. Thus, this optimized BM purification technique offers a pathway towards viable direct recycling of BM feedstocks that would otherwise be unusable.

25 ENERGY STORAGE↗

Optimization of transformer ratio and beam loading in a plasma wakefield accelerator with a structure-exploiting algorithm

Plasma-based acceleration has emerged as a promising candidate as an accelerator technology for a future linear collider or a next-generation light source. We consider the plasma wakefield accelerator (PWFA) concept where a plasma wave wake is excited by a particle beam and a trailing beam surfs on the wake. For a linear collider, the energy transfer efficiency from the drive beam to the wake and from the wake to the trailing beam must be large, while the emittance and energy spread of the trailing bunch must be preserved. One way to simultaneously achieve this when accelerating electrons is to use longitudinally shaped bunches and nonlinear wakes. In the linear regime, there is an analytical formalism to obtain the optimal shapes. In the nonlinear regime, however, the optimal shape of the driver to maximize the energy transfer efficiency cannot be precisely obtained because currently no theory describes the wake structure and excitation process for all degrees of nonlinearity. In addition, the ion channel radius is not well defined at the front of the wake where the plasma electrons are not fully blown out by the drive beam. We present results using a novel optimization method to effectively determine a current profile for the drive and trailing beam in PWFA that provides low energy spread, low emittance, and high acceleration efficiency. We parameterize the longitudinal beam current profile as a piecewise-linear function and define optimization objectives. For the trailing beam, the algorithm converges quickly to a nearly inverse trapezoidal trailing beam current profile similar to that predicted by the ultrarelativistic limit of the nonlinear wakefield theory. For the drive beam, the beam profile found by the optimization in the nonlinear regime that maximizes the transformer ratio also resembles that predicted by linear theory. Furthermore, the current profiles found from the optimization method provide higher transformer ratios compared with the linear ramp predicted by the relativistic limit of the nonlinear theory.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

The use of multi-objective optimization to improve the design process of nuclear power plant systems

Multi-objective optimization is proposed to address the problem of design optimality in the nuclear power plant design process. This is done via the creation/development of the Optimization and Preference Tool for the Improvement of Nuclear Systems (OPTIONS). This work details applications of multi-objective optimization methods (in Python 3) to two different nuclear system design problems: the flash-Rankine power conversion system (PCS) of the I 2 S-LWR and the Passive Endothermic Reaction Cooling System (PERCS) attached to a standard PWR primary system (in RELAP5). The PCS design problem is first solved for three configurations using a specific particle swarm optimization method, achieving a thermodynamic efficiency of 34.81%. A new method, the Mixed-Integer Non-dominated Sorting Genetic Algorithm (MI-NSGA), is created and then used, solving a PCS superstructure of 22 configurations and achieving an efficiency of 35.63%. Finally, the OPTIONS tool is used to optimize the PERCS, improving cost, core temperature control, and cooling longevity.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Optimal Control and Architecture Design Optimization for Hydraulic Drive Train of a Compact Track Loader

Hydrostatic transmission (HST) is a common hydraulic drive train transmission used in track loaders and other high power off-road vehicles. While reliable, traditional HST with fixed-displacement motors has relatively poor efficiencies. In this paper, alternative HST and series hybrid drive train architectures are proposed to replace the traditional HST to allow the implementation of optimal control and optimization methods for better vehicle fuel efficiency. Besides the optimal control methods applied to minimize fuel consumption, the proposed architectures are also optimized for the best configuration in terms of component sizing. Backward-facing (acausal) simulation models were developed to estimate the fuel efficiency of each architecture. Finally, each architecture is compared for optimized performance and fuel saving relative to the traditional HST as baseline.

33 ADVANCED PROPULSION SYSTEMS↗

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 Method of Optimal Control for Class 8 Vehicle Platoons Over Hilly Terrain

This work develops and implements an NMPC control system to facilitate fuel-optimal platooning of Class 8 vehicles over challenging terrain. Prior research has shown that Cooperative Adaptive Cruise Control (CACC), which allows multiple Class 8 vehicles to follow in close succession, can save between 3 and 8% in overall fuel consumption on flat terrain. However, on more challenging terrain, e.g. rolling hills, platooning vehicles can experience diminished fuel savings, and, in some cases, an increase in fuel consumption relative to individual vehicle operation. This research explores the use of Nonlinear Model Predictive Control (NMPC) with predefined route grade profiles to allow platooning vehicles to generate an optimal velocity trajectory with respect to fuel consumption. In order to successfully implement the NMPC system, a model relating vehicle velocity to fuel consumption was generated and validated using experimental data. Additionally, the predefined route grade profiles were created by using the vehicle's GPS velocity over the desired terrain. The real-time NMPC system was then implemented on a two-truck platoon operating over challenging terrain, with a reference vehicle running individually. The results from NMPC platooning are compared against fuel results from a classical proportional-integral-derivative (PID) headway control method. Furthermore, this comparison yields the comparative fuel savings and energy efficiency benefit of NMPC system. In the final analysis, significant fuel savings of greater than 14 and 20% were seen for the lead and following vehicles relative to their respective traditional cruise control and platooning architectures.

33 ADVANCED PROPULSION SYSTEMS↗

A Computational Theory for the Emergence of Grammatical Categories in Cortical Dynamics

A general agreement in psycholinguistics claims that syntax and meaning are unified precisely and very quickly during online sentence processing. Although several theories have advanced arguments regarding the neurocomputational bases of this phenomenon, we argue that these theories could potentially benefit by including neurophysiological data concerning cortical dynamics constraints in brain tissue. In addition, some theories promote the integration of complex optimization methods in neural tissue. In this paper we attempt to fill these gaps introducing a computational model inspired in the dynamics of cortical tissue. In our modeling approach, proximal afferent dendrites produce stochastic cellular activations, while distal dendritic branches–on the other hand–contribute independently to somatic depolarization by means of dendritic spikes, and finally, prediction failures produce massive firing events preventing formation of sparse distributed representations. The model presented in this paper combines semantic and coarse-grained syntactic constraints for each word in a sentence context until grammatically related word function discrimination emerges spontaneously by the sole correlation of lexical information from different sources without applying complex optimization methods. By means of support vector machine techniques, we show that the sparse activation features returned by our approach are well suited—bootstrapping from the features returned by Word Embedding mechanisms—to accomplish grammatical function classification of individual words in a sentence. In this way we develop a biologically guided computational explanation for linguistically relevant unification processes in cortex which connects psycholinguistics to neurobiological accounts of language. We also claim that the computational hypotheses established in this research could foster future work on biologically-inspired learning algorithms for natural language processing applications.

59 BASIC BIOLOGICAL SCIENCES↗

Automated Resonance Fitting for Nuclear Data Evaluation

Global and national efforts to deliver high-quality nuclear data to users have a wide-ranging impact, affecting applications in national security, reactor operations, basic science, medicine, and more. Cross section evaluation is a major part of this effort, combining theory and experimentation to produce recommended values and uncertainties for reaction probabilities. Resonance region evaluation is a specialized type of nuclear data evaluation that can require significant manual effort and months of time from expert scientists. In this article, non-convex non-linear optimization methods are combined with concepts of inferential statistics to infer a resonance model from experimental data in an automated manner that is not dependent on prior evaluation(s). This methodology aims to enhance the workflow of a resonance evaluator by minimizing time, effort, and the potential for bias from prior assumptions, while enhancing reproducibility and documentation, thereby addressing well-known challenges in the field.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Systems and methods for hierarchical multi-objective optimization

A method for optimizing objective functions can include selecting an objective function based at least on a hierarchy, applying parameters to the objective function to generate an output, responsive to the output not satisfying a tolerance condition, assigning a penalty to the set of parameters and evaluating a convergence condition using the set of parameters and the penalty, responsive to the output satisfying the tolerance condition, evaluating an additional objective function using the parameters in an order corresponding to the hierarchy or evaluating the convergence condition responsive to the selected objective function being a final objective function, modifying the set of parameters using a genetic algorithm responsive to the set of parameters not satisfying the convergence condition, and outputting the set of parameters responsive to the set of parameters satisfying the convergence condition.

Chan, Henry↗