Hostname: page-component-745bb68f8f-cphqk Total loading time: 0 Render date: 2025-02-11T15:05:17.568Z Has data issue: false hasContentIssue false
  • English
  • Français

Optimal scheduling for many-to-many on-orbit service manoeuvers considering variances in target accessibility

Published online by Cambridge University Press:  27 January 2025

J. Zhang Open the ORCID record for J. Zhang [Opens in a new window] ,
H. Xia Open the ORCID record for H. Xia [Opens in a new window]  and
L. Li
J. Zhang
Affiliation:
Space Control and Inertial Technology Research Center, Harbin Institute of Technology, Harbin, China
H. Xia*
Affiliation:
Space Control and Inertial Technology Research Center, Harbin Institute of Technology, Harbin, China
L. Li
Affiliation:
College of New Energy, Harbin Institute of Technology, Weihai, China
*
Corresponding author: H. Xia; Email: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In this article, we delve into the optimal scheduling challenge for many-to-many on-orbit services, taking into account variations in target accessibility. The scenario assumes that each servicing satellite is equipped with singular or multiple service capabilities, tasked with providing on-orbit services to multiple targets, each characterised by distinct service requirements. The mission’s primary objective is to determine the optimal service sequence, orbital transfer duration and on-orbit service time for each servicing satellite, with the ultimate goal of minimising the overall cost. We frame the optimal scheduling dilemma as a time-related colored travelling salesman problem (TRCTSP) and propose an enhanced firefly algorithm (EFA) to address it. Finally, experimental results across various scenarios validate the effectiveness and superiority of the proposed algorithm. The principal contribution of this work lies in the modeling and resolution of the many-to-many on-orbit service challenge, considering accessibility variations — a domain that has, until now, remained unexplored.

Keywords

optimal scheduling problemmany-to-many on-orbit servicevariances in target accessibilitytime-dependent coloured traveling salesman problemenhanced firefly algorithm
Type
Research Article
Information
The Aeronautical Journal , First View , pp. 1 - 29
Check for updates
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Royal Aeronautical Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Dorigo, M. and Gambardella, L.M. Ant colonies for the travelling salesman problem, Biosystems, 1997, 43, (2), pp 73–81.CrossRefGoogle ScholarPubMed
Baker, B.M. and Ayechew, M.A. A genetic algorithm for the vehicle routing problem, Comput. Oper. Res., 2003, 30, (5), pp 787–800.CrossRefGoogle Scholar
Mirjalili, S. Genetic Algorithm, pp 43–55. Springer International Publishing, 2019.Google Scholar
Fister, I., Fister, I., Yang, X.-S. and Brest, J. A comprehensive review of firefly algorithms. Swarm Evol. Comput., 2013, 13, pp 34–46.CrossRefGoogle Scholar
Kennedy, J. and Eberhart, R. Particle swarm optimization, In Proceedings of ICNN’95 - International Conference on Neural Networks, vol. 4, pp 1942–1948, 1995.CrossRefGoogle Scholar
Dorigo, M., Birattari, M. and Stutzle, T. Ant colony optimization, IEEE Comput. Intell. Mag., 2006, 1, (4), pp 28–39.CrossRefGoogle Scholar
Yang, Z., Ye, Y., Xu, H., Yueneng, Y. and Hua, Z. Mission planning optimization for the visual inspection of multiple geosynchronous satellites, Eng. Optim., 2015, 47, (11), pp 1543–1563.Google Scholar
Sorenson, S.E. and Nurre Pinkley, S.G. Multi-orbit routing and scheduling of refuellable on-orbit servicing space robots, Comput. Ind. Eng., 2023, 176, p 108852.CrossRefGoogle Scholar
Zhang, J., Parks, G.T., Luo, Y. and Tang, G. Multispacecraft refueling optimization considering the j2 perturbation and window constraints, J. Guid. Control Dyn., 37(1):111–122, 2014.CrossRefGoogle Scholar
Li, C. and Xu, B. Optimal scheduling of multiple sun-synchronous orbit satellites refueling, Adv. Space Res., 2020, 66, (2), pp 345–358.CrossRefGoogle Scholar
Han, P., Guo, Y., Wang, P., Li, C. and Pedrycz, W. Optimal orbit design and mission scheduling for sun-synchronous orbit on-orbit refueling system, IEEE Trans. Aerosp. Electron. Syst., 2023, 59, (5), pp 4968–4983.Google Scholar
Rodrigues Neto, J.B. and Ramos, G.D.O. An interpolated approach for active debris removal, In 2022 IEEE Congress on Evolutionary Computation (CEC), pp 1–6, 2022.CrossRefGoogle Scholar
Zona, D., Zavoli, A., Federici, L. and Avanzini, G. Evolutionary optimization for active debris removal mission planning, IEEE Access, 2023, 11, pp 41019–41033.CrossRefGoogle Scholar
Jing, Y., Xiaoqian, C. and Lihu, C. Optimal planning of Leo active debris removal based on hybrid optimal control theory, Adv. Space Res., 2015, 55, (11), pp 2628–2640.Google Scholar
Shen, H.X., Zhang, T.J., Casalino, L. and Pastrone, D. Optimization of active debris removal missions with multiple targets, J. Spacecr. Rockets, 2018, 55, (1), pp 181–189.CrossRefGoogle Scholar
Bang, J. and Ahn, J.. Multitarget rendezvous for active debris removal using multiple spacecraft, J. Spacecr. Rockets, 56(4):1237–1247, 2019.CrossRefGoogle Scholar
Han, P., Guo, Y., Li, C., Zhi, H. and Lv, Y. Multiple geo satellites on-orbit repairing mission planning using large neighborhood search-adaptive genetic algorithm, Adv. Space Res., 2022, 70, (2), pp 286–302.CrossRefGoogle Scholar
Chen, H., Gardner, B.M., Grogan, P.T. and Ho, K. Flexibility management for space logistics via decision rules, J. Spacecr. Rockets, 2021, 58, (5) pp 1314–1324.CrossRefGoogle Scholar
Sarton, T., Chen, H., Gunasekara, O. and Ho, K. Framework for modeling and optimization of on-orbit servicing operations under demand uncertainties, J. Spacecr. Rockets, 2021, 58, (4), pp. 1157–1173.CrossRefGoogle Scholar
Bakhtiari, M., Daneshjou, K. and Mohammadi-Dehabadi, A.A. The effects of parking orbit elements on designing of on-orbit servicing missions. Proc. Inst. Mech. Eng. G: J. Aerosp. Eng., 2019, 233, (3), pp 793–810.CrossRefGoogle Scholar
Daneshjou, K., Mohammadi-Dehabadi, A.A. and Bakhtiari, M. Mission planning for on-orbit servicing through multiple servicing satellites: A new approach, Adv. Space Res., 2017, 60, (6), pp 1148–1162.CrossRefGoogle Scholar
Li, J., Zhou, M.C., Sun, Q., Dai, X. and Yu, X. Colored traveling salesman problem, IEEE Trans. Cybern., 2015, 45, (11), pp 2390–2401.CrossRefGoogle ScholarPubMed
Das, S. and Suganthan, P.N. Differential evolution: A survey of the state-of-the-art, IEEE Trans. Evol. Comput., 2011, 15, (1), pp 4–31.CrossRefGoogle Scholar
Yan, H., Guo, Y., Li, C. and Song, B. Neural-network-assisted optimization of a close-range multi-spacecraft rendezvous mission based on a multi-impulse maneuvering strategy, Adv. Space Res., 2023, 72, (5), pp 1829–1843.CrossRefGoogle Scholar
Koroteev, A.S., Lovtsov, A.S., Vyacheslav, A., Muravlev, M.Y., Andrey, S. and Shagayda, A. Development of ion thruster it-500, Eur. Phys. J. D, 2017, 71, (120), pp 1–10.CrossRefGoogle Scholar
Liu, Y., Guo, C., and Weng, Y. Online time-optimal trajectory planning for robotic manipulators using adaptive elite genetic algorithm with singularity avoidance, IEEE Access, 2019, 7, pp 146301–146308.CrossRefGoogle Scholar
Curtis, H.D. Orbital Mechanics for Engineering Students. Butterworth-Heinemann, 2013.Google Scholar