Solution algorithm of a quasi-Lambert's problem with fixed flight-direction angle constraint

Astronomy and Astrophysics – Astronomy

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Two-Point Boundary Value Problem, Quasi-Lambert'S Problem, Flight-Direction Angle, Universal Variable, Iteration Algorithm

Scientific paper

A two-point boundary value problem of the Kepler orbit similar to Lambert's problem is proposed. The problem is to find a Kepler orbit that will travel through the initial and final points in a specified flight time given the radial distances of the two points and the flight-direction angle at the initial point. The Kepler orbits that meet the geometric constraints are parameterized via the universal variable z introduced by Bate. The formula for flight time of the orbits is derived. The admissible interval of the universal variable and the variation pattern of the flight time are explored intensively. A numerical iteration algorithm based on the analytical results is presented to solve the problem. A large number of randomly generated examples are used to test the reliability and efficiency of the algorithm.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Solution algorithm of a quasi-Lambert's problem with fixed flight-direction angle constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solution algorithm of a quasi-Lambert's problem with fixed flight-direction angle constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solution algorithm of a quasi-Lambert's problem with fixed flight-direction angle constraint will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-763085

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.