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 865 records · Page 48

Substation-Level Grid Topology Optimization Using Bus Splitting

Operations of substation circuit breakers are important for maintenance needs and topology reconfiguration in power systems. Bus splitting is one type of topology change where the two bus bars at a substation can become electrically disconnected under certain actions of circuit breakers. Because these events involve detailed substation modeling, they are typically not considered in routine power system operation and control. In this paper, an improved substation-level topology optimization framework is developed by expanding traditional line switching decisions by breaker-level bus splitting, which can further reduce grid congestion and generation costs. A tight McCormick relaxation is proposed to reformulate the bilinear terms in the resultant optimization problem to linear inequality constraints. Thus, a tractable mixed-integer linear program reformulation is attained that allows for efficient solutions in real-time operations. Numerical studies on the IEEE 14-bus and 118-bus systems demonstrate the computational performance and economic benefits of the proposed topology optimization approach.

bus split↗

Sensor placement for optimal event characterization performance.

Contaminant sensor placement is often cast as an optimization problem to minimize objectives such as the probability of failed detection or public health impact. In the case of an actual incident, the sensor network data will also be utilized for event characterization to estimate source location, size and hazard areas. We present a sensor placement methodology to optimize for event characterization performance, and also compare the results to traditional placement objectives.

99 GENERAL AND MISCELLANEOUS↗

On the emerging potential of quantum annealing hardware for combinatorial optimization

Abstract Over the past decade, the usefulness of quantum annealing hardware for combinatorial optimization has been the subject of much debate. Thus far, experimental benchmarking studies have indicated that quantum annealing hardware does not provide an irrefutable performance gain over state-of-the-art optimization methods. However, as this hardware continues to evolve, each new iteration brings improved performance and warrants further benchmarking. To that end, this work conducts an optimization performance assessment of D-Wave Systems’ Advantage Performance Update computer, which can natively solve sparse unconstrained quadratic optimization problems with over 5,000 binary decision variables and 40,000 quadratic terms. We demonstrate that classes of contrived problems exist where this quantum annealer can provide run time benefits over a collection of established classical solution methods that represent the current state-of-the-art for benchmarking quantum annealing hardware. Although this work does not present strong evidence of an irrefutable performance benefit for this emerging optimization technology, it does exhibit encouraging progress, signaling the potential impacts on practical optimization tasks in the future.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

The Coupling of ESP-R and Genopt: A Simple Case Study

This paper describes and demonstrates how to use the optimization program GenOpt with the building energy simulation program ESP-r. GenOpt, a generic optimization program, minimises an objective function that is evaluated by an external simulation program. It has been developed for optimization problems that are computationally expensive and that may have nonsmooth objective functions. ESP-r is a research oriented building simulation program that is well validated and has been used to conduct various building energy analysis studies. In this paper, the necessary file preparations are described and a simple optimization example is presented.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Controlled precision QUBO-based algorithm to compute eigenvectors of symmetric matrices

We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix which is based on solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of symmetric matrices; It can compute the eigenvector/eigenvalue pair to essentially any arbitrary precision, and with minor modifications, can also solve the generalized eigenvalue problem. Performance is analyzed on small random matrices and selected larger matrices from practical applications.

97 MATHEMATICS AND COMPUTING↗

Learning-Based Demand Response in Grid Interactive Buildings via Gaussian Processes

This paper presents a predictive controller for a grid-interactive multi-zone building where the temperature dynamics are learned via Gaussian Process (GP) regression. We investigate the development of a learning-based predictive control with two main objectives: (i) continuously learn the temperature dynamics of the building based on data; and, (ii) use the learned dynamics to solve a multi-objective predictive control problem to guarantee occupants' comfort and energy efficiency during normal conditions and demand response events. We leverage the probabilistic non-parametric properties of GPs to estimate the (unknown) non-linear temperature dynamics of the building and to incorporate the uncertainty of those predictions in a multi-objective optimization problem. The GP-based predictive control is solved via a zero-order primal-dual projected-gradient algorithm. We evaluate numerically the performance of the proposed controller using a five-zone commercial building.

demand response↗

An investigation of Newton-Sketch and subsampled Newton methods

Sketching, a dimensionality reduction technique, has received much attention in the statistics community. In this paper, we study sketching in the context of Newton's method for solving finite-sum optimization problems in which the number of variables and data points are both large. In this work, we study two forms of sketching that perform dimensionality reduction in data space: Hessian subsampling and randomized Hadamard transformations. Each has its own advantages, and their relative tradeoffs have not been investigated in the optimization literature. Additionally, our study focuses on practical versions of the two methods in which the resulting linear systems of equations are solved approximately, at every iteration, using an iterative solver. The advantages of using the conjugate gradient method vs. a stochastic gradient iteration are revealed through a set of numerical experiments, and a complexity analysis of the Hessian subsampling method is presented.

97 MATHEMATICS AND COMPUTING↗

SU-D-BRB-06: Treating Glioblastoma Multiforme (GBM) as a Chronic Disease: Implication of Temporal-Spatial Dose Fractionation Optimization Including Cancer Stem Cell Dynamics

Purpose: To explore the feasibility of improving GBM treatment outcome with temporal-spatial dose optimization of an ordinary differential equation (ODE) that models the differentiation and distinct radiosensitivity between cancer stem cells (CSC) and differentiated cancer cells (DCC). Methods: The ODE was formulated into a non-convex optimization problem with the objective to minimize remaining total cancer cells 500 days from the onset of radiotherapy when the total cancer cell number was 3.5×10{sup 7}, while maintaining normal tissue biological effective dose (BED) of 100Gy resulted from standard prescription of 2Gyx30. Assuming spatially separated CSC and DCC, optimization was also performed to explore the potential benefit from dose-painting the two compartments. Dose escalation to a sub-cell-population in the GTV was also examined assuming that a 2 cm margin around the GTV allows sufficient dose drop-off to 100Gy BED. The recurrence time was determined as the time at which the total cancer cell number regrows to 10{sup 9} cells. Results: The recurrence time with variable fractional doses administered once per week, bi-week and month for one year were found to be 615, 593 and 570 days, superior to the standard-prescription recurrence time of 418 days. The optimal dose-fraction size progression for both uniform and dose-painting to the tumor is low and relatively constant in the beginning and gradually increases to more aggressive fractions at end of the treatment course. Dose escalation to BED of 200Gy to the whole tumor alongside with protracted weekly treatment was found to further delay recurrence to 733 days. Dose-painting of 200 and 500Gy BED to CSC on a year-long weekly schedule further extended recurrence to 736 and 1076 days, respectively. Conclusion: GBM treatment outcome can possibly be improved with a chronic treatment approach. Further dose escalation to the entire tumor or CSC targeted killing is needed to achieve total tumor control. This work is supported by the NSF Graduate Research Fellowship (DGE-1144087)

60 APPLIED LIFE SCIENCES↗

High-precision control of tracked field robots in the presence of unknown traction coefficients

Accurate steering through crop rows that avoids crop damage is one of the most important tasks for agricultural robots utilized in various field operations, such as monitoring, mechanical weeding, or spraying. In practice, varying soil conditions can result in off-track navigation due to unknown traction coefficients so that it can cause crop damage. To address this problem, this work presents the development, application, and experimental results of a real-time receding horizon estimation and control (RHEC) framework applied to a fully autonomous mobile robotic platform to increase its steering accuracy. Recent advances in cheap and fast microprocessors, as well as advances in solution methods for nonlinear optimization problems, have made nonlinear receding horizon control (RHC) and receding horizon estimation (RHE) methods suitable for field robots that require high-frequency (milliseconds) updates. A real-time RHEC framework is developed and applied to a fully autonomous mobile robotic platform designed by the authors for in-field phenotyping applications in sorghum fields. Nonlinear RHE is used to estimate constrained states and parameters, and nonlinear RHC is designed based on an adaptive system model that contains time-varying parameters. The capabilities of the real-time RHEC framework are verified experimentally, and the results show an accurate tracking performance on a bumpy and wet soil field. Finally, the mean values of the Euclidean error and required computation time of the RHEC framework are equal to 0.0423 m and 0.88 ms, respectively.

42 ENGINEERING↗

Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation

Multiple tensor-times-matrix (Multi-TTM) is a key computation in algorithms for computing and operating with the Tucker tensor decomposition, which is frequently used in multidimensional data analysis. Here, we establish communication lower bounds that determine how much data movement is required (under mild conditions) to perform the Multi-TTM computation in parallel. The crux of the proof relies on analytically solving a constrained, nonlinear optimization problem. We also present a parallel algorithm to perform this computation that organizes the processors into a logical grid with twice as many modes as the input tensor. We show that, with correct choices of grid dimensions, the communication cost of the algorithm attains the lower bounds and is therefore communication optimal. Finally, we show that our algorithm can significantly reduce communication compared to the straightforward approach of expressing the computation as a sequence of tensor-times-matrix operations when the input and output tensors vary greatly in size.

HBL-inequalities↗

A Study of Physics-Informed Deep Learning for System Fluid Dynamics Closures

The sub-grid-scale (SGS) physics models, or so-called closure relations (CR), are essential in thermal-fluid modeling and simulation codes, ranging from large-eddy simulation to system-level thermo-fluid dynamic problems. While details vary, all thermo-fluid codes solve coupled mass-momentum-energy conservation partial differential equations (PDE). Traditionally, the analytical form of closure models has to be known, and then we calibrate the model using data from a set of applicable experiments. Characteristically, it takes long effort to gain insights and mechanistic understanding needed for developing closure models. Such a model is a compact form of data. The long time required for new model development limits the pace of model application while dealing with new geometries, new coolants or system conditions, particularly in newly designed systems. Alternative to mechanistic and semi-analytical models, it is possible to discover the pattern of closure relations by applying the modern machine learning methods to the body of relevant experimental data. Deep learning (DL) is a relatively new branch in the machine learning family, and a major breakthrough has been achieved since Hinton introduces a fast algorithm to efficiently train a feed-forward neural network (NN) with multilayer perceptrons. Generally, any NN with more than two layers is considered as deep learning, and it contains a large number of hyper-parameters to achieve pattern recognition or regression for complex datasets. Hornik shows that multilayer NN is compatible with universal approximation theorem. There is no constraint for a multilayer NN to capture the properties of any measurable information. This capability makes DL attractive for closure models in a system thermal-hydraulic code. As system geometry and/or operating conditions change, new physical experiments (increasingly sophisticated) are conducted to support evaluation and revision of closure models. Such a so-called data-driven modeling relaxes the structural form of system codes to directly assimilate data instead of hard-wiring the model to pre-calibrated correlations. The objective of this research is to enable cost-effective development of a DL-based closure that reflects the data. The previous work on applying machine learning techniques to fluid dynamics focused on statistical learning with basic NN from direct numerical simulations (DNS) dataset. In the present work, we show that DL-based closure models can cause the fluid calculation to diverge if multilayer NN is used. To address the issue, we investigate conditions by which the DL-based closure models work compatibly, stably, and effectively with PDE-constrained forward prediction problems. Optimally meeting the compatibility conditions constitutes a physics-informed deep learning (PIDL) strategy. We refer to this process as PDE-constrained machine learning or PDE-ML. To develop the technical basis for PDE-ML using DL-based fluid dynamics closure, numerical experiments are performed for manufactured problems of increasing complexity. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Robust H{sub ∞} control for singular time-delay systems with saturating actuators via static output feedback

The problem of H{sub ∞} robust exponential stability and static output feedback stabilization of uncertain singular time-delay systems with saturating actuators are investigated. First, the delay-dependent condition is given to guarantee that the singular time-delay systems are not only exponential admissible, but also satisfies H{sub ∞} performance γ. Moreover, the estimation of stability region and the design method of H{sub ∞} static output feedback controller are given by solving a convex optimization problem. Some simulation examples are provided to demonstrate the merit of the proposed design methods.

97 MATHEMATICS AND COMPUTING↗

Code verification for practically singular equations

We report the method-of-moments implementation of the electric-field integral equation (EFIE) yields many code-verification challenges due to the various sources of numerical error and their possible interactions. Matters are further complicated by singular integrals, which arise from the presence of a Green's function. To address these singular integrals, an approach is presented in wherein both the solution and Green's function are manufactured. Because the arising equations are poorly conditioned, they are reformulated as a set of constraints for an optimization problem that selects the solution closest to the manufactured solution. In this paper, we demonstrate how, for such practically singular systems of equations, computing the truncation error by inserting the exact solution into the discretized equations cannot detect certain orders of coding errors. On the other hand, the discretization error from the optimal solution is a more sensitive metric that can detect orders less than those of the expected convergence rate.

97 MATHEMATICS AND COMPUTING↗

A Topology Optimization Framework to Facilitate Adoption of Advanced District Thermal Energy Systems

Advanced district thermal energy systems, which circulate water at temperatures near ambient conditions, and facilitate the utilization of waste heat and renewable thermal sources, can lower the carbon-intensity of urban districts, advancing the U.N. Sustainable Development Goals. Optimization of the network topology — the selection of the best subset of buildings and the best network to connect them, to minimize life cycle cost — can increase adoption of these system in appropriate applications. The potential "solution space" of the topology optimization problem grows factorially with the number of buildings in the district, motivating the consideration of a design heuristic. In this study, a heuristic for the network selection was evaluated with an exhaustive search, for a prototypical four-building district. For the prototypical district considered, the heuristic was effective in selecting an optimal network topology. Additionally, it was found that, in this case, the selection of the subset of buildings was more influential on the life cycle cost than the selection of the network topology. This work is part of a larger effort to develop a topology optimization framework for district thermal energy systems, which is anticipated to address barriers to adoption of ambient-temperature systems.

28 EE - Advanced Manufacturing Office (EE-5A)↗

Dose–volume histogram evaluation scheme for beam orientations in intensity-modulated radiation therapy

Beam orientations in intensity-modulated radiation therapy (IMRT) is an important, but difficult NP-hard optimization problem. A considerable part of this difficulty is due to the essential prerequisite of defining, appropriately, counter-intuitive criteria for a mathematical plan evaluation that coincides with the clinical judgment of the considered plan. Moreover, the quality of beam directions depends heavily on their intensities. Usually a stochastic selector is utilized for optimizing beam orientations, and the intensities are thus calculated many thousands of times, each time for a different selection of beam directions, resulting in excessive time complexity. Therefore, selecting an appropriate set of beam directions in IMRT is still a time-consuming manual trial-and-error search procedure that depends on intuition and empirical knowledge. To overcome these difficulties, this work utilizes the concept of dose–volume histogram (DVH), which is one of the main recognized quantitative measurement tools used for plan judgment, and presents a DVH evaluation scheme that parallelizes plan evaluation with clinical plan judgment. This scheme is then utilized to optimize the intensities of each individual beam, enabling it to be represented by its DVHs, produced for the different irradiated volumes. Finally, an evolutionary algorithm is employed to search for the best combination of those DVHs reflecting the clinical optimal. The presented methods have been applied to three real clinical examples. In comparison to the standard equally spaced beam plans, improvements were reported in all three cases. In comparison with the greedy algorithm, improvements were reported in those examples requiring more than five beam directions.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Estimating PV power from aggregate power measurements within the distribution grid

The increased integration of photovoltaic (PV) systems in distribution grids reduces visibility and situational awareness for utilities because the PV systems' power production is usually not monitored by them. To address this problem, a method called Contextually Supervised Source Separation (CSSS) has been recently adapted for real-time estimation of aggregate PV active power generation from aggregate net active and reactive power measurements at a point in a radially configured distribution grid (e.g., substation). In its original version, PV disaggregation is formulated as an optimization problem that fits linear regression models for the aggregate PV active power generation and true substation active power load. This paper extends the previous work by adding regularization terms in the objective function to capture additional contextual information such as smoothness, by adding new constraints, by introducing new regressors such as ambient temperature, and by investigating the use of time-varying regressors. Furthermore, we perform extensive parametric analysis to study tuning of the objective function weighting factors in a way that maximizes performance and robustness. The proposed PV disaggregation method can be applied to networks with either a single PV system (e.g., megawatt scale) or many distributed ones (e.g., residential scale) connected downstream of the substation. Simulation studies with real field recorded data show that the enhancements of the proposed method reduce disaggregation error by 58% in winter and 35% in summer compared to previous CSSS-based work. When compared against a commonly used transposition model based approach, the reduction in disaggregation error is more pronounced (78% reduction in winter and 45% in summer). Additional simulations indicate that the proposed algorithm is also applicable for PV systems with time-varying power factors. In conclusion, overall, our results show that—with appropriate modeling and tuning—it is possible to accurately estimate the aggregated PV active power generation of a distribution feeder with minimal or no additional sensor deployment.

14 SOLAR ENERGY↗

Compact representations of structured BFGS matrices

For general large-scale optimization problems compact representations exist in which recursive quasi-Newton update formulas are represented as compact matrix factorizations. For problems in which the objective function contains additional structure, recent structured quasi-Newton methods exploit available second-derivative information and approximate unavailable second derivatives. Here, this article develops the compact representations of two structured Broyden-Fletcher-Goldfarb-Shanno update formulas. The compact representations enable efficient limited memory and initialization strategies. Two limited memory line search algorithms are described for which extensive numerical results demonstrate the efficacy of the algorithms, including comparisons to IPOPT on large machine learning problems, and to L-BFGS on a real world large scale ptychographic imaging application.

97 MATHEMATICS AND COMPUTING↗

AutonomieAI: An efficient and deployable vehicle energy consumption estimation toolkit

Here, this paper presents AutonomieAI, a novel toolkit designed for efficient energy estimation of vehicles across diverse trip scenarios, routes, and drive cycles, applicable to a broad range of vehicle powertrain technologies. It leverages state-of-the-art Machine Learning techniques to deliver real-time energy prediction of vehicles, enabling co-simulation with transportation level system tools and opening doors for large-scale optimization at city, network or national level. Benchmark results show that AutonomieAI achieves high accuracy, with an average percentage error below 2% for most powertrain types, and computational efficiency capable of processing over 10,000 trips per second. Applications of AutonomieAI have potential to offer the flexibility to assist in solving eco-routing problems, optimize for vehicle and powertrain selection, study charging decision behavior, and optimize for charging station placement. AutonomieAI is the result of large neural network based model architectures, trained on very large and unique high fidelity vehicle simulation data. It is lightweight, deployable, efficient and has accuracy comparable to specialized and complex physics based simulation softwares.

Autonomie↗