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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

Optimal trajectory generation for mechanical arms

A general method of generating optimal trajectories between an initial and a final position of an n degree of freedom manipulator arm with nonlinear equations of motion is proposed. The method is based on the assumption that the time history of each of the coordinates can be expanded in a series of simple time functions. By searching over the coefficients of the terms in the expansion, trajectories which minimize the value of a given cost function can be obtained. The method has been applied to a planar three degree of freedom arm.

Iemenschot, J. A.↗
NASA NTRS1989

Computing Optimal Multiarc Trajectories

Optimal Multi-Arc Trajectories (OMAT) computer program designed to calculate solution to optimal-trajectory problem in cases of low thrust-to-weight ratios. Developed for two-body exoatmospheric problem with three degrees of freedom in inverse-square force field. Offers two different options: impulsive changes in velocity and finite burns with low thrust-to-weight ratios. Two distinct solutions available from program: optimal multi-impulse (OMI) solution and optimal multiburn (OMB) solution. Two solutions obtained separately, or results of OMI solution used to guess unknown parameters of OMB solution. Written for DEC VAX-series computer. Written completely in FORTRAN 77.

Jezewski, Donald J.↗
NASA NTRS2012

A Robust Initialization Scheme for a Lateral Trajectory Optimization Problem with Time of Arrival Windows

We present a robust initialization scheme that estimates parameter values for the numerical solution of a two-point boundary value problem. The two-point boundary value problem formulation stems from the optimization of a cost functional subject to the dynamics of a simplified lateral aircraft model and other constraints. Leveraging regular perturbation methods, initial parameter estimates are analytically determined and used to initialize a gradient descent optimization routine which is shown to rapidly converge over a range of initial aircraft positions and heading angles. Additionally, the velocity of the aircraft is optimized to ensure the trajectory of the aircraft terminates within a desired region in both time and space.

lateral trajectory optimization↗
NASA NTRS1985

A preliminary study of the basic display/guidance requirements for flying near optimal trajectories

NASA has responded to the increased emphases on cost-efficient operation of today's airline fleet with an ongoing research program to investigate the requirements and benefits of using new airborne guidance and pilot procedures designed to yield cost-optimal flight profiles that are compatible with advanced air traffic control system concepts. A trajectory optimization algorithm has been incorporated into one of NASA Langley's fixed-based simulators to investigate the pilot/cockpit interface requirements. The trajectories that are generated by this algorithm differ from conventional profiles in that they are constantly varying in both flight path angle and airspeed. Considering the dynamic nature of these profiles, conventional guidance may be insufficient for practical use. This paper summarizes the results of an initial set of piloted simulation tests to investigate the basic guidance requirements for flying the near-optimal trajectories.

Vicroy, D. D.↗
NASA NTRS1974

Shuttle ascent trajectory optimization with function space quasi-Newton techniques

A Space Shuttle ascent trajectory optimization problem from lift-off to orbital insertion is solved with a function space version of a quasi-Newton parameter optimization method developed by Broyden. The problem includes five parameter and one bounded-function controls, two state-variable constraints, and four terminal conditions. The bounded controls are treated directly, while the remaining constraints are adjoined to the performance index (maximum payload) with penalty functions. The problem is formulated as a four-phase variational problem (liftoff, pitch-over, gravity-turn, linear tangent steering), and the appropriate gradients are developed by first variation theory. A projection operator is introduced to aid in the interpretation of the algorithm with mixed parameter and function controls.

Edge, E. R.↗
NASA NTRS1980

Application of an advanced trajectory optimization method to ramjet propelled missiles

The mission performance characteristics of ramjet-propelled missiles are highly dependent upon the trajectory flown. Integration of the trajectory profile with the ramjet propulsion system performance characteristics to achieve optimal missile performance is very complex. Past trajectory optimization methods have been extremely problem dependent and require a high degree of familiarity to achieve success. A general computer code (CTOP) has been applied to ramjet-powered missiles to compute open-loop optimal trajectories. CTOP employs Chebyshev polynomial representations of the states and controls. This allows a transformation of the continuous optimal control problem to one of parameter optimization. With this method, the trajectory boundary conditions are always satisfied. State dynamics and path constraints are enforced via penalty functions. The presented results include solutions to minimum fuel-to-climb, minimum time-to-climb, and minimum time-to-target intercept problems.

Paris, S. W.↗
NASA NTRS2014

Design of the VISITOR Tool: A Versatile ImpulSive Interplanetary Trajectory OptimizeR

The design of trajectories for interplanetary missions represents one of the most complex and important problems to solve during conceptual space mission design. To facilitate conceptual mission sizing activities, it is essential to obtain sufficiently accurate trajectories in a fast and repeatable manner. To this end, the VISITOR tool was developed. This tool modularly augments a patched conic MGA-1DSM model with a mass model, launch window analysis, and the ability to simulate more realistic arrival and departure operations. This was implemented in MATLAB, exploiting the built-in optimization tools and vector analysis routines. The chosen optimization strategy uses a grid search and pattern search, an iterative variable grid method. A genetic algorithm can be selectively used to improve search space pruning, at the cost of losing the repeatability of the results and increased computation time. The tool was validated against seven flown missions: the average total mission (Delta)V offset from the nominal trajectory was 9.1%, which was reduced to 7.3% when using the genetic algorithm at the cost of an increase in computation time by a factor 5.7. It was found that VISITOR was well-suited for the conceptual design of interplanetary trajectories, while also facilitating future improvements due to its modular structure.

Corpaccioli, Luca↗
NASA NTRS2005

Six-Degree-of-Freedom Trajectory Optimization Utilizing a Two-Timescale Collocation Architecture

Six-degree-of-freedom (6DOF) trajectory optimization of a reentry vehicle is solved using a two-timescale collocation methodology. This class of 6DOF trajectory problems are characterized by two distinct timescales in their governing equations, where a subset of the states have high-frequency dynamics (the rotational equations of motion) while the remaining states (the translational equations of motion) vary comparatively slowly. With conventional collocation methods, the 6DOF problem size becomes extraordinarily large and difficult to solve. Utilizing the two-timescale collocation architecture, the problem size is reduced significantly. The converged solution shows a realistic landing profile and captures the appropriate high-frequency rotational dynamics. A large reduction in the overall problem size (by 55%) is attained with the two-timescale architecture as compared to the conventional single-timescale collocation method. Consequently, optimum 6DOF trajectory problems can now be solved efficiently using collocation, which was not previously possible for a system with two distinct timescales in the governing states.

Desai, Prasun N.↗
NASA NTRS1990

Discrete approximations to optimal trajectories using direct transcription and nonlinear programming

A recently developed method for solving optimal trajectory problems uses a piecewise-polynomial representation of the state and control variables, enforces the equations of motion via a collocation procedure, and thus approximates the original calculus-of-variations problem with a nonlinear-programming problem, which is solved numerically. This paper identifies this method as a direct transcription method and proceeds to investigate the relationship between the original optimal-control problem and the nonlinear-programming problem. The discretized adjoint equation of the collocation method is found to have deficient accuracy, and an alternate scheme which discretizes the equations of motion using an explicit Runge-Kutta parallel-shooting approach is developed. Both methods are applied to finite-thrust spacecraft trajectory problems, including a low-thrust escape spiral, a three-burn rendezvous, and a low-thrust transfer to the moon.

Enright, Paul J.↗