Constrained Multiple-Revolution Lambert's Problem Academic Article uri icon

abstract

  • A fixed-time, multiple-revolution Lambert's problem is solved under given constraints. For Nmax revolutions, there exist 2Nmax + 1 mathematical solutions to Lambert's problem. Unfortunately, not all of these solutions are feasible. Practical solutions require that the perigee radius be greater than a minimum value (to avoid Earthimpacting trajectories) and the apogee radius be lower than a maximum value (to avoid expensive changes in eccentricity). In particular, short-path and long-path solutions require different considerations to discriminate between the unfeasible solutions. A solution procedure for the semimajor-axis range is proposed that takes these two constraints into account. Based on the semimajor-axis range, the solutions with a feasible number of revolutions can be easily selected. The case of zero revolutions is also discussed, as the trajectory may be feasible even if not complying with the bounds. Numerical examples show that the number of feasible solutions greatly decreases when considering the constraints. Copyright 2010 by Gang Zhang, Daniele Mortari, and Di Zhou.

published proceedings

  • JOURNAL OF GUIDANCE CONTROL AND DYNAMICS

author list (cited authors)

  • Zhang, G., Mortari, D., & Zhou, D. i.

complete list of authors

  • Zhang, Gang||Mortari, Daniele||Zhou, Di

publication date

  • January 1, 2010 11:11 AM