Optimization of multiple-impulse minimum-time rendezvous with impulse constraints using a hybrid genetic algorithm

The minimum-time multiple-impulse rendezvous with impulse constraints is investigated in this paper. Based on the Clohessy–Wiltshire (C–W) equations, an optimization model including several different kinds of impulse constraints such as the maximum impulse magnitude, the total velocity change magnitude and the time of imposing impulse for multiple-impulse minimum-time rendezvous is established. A generalized inverse matrix solution for linear equation is applied to avoid handling the terminal equality constraints. In order to obtain the global solution efficiently, a hybrid optimizer combining the advantages of a floating-coded genetic algorithm and simplex method is employed. A low-earth orbit multiple-impulse rendezvous problem is used as an example. The influence of the number of impulses, the optimization variables and the constraints on the solution is analyzed, and the different optimization algorithms are compared. Results indicate our proposed model and approach is effective in designing linearized minimum-time rendezvous trajectory with impulse constraints.