Research on Path Planning for Satellite Formation Configuration Changes

For different observation tasks, synthetic aperture radar(SAR) satellite formation needs to adopt different configurations. In this case, how to realize the path planning is an important research problem for configuration transition. In this paper, a sequential convex programming(SCP) is proposed for the swarm reconfiguration that involve avoiding collisions and minimizing fuel. The quadratic performance index of the control variable represents the optimization index of path planning to ensure the optimal fuel consumption. Then, a linear discrete relative orbital dynamic model under the J
2
perturbation is constructed. Regarding the dynamic constraints and the prevention of inter-satellite collisions as basic constraints, the path planning problem of configuration transformation is solved as a discretized convex programming problem. The SCP is introduced to realize iterated optimal planning. This algorithm reduces the computational complexity while developing the high control precision. Through experimental analysis, this method can ensure that there is no collision risk between satellites, and the planning converges to complete configuration reconstruction.