Remote-Sensing Satellite Mission Scheduling Optimisation Method under Dynamic Mission Priorities

Xiuhong Li, Chongxiang Sun, Huilong Fan () and Jiale Yang
Additional contact information
Xiuhong Li: College of Information Science and Engineering (School of Cyber Science and Engineering), Xinjiang University, Urumqi 830046, China
Chongxiang Sun: School of Computer Science and Engineering, Central South University, Changsha 410075, China
Huilong Fan: School of Computer Science and Engineering, Central South University, Changsha 410075, China
Jiale Yang: College of Information Science and Engineering (School of Cyber Science and Engineering), Xinjiang University, Urumqi 830046, China

Mathematics, 2024, vol. 12, issue 11, 1-28

Abstract: Mission scheduling is an essential function of the management control of remote-sensing satellite application systems. With the continuous development of remote-sensing satellite applications, mission scheduling faces significant challenges. Existing work has many inherent shortcomings in dealing with dynamic task scheduling for remote-sensing satellites. In high-load and complex remote sensing task scenarios, there is low scheduling efficiency and a waste of resources. The paper proposes a scheduling method for remote-sensing satellite applications based on dynamic task prioritization. This paper combines the and Bound methodologies with an onboard task queue scheduling band in an active task prioritization context. A purpose-built emotional task priority-based scheduling blueprint is implemented to mitigate the flux and unpredictability characteristics inherent in the traditional satellite scheduling paradigm, improve scheduling efficiency, and fine-tune satellite resource allocation. Therefore, the Branch and Bound method in remote-sensing satellite task scheduling will significantly save space and improve efficiency. The experimental results show that comparing the technique to the three heuristic algorithms (GA, PSO, DE), the BnB method usually performs better in terms of the maximum value of the objective function, always finds a better solution, and reduces about 80% in terms of running time.

Keywords: dynamic task priority; satellite scheduling; real-time adaptability; remote-sensing satellite (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/11/1704/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/11/1704/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:11:p:1704-:d:1405593

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().