On a restricted comparison of two impulse and one impulse orbital transfer
One and two impulse orbital transfer - optimal n-impulse problem including copolar elliptical orbits
SEARCH · Search NASA
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.
One and two impulse orbital transfer - optimal n-impulse problem including copolar elliptical orbits
Optimum two-impulse orbital transfer for arbitrary terminal conditions, discussing analytic characteristics
Numerical determination of optimum two-impulse orbital transfers between inclined elliptical orbits
Optimum two impulse orbital transfer for arbitrary terminal conditions, discussing analytic characteristics
Impulsive orbit transfer optimization using accelerated gradient program based on Newtonian algorithm for digital computer method
Impulsive orbit transfer optimization using accelerated gradient method
Numerical determination of optimum two-impulse orbital transfer between inclined elliptical orbits
Computer method to determine optimum two-impulse orbital transfers between inclined elliptical orbits
Optimum two-impulse orbital transfer and rendezvous between inclined elliptical orbits
Optimum two-impulse orbital transfer and rendezvous between any pair of unperturbed elliptical orbits
Several formulations are possible for the optimization of N-impulse two-body orbit transfers. One formulation that assumes the firstN−1impulses are design variables and implements Lambert’s algorithm in the final leg is here considered. This paper presents a derivation for the analytic expressions of the gradients needed to optimize this formulation. The impact of using these analytic expressions on the optimization computational cost is also presented. A linear system of equations is developed that approximates the Lambert’s problem solution in a way that is suitable for computing the analytic gradients. The derivations of the analytic gradients, as well as numerical case studies for 2-impulse and 3-impulse orbit transfers, are presented. The numerical case studies highlights a significant reduction in the computational cost, measured in terms of the number of function calls.
Predicting characteristics of minimal total impulse solution of two-terminal, two-impulse orbital transfer problem by using bounding trajectories
Comparison of two-impulse and three-impulse orbital transfer, using data from a 63-case numerical study. For each case investigated for which coplanarity of the regressing assembly parking ellipse was attained with the target asymptotic velocity vector, a two-impulse maneuver (or a one-impulse equivalent) was found for which the velocity expenditure was within 1% of a reference absolute minimum lower bound. Therefore, for the coplanar cases, use of a minimum delta-V three-impulse maneuver afforded scant improvement in velocity penalty. However, as the noncoplanarity of the parking ellipse and the target asymptotic velocity vector increased, there was a significant increase in the superiority of minimum delta-V three-impulse maneuvers for slowing the growth of velocity expenditure. It is concluded that a multiple-impulse maneuver should be contemplated if nonnominal launch conditions could occur.
Spacecraft rendezvous trajectory between two elliptical orbits is determined by optimization of the two impulse orbital transfer
Explore the source record for details and available documents.
Explore the source record for details and available documents.
A generalized technique for the numerical solution of any given class of problems is presented. The technique requires the analytic (or numerical) solution of every applicable equation for all variables that appear in the problem. Conditional blocks are employed to rapidly expand the set of known variables from a minimum of input. The method is illustrated via the use of the Hohmann transfer problem from orbital mechanics.
Explore the source record for details and available documents.