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,459 records · Page 81

Analytical Approach for Estimating Preliminary Mass of ARES I Crew Launch Vehicle Upper Stage Structural Components

In January 2004, President Bush gave the National Aeronautics and Space Administration (NASA) a vision for Space Exploration by setting our sight on a bold new path to go back to the Moon, then to Mars and beyond. In response to this vision, NASA started the Constellation Program, which is a new exploration launch vehicle program. The primary mission for the Constellation Program is to carry out a series of human expeditions ranging from Low Earth Orbit to the surface of Mars and beyond for the purposes of conducting human exploration of space, as specified by the Vision for Space Exploration (VSE). The intent is that the information and technology developed by this program will provide the foundation for broader exploration activities as our operational experience grows. The ARES I Crew Launch Vehicle (CLV) has been designated as the launch vehicle that will be developed as a "first step" to facilitate the aforementioned human expeditions. The CLV Project is broken into four major elements: First Stage, Upper Stage Engine, Upper Stage (US), and the Crew Exploration Vehicle (CEV). NASA's Marshall Space Flight Center (MSFC) is responsible for the design of the CLV and has the prime responsibility to design the upper stage of the vehicle. The US is the second propulsive stage of the CLV and provides CEV insertion into low Earth orbit (LEO) after separation from the First Stage of the Crew Launch Vehicle. The fully integrated Upper Stage is a mix of modified existing heritage hardware (J-2X Engine) and new development (primary structure, subsystems, and avionics). The Upper Stage assembly is a structurally stabilized cylindrical structure, which is powered by a single J-2X engine which is developed as a separate Element of the CLV. The primary structure includes the load bearing liquid hydrogen (LH2) and liquid oxygen (LOX) propellant tanks, a Forward Skirt, the Intertank structure, the Aft Skirt and the Thrust Structure. A Systems Tunnel, which carries fluid and electrical power functions to other Elements of the CLV, is included as secondary structure. The MSFC has an overall responsibility for the integrated US element as well as structural design an thermal control of the fuel tanks, intertank, interstage, avionics, main propulsion system, Reaction Control System (RCS) for both the Upper Stage and the First Stage. MSFC's Spacecraft and Vehicle Department, Structural and Analysis Design Division is developing a set of predicted mass of these elements. This paper details the methodology, criterion and tools used for the preliminary mass predictions of the upper stage structural assembly components. In general, weight of the cylindrical barrel sections are estimated using the commercial code Hypersizer, whereas, weight of the domes are developed using classical solutions. HyperSizer is software that performs automated structural analysis and sizing optimization based on aerospace methods for strength, stability, and stiffness. Analysis methods range from closed form, traditional hand calculations repeated every day in industry to more advanced panel buckling algorithms. Margin-of-safety reporting for every potential failure provides the engineer with a powerful insight into the structural problem. Optimization capabilities include finding minimum weight panel or beam concepts, material selections, cross sectional dimensions, thicknesses, and lay-ups from a library of 40 different stiffened and sandwich designs and a database of composite, metallic, honeycomb, and foam materials. Multiple different concepts (orthogrid, isogrid, and skin stiffener) were run for multiple loading combinations of ascent design load with and with out tank pressure as well as proof pressure condition. Subsequently, selected optimized concept obtained from Hypersizer runs was translated into a computer aid design (CAD) model to account for the wall thickness tolerance, weld land etc for developing the most probable weight of the components. The flow diram summarizes the analysis steps used in developing these predicted mass.

Aggarwal, Pravin↗

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↗

Application of the steepest ascent optimization method to a reentry trajectory problem

The direct optimization method is presented in detail. Nominal values of the control variables are input parameters. Perturbations are introduced into the control variables and the resulting first order predictions of changes in the payoff, and constraint functions are then determined. Through a sequence of prescribed cycles, a trajectory is eventually obtained which is reasonably close to the optimum. The method is successfully applied to an Apollo three-dimensional reentry problem. The study of this Apollo application problem has resulted in the development of a highly flexible computer program that can be modified to consider other trajectory optimization problems.

Junkin, B. G.↗

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↗

Combined optimization of image-gathering optics and image-processing algorithm for edge detection

This paper investigates the relationships between the image-gathering and image-processing systems for minimum mean-squared error estimation of scene characteristics. A stochastic optimization problem is formulated in which the objective is to determine a spatial characteristic of the scene rather than a feature of the already blurred, sampled, and noisy image data. The Wiener filter for the sampled image case is obtained as a special case, where the desired characteristics is scene restoration. Optimal edge detection is investigated. It is shown that the optimal edge detector compensates for the blurring introduced by the image-gathering optics, and, notably, that it is not circularly symmetric. The lack of circular symmetry is largely due to the geometric effects of the sampling lattice used in image acquisition.

Halyo, N.↗

A Risk-Constrained Multi-Stage Decision Making Approach to the Architectural Analysis of Mars Missions

This paper presents a novel risk-constrained multi-stage decision making approach to the architectural analysis of planetary rover missions. In particular, focusing on a 2018 Mars rover concept, which was considered as part of a potential Mars Sample Return campaign, we model the entry, descent, and landing (EDL) phase and the rover traverse phase as four sequential decision-making stages. The problem is to find a sequence of divert and driving maneuvers so that the rover drive is minimized and the probability of a mission failure (e.g., due to a failed landing) is below a user specified bound. By solving this problem for several different values of the model parameters (e.g., divert authority), this approach enables rigorous, accurate and systematic trade-offs for the EDL system vs. the mobility system, and, more in general, cross-domain trade-offs for the different phases of a space mission. The overall optimization problem can be seen as a chance-constrained dynamic programming problem, with the additional complexity that 1) in some stages the disturbances do not have any probabilistic characterization, and 2) the state space is extremely large (i.e, hundreds of millions of states for trade-offs with high-resolution Martian maps). To this purpose, we solve the problem by performing an unconventional combination of average and minimax cost analysis and by leveraging high efficient computation tools from the image processing community. Preliminary trade-off results are presented.

entry, descent, and landing (EDL)↗

Sensitivity of optimum solutions to problem parameters

Derivation of the sensitivity equations that yield the sensitivity derivatives directly, which avoids the costly and inaccurate perturb-and-reoptimize approach, is discussed and solvability of the equations is examined. The equations apply to optimum solutions obtained by direct search methods as well as those generated by procedures of the sequential unconstrained minimization technique class. Applications are discussed for the use of the sensitivity derivatives in extrapolation of the optimal objective function and design variable values for incremented parameters, optimization with multiple objectives, and decomposition of large optimization problems.

Sobieszczanski-Sobieski, J.↗

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↗

Optimal placement of tuning masses on truss structures by genetic algorithms

Optimal placement of tuning masses, actuators and other peripherals on large space structures is a combinatorial optimization problem. This paper surveys several techniques for solving this problem. The genetic algorithm approach to the solution of the placement problem is described in detail. An example of minimizing the difference between the two lowest frequencies of a laboratory truss by adding tuning masses is used for demonstrating some of the advantages of genetic algorithms. The relative efficiencies of different codings are compared using the results of a large number of optimization runs.

Ponslet, Eric↗

Harnessing Collaborative Learning Automata to Guide Multi-objective Optimization based Inverse Analysis for Structural Damage Identification

Structural damage identification based on physical models is often transformed into an optimization problem that minimizes the difference between measurement information of structure being monitored and the model prediction in the parametric space. However, the objective function in this context often exhibits multimodality, involving high-dimensional variables due to the reliance on finite element models for damage identification. These features pose challenges to optimization algorithms, where entrapment in local solutions can lead to false positives and false negatives in damage identification. In this research, we propose a reinforcement learning based multi-swarm optimizer to tackle such challenges in pursuit of a small yet diverse solution set that can capture the true damage scenario as one of the solutions. The proposed method leverages the flexibility of the particle swarm optimizer and incorporates novel strategies of metaheuristics to realize targeted improvement. To enable the particle swarm to adaptively select the appropriate search strategy based on the current environment, we adopt the learning automata technique, which sidesteps the need for reward strategy selection that is usually ad hoc at each step of the search. The integration harnesses the automatic learning and self-adaptation capabilities of learning automata, enabling the particles to navigate based on environmental signals. This leads to accumulated probabilities tied to advantageous movements, fostering an adaptive exploration of particles in the search space. The proposed approach is first validated through implementing into benchmark test cases with comparisons. It is then applied to structural damage identification with piezoelectric admittance experimental signals. `The results highlight the capability of the algorithm to identify a small solution set with high accuracy to match the actual damage scenario.

Yang Zhang↗

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)↗