Systems Engineering and Electronics ›› 2022, Vol. 44 ›› Issue (5): 1581-1588.doi: 10.12305/j.issn.1001-506X.2022.05.19

• Systems Engineering • Previous Articles     Next Articles

Conflict avoidance scheduling algorithm for complex associated TT & C requirements

Liqiang XIN1, Chao ZHANG1,*, Lingzhi ZHAO2, Jianping LIU2   

  1. 1. School of Information and Communications Engineering, Xi'an Jiaotong University, Xi'an 710048, China
    2. State Key Laboratory of Astronautic Dynamics, Xi'an Satellite Control Center, Xi'an 710043, China
  • Received:2021-04-09 Online:2022-05-01 Published:2022-05-16
  • Contact: Chao ZHANG

Abstract:

This paper analyzes the current situation of satellite trace, telemetry, control (TT & C) resource scheduling problem. Based on the existing scenarios, requirements and tasks, we establish the objective constraint satisfaction model. After the systematic description of TT & C resources, visible arcs and task requirements, considering the complex relationship between TT & C task requirements, a TT & C resources scheduling algorithm based on task conflict avoidance is proposed. Compared with other traditional methods, this algorithm has considered the resource requirements of global tasks and the complex correlation between tasks. We introduce the acceptance function of the feasible solution, which avoids the greedy drawbacks of the traditional heuristic algorithm. Experimental results show that the algorithm can raise the scheduling success rate of tasks effectively when applied to a large-scale TT & C task resource scheduling.

Key words: satellite trace, telemetry, control (TT & C), resource scheduling, constraint optimization problem, heuristic algorithm

CLC Number: 

[an error occurred while processing this directive]