Engineering Papers⌕ Search

SEARCH · Engineering Papers

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,369 records · Page 76

(abstract) Optimal Low Thrust Trajectories Using Differential Inclusion Concepts

Low thrust propulsion systems typically have their greatest benefit for high energy missions or missions with large post-launch maneuver requirements. Missions which have been examined include main belt asteroid rendezvous, comet rendezvous, outer planet and Mercury orbiters, Pluto flyby, and solar probe missions. Low thrust mission design software used to determine these trajectories is based on two distinct formulations of the optimal control problem: the indirect and direct methods. The traditional approach (indirect) is to use the calculus of variations to obtain first order necessary conditions on the states and costates. In contrast, direct methods are conceptually different in that no explicit integration takes place. A direct method based on differential inclusion concepts has been developed and successfully used to compute low thrust trajectories. This new approach removes explicit control dependence from the problem thereby reducing the dimension of the parameter space for the nonlinear programming problem. Also when compared to other direct methods, fewer nonlinear constraints are required to represent the dynamics of the problem.

low↗

Convex Optimization Guidance for Precision Landing on Titan

Precision landing is an anticipated technology for future interplanetary missions. Autonomous spacecraft Entry, Descent and Landing (EDL) on the surface of a planetary body with a degree of precision in the order of meters is highly challenging. In this paper, a successive convexification guidance algorithm is utilized to simulate autonomous precision landing sequences on Saturn’s moon Titan. Due to its unique geophysical features, studying the science of matter within Titan’s atmosphere and beneath its surface is one of NASA’s most important planetary science objectives. As part of the Space Exploration Technology Directorate, a parafoil is proposed for landing on Titan due to its cost effectiveness, ease of deployment, low mass compared to the prospective payload and capabilities of precise autonomous delivery. This paper focuses on path optimization and guidance law development for high-fidelity dynamics parafoil tuning in the dense and adverse wind atmosphere of Titan, defined as a nonlinear and nonconvex optimal control problem. The powerful successive convexification method is used to solve the problem accordingly. The algorithm is designed such that the converged solution adheres to the nonlinear dynamics and kinematics in accordance with the original formulation, while respecting the state and control constraints. The six-degree-of-freedom (6DoF) simulations results show that this robust method is suitable for autonomous interplanetary applications.

Mooij, Edwin↗

Designing Trajectories Resilient to Missed Thrust Events Using Expected Thrust Fraction

With the adoption of efficient low-thrust propulsion methods, the probability of a missed thrust event occurring has become a significant concern for short and long- duration missions. If the missed thrust events take place during a critical portion of the trajectory, the mission can be compromised. Therefore, it is essential to de- velop trajectories that are resilient to missed thrust events. This paper investigates the use of expected thrust fraction, which embeds the stochastic nature of missed thrust events into a deterministic optimal control problem. The performance of trajectories designed using expected thrust fraction is compared with traditionally designed trajectories to measure changes in resiliency to missed thrust events. In this investigation, trajectories designed using expected thrust fraction arrive with a median lateness half that of traditionally designed trajectories. Using expected thrust fraction can help astrodynamicists mitigate risks posed by the use of low- thrust propulsion.

Laipert, Frank E.↗

Combinatorial Reasoning: Selecting Reasons in Generative AI Pipelines via Combinatorial Optimization

Recent Large Language Models (LLMs) have demonstrated impressive capabilities at tasks that require human intelligence and are a significant step towards human-like artificial intelligence (AI). Yet the performance of LLMs at reasoning tasks have been subpar and the reasoning capability of LLMs is a matter of significant debate. While it has been shown that the choice of the prompting technique to the LLM can alter its performance on a multitude of tasks, including reasoning, the best performing techniques require human-made prompts with the knowledge of the tasks at hand. We introduce a framework for what we call Combinatorial Reasoning (CR), a fully-automated prompting method, where reasons are sampled from an LLM pipeline and mapped into a Quadratic Unconstrained Binary Optimization (QUBO) problem. The framework investigates whether QUBO solutions can be profitably used to select a useful subset of the reasons to construct a Chain-of-Thought style prompt. We explore the acceleration of CR with specialized solvers. We also investigate the performance of simpler zero-shot strategies such as linear majority rule or random selection of reasons. Our preliminary study indicates that coupling a combinatorial solver to generative AI pipelines is an interesting avenue for AI reasoning and elucidates design principles for future CR methods.

combinatorial reasoning↗

Cascade Optimization Strategy for Aircraft and Air-Breathing Propulsion System Concepts

Design optimization for subsonic and supersonic aircraft and for air-breathing propulsion engine concepts has been accomplished by soft-coupling the Flight Optimization System (FLOPS) and the NASA Engine Performance Program analyzer (NEPP), to the NASA Lewis multidisciplinary optimization tool COMETBOARDS. Aircraft and engine design problems, with their associated constraints and design variables, were cast as nonlinear optimization problems with aircraft weight and engine thrust as the respective merit functions. Because of the diversity of constraint types and the overall distortion of the design space, the most reliable single optimization algorithm available in COMETBOARDS could not produce a satisfactory feasible optimum solution. Some of COMETBOARDS' unique features, which include a cascade strategy, variable and constraint formulations, and scaling devised especially for difficult multidisciplinary applications, successfully optimized the performance of both aircraft and engines. The cascade method has two principal steps: In the first, the solution initiates from a user-specified design and optimizer, in the second, the optimum design obtained in the first step with some random perturbation is used to begin the next specified optimizer. The second step is repeated for a specified sequence of optimizers or until a successful solution of the problem is achieved. A successful solution should satisfy the specified convergence criteria and have several active constraints but no violated constraints. The cascade strategy available in the combined COMETBOARDS, FLOPS, and NEPP design tool converges to the same global optimum solution even when it starts from different design points. This reliable and robust design tool eliminates manual intervention in the design of aircraft and of air-breathing propulsion engines where it eases the cycle analysis procedures. The combined code is also much easier to use, which is an added benefit. This paper describes COMETBOARDS and its cascade strategy and illustrates the capability of the combined design tool through the optimization of a subsonic aircraft and a high-bypass-turbofan wave-rotor-topped engine.

Patnaik, Surya N.↗

Low-Thrust Trajectory Optimization with Simplified SQP Algorithm

The problem of low-thrust trajectory optimization in highly perturbed dynamics is a stressing case for many optimization tools. Highly nonlinear dynamics and continuous thrust are each, separately, non-trivial problems in the field of optimal control, and when combined, the problem is even more difficult. This paper de-scribes a fast, robust method to design a trajectory in the CRTBP (circular restricted three body problem), beginning with no or very little knowledge of the system. The approach is inspired by the SQP (sequential quadratic programming) algorithm, in which a general nonlinear programming problem is solved via a sequence of quadratic problems. A few key simplifications make the algorithm presented fast and robust to initial guess: a quadratic cost function, neglecting the line search step when the solution is known to be far away, judicious use of end-point constraints, and mesh refinement on multiple shooting with fixed-step integration.In comparison to the traditional approach of plugging the problem into a “black-box” NLP solver, the methods shown converge even when given no knowledge of the solution at all. It was found that the only piece of information that the user needs to provide is a rough guess for the time of flight, as the transfer time guess will dictate which set of local solutions the algorithm could converge on. This robustness to initial guess is a compelling feature, as three-body orbit transfers are challenging to design with intuition alone. Of course, if a high-quality initial guess is available, the methods shown are still valid.We have shown that endpoints can be efficiently constrained to lie on 3-body repeating orbits, and that time of flight can be optimized as well. When optimizing the endpoints, we must make a trade between converging quickly on sub-optimal endpoints or converging more slowly on end-points that are arbitrarily close to optimal. It is easy for the mission design engineer to adjust this trade based on the problem at hand.The biggest limitation to the algorithm at this point is that multi-revolution transfers (greater than 2 revolutions) do not work nearly as well. This restriction comes in because the relationship between node 1 and node N becomes increasingly nonlinear as the angular distance grows. Trans-fers with more than about 1.5 complete revolutions generally require the line search to improve convergence. Future work includes: Comparison of this algorithm with other established tools; improvements to how multiple-revolution transfers are handled; parallelization of the Jacobian computation; in-creased efficiency for the line search; and optimization of many more trajectories between a variety of 3-body orbits.

Parrish, Nathan L.↗

A multilevel cost-space approach to solving the balanced long transportation problem

We develop a multilevel scheme for solving the balanced long transportation problem, that is, given a set (c(sub kj)) of shipping costs from a set of M supply nodes S(sub k) to a set of N demand nodes D(sub j), we seek to find a set of flows, (x(sub kj)), that minimizes the total cost Sigma(sub k=1)(exp M) Sigma(sub j=1)(exp N) x(sub kj)c(sub kj). We require that the problem be balanced, that is, the total demand must equal the total supply. Solution techniques for this problem are well known from optimization and linear programming. We examine this problem, however, in order to develop principles that can then be applied to more intractible problems of optimization. We develop a multigrid scheme for solving the problem, defining the grids, relaxation, and intergrid operators. Numerical experimentation shows that this line of research may prove fruitful. Further research directions are suggested.

Cavanaugh, Kevin J.↗

Runtime Thread-Block Optimization for Custom Multistream CUDA Kernels for the Glenn Research Center Communication Analysis Suite

In preparation of the return of humans to the Moon with the coming Artemis missions, NASA scientists must evaluate proposed landing site locations for terrain and communications viability. The Glenn Research Center Communication Analysis Suite (GCAS) combines sophisticated communication network models with accurate lunar terrain to access sites across the Moon’s south pole. Given the importance of proper site selection to crew safety and mission success, many locations need to be analyzed resulting in a large computational load needing to be performed. To meet the growing project demands, development has begun to improve the runtime efficiency of GCAS with GPU parallelization by way of multi-stream CUDA kernels. One of the most prominent factors in kernel optimization is the proper selection of thread-block dimensions in order to maximize the concurrent operation on the device. Typically, thread-block dimensions are optimized by hand requiring many stages of benchmarking and iteration. Additionally, given the main conditions to optimization are the physical GPU architecture and problem size, these optimal dimensions are non-portable and fragile in their scope. As such, a novel optimization routine was developed to generate the optimal thread-block dimensions during runtime with considerations to hardware specifications and problem size resolving the issues of portability and enabling the function of more dynamic routines.

Aden Bergstresser↗

Lagrange duality theory for convex control problems

The Lagrange dual to a control problem is studied. The principal result based on the Hahn-Banach theorem proves that the dual problem has an optimal solution if there exists an interior point for the constraint set. A complementary slackness condition holds, if the primal problem has an optimal solution. A necessary and sufficient condition for the optimality of solutions to the primal and the dual problem is also presented.

Hager, W. W.↗

CONSOLE: A CAD tandem for optimization-based design interacting with user-supplied simulators

CONSOLE employs a recently developed design methodology (International Journal of Control 43:1693-1721) which provides the designer with a congenial environment to express his problem as a multiple ojective constrained optimization problem and allows him to refine his characterization of optimality when a suboptimal design is approached. To this end, in CONSOLE, the designed formulates the design problem using a high-level language and performs design task and explores tradeoff through a few short and clearly defined commands. The range of problems that can be solved efficiently using a CAD tools depends very much on the ability of this tool to be interfaced with user-supplied simulators. For instance, when designing a control system one makes use of the characteristics of the plant, and therefore, a model of the plant under study has to be made available to the CAD tool. CONSOLE allows for an easy interfacing of almost any simulator the user has available. To date CONSOLE has already been used successfully in many applications, including the design of controllers for a flexible arm and for a robotic manipulator and the solution of a parameter selection problem for a neural network.

Fan, Michael K. H.↗

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

In this paper we present, a comparison of trajectory optimization approaches for the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP). Quasi- Newton and Nelder-Meade Simplex. Several cost function parameterizations are considered for the direct approach. We choose one direct approach that appears to be the most flexible. Both the direct and indirect methods are applied to a variety of test cases which are chosen to demonstrate the performance of each method in different flight regimes. The first test case is a simple circular-to-circular coplanar rendezvous. The second test case is an elliptic-to-elliptic line of apsides rotation. The final test case is an orbit phasing maneuver sequence in a highly elliptic orbit. For each test case we present a comparison of the performance of all methods we consider in this paper.

Hughes, Steven P.↗

Low-Earth Orbit Trajectory Optimization in the Presence of Atmospheric Uncertainty

The previous 20 to 25 years have seen a tremendous increase in space exploration, and with that an increase in the level of logistics planning needed to ensure mission success. For spacecraft that are designed to be periodically re-supplied, a key logistics consumable is propellant, as it constitutes the greatest up-mass on re-supply vehicles. A trajectory design strategy is therefore desired that minimizes propellant usage in order to ease the demand for propellant re-supply missions. This thesis develops such a strategy in three stages, and uses the International Space Station (ISS) as its testbed, as no other LEO spacecraft is more challenging from a space logistics standpoint. First, the ISS trajectory planning problem is formulated as a constrained burn optimization problem assuming a deterministic atmosphere. The cost function is total ∆v, with constraints imposed on longitude of ascending viii node (LAN) and semi-major axis (SMA) altitude. Analytic derivatives are constructed for both the cost and constraints, which are necessary given the 6-week to 2-year time frames being considered. A gradient-based optimizer is then utilized to find locally-optimal solutions to real-world ISS trajectory planning problems. Second, atmospheric uncertainty is addressed by constructing a probabilistic model of space weather data using Gaussian Processes (GPs). Bayesian inference is performed using the GP model to generate mean and covariance estimates for space weather predictions, whose pedigree is assessed against test data. The predictions are then mapped into atmospheric density via the analytic Jacchia-Roberts density model, and the effect of space weather uncertainty on orbital lifetime is examined. Third, an ISS burn execution uncertainty model is developed. This model, along with the space weather uncertainty model, are deployed in a linear covariance analysis to ascertain their combined effect on LAN and SMA altitude dispersions. The deterministic constraints from the original problem are re-formulated as stochastic constraints, where now the constraint uncertainty interval is required to fall within specified bounds. An updated optimization framework is constructed using the original ∆v cost function along with the stochastic constraints to solve the trajectory optimization problem under atmospheric uncertainty. Finally, the complete architecture is summarized for deployment in an operational setting.

Trajectory Optimization↗

System design optimization for a Mars-roving vehicle and perturbed-optimal solutions in nonlinear programming

Work in two somewhat distinct areas is presented. First, the optimal system design problem for a Mars-roving vehicle is attacked by creating static system models and a system evaluation function and optimizing via nonlinear programming techniques. The second area concerns the problem of perturbed-optimal solutions. Given an initial perturbation in an element of the solution to a nonlinear programming problem, a linear method is determined to approximate the optimal readjustments of the other elements of the solution. Then, the sensitivity of the Mars rover designs is described by application of this method.

Pavarini, C.↗

Abstract models for the synthesis of optimization algorithms.

Systematic approach to the problem of synthesis of optimization algorithms. Abstract models for algorithms are developed which guide the inventive process toward ?conceptual' algorithms which may consist of operations that are inadmissible in a practical method. Once the abstract models are established a set of methods for converting ?conceptual' algorithms falling into the class defined by the abstract models into ?implementable' iterative procedures is presented.

Meyer, G. G. L.↗

A real-time guidance algorithm for aerospace plane optimal ascent to low earth orbit

Problems of onboard trajectory optimization and synthesis of suitable guidance laws for ascent to low Earth orbit of an air-breathing, single-stage-to-orbit vehicle are addressed. A multimode propulsion system is assumed which incorporates turbojet, ramjet, Scramjet, and rocket engines. An algorithm for generating fuel-optimal climb profiles is presented. This algorithm results from the application of the minimum principle to a low-order dynamic model that includes angle-of-attack effects and the normal component of thrust. Maximum dynamic pressure and maximum aerodynamic heating rate constraints are considered. Switching conditions are derived which, under appropriate assumptions, govern optimal transition from one propulsion mode to another. A nonlinear transformation technique is employed to derived a feedback controller for tracking the computed trajectory. Numerical results illustrate the nature of the resulting fuel-optimal climb paths.

Calise, A. J.↗

Performance Trend of Different Algorithms for Structural Design Optimization

Nonlinear programming algorithms play an important role in structural design optimization. Fortunately, several algorithms with computer codes are available. At NASA Lewis Research Center, a project was initiated to assess performance of different optimizers through the development of a computer code CometBoards. This paper summarizes the conclusions of that research. CometBoards was employed to solve sets of small, medium and large structural problems, using different optimizers on a Cray-YMP8E/8128 computer. The reliability and efficiency of the optimizers were determined from the performance of these problems. For small problems, the performance of most of the optimizers could be considered adequate. For large problems however, three optimizers (two sequential quadratic programming routines, DNCONG of IMSL and SQP of IDESIGN, along with the sequential unconstrained minimizations technique SUMT) outperformed others. At optimum, most optimizers captured an identical number of active displacement and frequency constraints but the number of active stress constraints differed among the optimizers. This discrepancy can be attributed to singularity conditions in the optimization and the alleviation of this discrepancy can improve the efficiency of optimizers.

Patnaik, Surya N.↗