Engineering PapersSearch

SEARCH · Engineering Papers

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 91 records · Page 5

Angles-Only Robust Trajectory Optimization for NRHO Rendezvous

This study demonstrates a robust trajectory optimization approach for rendezvous and proximity operations with angles-only navigation measurements. Often, sensors that directly measure relative range and velocity require communication or coordination between the chaser and target vehicle and can have limiting pointing accuracy, mass, or power requirements compared to angle measurement sensors. Thus, the capability to perform a rendezvous with only angle measurements can be advantageous for vehicle design and to improve robustness to failures. However, the well studied limitation of angles-only navigation in measuring range results in large uncertainties in the navigation system that must be reduced with chaser vehicle thrust maneuvers to induce observability in range for the navigation filter. This analysis presents a trajectory optimization problem for a lunar ascent rendezvous during a crewed lunar mission in a Near-Rectilinear Halo Orbit (NRHO) that is limited to only angle measurements. The objective of this study is to show that an angles-only rendezvous is feasible in an NRHO and to present the sensitivity to an assortment of constraints generated from a systematic optimization process using linear covariance analysis and particle swarm optimization. Linearized NRHO dynamics and linearized relative targeting are applied to use linear covariance analysis to determine the expected delta-v and trajectory dispersions due to initial state uncertainty, sensor errors, maneuver execution errors, and unmodeled dynamics. The delta-v and trajectory dispersions are passed into a particle swarm optimization algorithm to find the optimized maneuver profile that minimizes fuel use while satisfying constraints such as free drift and underburn to 3-sigma certainty. The trajectory constraints including time available, desired final uncertainty, and initial uncertainty are varied to ascertain sensitivity and desirable engineering trades.

Linear Covariance Analysis

Trajectory optimization for a National Launch System vehicle

A trajectory design process is presented for a proposed National Launch System (NLS) vehicle configuration. A software trajectory planner was developed to generate near optimal pitch plane trajectories for variable mission plans, variable launch site selections, and last minute wind conditions at the time of launch. In addition, the trajectory planner performs in-flight near optimal trajectory redesign in the event of an engine-out or unexpected wind dispersions. The trajectory planner iteratively simulates trial trajectories defined by variables corresponding to a parameterized trajectory shape. The trajectory planner optimizes these trajectory parameters according to the fuel used to realize the trajectories. For prelaunch scenarios, the trajectory planner generated near optimal trajectories of consistent fuel performance irrespective of the winds encountered at the launch site. In-flight trajectory redesigns were also shown to be effective in fulfilling the mission plan and preserving the structural integrity of the vehicle. The in-flight redesign results indicate that closed-loop guidance in the early stages of ascent is highly effective in accommodating engine failures or wind dispersions. All trajectory designs were verified using a 6DOF simulation with flight controllers.

Chen, Eugene S.

Numerical derivative techniques for trajectory optimization

The adoption of robust numerical optimization techniques in trajectory simulation programs has resulted in powerful design and analysis tools. These trajectory simulation/optimization programs are widely used, and a representative list includes the GTS system, the POST program, and newer collocation methods such as OTIS and FONPAC. All of these programs rely on optimization algorithms which require objective function and constraint gradient data during the iteration process. However, most trajectory optimization problems lack simple analytical expressions for these derivatives. In the general case a function evaluation involves integrating aerodynamic, propulsive, and gravity forces over multiple trajectory phases with complex control models. With the newer collocation methods, the integration is replaced by defect constraints and cubic approximations for the state. While analytic gradient expressions can sometimes be derived for trajectory optimization problems, the derivation is cumbersome, time consuming, and prone to mistakes. Fortunately, an alternate method exists for the gradient evaluation, namely finite difference approximations. In this paper some finite difference gradient techniques developed for use with the GTS system are presented. These techniques include methods for computing first and second partial derivatives of single and multiple sets of functions. A key feature of these methods is an error control mechanism which automatically adjusts the perturbation size to obtain accurate derivative values.

Hallman, Wayne P.

Rapid Trajectory Optimization for the ARES I Launch Vehicle

A simplified ascent trajectory optimization procedure has been developed with application to NASA's proposed Ares I launch vehicle. In the interest of minimizing bending loads and ensuring safe separation of the first-stage solid rocket motor, the vehicle is con- strained to follow a gravity-turn trajectory. This reduces the design space to just two free parameters, the pitch rate after a short vertical rise phase to clear the launch pad, and initial launch azimuth. The pitch rate primarily controls the in-plane parameters (altitude, speed, flight path angle) of the trajectory whereas the launch azimuth primarily controls the out-of-plane portion (velocity heading.) Thus, the optimization can be mechanized as two one-dimensional searches that converge quickly and reliably. The method is compared with POST-optimized trajectories to verify its optimality.

Dukeman, Greg A.

An Optimized Trajectory for a Two-Stage, Surface to Orbit Titan Launch Vehicle

As part of a NIAC funded Titan sample return mission, NASA GRC’s Compass Team has investigated a two-stage, in-situ propellant, launch vehicle design. This paper presents a proposed trajectory for the vehicle and mission of interest. This trajectory is optimally solved to balance drag losses in the denser atmosphere along with gravity losses accumulated during vehicle ascent to select an optimal path from Titan’s surface to a parking orbit. The resulting trajectory is characterized by a slow, vertical climb to an altitude above the densest part of the atmosphere followed by a vehicle pitch-over and climb to orbital insertion. The resulting ∆V is 3.96 km/s.

trajectory

Global, Multi-Objective Trajectory Optimization With Parametric Spreading

Mission design problems are often characterized by multiple, competing trajectory optimization objectives. Recent multi-objective trajectory optimization formulations enable generation of globally-optimal, Pareto solutions via a multi-objective genetic algorithm. A byproduct of these formulations is that clustering in design space can occur in evolving the population towards the Pareto front. This clustering can be a drawback, however, if parametric evaluations of design variables are desired. This effort addresses clustering by incorporating operators that encourage a uniform spread over specified design variables while maintaining Pareto front representation. The algorithm is demonstrated on a Neptune orbiter mission, and enhanced multidimensional visualization strategies are presented.

trajectory design

Trajectory optimization for the Atlas/Centaur launch vehicle

A method for finding solutions to complex trajectory optimization problems with detailed hardware and launch vehicle constraints is presented. The trajectory optimization problem is formulated as a constrained function minimization problem by modeling the control by a function of a finite number of parameters. Although any parametric control model may be selected, the natural choice of parameters is the actual parameters of the parametric guidance equations flown on the flight digital computer. A variation of the method of multipliers is presented for performing the constrained function minimization. A functional is proposed that allows incorporation of state variable inequality constraints. Finally, optimization of the HEAO-A direct-ascent trajectory is discussed. The HEAO-A mission demonstrates profile optimization to meet range safety, tracking, heating, structural integrity, and attitude rate constraints.

Brusch, R. G.

Real-time trajectory optimization on parallel processors

A parallel algorithm has been developed for rapidly solving trajectory optimization problems. The goal of the work has been to develop an algorithm that is suitable to do real-time, on-line optimal guidance through repeated solution of a trajectory optimization problem. The algorithm has been developed on an INTEL iPSC/860 message passing parallel processor. It uses a zero-order-hold discretization of a continuous-time problem and solves the resulting nonlinear programming problem using a custom-designed augmented Lagrangian nonlinear programming algorithm. The algorithm achieves parallelism of function, derivative, and search direction calculations through the principle of domain decomposition applied along the time axis. It has been encoded and tested on 3 example problems, the Goddard problem, the acceleration-limited, planar minimum-time to the origin problem, and a National Aerospace Plane minimum-fuel ascent guidance problem. Execution times as fast as 118 sec of wall clock time have been achieved for a 128-stage Goddard problem solved on 32 processors. A 32-stage minimum-time problem has been solved in 151 sec on 32 processors. A 32-stage National Aerospace Plane problem required 2 hours when solved on 32 processors. A speed-up factor of 7.2 has been achieved by using 32-nodes instead of 1-node to solve a 64-stage Goddard problem.

Psiaki, Mark L.

Canonical transformations for space trajectory optimization

Canonical transformations are developed between the Cartesian coordinates, equinoctial elements, trajectory variables, and orbital elements for coplanar space trajectory optimization problems. The canonical transformations permit the state and adjoint or their solution, transversality conditions, the optimal control, and integrals of the motion, to be transformed between any of the common sets of coordinates for planar space trajectory optimization problems. Variations on the canonical transformations shown are straightforward to develop given the group properties of the canonical transformations.

Haissig, Christine M.

An aircraft noise pollution model for trajectory optimization

A mathematical model describing the generation of aircraft noise is developed with the ultimate purpose of reducing noise (noise-optimizing landing trajectories) in terminal areas. While the model is for a specific aircraft (Boeing 737), the methodology would be applicable to a wide variety of aircraft. The model is used to obtain a footprint on the ground inside of which the noise level is at or above 70 dB.

Barkana, A.

Trajectory optimization for the national aerospace plane

During the past six months the research objectives outlined in the last semi-annual report were accomplished. Specifically, these are: three-dimensional (3-D) fuel-optimal ascent trajectory of the aerospace plane and the effects of thrust vectoring control (TVC) on the fuel consumption and trajectory shaping were investigated; the maximum abort landing area (footprint) was studied; preliminary assessment of simultaneous design of the ascent trajectory and the vehicle configuration for the aerospace plane was also conducted. The work accomplished in the reporting period is summarized.

Lu, Ping