scholarly journals Research on Task Priority Model and Algorithm for Satellite Scheduling Problem

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 103031-103046
Author(s):  
Jian Wu ◽  
Jiawei Zhang ◽  
Jinghui Yang ◽  
Lining Xing
Sensors ◽  
2019 ◽  
Vol 19 (6) ◽  
pp. 1430 ◽  
Author(s):  
Jintian Cui ◽  
Xin Zhang

Emergency observations are missions executed by Earth observation satellites to support urgent ground operations. Emergency observations become more important for meeting the requirements of highly dynamic and highly time-sensitive observation missions, such as disaster monitoring and early warning. Considering the complex scheduling problem of Earth observation satellites under emergency conditions, a multi-satellite dynamic mission scheduling model based on mission priority is proposed in this paper. A calculation model of mission priority is designed for emergency missions based on seven impact factors. In the satellite mission scheduling, the resource constraints of scheduling are analyzed in detail, and the optimization objective function is built to maximize the observation mission priority and mission revenues, and minimize the waiting time for missions that require urgency for execution time. Then, the hybrid genetic tabu search algorithm is used to obtain the initial satellite scheduling plan. In case of the dynamic arrival of new emergency missions before scheduling plan releases, a dynamic scheduling algorithm based on mission priority is proposed to solve the scheduling problem caused by newly arrived missions and to obtain the scheduling plan of newly arrived missions. A simulation experiment was conducted for different numbers of initial missions and newly arrived missions, and the scheduling results were evaluated with a model performance evaluation function. The results show that the execution probability of high-priority missions increased because the mission priority was taken into account in the model. In the case of more satellite resources, when new missions dynamically arrived, the satellite resources can be reasonably allocated to these missions based on the mission priority. Overall, this approach reduces the complexity of the dynamic adjustment and maintains the stability of the initial scheduling plan.


2013 ◽  
Vol 791-793 ◽  
pp. 1341-1346 ◽  
Author(s):  
Peng Gao ◽  
Yue Jin Tan ◽  
Ju Fang Li ◽  
Ren Jie He

The algorithms for solving the remote satellite scheduling problem are less effective usually in single computing environment. This paper designed a framework of ant colony algorithm for remote satellite and ground integration scheduling problem in the parallel environment, and given the detail of key steps in the algorithm. Experiments are show at the end of this paper to prove effective and validation.


4OR ◽  
2004 ◽  
Vol 2 (3) ◽  
pp. 235-249 ◽  
Author(s):  
Thierry Benoist ◽  
Beno�t Rottembourg

2020 ◽  
Vol 31 (2) ◽  
pp. 321-334
Author(s):  
Jian Wu ◽  
Fang Lu ◽  
Jiawei Zhang ◽  
Jinghui Yang ◽  
Lining Xing

Sign in / Sign up

Export Citation Format

Share Document