IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i19p3107-d1492101.html
   My bibliography  Save this article

Two-Stage Satellite Combined-Task Scheduling Based on Task Merging Mechanism

Author

Listed:
  • Jing Yu

    (School of Traffic and Transportation Engineering, Changsha University of Science and Technology, Changsha 410004, China)

  • Jiawei Guo

    (School of Traffic and Transportation Engineering, Changsha University of Science and Technology, Changsha 410004, China)

  • Lining Xing

    (Key Laboratory of Collaborative Intelligence Systems, Xidian University, Xi’an 710126, China
    Hunan Quanyong Information Technology Co., Ltd., Changsha 410100, China)

  • Yanjie Song

    (School of Reliability and Systems Engineering, Beihang University, Beijing 100191, China)

  • Zhaohui Liu

    (School of Traffic and Transportation Engineering, Changsha University of Science and Technology, Changsha 410004, China)

Abstract

Satellites adopt a single-task observation mode in traditional patterns. Although this mode boasts high imaging accuracy, it is accompanied by a limited number of observed tasks and a low utilization rate of satellite resources. This limitation becomes particularly pronounced when dealing with extensive and densely populated observation task sets because the inherent mobility of satellites often leads to conflicts among numerous tasks. To address this issue, this paper introduces a novel multi-task merging mechanism aimed at enhancing the observation rate of satellites by resolving task conflicts. Initially, this paper presents a task merging method based on the proposed multitask merging mechanism, referred to as the constrained graph (CG) task merging approach. This method can merge tasks while adhering to the minimal requirements specified by users. Subsequently, a multi-satellite merging scheduling model is established based on the combined task set. Considering the satellite combined-task scheduling problem (SCTSP), an enhanced fireworks algorithm (EFWA) is proposed that incorporates the CG task synthesis mechanism. This algorithm incorporates local search strategies and a population disturbance mechanism to enhance both the solution quality and convergence speed. Finally, the efficacy of the CG algorithm was validated through a multitude of simulation experiments. Moreover, the effectiveness of the EFWA is confirmed via extensive comparisons with other algorithms, including the basic ant colony optimization (ACO) algorithm, enhanced ant colony optimization (EACO) algorithm, fireworks algorithm (FWA), and EFWA. When the number of tasks in the observation area are dense, such as in the case where the number of tasks is 700, the CG + EFWA (CG is adopted in the task merging stage and EFWA is adopted in the satellite combined-task scheduling stage) method improves observation benefits by 70.35% (compared to CG + EACO, CG is adopted in the task merging stage and EACO is adopted in the satellite combined-task scheduling stage), 78.93% (compared to MS + EFWA, MS is adopted in the task merging stage and EFWA is adopted in the satellite combined-task scheduling stage), and 39.03% (compared to MS + EACO, MS is adopted in the task merging stage and EACO is adopted in the satellite combined-task scheduling stage).

Suggested Citation

  • Jing Yu & Jiawei Guo & Lining Xing & Yanjie Song & Zhaohui Liu, 2024. "Two-Stage Satellite Combined-Task Scheduling Based on Task Merging Mechanism," Mathematics, MDPI, vol. 12(19), pages 1-22, October.
    • Handle: RePEc:gam:jmathe:v:12:y:2024:i:19:p:3107-:d:1492101
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/19/3107/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/12/19/3107/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Bianchessi, Nicola & Cordeau, Jean-Francois & Desrosiers, Jacques & Laporte, Gilbert & Raymond, Vincent, 2007. "A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites," European Journal of Operational Research, Elsevier, vol. 177(2), pages 750-762, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rigo, Cezar Antônio & Seman, Laio Oriel & Camponogara, Eduardo & Morsch Filho, Edemar & Bezerra, Eduardo Augusto & Munari, Pedro, 2022. "A branch-and-price algorithm for nanosatellite task scheduling to improve mission quality-of-service," European Journal of Operational Research, Elsevier, vol. 303(1), pages 168-183.
    2. Fuyu Sun & Hua Wang, 2021. "Research on detection mission scheduling strategy for the LEO constellation to multiple targets," The Journal of Defense Modeling and Simulation, , vol. 18(2), pages 87-103, April.
    3. Lei He & Mathijs Weerdt & Neil Yorke-Smith, 2020. "Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm," Journal of Intelligent Manufacturing, Springer, vol. 31(4), pages 1051-1078, April.
    4. Zhang Ye & Hu Xiaoxuan & Zhu Waiming & Jin Peng, 2018. "Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 399-420, October.
    5. Fliege, Jörg & Kaparis, Konstantinos & Khosravi, Banafsheh, 2012. "Operations research in the space industry," European Journal of Operational Research, Elsevier, vol. 217(2), pages 233-240.
    6. Chen, Xiaoyu & Reinelt, Gerhard & Dai, Guangming & Spitz, Andreas, 2019. "A mixed integer linear programming model for multi-satellite scheduling," European Journal of Operational Research, Elsevier, vol. 275(2), pages 694-707.
    7. Tangpattanakul, Panwadee & Jozefowiez, Nicolas & Lopez, Pierre, 2015. "A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite," European Journal of Operational Research, Elsevier, vol. 245(2), pages 542-554.
    8. Bernhard, Pierre & Deschamps, Marc & Zaccour, Georges, 2023. "Large satellite constellations and space debris: Exploratory analysis of strategic management of the space commons," European Journal of Operational Research, Elsevier, vol. 304(3), pages 1140-1157.
    9. Xiao, Yiyong & Zhang, Siyue & Yang, Pei & You, Meng & Huang, Jiaoying, 2019. "A two-stage flow-shop scheme for the multi-satellite observation and data-downlink scheduling problem considering weather uncertainties," Reliability Engineering and System Safety, Elsevier, vol. 188(C), pages 263-275.
    10. Jingjing Zhang & Chenyang He & Yan Zhang & Xianjun Qi & Xi Yang, 2024. "CubeSat Mission Scheduling Method Considering Operational Reliability," Energies, MDPI, vol. 17(2), pages 1-16, January.
    11. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    12. Alex Elkjær Vasegaard & Ilkyeong Moon & Peter Nielsen & Subrata Saha, 2023. "Determining the pricing strategy for different preference structures for the earth observation satellite scheduling problem through simulation and VIKOR," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 945-973, September.
    13. Karapetyan, Daniel & Mitrovic Minic, Snezana & Malladi, Krishna T. & Punnen, Abraham P., 2015. "Satellite downlink scheduling problem: A case study," Omega, Elsevier, vol. 53(C), pages 115-123.
    14. Jie Chun & Wenyuan Yang & Xiaolu Liu & Guohua Wu & Lei He & Lining Xing, 2023. "Deep Reinforcement Learning for the Agile Earth Observation Satellite Scheduling Problem," Mathematics, MDPI, vol. 11(19), pages 1-20, September.
    15. Wang, Xin-Wei & Chen, Zhen & Han, Chao, 2016. "Scheduling for single agile satellite, redundant targets problem using complex networks theory," Chaos, Solitons & Fractals, Elsevier, vol. 83(C), pages 125-132.
    16. Philippe Monmousseau, 2021. "Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear Model," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 846-873, December.
    17. Bingyu Song & Feng Yao & Yuning Chen & Yingguo Chen & Yingwu Chen, 2018. "A Hybrid Genetic Algorithm for Satellite Image Downlink Scheduling Problem," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-11, May.
    18. Jang, Jinbong & Choi, Jiwoong & Bae, Hee-Jin & Choi, In-Chan, 2013. "Image collection planning for KOrea Multi-Purpose SATellite-2," European Journal of Operational Research, Elsevier, vol. 230(1), pages 190-199.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:19:p:3107-:d:1492101. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.