Search NASA⌕ Search

SEARCH · Search NASA

Results for “Trajectory 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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Constrained trajectory optimization for kinematically redundant arms

Two velocity optimization schemes for resolving redundant joint configurations are compared. The Extended Moore-Penrose Technique minimizes the joint velocities and avoids obstacles indirectly by adjoining a cost gradient to the solution. A new method can incorporate inequality constraints directly to avoid obstacles and singularities in the workspace. A four-link arm example is used to illustrate singularity avoidance while tracking desired end-effector paths.

Carignan, Craig R.↗
NASA NTRS1993

Trajectory optimization based on differential inclusion

A method for generating finite-dimensional approximations to the solutions of optimal control problems is introduced. By employing a description of the dynamical system in terms of its attainable sets in favor of using differential equations, the controls are completely eliminated from the system model. Besides reducing the dimensionality of the discretized problem compared to state-of-the-art collocation methods, this approach also alleviates the search for initial guesses from where standard gradient search methods are able to converge. The mechanics of the new method are illustrated on a simple double integrator problem. The performance of the new algorithm is demonstrated on a 1-D rocket ascent problem ('Goddard Problem') in presence of a dynamic pressure constraint.

Seywald, Hans↗
NASA NTRS1993

Trajectory optimization based on differential inclusion

A method for generating finite-dimensional approximations to the solutions of optimal control problems is introduced. By employing a description of the dynamical system in terms of its attainable sets in favor of using differential equations, the controls are completely eliminated from the system model. Besides reducing the dimensionality of the discretized problem compared to state-of-the-art collocation methods, this approach also alleviates the search for initial guesses from where standard gradient search methods are able to converge. The mechanics of the new method are illustrated on a simple double integrator problem. The performance of the new algorithm is demonstrated on a I-D rocket ascent problem ('Goddard Problem') in presence of a dynamic pressure constraint.

Seywald, Hans↗
NASA NTRS1989

Analysis of a turning point problem in flight trajectory optimization

The optimal control policy for the aeroglide portion of the minimum fuel, orbital plane change problem for maneuvering entry vehicles is reduced to the solution of a turning point problem for the bank angle control. For this problem a turning point occurs at the minimum altitude of the flight, when the flight path angle equals zero. The turning point separates the bank angle control into two outer solutions that are valid away from the turning point. In a neighborhood of the turning point, where the bank angle changes rapidly, an inner solution is developed and matched with the two outer solutions. An asymptotic analysis of the turning point problem is given, and an analytic example is provided to illustrate the construction of the bank angle control.

Gracey, C.↗
NASA NTRS1995

Analytical investigations in aircraft and spacecraft trajectory optimization and optimal guidance

A collection of analytical studies is presented related to unconstrained and constrained aircraft (a/c) energy-state modeling and to spacecraft (s/c) motion under continuous thrust. With regard to a/c unconstrained energy-state modeling, the physical origin of the singular perturbation parameter that accounts for the observed 2-time-scale behavior of a/c during energy climbs is identified and explained. With regard to the constrained energy-state modeling, optimal control problems are studied involving active state-variable inequality constraints. Departing from the practical deficiencies of the control programs for such problems that result from the traditional formulations, a complete reformulation is proposed for these problems which, in contrast to the old formulation, will presumably lead to practically useful controllers that can track an inequality constraint boundary asymptotically, and even in the presence of 2-sided perturbations about it. Finally, with regard to s/c motion under continuous thrust, a thrust program is proposed for which the equations of 2-dimensional motion of a space vehicle in orbit, viewed as a point mass, afford an exact analytic solution. The thrust program arises under the assumption of tangential thrust from the costate system corresponding to minimum-fuel, power-limited, coplanar transfers between two arbitrary conics. The thrust program can be used not only with power-limited propulsion systems, but also with any propulsion system capable of generating continuous thrust of controllable magnitude, and, for propulsion types and classes of transfers for which it is sufficiently optimal the results of this report suggest a method of maneuvering during planetocentric or heliocentric orbital operations, requiring a minimum amount of computation; thus uniquely suitable for real-time feedback guidance implementations.

Markopoulos, Nikos↗
NASA NTRS1993

Trajectory optimization based on differential inclusion

A method for generating finite-dimensional approximations to the solutions of optimal control problems is introduced. By employing a description of the dynamical system in terms of its attainable sets in favor of using differential equations, the controls are completely eliminated from the system model. Besides reducing the dimensionality of the discretized problem compared to state-of-the-art collocation methods, this approach also alleviates the search for initial guesses from where standard gradient search methods are able to converge. The mechanics of the new method are illustrated on a simple double integrator problem. The performance of the new algorithm is demonstrated on a 1-D rocket ascent problem (`Goddard Problem') in presence of a dynamic pressure constraint.

Seywald, Hans↗
NASA NTRS2002

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

In this paper we present a comparison of optimization approaches to 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, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

Hughes, Steven P.↗
NASA NTRS2007

Fuel-Optimal Trajectories in a Planet-Moon Environment Using Multiple Gravity Assists

For low energy spacecraft trajectories such as multi-moon orbiters for the Jupiter system, multiple gravity assists by moons could be used in conjunction with ballistic capture to drastically decrease fuel usage. In this paper, we outline a procedure to obtain a family of zero-fuel multi-moon orbiter trajectories, using a family of Keplerian maps derived by the first author previously. The maps capture well the dynamics of the full equations of motion; the phase space contains a connected chaotic zone where intersections between unstable resonant orbit manifolds provide the template for lanes of fast migration between orbits of different semimajor axes. Patched three body approach is used and the four body problem is broken down into two three-body problems, and the search space is considerably reduced by the use of properties of the Keplerian maps. We also introduce the notion of Switching Region where the perturbations due to the two perturbing moons are of comparable strength, and which separates the domains of applicability of the corresponding two Keplerian maps.

Ross, Shane D.↗
NASA NTRS2016

Traffic Aware Planner for Cockpit-Based Trajectory Optimization

The Traffic Aware Planner (TAP) software application is a cockpit-based advisory tool designed to be hosted on an Electronic Flight Bag and to enable and test the NASA concept of Traffic Aware Strategic Aircrew Requests (TASAR). The TASAR concept provides pilots with optimized route changes (including altitude) that reduce fuel burn and/or flight time, avoid interactions with known traffic, weather and restricted airspace, and may be used by the pilots to request a route and/or altitude change from Air Traffic Control. Developed using an iterative process, TAP's latest improvements include human-machine interface design upgrades and added functionality based on the results of human-in-the-loop simulation experiments and flight trials. Architectural improvements have been implemented to prepare the system for operational-use trials with partner commercial airlines. Future iterations will enhance coordination with airline dispatch and add functionality to improve the acceptability of TAP-generated route-change requests to pilots, dispatchers, and air traffic controllers.

Woods, Sharon E.↗
NASA NTRS2020

Optimizing Trajectories with Dymos

A live demonstration of the Open-Source trajectory analysis tool Dymos is given where it is used to solve a submarine intercept problem.

Falck, Robert D.↗
NASA NTRSDate not supplied

Trajectory Optimization for dynamic tool Systems Swapping

Develop capability to reliably execute a handoff of the grapple tool between two robot arms in difficult environments. Goals for the end of summer include evaluating different approaches to state estimation and determine optimal handoff poses based on a given scene.

Dominic Bisio↗