Optimal Multiple-Impulse Time-Fixed Rendezvous Using Genetic Algorithm
Qian Yu, Min Xu, Zhifeng Zeng, Xunliang Yan · 2010
The rendezvous of an orbiting vehicle with a target body in another orbit can be accomplished in a specified time by two or more impulses. Aiming to solve the minimum fuel, multiple-impulse and time-fixed rendezvous problem, the genetic algorithm method is used in this paper. The genetic algorithm is a direct method for solving this constrained optimization problem that is based on natural selection, the process that drives biological evolution. The 3-impulse rendezvous and 4-impulse rendezvous, and coplanar case and noncoplanar case have been simulated. The results obtained show that, the genetic algorithm is a feasible method to solve this problem. And the results obtained can be used to perform a fixed-time, minimum fuel missions,such as space rescue operations and avoidance maneuvers.