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 487 records · Page 27

A Physical Model to Estimate Snowfall over Land using AMSU-B Observations

In this study, we present an improved physical model to retrieve snowfall rate over land using brightness temperature observations from the National Oceanic and Atmospheric Administration's (NOAA) Advanced Microwave Sounder Unit-B (AMSU-B) at 89 GHz, 150 GHz, 183.3 +/- 1 GHz, 183.3 +/- 3 GHz, and 183.3 +/- 7 GHz. The retrieval model is applied to the New England blizzard of March 5, 2001 which deposited about 75 cm of snow over much of Vermont, New Hampshire, and northern New York. In this improved physical model, prior retrieval assumptions about snowflake shape, particle size distributions, environmental conditions, and optimization methodology have been updated. Here, single scattering parameters for snow particles are calculated with the Discrete-Dipole Approximation (DDA) method instead of assuming spherical shapes. Five different snow particle models (hexagonal columns, hexagonal plates, and three different kinds of aggregates) are considered. Snow particle size distributions are assumed to vary with air temperature and to follow aircraft measurements described by previous studies. Brightness temperatures at AMSU-B frequencies for the New England blizzard are calculated using these DDA calculated single scattering parameters and particle size distributions. The vertical profiles of pressure, temperature, relative humidity and hydrometeors are provided by MM5 model simulations. These profiles are treated as the a priori data base in the Bayesian retrieval algorithm. In algorithm applications to the blizzard data, calculated brightness temperatures associated with selected database profiles agree with AMSU-B observations to within about +/- 5 K at all five frequencies. Retrieved snowfall rates compare favorably with the near-concurrent National Weather Service (NWS) radar reflectivity measurements. The relationships between the NWS radar measured reflectivities Z(sub e) and retrieved snowfall rate R for a given snow particle model are derived by a histogram matching technique. All of these Z(sub e)-R relationships fall in the range of previously established Z(sub e)-R relationships for snowfall. This suggests that the current physical model developed in this study can reliably estimate the snowfall rate over land using the AMSU-B measured brightness temperatures.

Kim, Min-Jeong↗

Multi-Band Atmospheric Correction Algorithm for Ocean Color Retrievals

NASA's current Atmospheric Correction (AC) algorithm for ocean color utilizes two bands and their ratio in the Near Infrared (NIR) to estimate aerosol reflectance and aerosol type. The algorithm then extrapolates the spectral dependence of aerosol reflectance to the visible wavelengths based on modeled spectral dependence of the identified aerosol type. Future advanced ocean color sensors, such as the Ocean Color Instrument (OCI) that will be carried on the Plankton, Aerosol, Cloud, and ocean Ecosystem (PACE) satellite, will be capable of measuring the hyperspectral radiance from 340 to 890 nm at 5-nm spectral resolution and at 7 discrete Short-wave Infrared (SWIR) channels: 940, 1038,1250, 1378, 1615, 2130, and 2260 nm. To optimally employ this unprecedented instrument capability, we propose an improved AC algorithm that utilizes all atmospheric-window channels in the NIR to SWIR spectral range to reduce the uncertainty in the AC process. A theoretical uncertainty analysis of this, namely Multi-Band AC (MBAC), indicates that the algorithm can reduce the uncertainty in remote sensing reflectance (Rrs) retrievals of the ocean caused by sensor random noise. Furthermore, in optically complex waters, where the NIR signal is affected by contributions from highly-reflective turbid waters, the MBAC algorithm can be adaptively weighted to the strongly-absorbing SWIR channels to enable improved ocean color retrievals in coastal waters. We provide here a description of the algorithm and demonstrate the improved performance in ocean color retrievals, relative to the current NASA standard AC algorithm, through comparison with field measurements and assessment of propagated uncertainties in applying the MBAC algorithm to MODIS and simulated PACE OCI data.

PACE↗

Multi-Objective Hybrid Optimal Control for Multiple-Flyby Low-Thrust Mission Design

Preliminary design of low-thrust interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys, the bodies at which those flybys are performed, and in some cases the final destination. In addition, a time-history of control variables must be chosen that defines the trajectory. There are often many thousands, if not millions, of possible trajectories to be evaluated. The customer who commissions a trajectory design is not usually interested in a point solution, but rather the exploration of the trade space of trajectories between several different objective functions. This can be a very expensive process in terms of the number of human analyst hours required. An automated approach is therefore very desirable. This work presents such an approach by posing the mission design problem as a multi-objective hybrid optimal control problem. The method is demonstrated on a hypothetical mission to the main asteroid belt.

Optimization↗

Controller reduction for effective interdisciplinary design of active structures

Control problems of large aerospace structures are intrinsically interdisciplinary and require strategies which address the complete interaction between flexible structures, electromechanical actuators and sensors, and feedback control algorithms. Current research and future directions which will require an interdisciplinary team effort in dynamics, control and optimization of such structures are being surveyed. It is generally agreed that the dynamics of space structures require large scale discrete modeling, resulting in thousands of discrete unknowns. Proven control strategies, on the other hand, employ a low order controller that is based on a reduced order model of structures. Integration of such low order controllers and large scale dynamics models often leads to serious deterioration of the closed loop stability margin and even instability. To alleviate this stability deterioration while low order controllers remain effective, the following approach was investigated: (1) retain low order controllers based on reduced order models of structures as the basic control strategy; (2) introduce a compensator that will directly account for the deterioration of stability margin due to controller-structure integration; and (3) assess overall performance of the integrated control structure system by developing measures of suboptimality in the combination of (1) and (2). The benefits include: simplicity in the design of basic controllers, thus facilitating the optimization of structure control interactions; increased understanding of the roles of the compensator so as to modify the structure as well as the basic controller, if necessary, for improved performance; and adaptability to localize controllers by viewing the compensator as a systems integration filter.

Balas, Mark J.↗

Aerodynamic shape optimization via sensitivity analysis on decomposed computational domains

Direct and iterative method considered to be most applicable to large systems of linear equations arising in discrete sensitivity analysis are assessed. Based on a single-domain grid, computations are performed using a banded matrix solver and an iterative solver, the generalized minimum residual (GMRES) method. The banded matrix solver is found to be generally the most economical method for those applications where the number of right-hand sides is large (i.e., a large number of design variables or a large number of adjoint vectors). For systems of equations that are too large to be solved by direct methods, an approach is proposed whereby the computational domain is divided into small subdomains, and each subdomain is solved separately.

Eleshaky, Mohamed E.↗

Applying Squeaky-Wheel Optimization Schedule Airborne Astronomy Observations

We apply the Squeaky Wheel Optimization (SWO) algorithm to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The problem contains complex constraints relating the feasibility of an astronomical observation to the position and time at which the observation begins, telescope elevation limits, special use airspace, and available fuel. Solving the problem requires making discrete choices (e.g. selection and sequencing of observations) and continuous ones (e.g. takeoff time and setting up observations by repositioning the aircraft). The problem also includes optimization criteria such as maximizing observing time while simultaneously minimizing total flight time. Previous approaches to the problem fail to scale when accounting for all constraints. We describe how to customize SWO to solve this problem, and show that it finds better flight plans, often with less computation time, than previous approaches.

Frank, Jeremy↗

Edge‐Driven Fringe‐Field Effects, Reduced Screening, and Bandgap Widening in Graphene Nanoribbons Enable Single‑Molecule Sensitivity

Graphene nanoribbons (GNRs) offer promising platforms for single‐molecule sensing due to their quasi‐1D channels and discrete electronic states, providing superior sensitivity toward molecular perturbations. While prior studies emphasize smoother edges as essential for optimal performance, the potential benefits of controlled edge roughness remain largely unexplored. Additionally, most investigations focus on GNR arrays, leaving critical edge‐ and width‐dependent factors, including fringe fields, bandgap widening, interactions between adsorbing molecules and GNR atoms, density of states (DOS) suppression, and electrostatic screening lengths, and their collective impact on sensitivity, poorly understood. Here, in this work, we fabricated field‐effect transistors using individual GNRs (widths: 200–20 nm) and characterized their response to molecular adsorption with perfluorooctanoic acid as the model analyte. Narrower ribbons displayed significantly enhanced sensitivity, yielding a coverage‐normalized response of 116 ± 10 mV per molecule in 20 nm‐wide GNRs (from calibrated ensemble Dirac‐point shifts). Experimental and theoretical analyses reveal that this heightened sensitivity arises from stronger fringe fields, width‐dependent quantum confinement effects, reduced DOS, and increased edge roughness that facilitates molecular anchoring, enhanced orbital overlap, and improved charge transfer efficiency. Our findings challenge the conventional assumption that smoother edges inherently enhance sensor performance, demonstrating that controlled edge disorder substantially boosts molecular sensitivity in GNR sensors.

36 MATERIALS SCIENCE↗

Polynomial compensation, inversion, and approximation of discrete time linear systems

The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion, and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the weighting patterns of certain linear systems. These, in turn, can be used in the recursive solution of the normal equation.

Baram, Yoram↗

Space Shuttle 2 advanced space transportation system, volume 2

To determine the best configuration from all candidate configurations, it was necessary first to calculate minimum system weights and performance. To optimize the design, it is necessary to vary configuration-specific variables such as total system weight, thrust-to-weight ratios, burn durations, total thrust available, and mass fraction for the system. Optimizing each of these variables at the same time is technically unfeasible and not necessarily mathematically possible. However, discrete sets of data can be generated which will eliminate many candidate configurations. From the most promising remaining designs, a final configuration can be selected. Included are the three most important designs considered: one which closely approximates the design criteria set forth in a Marshall Space Flight Center study of the Shuttle 2; the configuration used in the initial proposal; and the final configuration. A listing by cell of the formulas used to generate the aforementioned data is included for reference.

Adinaro, James N.↗

Fuel performance analysis of fully-resolved TRISO compact

The TRi-structural ISOtropic (TRISO) fuel multilayered coating structure offers multiple barriers to fission product release, enhancing safety and performance. The heterogeneous nature of TRISO fuel compacts, comprising thousands of randomly distributed coated fuel particles embedded in a graphite matrix, creates intricate stress fields and thermal gradients that cannot be accurately modeled using simplified one-dimensional or homogenized approaches. Consequently, three-dimensional modeling enables the prediction of fuel compact dimensional changes, internal pressure buildup, and fission product transport pathways under diverse irradiation and thermal conditions. This capability facilitates detailed analysis of particle-to-particle interactions, matrix cracking mechanisms, and the statistical distribution of coating failures, which directly impact fuel performance and safety margins. This capability is particularly critical for advanced reactors, such as high-temperature gas-cooled reactors and other Generation IV reactor designs where TRISO fuel operates at elevated temperatures and burn-up levels. This work introduces a novel method to generate an optimized packing of TRISO compacts and a complete 3D mesh with random distribution of TRISO particles, which are discretized into each coating component layer.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Adjoint-Based Design of Rotors Using the Navier-Stokes Equations in a Noninertial Reference Frame

Optimization of rotorcraft flowfields using an adjoint method generally requires a time-dependent implementation of the equations. The current study examines an intermediate approach in which a subset of rotor flowfields are cast as steady problems in a noninertial reference frame. This technique permits the use of an existing steady-state adjoint formulation with minor modifications to perform sensitivity analyses. The formulation is valid for isolated rigid rotors in hover or where the freestream velocity is aligned with the axis of rotation. Discrete consistency of the implementation is demonstrated by using comparisons with a complex-variable technique, and a number of single- and multipoint optimizations for the rotorcraft figure of merit function are shown for varying blade collective angles. Design trends are shown to remain consistent as the grid is refined.

Nielsen, Eric J.↗

Multi-Objective Hybrid Optimal Control for Multiple-Flyby Interplanetary Mission Design Using Chemical Propulsion

Preliminary design of high-thrust interplanetary missions is a highly complex process. The mission designer must choose discrete parameters such as the number of flybys and the bodies at which those flybys are performed. For some missions, such as surveys of small bodies, the mission designer also contributes to target selection. In addition, real-valued decision variables, such as launch epoch, flight times, maneuver and flyby epochs, and flyby altitudes must be chosen. There are often many thousands of possible trajectories to be evaluated. The customer who commissions a trajectory design is not usually interested in a point solution, but rather the exploration of the trade space of trajectories between several different objective functions. This can be a very expensive process in terms of the number of human analyst hours required. An automated approach is therefore very desirable. This work presents such an approach by posing the impulsive mission design problem as a multiobjective hybrid optimal control problem. The method is demonstrated on several real-world problems.

Trajectory↗

Adjoint Formulation for an Embedded-Boundary Cartesian Method

Many problems in aerodynamic design can be characterized by smooth and convex objective functions. This motivates the use of gradient-based algorithms, particularly for problems with a large number of design variables, to efficiently determine optimal shapes and configurations that maximize aerodynamic performance. Accurate and efficient computation of the gradient, however, remains a challenging task. In optimization problems where the number of design variables dominates the number of objectives and flow- dependent constraints, the cost of gradient computations can be significantly reduced by the use of the adjoint method. The problem of aerodynamic optimization using the adjoint method has been analyzed and validated for both structured and unstructured grids. The method has been applied to design problems governed by the potential, Euler, and Navier-Stokes equations and can be subdivided into the continuous and discrete formulations. Giles and Pierce provide a detailed review of both approaches. Most implementations rely on grid-perturbation or mapping procedures during the gradient computation that explicitly couple changes in the surface shape to the volume grid. The solution of the adjoint equation is usually accomplished using the same scheme that solves the governing flow equations. Examples of such code reuse include multistage Runge-Kutta schemes coupled with multigrid, approximate-factorization, line-implicit Gauss-Seidel, and also preconditioned GMRES. The development of the adjoint method for aerodynamic optimization problems on Cartesian grids has been limited. In contrast to implementations on structured and unstructured grids, Cartesian grid methods decouple the surface discretization from the volume grid. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin e t al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation.

Nemec, Marian↗

Lila: Optimal Dispatching in Probabilistic Temporal Networks using Monte Carlo Tree Search

Executing a Probabilistic Simple Temporal Network (PSTN) amounts at scheduling, i.e. \textit{dispatch}, a set of events under time uncertainty. This constitutes a NP-hard online optimization problem. The right execution time must be dynamically assigned to each event of the PSTN such that the temporal constraints are met, whereas activity durations are progressively observed as the execution unfolds. We propose a dispatching algorithm based on Monte Carlo Tree Search, called Lila, with the following characteristics: (i) it is an anytime algorithm, both offline and online, proven asymptotically optimal; (ii) it returns the current probability of success, either before or at any moment during operations; (iii) it handles any possible continuous or discrete, even non-parametric, probability distributions, as well as inter-dependencies between random variables, exogenous and endogenous uncertainty; and (iv) can be easily extended to handle probabilistic external events, PSTNs with resources, PSTNs with cutoff times and precondition chains, etc. Lila is universal in the sense that it can handle any dispatching protocol, simply by specifying it to the algorithm. It has the unlimited flexibility offered by the simulation paradigm, whilst it asymptotically converges to optimal decisions and/or robustness approximations.

Chien, Steve A.↗

Problem size, parallel architecture and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.↗

Problem size, parallel architecture, and optimal speedup

The communication and synchronization overhead inherent in parallel processing can lead to situations where adding processors to the solution method actually increases execution time. Problem type, problem size, and architecture type all affect the optimal number of processors to employ. The numerical solution of an elliptic partial differential equation is examined in order to study the relationship between problem size and architecture. The equation's domain is discretized into n sup 2 grid points which are divided into partitions and mapped onto the individual processor memories. The relationships between grid size, stencil type, partitioning strategy, processor execution time, and communication network type are analytically quantified. In so doing, the optimal number of processors was determined to assign to the solution, and identified (1) the smallest grid size which fully benefits from using all available processors, (2) the leverage on performance given by increasing processor speed or communication network speed, and (3) the suitability of various architectures for large numerical problems.

Nicol, David M.↗

Adjoint-Based Design of Rotors using the Navier-Stokes Equations in a Noninertial Reference Frame

Optimization of rotorcraft flowfields using an adjoint method generally requires a time-dependent implementation of the equations. The current study examines an intermediate approach in which a subset of rotor flowfields are cast as steady problems in a noninertial reference frame. This technique permits the use of an existing steady-state adjoint formulation with minor modifications to perform sensitivity analyses. The formulation is valid for isolated rigid rotors in hover or where the freestream velocity is aligned with the axis of rotation. Discrete consistency of the implementation is demonstrated using comparisons with a complex-variable technique, and a number of single- and multi-point optimizations for the rotorcraft figure of merit function are shown for varying blade collective angles. Design trends are shown to remain consistent as the grid is refined.

Nielsen, Eric J.↗

Improving ADAM through an implicit-explicit (IMEX) time-stepping approach

The ADAM optimizer, often used in machine learning for neural network training, corresponds to an underlying ordinary differential equation (ODE) in the limit of very small learning rates. Here, this work shows that the classical ADAM algorithm is a first-order implicit-explicit (IMEX) Euler discretization of the underlying ODE. Employing the time discretization point of view, we propose new extensions of the ADAM scheme obtained by using higher-order IMEX methods to solve the ODE. Based on this approach, we derive a new optimization algorithm for neural network training that performs better than classical ADAM on several regression and classification problems.

97 MATHEMATICS AND COMPUTING↗