Abstract Before a manned orbital rendezvous mission, the target spacecraft usually performs several maneuvers to adjust the initial phase angle of the orbital rendezvous and to coordinate the injection of the chaser. This maneuvering process is referred to as the “target phasing mission”. This target phasing presents an orbital long-duration two-point boundary value problem. Further, when the maneuver revolution numbers are used as design variables, the target phasing maneuver's optimization becomes a mixed integer nonlinear programming problem. This paper presents a new optimization method for this phasing maneuver mission, employing a hybrid approach. First, we provide an approximate phasing optimization problem that considers the phase angle influences of node drift and orbital altitude decay. This problem is then optimized using a hybrid approach that integrates branch-and-bound and sequential quadratic programming. Second, a shooting iteration method is adopted to improve the solution to the approximate problem in order to satisfy the terminal constraints of high-precision numerical integration. The proposed method is then applied to an operational target phasing maneuver problem. The results lead to four major conclusions: (1) The proposed approximate phasing optimization model presents a good approximation of the operational mission. (2) The hybrid optimization approach can solve the approximate problem effectively, and the shooting iteration used to arrive at a high-precision solution converges steadily and rapidly. (3) Compared with mixed-code genetic algorithm, the proposed method can obtain a similar result with a lower computation cost and, compared with the approximate model that does not consider node drift and orbital altitude decay, the proposed method has better convergence efficiency. (4) The terminal time of target phasing remains almost constant when the initial semi-major axis increases in a limited interval, and the transition appears only when there is a change in the terminal revolution number.
[1]
Sven Leyffer,et al.
Integrating SQP and Branch-and-Bound for Mixed Integer Nonlinear Programming
,
2001,
Comput. Optim. Appl..
[2]
L. Watson,et al.
Genetic Algorithm for Mixed Integer Nonlinear Programming Problems Using Separate Constraint Approximations
,
2003
.
[3]
G. W. Davis,et al.
The Joint Gravity Model 3
,
1996
.
[4]
E. E. Prust,et al.
A survey of rendezvous trajectory planning
,
1992
.
[5]
I. Michael Ross.
Hybrid Optimal Control Framework for Mission Planning
,
2005,
Journal of Guidance, Control, and Dynamics.
[6]
James R. Wertz,et al.
Space Mission Analysis and Design
,
1992
.
[7]
Wigbert Fehse,et al.
Automated Rendezvous and Docking of Spacecraft
,
2003
.
[8]
D. Vallado.
Fundamentals of Astrodynamics and Applications
,
1997
.
[9]
Kusum Deep,et al.
A real coded genetic algorithm for solving integer and mixed integer optimization problems
,
2009,
Appl. Math. Comput..
[10]
Ya-zhong Luo,et al.
Hybrid Approach to Optimize a Rendezvous Phasing Strategy
,
2007
.
[11]
Guo-Jin Tang,et al.
Orbital rendezvous mission planning using mixed integer nonlinear programming
,
2011
.
[12]
Panagiotis Tsiotras,et al.
Optimal Two-Impulse Rendezvous Using Multiple-Revolution Lambert Solutions
,
2003
.