Search NASASearch

SEARCH · Search NASA

Results for “global 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 37 records · Page 2

Electronic neural network for solving traveling salesman and similar global optimization problems

This invention is a novel high-speed neural network based processor for solving the 'traveling salesman' and other global optimization problems. It comprises a novel hybrid architecture employing a binary synaptic array whose embodiment incorporates the fixed rules of the problem, such as the number of cities to be visited. The array is prompted by analog voltages representing variables such as distances. The processor incorporates two interconnected feedback networks, each of which solves part of the problem independently and simultaneously, yet which exchange information dynamically.

Thakoor, Anilkumar P.

Global optimality of extremals: An example

The question of the existence and location of Darboux points is crucial for minimally sufficient conditions for global optimality and for computation of optimal trajectories. A numerical investigation is presented of the Darboux points and their relationship with conjugate points for a problem of minimum fuel, constant velocity, and horizontal aircraft turns to capture a line. This simple second order optimal control problem shows that ignoring the possible existence of Darboux points may play havoc with the computation of optimal trajectories.

Kreindler, E.

Global optimization of harmonic oscillator basis in covariant density functional theory

The present investigation focuses on the improvement of the accuracy of the description of binding energies within moderately sized fermionic basis. Using the solutions corresponding to infinite fermionic basis it was shown that in the case of meson exchange (ME) covariant energy density functionals (CEDFs) the global accuracy of the description of binding energies in the finite $N_F$ = 16 - 20 bases can be drastically (by a factor ranging from ~3 up to ~9 dependent on the functional and $N_F$) improved by a global optimization of oscillator frequency of the basis. This is a consequence of the unique feature of the ME functionals in which with increasing fermionic basis size fermionic and mesonic energies approach the exact (infinite basis) solution from above and below, respectively. As a consequence, an optimal oscillator frequency $\hbar\omega_0$ of the basis can be defined which provides an accurate reproduction of exact total binding energies by the ones calculated in truncated basis. This leads to a very high accuracy of the calculations in moderately sized $N_F=20$ basis when mass dependent oscillator frequency is used: global rms differences $\delta B_{rms}$ between the binding energies calculated in infinite and truncated bases are only 0.025 MeV and 0.031 MeV for the NL5(Z) and DD-MEZ functionals, respectively. Optimized values of the oscillator frequency $\hbar\omega_0$ are provided for three major classes of CEDFs, i.e. for density dependent meson exchange functionals, nonlinear meson exchange ones and point coupling functionals.

Binding energy & masses

Global Optimization of N-Maneuver, High-Thrust Trajectories Using Direct Multiple Shooting

The performance of impulsive, gravity-assist trajectories often improves with the inclusion of one or more maneuvers between flybys. However, grid-based scans over the entire design space can become computationally intractable for even one deep-space maneuver, and few global search routines are capable of an arbitrary number of maneuvers. To address this difficulty a trajectory transcription allowing for any number of maneuvers is developed within a multi-objective, global optimization framework for constrained, multiple gravity-assist trajectories. The formulation exploits a robust shooting scheme and analytic derivatives for computational efficiency. The approach is applied to several complex, interplanetary problems, achieving notable performance without a user-supplied initial guess.

optimization

Global Optimization of N-Maneuver, High-Thrust Trajectories Using Direct Multiple Shooting

The performance of impulsive, gravity-assist trajectories often improves with the inclusion of one or more maneuvers between flybys. However, grid-based scans over the entire design space can become computationally intractable for even one deep-space maneuver, and few global search routines are capable of an arbitrary number of maneuvers. To address this difficulty a trajectory transcription allow-ing for any number of maneuvers is developed within a multi-objective, global optimization framework for constrained, multiple gravity-assist trajectories. The formulation exploits a robust shooting scheme and analytic derivatives for com-putational efficiency. The approach is applied to several complex, interplanetary problems, achieving notable performance without a user-supplied initial guess.

trajectory design

Globally Optimal Band Structure for Thermoelectrics in Realistic Systems

One of the ultimate questions in the field of thermoelectrics is the optimal band structure for the figure of merit. The observation made here is that a linear band dispersion, of any dimension, under acoustic-phonon-deformation-potential scattering comprises the theoretical regimen for delivering boxcar transport distribution, which has been mathematically proven to deliver optimum figure of merit. This is guaranteed by the interplay of the energy-dependencies of groupvelocity and density of states of linear dispersion as well as the energy-behavior of deformation-potential scattering. Then linear dispersion, capped with optimum bandwidth and combined with provisions of Park et al, npj Comput. Mater. 7, 43 2021, is the globally optimal band structure for thermoelectricity.

Junsoo Park

Integration of Structural Analysis and Manufacturing Process Planning for Global Optimization with Automated Fiber Placement

Design of mass-efficient composite structures intended for Automated Fiber Placement (AFP) requires close interaction between structural analysis and manufacturing process planning. Tools exist for each of these disciplines, but software interplay has been insufficient for rapid and efficient design iteration. Within the NASA Advanced Composites Consortium (ACC), the Design for Manufacturing (DFM) task has made significant progress towards linking these disciplines and respective software – HyperX (design), CAPP (process planning), and VCP (tool path generation). The initial focus in previous work was on data exchange between disciplines. The ability to both export and consume composite design and manufacturing data to and from each tool. This paper focuses on the effort to automate and streamline the connection between the tools listed above, with the goal of being able to automatically generate a composite AFP design that is mass-efficient and manufacturable. The optimization method being pursued is a bi-level approach, where each tool performs optimization within its discipline. The optimization in HyperX is focused on mass and laminate strength, while CAPP is focused on maximizing manufacturability. VCP is used to generate fiber paths for each design iteration. These sub-processes are wrapped with a global level optimization, driven by HyperX, used to converge the design. This paper describes the current state of this effort, which is a completed HyperX-VCP iteration loop and initial work on the HyperX-CAPP iteration loop. Additionally, example results are shown for a wind blade structure with double curvature.

Automated Fiber Placement

Global Optimization of Interplanetary Trajectories in the Presence of Realistic Mission Contraints

Interplanetary missions are often subject to difficult constraints, like solar phase angle upon arrival at the destination, velocity at arrival, and altitudes for flybys. Preliminary design of such missions is often conducted by solving the unconstrained problem and then filtering away solutions which do not naturally satisfy the constraints. However this can bias the search into non-advantageous regions of the solution space, so it can be better to conduct preliminary design with the full set of constraints imposed. In this work two stochastic global search methods are developed which are well suited to the constrained global interplanetary trajectory optimization problem.

Design

Deep Learning without Global Optimization by Random Fourier Neural Networks

Here we introduce a new training algorithm for deep neural networks that utilize random complex exponential activation functions. Our approach employs a Markov chain Monte Carlo sampling procedure to iteratively train network layers, avoiding global and gradient-based optimization while maintaining error control. It consistently attains the theoretical approximation rate for residual networks with complex exponential activation functions, determined by network complexity. Additionally, it enables efficient learning of multiscale and high-frequency features, producing interpretable parameter distributions. Despite using sinusoidal basis functions, we do not observe Gibbs phenomena in approximating discontinuous target functions.

97 MATHEMATICS AND COMPUTING

On Global Optimal Sailplane Flight Strategy

The derivation and interpretation of the necessary conditions that a sailplane cross-country flight has to satisfy to achieve the maximum global flight speed is considered. Simple rules are obtained for two specific meteorological models. The first one uses concentrated lifts of various strengths and unequal distance. The second one takes into account finite, nonuniform space amplitudes for the lifts and allows, therefore, for dolphin style flight. In both models, altitude constraints consisting of upper and lower limits are shown to be essential to model realistic problems. Numerical examples illustrate the difference with existing techniques based on local optimality conditions.

Sander, G. J.

Strategies for Global Optimization of Temporal Preferences

A temporal reasoning problem can often be naturally characterized as a collection of constraints with associated local preferences for times that make up the admissible values for those constraints. Globally preferred solutions to such problems emerge as a result of well-defined operations that compose and order temporal assignments. The overall objective of this work is a characterization of different notions of global preference, and to identify tractable sub-classes of temporal reasoning problems incorporating these notions. This paper extends previous results by refining the class of useful notions of global temporal preference that are associated with problems that admit of tractable solution techniques. This paper also answers the hitherto open question of whether problems that seek solutions that are globally preferred from a Utilitarian criterion for global preference can be found tractably.

Morris, Paul

A Globally Optimal Minimax Solution for Spectral Overbounding and Factorization

In this paper, an algorithm is introduced to find a minimum phase transfer function of specified order whose magnitude "tightly" overbounds a specified real-valued nonparametric function of frequency. This method has direct application to transforming nonparametric uncertainty bounds (available from system identification experiments and/or plant modeling) into parametric representations required for modern robust control design software (i.e., a minimum-phase transfer function multiplied by a norm-bounded perturbation).

Scheid, Robert E.

A Global Optimization Methodology for Rocket Propulsion Applications

While the response surface method is an effective method in engineering optimization, its accuracy is often affected by the use of limited amount of data points for model construction. In this chapter, the issues related to the accuracy of the RS approximations and possible ways of improving the RS model using appropriate treatments, including the iteratively re-weighted least square (IRLS) technique and the radial-basis neural networks, are investigated. A main interest is to identify ways to offer added capabilities for the RS method to be able to at least selectively improve the accuracy in regions of importance. An example is to target the high efficiency region of a fluid machinery design space so that the predictive power of the RS can be maximized when it matters most. Analytical models based on polynomials, with controlled level of noise, are used to assess the performance of these techniques.

Source record

Global Optimization of Low-Thrust Interplanetary Trajectories Subject to Operational Constraints

Low-thrust electric propulsion provides many advantages for mission to difficult targets-Comets and asteroids-Mercury-Outer planets (with sufficient power supply)Low-thrust electric propulsion is characterized by high power requirements but also very high specific impulse (Isp), leading to very good mass fractions. Low-thrust trajectory design is a very different process from chemical trajectory.

optimization

Optimizing Global Coronal Magnetic Field Models Using Image-Based Constraints

The coronal magnetic field directly or indirectly affects a majority of the phenomena studied in the heliosphere. It provides energy for coronal heating, controls the release of coronal mass ejections, and drives heliospheric and magnetospheric activity, yet the coronal magnetic field itself has proven difficult to measure. This difficulty has prompted a decades-long effort to develop accurate, timely, models of the field, an effort that continues today. We have developed a method for improving global coronal magnetic field models by incorporating the type of morphological constraints that could be derived from coronal images. Here we report promising initial tests of this approach on two theoretical problems, and discuss opportunities for application.

Jones-Mecholsky, Shaela I.