Mission planning optimization for multiple geosynchronous satellites refueling

Abstract The scheduling problem of multiple geosynchronous satellites refueling mission with a servicing satellite and a fuel station is studied in this paper. In the proposed mission scenario, a number of geosynchronous satellites require a specified weight of fuel to be delivered. The servicing satellite and the fuel station are initially parked in the geosynchronous Earth orbit (GEO). The capacitated servicing satellite is expected to visit and refuel these fuel-deficient GEO targets with the fuel received from the fuel station. In general, the fuel station will refuel the servicing satellite more than once. The refueling order and binary decision variable are used as design variables, whereas the total fuel consumed by orbital maneuvers is used as a design objective. A one-level optimization model and a two-level optimization model are formulated to find the optimal refueling order and decision variable. Genetic algorithm (GA) is employed to address the one-level optimization problem. For the two-level optimization problem, the up-level GA that optimizes the refueling order is combined with the low-level random search that can quickly locate the near-optimal binary decision variable. Finally, the proposed methods are applied to numerical test cases to demonstrate that they are valid for mission planning optimization for multiple GEO targets refueling.

[1]  Jing Yu,et al.  Optimal scheduling of multispacecraft refueling based on cooperative maneuver , 2015 .

[2]  Atri Dutta,et al.  Peer-to-Peer Refueling Strategy Using Low-Thrust Propulsion , 2010 .

[3]  Liu Yu The Status and Prospect of Orbital Servicing in the Geostationary Orbit , 2010 .

[4]  Neil Dipprey,et al.  Orbital Express Propellant Resupply Servicing , 2003 .

[5]  Yu Jing,et al.  Biobjective planning of GEO debris removal mission with multiple servicing spacecrafts , 2014 .

[6]  Jing Yu,et al.  Optimal scheduling of GEO debris removing based on hybrid optimal control theory , 2014 .

[7]  Daniel E. Hastings,et al.  On-Orbit Servicing: A New Value Proposition for Satellite Design and Operation , 2007 .

[8]  R. C. White A survey of random methods for parameter optimization , 1971 .

[9]  J. Betts Survey of Numerical Methods for Trajectory Optimization , 1998 .

[10]  Vili Podgorelec,et al.  A survey of genetic algorithms for solving multi depot vehicle routing problem , 2015, Appl. Soft Comput..

[11]  B. Jackson,et al.  Minimum energy maneuvering strategies for multiple satellite inspection missions , 2005, 2005 IEEE Aerospace Conference.

[12]  Zhu Yanwei Mission planning for multiple GEO satellite proximity inspection , 2011 .

[13]  Hua Zhang,et al.  Mission planning optimization for the visual inspection of multiple geosynchronous satellites , 2015 .

[14]  Matteo Ceriotti,et al.  Displaced geostationary orbits using hybrid low-thrust propulsion , 2012 .

[15]  K. Alfriend,et al.  Optimal Servicing of Geosynchronous Satellites , 2002 .

[16]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[17]  Geoffrey T. Parks,et al.  Multispacecraft Refueling Optimization Considering the J2 Perturbation and Window Constraints , 2014 .

[18]  Stephen H. Lane,et al.  Solution to the traveling salesman problem using heuristic function maximization , 1988 .

[19]  R. Jehn,et al.  The situation in the geostationary ring , 2005 .

[20]  Panagiotis Tsiotras,et al.  Peer-to-Peer Refueling for Circular Satellite Constellations , 2005 .

[21]  Bruce A. Conway,et al.  Automated Mission Planning via Evolutionary Algorithms , 2012 .

[22]  Daniel E. Hastings,et al.  Flexibility and the value of on-orbit servicing: New customer-centric perspective , 2003 .

[23]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[24]  D. A. Smith,et al.  A mission to preserve the geostationary region , 2004 .

[25]  Xu Bo,et al.  Research on constellation refueling based on formation flying , 2011 .