Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discrete Optimization”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Technology development program for the Space Infrared Telescope Facility (SIRTF) science instruments

A coordinated technology program for the Space Infrared Telescope Facility (SIRTF) is described. The program encompasses detector technology, cryogenic mechanisms technology, and an adiabatic demagnetization refrigerator. Discrete detectors, detector arrays, detector readouts, and testing of engineering models under simulated flight environment conditions are considered. Several focal planes will be optimized at a particular wavelength range to make up over 247,000 detector pixels from about 1.8 to 1000 microns.

Ramos, Ruben↗
NASA NTRS2012

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step.

Ono, Masahiro↗
NASA NTRS1991

Discrete observability and numerical quadrature

The authors consider the problem of approximate observability of a one-dimensional diffusion equation on a finite spatial domain with spatial point measurements. The problem of the optimal selection of the measurement points is considered under three conditions: (1) no preassigned measurement nodes; (2) one preassigned node and; (3) two preassigned nodes. The main observation is that the optimal choice is related to three classical procedures in numerical analysis: (1) Gaussian quadrature; (2) Radau quadrature and; (3) Lobatto quadrature. It is shown that the existence of the Radau and Lobatto quadrature is closely related to classical root locus theory.

Martin, Clyde F.↗
NASA NTRS1990

Shape design sensitivities using fully automatic 3-D mesh generation

Previous work in three dimensional shape optimization involved specifying design variables by associating parameters directly with mesh points. More recent work has shown the use of fully-automatic mesh generation based upon a parameterized geometric representation. Design variables have been associated with a mathematical model of the part rather than the discretized representation. The mesh generation procedure uses a nonuniform grid intersection technique to place nodal points directly on the surface geometry. Although there exists an associativity between the mesh and the geometrical/topological entities, there is no mathematical functional relationship. This poses a problem during certain steps in the optimization process in which geometry modification is required. For the large geometrical changes which occur at the beginning of each optimization step, a completely new mesh is created. However, for gradient calculations many small changes must be made and it would be too costly to regenerate the mesh for each design variable perturbation. For that reason, a local remeshing procedure has been implemented which operates only on the specific edges and faces associated with the design variable being perturbed. Two realistic design problems are presented which show the efficiency of this process and test the accuracy of the gradient computations.

Botkin, M. E.↗
NASA NTRS1987

Investigation, development, and application of optimal output feedback theory. Volume 3: The relationship between dynamic compensators and observers and Kalman filters

Relationships between observers, Kalman Filters and dynamic compensators using feedforward control theory are investigated. In particular, the relationship, if any, between the dynamic compensator state and linear functions of a discrete plane state are investigated. It is shown that, in steady state, a dynamic compensator driven by the plant output can be expressed as the sum of two terms. The first term is a linear combination of the plant state. The second term depends on plant and measurement noise, and the plant control. Thus, the state of the dynamic compensator can be expressed as an estimator of the first term with additive error given by the second term. Conditions under which a dynamic compensator is a Kalman filter are presented, and reduced-order optimal estimaters are investigated.

Broussard, John R.↗
DOE OSTI2025

Gaussian FLOWERS: Wind-rose-based analytical integration of Gaussian wake model for extremely fast AEP estimation

A major cost in the study of wind farm layout optimization is the repeated evaluation of the annual energy production (AEP). The current approach to estimating AEP requires a large set of flow simulations to be performed that cover each discrete wind speed and direction combination contained within the wind rose, followed by a probability-weighted sum of the power production resulting from each simulation. Even with inexpensive engineering wake models, this numerical integration scheme can lead to high computational costs. In this paper, we derive an analytical formulation for estimating farm AEP across every wind direction, based on a Gaussian wake velocity model, which reduces the number of wind farm simulations to a single function evaluation. As a result, we find that the Gaussian-FLOWERS approach reduces the time for AEP calculations by more than two orders of magnitude with a small trade-off in accuracy when compared to a conventional approach. This massive reduction in computation cost is useful to reduce overall costs in wind farm layout optimization studies.

17 WIND ENERGY↗
NASA NTRS1991

A comparison of two closely-related approaches to aerodynamic design optimization

Two related methods for aerodynamic design optimization are compared. The methods, called the implicit gradient approach and the variational (or optimal control) approach, both attempt to obtain gradients necessary for numerical optimization at a cost significantly less than that of the usual black-box approach that employs finite difference gradients. While the two methods are seemingly quite different, they are shown to differ (essentially) in that the order of discretizing the continuous problem, and of applying calculus, is interchanged. Under certain circumstances, the two methods turn out to be identical. We explore the relationship between these methods by applying them to a model problem for duct flow that has many features in common with transonic flow over an airfoil. We find that the gradients computed by the variational method can sometimes be sufficiently inaccurate to cause the optimization to fail.

Shubin, G. R.↗
DOE OSTI2025

Gaussian integral method for void fraction

Here, a novel method, the Gaussian Integral Method (GIM), is presented for calculating void fractions in Computational Fluid Dynamics–Discrete Element Method (CFD-DEM) simulations. GIM is versatile and applicable to various grid types, including structured and unstructured polyhedral meshes, without requiring special boundary treatments. An optimization technique is introduced to make GIM independent of grid resolution and type. The method is validated against experimental data from a fluidized bed, demonstrating that GIM produces realistic simulations closely resembling experimental observations. Additionally, unstructured polyhedral grids using GIM outperform structured grids of equivalent resolution, yielding results more aligned with experimental data. The gradient of the void fraction is computed in the CFD solver and utilized in the DEM solver for precise estimation at particle locations. Overall, GIM provides an effective solution for void fraction calculations in particulate media simulations with complex geometries, enhancing the accuracy and applicability of CFD-DEM simulations for industrial processes.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
NASA NTRS2016

An Optimized Multicolor Point-Implicit Solver for Unstructured Grid Applications on Graphics Processing Units

In the field of computational fluid dynamics, the Navier-Stokes equations are often solved using an unstructuredgrid approach to accommodate geometric complexity. Implicit solution methodologies for such spatial discretizations generally require frequent solution of large tightly-coupled systems of block-sparse linear equations. The multicolor point-implicit solver used in the current work typically requires a significant fraction of the overall application run time. In this work, an efficient implementation of the solver for graphics processing units is proposed. Several factors present unique challenges to achieving an efficient implementation in this environment. These include the variable amount of parallelism available in different kernel calls, indirect memory access patterns, low arithmetic intensity, and the requirement to support variable block sizes. In this work, the solver is reformulated to use standard sparse and dense Basic Linear Algebra Subprograms (BLAS) functions. However, numerical experiments show that the performance of the BLAS functions available in existing CUDA libraries is suboptimal for matrices representative of those encountered in actual simulations. Instead, optimized versions of these functions are developed. Depending on block size, the new implementations show performance gains of up to 7x over the existing CUDA library functions.

Zubair, Mohammad↗
DOE OSTI2024

Development of an Optical Library for Coevaporated CdSe x Te 1– x

The conversion efficiency of CdTe solar cells may be improved by bandgap engineering, i.e., changing the bandgap value through the addition of Se in the absorber. The Se alloying enables a short-circuit current density improvement, as it leads to a bandgap energy value decrease. Furthermore, it has been associated with increased minority carrier lifetimes, assuring high open-circuit voltage values. An Se gradient profile control can further optimize the solar cell performance. Thus, an optical model baseline of the CdSe x Te 1–x (CST) compound was developed. Spectroscopic ellipsometry measurements were conducted to accurately extract the optical constants of ten CST layers deposited through coevaporation with x varying from 0 to 1. Using the measured dielectric function spectra from the discrete CST layers with varying x, and considering the composition-induced shift in the critical point energies, an energy-shift model was employed to develop the accurate optical library for the CST compound for any x value to provide data for future modeling and optimization. Furthermore, the library accuracy was validated through optical simulations of the quantum efficiency of a graded CST solar cell using the finite-difference time-domain method by replicating the Se profile in the absorber layer measured through secondary ion mass spectrometry.

14 SOLAR ENERGY↗
NASA NTRS2016

Optimal Reorganization of NASA Earth Science Data for Enhanced Accessibility and Usability for the Hydrology Community

A long-standing "Digital Divide" in data representation exists between the preferred way of data access by the hydrology community and the common way of data archival by earth science data centers. Typically, in hydrology, earth surface features are expressed as discrete spatial objects (e.g., watersheds), and time-varying data are contained in associated time series. Data in earth science archives, although stored as discrete values (of satellite swath pixels or geographical grids), represent continuous spatial fields, one file per time step. This Divide has been an obstacle, specifically, between the Consortium of Universities for the Advancement of Hydrologic Science, Inc. and NASA earth science data systems. In essence, the way data are archived is conceptually orthogonal to the desired method of access. Our recent work has shown an optimal method of bridging the Divide, by enabling operational access to long-time series (e.g., 36 years of hourly data) of selected NASA datasets. These time series, which we have termed "data rods," are pre-generated or generated on-the-fly. This optimal solution was arrived at after extensive investigations of various approaches, including one based on "data curtains." The on-the-fly generation of data rods uses "data cubes," NASA Giovanni, and parallel processing. The optimal reorganization of NASA earth science data has significantly enhanced the access to and use of the data for the hydrology user community.

data rods↗
NASA NTRS1979

Automated vehicle guidance using discrete reference markers

Techniques for providing steering control for an automated vehicle using discrete reference markers fixed to the road surface are investigated analytically. Either optical or magnetic approaches can be used for the sensor, which generates a measurement of the lateral offset of the vehicle path at each marker to form the basic data for steering control. Possible mechanizations of sensor and controller are outlined. Techniques for handling certain anomalous conditions, such as a missing marker, or loss of acquisition, and special maneuvers, such as u-turns and switching, are briefly discussed. A general analysis of the vehicle dynamics and the discrete control system is presented using the state variable formulation. Noise in both the sensor measurement and in the steering servo are accounted for. An optimal controller is simulated on a general purpose computer, and the resulting plots of vehicle path are presented. Parameters representing a small multipassenger tram were selected, and the simulation runs show response to an erroneous sensor measurement and acquisition following large initial path errors.

Johnston, A. R.↗
NASA NTRS1999

Multi-Parent Clustering Algorithms from Stochastic Grammar Data Models

We introduce a statistical data model and an associated optimization-based clustering algorithm which allows data vectors to belong to zero, one or several "parent" clusters. For each data vector the algorithm makes a discrete decision among these alternatives. Thus, a recursive version of this algorithm would place data clusters in a Directed Acyclic Graph rather than a tree. We test the algorithm with synthetic data generated according to the statistical data model. We also illustrate the algorithm using real data from large-scale gene expression assays.

Mjoisness, Eric↗
NASA NTRS1994

Merging Intelligent Systems Technologies with CFD Analysis Strategies: Prototype Development at NASA Ames

A collaborative team of researchers from fields of Computational Fluid Dynamics (CFD), fluid physics, computer architectures, and computer science and knowledge engineering have begun work on a prototype system that addresses several of industry's concerns in using NASA-developed CFD codes as part of the design cycle. A major problem exists in the application of CFD technologies within the aeronautics design cycle due primarily to misunderstandings in the ranges of applicability of the various solver codes or turbulence models. Features that arise during the CFD solution process need to be discriminated and recognized as actual flow features with physical support in the geometry and flow conditions of the problem being solved, or as numerical or non-physical errors arising from mis-application of solver code and its parameters, gridding strategies, or discretization. interpolations. The fundamental concept is to develop an intelligent computational system that can accept the engineer's definition of the problem and construct an optimal CFD solution. To do this requires capturing both the knowledge of how to apply the various CFD tools and how to adapt the application of those tools to flow structures as they evolve during the flow simulation. Embedded within this adaptive system approach is the additional desire to automatically identify and quantify the quality of resolution of the pertinent flow structures, be they genuine or error-induced, and then to adjust the solution strategy accordingly. This paper discusses the status of that prototyping effort.

Thompson, David E.↗
NASA NTRS2002

Wavelet Approximation in Data Assimilation

Estimation of the state of the atmosphere with the Kalman filter remains a distant goal because of high computational cost of evolving the error covariance for both linear and nonlinear systems. Wavelet approximation is presented here as a possible solution that efficiently compresses both global and local covariance information. We demonstrate the compression characteristics on the the error correlation field from a global two-dimensional chemical constituent assimilation, and implement an adaptive wavelet approximation scheme on the assimilation of the one-dimensional Burger's equation. In the former problem, we show that 99%, of the error correlation can be represented by just 3% of the wavelet coefficients, with good representation of localized features. In the Burger's equation assimilation, the discrete linearized equations (tangent linear model) and analysis covariance are projected onto a wavelet basis and truncated to just 6%, of the coefficients. A nearly optimal forecast is achieved and we show that errors due to truncation of the dynamics are no greater than the errors due to covariance truncation.

Tangborn, Andrew↗
NASA NTRS2019

A Fast All-Sky Radiation Model for Solar Applications with Narrowband Irradiances on Tilted Surfaces (FARMS-NIT): Part II. The Cloudy-Sky Model

The Fast All-sky Radiation Model for Solar applications with Narrowband Irradiances on Tilted surfaces (FARMSNIT) reported in Part I of this study is enhanced to include the requirements for cloudy-sky conditions. Surface radiances in 2002 narrow-wavelength bands from 0.28 to 4.0 μm are analytically computed by solving the radiative transfer equation for five independent photon paths accounting for clear-sky absorption, Rayleigh scattering, and cloud absorption and scattering. The Simple Model of the Atmospheric Radiative Transfer of Sunshine (SMARTS) is used to provide the optical thickness of the clear-sky atmosphere. Unlike Part I, which approximates the computation of aerosol scattering using the single-scattering phase function, the cloud transmittance and reflectance are efficiently retrieved from a comprehensive look-up table pre-computed by a 32-stream DIScrete Ordinates Radiative Transfer (DISORT) model for possible cloud conditions as well as solar and viewing geometries. A resolution analysis is performed to assess the optimal balance between the computational efficiency and accuracy in the development of the look-up table. Model simulations by DISORT and TMYSPEC are used to evaluate the performance of FARMS-NIT under cloudy-sky conditions. Compared to DISORT, FARMS-NIT yields 2–3% uncertainties on average, but it substantially reduces the computational time because of the independent computation of cloud properties and the implementation of the look-up table. In contrast to TMYSPEC, which uses successive steps to empirically compute plane-of-array (POA) irradiances and spectral irradiances, FARMS-NIT directly solves spectral radiances from the radiative transfer equation, which profoundly increases the accuracy in surface irradiances, especially over inclined photovoltaics (PV) panels.

Xie, Yu↗
NASA NTRS2018

Area Coverage Planning with 3-axis Steerable, 2D Framing Sensors

Existing algorithms for Agile Earth Observing Satellites((Lemaitre et al. 2002)) were largely created for 1D line sensors that acquire images in linear swaths. However, imaging satellites increasingly use 2D framing sensors (cameras) that capture discrete rectangular images. We describe tiling step-stare approaches that are more suited to rectangular image footprints than are 1D swath-based algorithms. Optimal area planning for these 2D framing instruments is an NPcomplete problem and intractable for large areas, so we present four approximation algorithms. Strategies are compared against a prior 2D framing instrument algorithm (Knight 2014) in three computational experiments. The impact of observer agility on schedule makespan is examined. Makespans vary more as observer agility decreases toward a critical point, then vary less after the critical point, suggesting a possible problem phase transition.

Chien, Steve↗