Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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,765 records · Page 98

Machine learning from RANS and LES to inform coarse grid simulations

Nuclear system thermal hydraulic analysis has historically relied on computationally inexpensive 1D codes. However, such tools are unable to capture multiscale multidimensional effects in large nuclear reactor enclosures. On the other hand, simulations with higher fidelity can be too expensive for such purposes. One of the ways to reduce computational cost is to perform simulations on a coarse grid, which, unfortunately, introduces large discretization errors. In this paper, two high-to-low data-driven approaches are investigated: (1) a coarse grid turbulence model to predict eddy viscosity and (2) correction of errors in coarse grid velocity fields. The approaches aim to reduce grid- and turbulence model-induced errors in coarse grid Reynolds-averaged Navier–Stokes (RANS) simulations. Two sources of high-fidelity data, RANS and large eddy simulations (LES), are explored. To extract the eddy viscosity from the LES data, an inverse optimization problem is solved. However, the LES eddy viscosity is shown to be comparable to the RANS eddy viscosity in terms of error reduction. Therefore, the directly available RANS eddy viscosity was used to develop a coarse grid data-driven turbulence model. Additionally, error correction in velocity is used to reduce the remaining uncertainties and bring the results closer to reality. In conclusion, the performance of the frameworks is demonstrated for a scaled upper plenum of a gas-cooled reactor facility.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Development of a nearshore oscillating surge wave energy converter with variable geometry

This paper presents an analysis of a novel wave energy converter concept that combines an oscillating surge wave energy converter (OSWEC) with control surfaces. The control surfaces allow for a variable device geometry that enables the hydrodynamic properties to be adapted with respect to structural loading, absorption range and power-take-off capability. The device geometry is adjusted on a sea state-to-sea state time scale and combined with wave-to-wave manipulation of the power take-off (PTO) to provide greater control over the capture efficiency, capacity factor, and design loads. This work begins with a sensitivity study of the hydrodynamic coefficients with respect to device width, support structure thickness, and geometry. A linear frequency domain analysis is used to evaluate device performance in terms of absorbed power, foundation loads, and PTO torque. Previous OSWEC studies included nonlinear hydrodynamics, in response a nonlinear model that includes a quadratic viscous damping torque that was linearized via the Lorentz linearization. Inclusion of the quadratic viscous torque led to construction of an optimization problem that incorporated motion and PTO constraints. Results from this study found that, when transitioning from moderate-to-large sea states the novel OSWEC was capable of reducing structural loads while providing a near constant power output.

16 TIDAL AND WAVE POWER↗

Stochastic pre-event preparation for enhancing resilience of distribution systems

Extreme weather events are the common causes for power supply interruptions and power outages in electrical distribution systems. Improving the distribution system and enhancing its resilience is becoming crucial due to the increased frequency of extreme weather events. Preparation and allocation of multiple flexible resources, such as mobile resources, fuel resources, and labor resources before extreme weather events can mitigate the effects of extreme weather events and enhance the resilience of power distribution systems. Here, in this paper, a two-stage stochastic mixed-integer linear programming (SMILP) is proposed to optimize the preparation and resource allocation process for upcoming extreme weather events, which leads to faster and more efficient post-event restoration. The objective of the proposed two-stage SMILP is to maximize the served load and minimize the operating cost of flexible resources. The first stage in the optimization problem selects the amounts and locations of different resources. The second stage considers the operational constraints of the distribution system and repair crew scheduling constraints. The proposed stochastic pre-event preparation model is solved by a scenario decomposition method, Progressive Hedging (PH), to ease the computational complexity introduced by a large number of scenarios. Furthermore, to show the impact of solar photovoltaic (PV) generation on system resilience, three types of PV systems are considered during a power outage and the resilience improvements with different PV penetration levels are compared. Numerical results from simulations on a large-scale (more than 10,000 nodes) distribution feeder have been used to validate the effectiveness and scalability of the proposed method.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Constructing probabilistic scenarios for wide-area solar power generation

Optimizing thermal generation commitments and dispatch in the presence of high penetrations of renewable resources such as solar energy requires a characterization of their stochastic properties. In this study, we describe novel methods designed to create day-ahead, wide-area probabilistic solar power scenarios based only on historical forecasts and associated observations of solar power production. Each scenario represents a possible trajectory for solar power in next-day operations with an associated probability computed by algorithms that use historical forecast errors. Scenarios are created by segmentation of historic data, fitting non-parametric error distributions using epi-splines, and then computing specific quantiles from these distributions. Additionally, we address the challenge of establishing an upper bound on solar power output. Our specific application driver is for use in stochastic variants of core power systems operations optimization problems, e.g., unit commitment and economic dispatch. These problems require as input a range of possible future realizations of renewables production. However, the utility of such probabilistic scenarios extends to other contexts, e.g., operator and trader situational awareness. Finally, we compare the performance of our approach to a recently proposed method based on quantile regression, and demonstrate that our method performs comparably to this approach in terms of two widely used methods for assessing the quality of probabilistic scenarios: the Energy score and the Variogram score.

14 SOLAR ENERGY↗

Distributed output-feedback model predictive control for multi-agent consensus

We introduce a distributed output-feedback model predictive control approach for achieving consensus among multiple agents. Each agent computes a distributed control action based on an output-feedback measurement of a local neighborhood tracking error and communicates information only to its neighbors, according to a communication network modeled as a directed graph. Each agent computes its distributed control action by solving a local min–max optimization problem that simultaneously computes a local state estimate and control input under worst-case assumptions on unmeasured input disturbances and measurement noise. Under easily verified controllability and observability assumptions, this distributed output-feedback model predictive control approach provides an upper bound on the group consensus error, thereby ensuring practical consensus in the presence of unmeasured disturbances and noise. A numerical example with four agents connected in a directed graph is demonstrated to illustrate the results.

42 ENGINEERING↗

Longitudinal train dynamics model for a rail transit simulation system

The paper develops a longitudinal train dynamics model in support of microscopic railway transportation simulation. The model can be calibrated without any mechanical data making it ideal for implementation in transportation simulators. The calibration and validation work is based on data collected from the Portland light rail train fleet. The calibration procedure is mathematically formulated as a constrained non-linear optimization problem. The validity of the model is assessed by comparing instantaneous model predictions against field observations, and also evaluated in the domains of acceleration/deceleration versus speed and acceleration/deceleration versus distance. A test is conducted to investigate the adequacy of the model in simulation implementation. The results demonstrate that the proposed model can adequately capture instantaneous train dynamics, and provides good performance in the simulation test. Thus, the model provides a simple theoretical foundation for microscopic simulators and will significantly support the planning, management and control of railway transportation systems.

42 ENGINEERING↗

Actuator selection and placement for localized feedback flow control

The selection and placement of actuators and sensors to control compressible viscous flows is addressed by developing a novel methodology based upon the eigensystem structural sensitivity of the linearized evolution operator appropriate for linear feedback control. Forward and adjoint global modes are used to construct a space of possible perturbations to the linearized operator, which yields a small optimization problem for selecting the parameters that best achieve the control objective, including where they should be placed. The method is demonstrated by informing actuation to suppress amplification of the instabilities in boundary layer separation in a high-subsonic diffuser. Complete stabilization is observed in the separated shear layer for short downstream distances at modest Reynolds number. Higher Reynolds numbers and longer distances are expected to be more challenging to stabilize; here the control informed by the procedure still substantively suppresses amplification of instabilities. It is also demonstrated that more complex actuator–sensor selections may not yield superior controllers.

Mechanics↗

The DESC stellarator code suite Part 3: Quasi-symmetry optimization

The DESC stellarator optimization code takes advantage of advanced numerical methods to search the full parameter space much faster than conventional tools. Only a single equilibrium solution is needed at each optimization step thanks to automatic differentiation, which efficiently provides exact derivative information. A Gauss–Newton trust-region optimization method uses second-order derivative information to take large steps in parameter space and converges rapidly. With just-in-time compilation and GPU portability, high-dimensional stellarator optimization runs take orders of magnitude less computation time with DESC compared to other approaches. This paper presents the theory of the DESC fixed-boundary local optimization algorithm along with demonstrations of how to easily implement it in the code. Example quasi-symmetry optimizations are shown and compared to results from conventional tools. Three different forms of quasi-symmetry objectives are available in DESC, and their relative advantages are discussed in detail. In the examples presented, the triple product formulation yields the best optimization results in terms of minimized computation time and particle transport. This paper concludes with an explanation of how the modular code suite can be extended to accommodate other types of optimization problems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Performing fully parallel constraint logic programming on a quantum annealer

A quantum annealer exploits quantum effects to solve a particular type of optimization problem. The advantage of this specialized hardware is that it effectively considers all possible solutions in parallel, thereby potentially outperforming classical computing systems. However, despite quantum annealers having recently become commercially available, there are relatively few high-level programming models that target these devices. In this article, we show how to compile a subset of Prolog enhanced with support for constraint logic programming into a two-local Ising-model Hamiltonian suitable for execution on a quantum annealer. In particular, we describe the series of transformations one can apply to convert constraint logic programs expressed in Prolog into an executable form that bears virtually no resemblance to a classical machine model yet that evaluates the specified constraints in a fully parallel manner. We evaluate our efforts on a 1,095-qubit D-Wave 2X quantum annealer and describe the approach's associated capabilities and shortcomings.

97 MATHEMATICS AND COMPUTING↗

Development of Steady-State and Dynamic Mass and Energy Constrained Neural Networks for Distributed Chemical Systems Using Noisy Transient Data

The paper presents the development of algorithms for mass and energy constrained neural network models that can exactly conserve the overall mass and energy of distributed chemical process systems, even though the noisy transient data used for optimal model training violate the same. In contrast to approximately satisfying mass and energy balance constraints of a system by soft penalization of objective function, algorithms have been developed for solving equality-constrained nonlinear optimization problems, thus providing the guarantee of exactly satisfying the system mass and energy conservation laws. For developing dynamic mass-energy constrained network models for distributed systems, hybrid series and parallel dynamic-static neural networks have been leveraged. The developed algorithms for solving both the training and forward problems are validated using both steady-state and dynamic data in the presence of various noise characteristics. The developed data-driven algorithms are flexible to exactly satisfy mass and energy balance constraints for dynamic chemical processes if the system holdup information is available. The proposed network structures and algorithms are applied to the development of data-driven lumped and distributed models of an adiabatic superheater/reheater system, a nonisothermal continuous stirred tank reactor, as well as an electrically heated plug-flow reactor system where one form of energy gets transformed to another. It has been observed that the mass-energy constrained neural networks yield a root mean squared error of <1% with respect to the system truth for the case studies evaluated in this work.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Atomic Radius and Charge Parameter Uncertainty in Biomolecular Solvation Energy Calculations

Atomic radii and charges are two major parameters used in implicit solvent electrostatics and energy calculations. The optimization problem for charges and radii is under-determined, leading to uncertainty in the values of these parameters and in the results of solvation energy calculations using these parameters. This paper presents a method for quantifying this uncertainty in solvation energies using surrogate models based on generalized polynomial chaos (gPC) expansions. There are relatively few atom types used to specify radii parameters in implicit solvation calculations; therefore, surrogate models for these low-dimensional spaces could be constructed using least-squares fitting. However, there are many more types of atomic charges; therefore, construction of surrogate models for the charge parameter space required compressed sensing combined with an iterative rotation method to enhance problem sparsity. We present results for the uncertainty in small molecule solvation energies based on these approaches. Additionally, we explore the correlation between uncertainties due to radii and charges which motivates the need for future work in uncertainty quantification methods for high-dimensional parameter spaces.

Yang, Xiu↗

A Comparison of Electronic Structure Methods for Predicting the Hydrogenation Energies of Candidate Molecules for Hydrogen Storage

The development of novel energy materials and fuels is required to expand current available energy sources. Aiming to reach this goal, there is growing interest in using molecular hydrogen as an energy carrier due to its abundance and high energy density. Liquid organic hydrogen carriers (LOHCs) are a promising route to the large-scale storage and transport of hydrogen for use in the energy economy. The search for thermodynamically viable LOHC molecules for real world use has led to a set of constraints on the dehydrogenation enthalpy and the minimum gravimetric hydrogen capacity. These constraints allow one to formulate the search for an ideal LOHC candidate molecule as an optimization problem well suited to the strengths of machine learning and artificial intelligence computational approaches. A critical barrier to a large-scale, high-throughput screening of LOHC candidate molecules is the lack of reliable training data. Computational electronic structure methods including density functional theory, coupled cluster approximations, and diffusion Monte Carlo can be used to provide training data where experimental data are either unreliable or do not exist. In this work, we use these methods to calculate the dehydrogenation energies and enthalpies of candidate LOHC molecules.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

energy minimization↗

Optimization of Desalination Systems with Detailed Water Chemistry through Integration of Reaktoro in WaterTAP

Chemistry predictions are critical for an accurate estimation of performance and costs in desalination process models, which allows for the estimation of the value of new technologies and the viability of treating new water sources. Herein, we present how an implicit function formulation can be used to integrate the chemical modeling package, Reaktoro, into the techno-economic assessment and modeling platform, WaterTAP. This approach resolves the critical issues of integrating large-scale thermodynamic models and databases into equation-oriented process models while allowing more flexibility relative to previously presented surrogate-based methods. We describe how this integration into Pyomo and WaterTAP models is implemented and used through the open-source package Reaktoro-PSE . We first validate this integration approach by performing optimization on a previously presented desalination treatment train with softening and acid addition as the pretreatment steps. Then, to demonstrate the value of this approach, we extend the cost-optimization problem to include the simultaneous addition of lime and soda ash for softening, and HCl and H 2 SO 4 in the acidification steps. Finally, we were able to confirm the previously established results that were obtained by using surrogate models and demonstrate that the implicit function approach enables exploration of different feedwater compositions and a larger number of chemicals and their combinations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Multi‐Objective Urban Observational Strategies: A Risk‐Based Framework for Expanding Flood Sensor Networks

In coupled human and natural systems, developing an observation strategy which maximizes insight into both the natural system and the human system is a challenging multi-objective optimization problem. In this article, we describe the expansion of a flood risk observation system in Southeast Texas designed to improve our understanding of both physical and socioeconomic exposure to hydrological hazards at fine spatial scales, in the context of a structured hazard-exposure-vulnerability risk framework. We describe a new approach for assessing the spatial extent through which a flood sensor's observations can be assumed to be relevant, and estimate the population served within each sensor's area of information using downscaled socio-demographic data. As hydrological observations and modeling move to ever finer scale, assessing the information they contain in the context of both social and natural systems becomes increasingly important for developing actionable scientific insights.

54 ENVIRONMENTAL SCIENCES↗

Towards a fully automated algorithm driven platform for biosystems design

Large-scale data acquisition and analysis are often required in the successful implementation of the design, build, test, and learn (DBTL) cycle in biosystems design. However, it has long been hindered by experimental cost, variability, biases, and missed insights from traditional analysis methods. Here, we report the application of an integrated robotic system coupled with machine learning algorithms to fully automate the DBTL process for biosystems design. As proof of concept, we have demonstrated its capacity by optimizing the lycopene biosynthetic pathway. This fully-automated robotic platform, BioAutomata, evaluates less than 1% of possible variants while outperforming random screening by 77%. A paired predictive model and Bayesian algorithm select experiments which are performed by Illinois Biological Foundry for Advanced Biomanufacturing (iBioFAB). BioAutomata excels with black-box optimization problems, where experiments are expensive and noisy and the success of the experiment is not dependent on extensive prior knowledge of biological mechanisms.

59 BASIC BIOLOGICAL SCIENCES↗

Accelerating network layouts using graph neural networks

Graph layout algorithms used in network visualization represent the first and the most widely used tool to unveil the inner structure and the behavior of complex networks. Current network visualization software relies on the force-directed layout (FDL) algorithm, whose high computational complexity makes the visualization of large real networks computationally prohibitive and traps large graphs into high energy configurations, resulting in hard-to-interpret “hairball” layouts. Here we use Graph Neural Networks (GNN) to accelerate FDL, showing that deep learning can address both limitations of FDL: it offers a 10 to 100 fold improvement in speed while also yielding layouts which are more informative. We analytically derive the speedup offered by GNN, relating it to the number of outliers in the eigenspectrum of the adjacency matrix, predicting that GNNs are particularly effective for networks with communities and local regularities. Finally, we use GNN to generate a three-dimensional layout of the Internet, and introduce additional measures to assess the layout quality and its interpretability, exploring the algorithm’s ability to separate communities and the link-length distribution. The novel use of deep neural networks can help accelerate other network-based optimization problems as well, with applications from reaction-diffusion systems to epidemics.

97 MATHEMATICS AND COMPUTING↗

A regression algorithm for accelerated lattice QCD that exploits sparse inference on the D-Wave quantum annealer

We propose a regression algorithm that utilizes a learned dictionary optimized for sparse inference on a D-Wave quantum annealer. In this regression algorithm, we concatenate the independent and dependent variables as a combined vector, and encode the high-order correlations between them into a dictionary optimized for sparse reconstruction. On a test dataset, the dependent variable is initialized to its average value and then a sparse reconstruction of the combined vector is obtained in which the dependent variable is typically shifted closer to its true value, as in a standard inpainting or denoising task. Here, a quantum annealer, which can presumably exploit a fully entangled initial state to better explore the complex energy landscape, is used to solve the highly non-convex sparse coding optimization problem. The regression algorithm is demonstrated for a lattice quantum chromodynamics simulation data using a D-Wave 2000Q quantum annealer and good prediction performance is achieved. The regression test is performed using six different values for the number of fully connected logical qubits, between 20 and 64. The scaling results indicate that a larger number of qubits gives better prediction accuracy.

97 MATHEMATICS AND COMPUTING↗