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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 685 records · Page 38

All sources NASA NTRS DOE OSTI

NASA NTRS1993

A time optimal Space Station reboost guidance strategy

A closed-loop guidance strategy for time and fuel optimal reboost of Space Station Freedom is discussed in this paper. The reboost maneuver is formulated as an optimal control problem rather than a parameter optimization problem, the parameters being the thrust switching times. In the present approach the thrust switching structure need not be prescribed a priori to solve the resulting two point boundary value problem. Non-optimality of singular control or intermediate thrust is proved by utilizing the second order Kelley condition or the Generalized Legendre-Clebsch condition. Only a few sets of initial co-states and time-to-go guess values need to be stored on-board for a wide range of reboost scenarios.

Kumar, Renjith R.↗

NASA NTRS1993

A time-optimal Space Station reboost guidance strategy

Kumar, Renjith R.↗

NASA NTRSDate not supplied

Learning Based Edge Computing in Air-to-Air Communication Network

This paper studies learning-based edge computing and communication in a dynamic Air-to-Air Ad-hoc Network (AAAN). Due to spectrum scarcity, we assume the number of Air-to-Air (A2A) communication links is greater than that of the available frequency channels, such that some communication links have to share the same channel, causing co-channel interference. We formulate the joint channel selection and power control optimization problem to maximize the aggregate spectrum utilization efficiency under resource and fairness constraints. A distributed deep Q learning-based edge computing and communication algorithm is proposed to find the optimal solution. In particular, we design two different neural network structures and each communication link can converge to the optimal operation by exploiting only the local information from its neighbors, making it scalable to large networks. Finally, experimental results demonstrate the effectiveness of the proposed solution in various AAAN scenarios.

Zhe Wang↗

NASA NTRS1986

Intractable computations without local minima

An NP-complete problem which is not a spin-glass is exhibited. The NP-complete problem 3-satisfiability is also embedded into a continuous analog system with no hills in the energy landscape obstructing solution of the problem. There is, however, a large flat plateau. This shows how sculpting of the energy surfaces of continuous analog systems to remove hills may fail to aid solution of embedded combinatorial optimization problems.

Baum, Eric B.↗

NASA NTRS1990

Aircraft design for mission performance using nonlinear multiobjective optimization methods

A new technique which converts a constrained optimization problem to an unconstrained one where conflicting figures of merit may be simultaneously considered was combined with a complex mission analysis system. The method is compared with existing single and multiobjective optimization methods. A primary benefit from this new method for multiobjective optimization is the elimination of separate optimizations for each objective, which is required by some optimization methods. A typical wide body transport aircraft is used for the comparative studies.

Dovi, Augustine R.↗

NASA NTRS2008

Optimal Planning and Problem-Solving

CTAEMS MDP Optimal Planner is a problem-solving software designed to command a single spacecraft/rover, or a team of spacecraft/rovers, to perform the best action possible at all times according to an abstract model of the spacecraft/rover and its environment. It also may be useful in solving logistical problems encountered in commercial applications such as shipping and manufacturing. The planner reasons around uncertainty according to specified probabilities of outcomes using a plan hierarchy to avoid exploring certain kinds of suboptimal actions. Also, planned actions are calculated as the state-action space is expanded, rather than afterward, to reduce by an order of magnitude the processing time and memory used. The software solves planning problems with actions that can execute concurrently, that have uncertain duration and quality, and that have functional dependencies on others that affect quality. These problems are modeled in a hierarchical planning language called C_TAEMS, a derivative of the TAEMS language for specifying domains for the DARPA Coordinators program. In realistic environments, actions often have uncertain outcomes and can have complex relationships with other tasks. The planner approaches problems by considering all possible actions that may be taken from any state reachable from a given, initial state, and from within the constraints of a given task hierarchy that specifies what tasks may be performed by which team member.

Clemet, Bradley↗

NASA NTRS1997

Towards a Self-Configuring Optimization System for Spacecraft Design

In this paper, we propose the use of a set of generic, metaheuristic optimization algorithms, which is configured for a particular optimization problem by an adaptive problem solver based on artificial intelligence and machine learning techniques. We describe work in progress on these principles.

Metaheuristic Optimization Algorithm OASIS↗

NASA NTRS2018

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

Monotonic Basin Hopping has been shown to be an effective method of solving low thrust trajectory optimization problems. This paper outlines an extension to the common serial implementation by parallelizing it over any number of available compute cores. The Parallel Monotonic Basin Hopping algorithm described herein is shown to be an effective way to more quickly locate feasible solutions, and improve locally optimal solutions in an automated way without requiring a feasible initial guess. The increased speed achieved through parallelization enables the algorithm to be applied to more complex problems that would otherwise be impractical for a serial implementation. Low thrust cislunar transfers and a hybrid Mars example case demonstrate the effectiveness of the algorithm. Finally, a preliminary scaling study quantifies the expected decrease in solve time compared to a serial implementation.,

McCarty, Steven L.↗

NASA NTRS2018

Parallel Monotonic Basin Hopping for Low Thrust Trajectory Optimization

McCarty, Steven L.↗

DOE OSTI2025

A randomized sketching trust-region secant method for low-memory dynamic optimization

The numerical solution of dynamic optimization problems is often limited by the memory required to store the state trajectory, which is used to evaluate the objective function and its derivatives. Recently, [R. Muthukumar et al., SIAM Journal on Optimization 31(2), pp. 1242–1275 (2021)] introduced a trust-region method for dynamic optimization that employs randomized sketching to compress the state trajectory, resulting in inexact derivative computations. By adaptively learning the sketch rank, the trust-region algorithm achieves rigorous convergence guarantees. Here, we extend this approach to use secant Hessian approximations. Due to the randomness introduced by the sketch, the traditional secant update formulae can produce poor Hessian approximations. In particular, the difference of two gradients, computed from two different sketches, may be inconsistent. To overcome this, we employ a sketched approximation of the Hessian application, in lieu of computing the gradient difference. We numerically demonstrate the improved stability of this approach on an example from PDE-constrained optimization.

dynamic optimization↗

NASA NTRS1989

Aircraft design for mission performance using non-linear multiobjective optimization methods

A new technique which converts a constrained optimization problem to an unconstrained one where conflicting figures of merit may be simultaneously considered has been combined with a complex mission analysis system. The method is compared with existing single and multiobjective optimization methods. A primary benefit from this new method for multiobjective optimization is the elimination of separate optimizations for each objective, which is required by some optimization methods. A typical wide body transport aircraft is used for the comparative studies.

Dovi, Augustine R.↗

NASA NTRS2002

Turbomachinery Airfoil Design Optimization Using Differential Evolution

An aerodynamic design optimization procedure that is based on a evolutionary algorithm known at Differential Evolution is described. Differential Evolution is a simple, fast, and robust evolutionary strategy that has been proven effective in determining the global optimum for several difficult optimization problems, including highly nonlinear systems with discontinuities and multiple local optima. The method is combined with a Navier-Stokes solver that evaluates the various intermediate designs and provides inputs to the optimization procedure. An efficient constraint handling mechanism is also incorporated. Results are presented for the inverse design of a turbine airfoil from a modern jet engine and compared to earlier methods. The capability of the method to search large design spaces and obtain the optimal airfoils in an automatic fashion is demonstrated. Substantial reductions in the overall computing time requirements are achieved by using the algorithm in conjunction with neural networks.

Madavan, Nateri K.↗

NASA NTRS2002

Turbomachinery Airfoil Design Optimization Using Differential Evolution

An aerodynamic design optimization procedure that is based on a evolutionary algorithm known at Differential Evolution is described. Differential Evolution is a simple, fast, and robust evolutionary strategy that has been proven effective in determining the global optimum for several difficult optimization problems, including highly nonlinear systems with discontinuities and multiple local optima. The method is combined with a Navier-Stokes solver that evaluates the various intermediate designs and provides inputs to the optimization procedure. An efficient constraint handling mechanism is also incorporated. Results are presented for the inverse design of a turbine airfoil from a modern jet engine. The capability of the method to search large design spaces and obtain the optimal airfoils in an automatic fashion is demonstrated. Substantial reductions in the overall computing time requirements are achieved by using the algorithm in conjunction with neural networks.

Madavan, Nateri K.↗

NASA NTRS2004

Product Distributions for Distributed Optimization

With connections to bounded rational game theory, information theory and statistical mechanics, Product Distribution (PD) theory provides a new framework for performing distributed optimization. Furthermore, PD theory extends and formalizes Collective Intelligence, thus connecting distributed optimization to distributed Reinforcement Learning (FU). This paper provides an overview of PD theory and details an algorithm for performing optimization derived from it. The approach is demonstrated on two unconstrained optimization problems, one with discrete variables and one with continuous variables. To highlight the connections between PD theory and distributed FU, the results are compared with those obtained using distributed reinforcement learning inspired optimization approaches. The inter-relationship of the techniques is discussed.

Bieniawski, Stefan R.↗

NASA NTRSDate not supplied

Integrated Framework to Enable Design Space Exploration of In-Space Transportation Architectures

Even with the recent shift in focus of NASA’s human spaceflight program towards the Moon, the long-term goal continues to be crewed missions to Mars. Regardless of the accepted architecture, in-space transportation systems are a critical portion to achieving this goal. An emphasis is placed on presenting decision makers with many options early on to make an informed down-selection. Although current processes are able to address any aspects of the challenging underlying multi-disciplinary analysis and optimization problem of these advanced concepts, they are unable to comprehensively perform design space exploration inexpensively,potentially leaving attractive alternatives on the table. A design framework is proposed that is capable of enabling the integrated mission analysis, vehicle sizing and synthesis problem for in-space transportation architectures. This framework is enabled through the use of the vehicle synthesis tool, Dynamic Rocket Equation Tool, various subsystem sizing models, and low-thrust trajectory optimization codes. As a case study to demonstrate the framework, two design points of a hybrid propulsion stage concept, studied by Georgia Tech’s 2018 Revolutionary Aerospace Systems Concepts-Academic Linkage team, is explored.

Akshay Prasad↗

NASA NTRSDate not supplied

Integrated Framework to Enable Design Space Exploration of In-Space Transportation Architectures

Even with the recent shift in focus of NASA’s human spaceflight program towards the Moon, the long-term goal continues to be crewed missions to Mars. Regardless of the accepted architecture, in-space transportation systems are a critical portion to achieving this goal. An emphasis is placed on presenting decision makers with many options early on to make an informed down-selection. Although current processes are able to address any aspects of the challenging underlying multi-disciplinary analysis and optimization problem of these advanced concepts, they are unable to comprehensively perform design space exploration inexpensively, potentially leaving attractive alternatives on the table. A design framework is proposed that is capable of enabling the integrated mission analysis, vehicle sizing and synthesis problem for in-space transportation architectures. This framework is enabled through the use of the vehicle synthesis tool, Dynamic Rocket Equation Tool, various subsystem sizing models, and low-thrust trajectory optimization codes. As a case study to demonstrate the framework, two design points of a hybrid propulsion stage concept, studied by Georgia Tech’s 2018 Revolutionary Aerospace Systems Concepts-Academic Linkage team, is explored.

Akshay Prasad↗

NASA NTRS2020

Missed Thrust Analysis and Design for Low Thrust Cislunar Transfers

This paper details the analysis of the missed thrust problem for low thrust cislunar transfers. Missed thrust analysis is completed for a reference NRHO to DRO transfer that is designed to maximize the final mass without consideration of robustness to unexpected loss of thrust. A new missed thrust design method is presented to include the robustness of the transfer as part of the optimization problem by including a minimal number of branching trajectories tied to the start of thrust arcs in the reference transfer and optimizing them all simultaneously. Results from variations of this approach are presented for and compared to the reference transfer designed without consideration for missed thrust. The results show that this new method can reduce the additional propellant required for recovery from an unexpected 7-day outage by up to 90% without significant increase to the propellant required to complete the reference transfer.

Grebow, Daniel J.↗

DOE OSTI2024

Multi-scale Simulation, Calibration, and Optimization of Calcium Carbonate Precipitation in Microbial Communities

Ensuring the efficient engineering of microbially induced calcium carbonate precipitation (MICP) is crucial for a variety of environmental and civil engineering applications, such as soil stabilization and carbon sequestration. Addressing this need, we present a comprehensive multi-scale workflow that begins with the isolation of calcium carbonate-producing microbes from soil samples, followed by metagenomic sequencing and metabolic reconstruction. We then characterize microbial growth phenotypes under diverse nutrient conditions, compare observed growth with metabolic model predictions, and apply the Consistent Reproduction of Phenotype (CROP) algorithm to refine these models. Furthermore, we analyze metabolite consumption and production, and develop a consumer-resource model that is calibrated using time-series measurements of growth rates, pH levels, and calcium carbonate precipitation. The primary benefit of our approach lies in its ability to predict and control MICP outcomes, facilitated by a Bayesian methodology that incorporates priors on initial conditions and parameters. This allows us to compute posteriors by integrating experimental data, and to solve a risk optimization problem under uncertainty to identify nutrient conditions that maximize calcium carbonate production. In contrast to non-Bayesian methods, which fail to quantify uncertainty accurately, our approach provides a more reliable pathway to optimizing nutrient conditions, enhancing the likelihood of achieving desired MICP outcomes. This positions our method as a superior alternative in the quest to improve MICP through engineered microbial consortia.

54 ENVIRONMENTAL SCIENCES↗