Trajectory Planning of Satellite Formation Flying using Nonlinear Programming and Collocation

Abstract

Recently, satellite formation flying has been a topic of significant research interest in aerospace society because it provides potential benefits compared to a large spacecraft. Some techniques have been proposed to design optimal formation trajectories minimizing fuel consumption in the process of formation configuration or reconfiguration. In this study, a method is introduced to build fuel-optimal trajectories minimizing a cost function that combines the total fuel consumption of all satellites and assignment of fuel consumption rate for each satellite. This approach is based on collocation and nonlinear programming to solve constraints for collision avoidance and the final configuration. New constraints of nonlinear equality or inequality are derived for final configuration, and nonlinear inequality constraints are established for collision avoidance. The final configuration constraints are that three or more satellites should form a projected circular orbit and make an equilateral polygon in the horizontal plane. Example scenarios, including these constraints and the cost function, are simulated by the method to generate optimal trajectories for the formation configuration and reconfiguration of multiple satellites.

Keywords

• satellite formation flying
• onlinear programming
• collocation
• collision avoidance