Particle Swarm Optimization of Multiple-Burn Rendezvous Trajectories

Abstract

The particle swarm algorithm is a population-based heuristic method successfully applied in several fields of research, only recently to aerospace trajectories. It represents a very intuitivemethodology for optimization, inspired by the behavior of bird flocks while searching for food. In this work, the method is applied to (impulsive and finitethrust) multiple-burn rendezvous trajectories. First, the technique is employed to determine the globally optimal four-impulse rendezvous trajectories for two challenging test cases. Second, the same problems are solved under the assumption of using finite thrust. In this context, the control function is assumed to be a linear combination of B-splines. Themethod at hand is relatively straightforward to implement anddoes not require an initial guess, unlike gradient-based solvers. Despite its simplicity and intuitiveness, the particle swarm methodology proves to be quite effective in finding the optimal solution to orbital rendezvous optimization problems with considerable numerical accuracy.