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

Dynamic Merging for Optimal Onboard Resource Utilization: Innovating Mission Queue Constructing Method in Multi-Satellite Spatial Information Networks

Author

Listed:
  • Jun Long

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China
    Big Data Institute, Central South University, Changsha 410075, China
    Joint Laboratory of Space Information System, Changsha 410075, China)

  • Shangpeng Wang

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China)

  • Yakun Huo

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China)

  • Limin Liu

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China
    Joint Laboratory of Space Information System, Changsha 410075, China)

  • Huilong Fan

    (School of Computer Science and Engineering, Central South University, Changsha 410075, China
    Network Resource Management and Trust Evaluation Key Laboratory of Hunan, Changsha 410075, China)

Abstract

The purpose of constructing onboard observation mission queues is to improve the execution efficiency of onboard tasks and reduce energy consumption, representing a significant challenge in achieving efficient global military reconnaissance and target tracking. Existing research often focuses on the aspect of task scheduling, aiming at optimizing the efficiency of single-task execution, while neglecting the complex dependencies that might exist between multiple tasks and payloads. Moreover, traditional task scheduling schemes are no longer suitable for large-scale tasks. To effectively reduce the number of tasks within the network, we introduce a network aggregation graph model based on multiple satellites and tasks, and propose a task aggregation priority dynamic calculation algorithm based on graph computations. Subsequently, we present a dynamic merging-based method for multi-satellite, multi-task aggregation, a novel approach for constructing onboard mission queues that can dynamically optimize the task queue according to real-time task demands and resource status. Simulation experiments demonstrate that, compared to baseline algorithms, our proposed task aggregation method significantly reduces the task size by approximately 25% and effectively increases the utilization rate of onboard resources.

Suggested Citation

  • Jun Long & Shangpeng Wang & Yakun Huo & Limin Liu & Huilong Fan, 2024. "Dynamic Merging for Optimal Onboard Resource Utilization: Innovating Mission Queue Constructing Method in Multi-Satellite Spatial Information Networks," Mathematics, MDPI, vol. 12(7), pages 1-16, March.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:7:p:986-:d:1364198
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/7/986/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/7/986/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Sean Phillips & Christopher Petersen & Rafael Fierro, 2022. "Robust, Resilient, and Energy-Efficient Satellite Formation Control," Springer Optimization and Its Applications, in: Maude Josée Blondin & João Pedro Fernandes Trovão & Hicham Chaoui & Panos M. Pardalos (ed.), Intelligent Control and Smart Energy Management, pages 223-251, Springer.
    2. Xiuhong Li & Jiale Yang & Huilong Fan, 2023. "Dynamic Network Resource Autonomy Management and Task Scheduling Method," Mathematics, MDPI, vol. 11(5), pages 1-19, 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.

      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:7:p:986-:d:1364198. 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.