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 1,081 records · Page 60

Secondary mission optimization.

Secondary or abort mission maximized subject to primary mission constraints by variational treatment of optimal branched trajectories

Dickerson, W. D.↗

Secondary mission optimization.

Secondary or abort mission maximized subject to primary mission constraints by variational treatment of optimal branched trajectories

Dickerson, W. D.↗

A Ganymede lander mission

The paper addresses the dynamical problem and question of technical feasibility associated with delivering a simple, semi-hard lander to one of the Galilean satellites, Ganymede. Emphasis is placed on the identification of a viable, not necessarily optimal, baseline trajectory and maneuver sequence. Simplicity is stressed in the lander's use of two fixed-impulse solid rockets for landing maneuvers. It is shown through an error analysis that navigation and maneuver execution errors can be compensated on the baseline descent trajectory by controlling just the thrust direction. Finally, specific subsystem capabilities needed on the lander to achieve a successful touchdown within a specific performance envelope are also identified.

Boain, R. J.↗

Transferable Output ASCII Data (TOAD) gateway: Version 1.0 user's guide

The Transferable Output ASCII Data (TOAD) Gateway, release 1.0 is described. This is a software tool for converting tabular data from one format into another via the TOAD format. This initial release of the Gateway allows free data interchange among the following file formats: TOAD; Standard Interface File (SIF); Program to Optimize Simulated Trajectories (POST) input; Comma Separated Value (TSV); and a general free-form file format. As required, additional formats can be accommodated quickly and easily.

Bingel, Bradford D.↗

Ascent performance of an air-breathing horizontal-takeoff launch vehicle

Simulations are conducted to investigate a proposed NASA launch vehicle that is fully reusable, takes off horizontally, and uses airbreathing propulsion in a single stage. The propulsion model is based on a cycle analysis method, and the vehicle is assumed to be a rigid structure with distributed fuel, operating under a range of atmospheric conditions. The program to optimize simulated trajectories (POST) is modified to include a predictor-corrector guidance capability and then used to generate the trajectories. Significant errors are encountered during the unpowered coast phase due to uncertainty in the atmospheric density profile. The amount of ascent propellant needed is shown to be directly related to the thrust-vector angle and the location of the center of gravity of the vehicle because of the importance of aim-drag losses to total ideal velocity.

Powell, Richard W.↗

A feedback control for the advanced launch system

A robust feedback algorithm is presented for a near-minimum-fuel ascent of a two-stage launch vehicle operating in the equatorial plane. The development of the algorithm is based on the ideas of neighboring optimal control and can be derived into three phases. In phase 1, the formalism of optimal control is employed to calculate fuel-optimal ascent trajectories for a simple point-mass model. In phase 2, these trajectories are used to numerically calculate gain functions of time for the control(s), the total flight time, and possibly, for other variables of interest. In phase 3, these gains are used to determine feedback expressions for the controls associated with a more realistic model of a launch vehicle. With the Advanced Launch System in mind, all calculations are performed on a two-stage vehicle with fixed thrust history, but this restriction is by no means important for the approach taken. Performance and robustness of the algorithm is found to be excellent.

Seywald, Hans↗