• Corpus ID: 238531401

GEO satellites on-orbit repairing mission planning with mission deadline constraint using a large neighborhood search-genetic algorithm

  title={GEO satellites on-orbit repairing mission planning with mission deadline constraint using a large neighborhood search-genetic algorithm},
  author={Peng Han and Yanning Guo and Chuanjiang Li and Hui Zhi and Yueyong Lv},
  • Peng Han, Yanning Guo, +2 authors Yueyong Lv
  • Published 8 October 2021
  • Computer Science, Engineering
  • ArXiv
This paper proposed a novel large neighborhood search-adaptive genetic algorithm (LNSAGA) for many-to-many on-orbit repairing mission planning of geosynchronous orbit (GEO) satellites with mission deadline constraint. In the many-to-many on-orbit repairing scenario, several servicing spacecrafts and target satellites are located in GEO orbits which have different inclination, RAAN and true anomaly. Each servicing spacecraft need to rendezvous with target satellites to perform repairing missions… 


Mission planning for on-orbit servicing through multiple servicing satellites: A new approach
A novel approach is proposed for the mission planning of on-orbit servicing such as visual inspection, active debris removal and refueling through multiple servicing satellites (SSs) that reduces the fuel consumption and the mission duration significantly in comparison with the conventional approaches.
Distributed onboard mission planning for multi-satellite systems
A distributed onboard mission planning algorithm based on the Hybrid Dynamic Mutation Genetic Algorithm (HDMGA) is proposed for multi-satellite system (MSS) and shows superior performance on both computation time and success rate, as compared with other two state-of-the-art distributed mission planning approaches.
Optimal scheduling of multiple geosynchronous satellites refueling based on a hybrid particle swarm optimizer
Abstract A new multiple geosynchronous satellites refueling strategy, where multiple servicing satellites and fuel stations are utilized to refuel multiple geosynchronous satellites of known fuel
A Mission Architecture for On-Orbit Servicing Industrialization
Similar to any service or product, industrialization of On-Orbit Servicing (OOS) demands performance enhancement through introducing relevant autonomy elements in planning and executing single and
Optimal mission planning of GEO on-orbit refueling in mixed strategy
Abstract The mission planning of GEO on-orbit refueling (OOR) in Mixed strategy is studied in this paper. Specifically, one SSc will be launched to an orbital slot near the depot when multiple GEO
Multi-objective planning of a multiple geostationary spacecraft refuelling mission
ABSTRACT The multi-objective optimization of multiple geostationary spacecraft refuelling is investigated in this article. A servicing spacecraft (SSc) and a propellant depot (PD), both parked
On-Orbit Upgrade and Repair: The Hubble Space Telescope Example
From the Hubble Space Telescope (HST) example, a model of a serviceable scientific mission is developed to study on-orbit repair and upgrading, including spacecraft repair, payload instrument
Optimal scheduling of GEO debris removing based on hybrid optimal control theory
It can be concluded from the experiments that the RM is effective and efficient in dealing with this problem especially for the cases with numerous targets.
Optimal scheduling for location geosynchronous satellites refueling problem
An ant colony optimization (ACO) metaheuristic that features a special solution representation scheme is proposed that outperforms the existing approaches in the M2M refueling mission design and is able to detect the optimal refueling strategy on all instances containing 85 GEO targets with 15 potential fuel tankers.
Optimization of Multiple Debris Removal Missions Using an Evolving Elitist Club Algorithm
  • Haiyang Li, H. Baoyin
  • Computer Science
    IEEE Transactions on Aerospace and Electronic Systems
  • 2020
An intelligent global optimization algorithm named the evolving elitist club algorithm (EECA) is proposed, and its application in multiple debris removal missions is studied, showing that EECA is more efficient than other ACO algorithms.