A Heuristic Algorithm of Space-Ground Cooperative TT&C Resources Scheduling

Author

Liu, Jian-Ping ; Li, Jing ; Bai, Jian ; Yu, Pei-Jun

Author_Institution

Xi´´an Satellite Control Center, State Key Lab. of Astronaut. Dynamics, Xi´´an, China

Volume

2

fYear

2010

fDate

23-24 Oct. 2010

Firstpage

425

Lastpage

428

Abstract

Space-ground cooperative Tracking Telemetry and Command (TT&C) Resources scheduling is a constraint satisfaction problem based on complicated more tasks and more resources and more windows. Considering general task requirements and space-based TT&C characteristics about more available passes and longer visible window time, a heuristic algorithm of space-ground cooperative TT&C resources scheduling is proposed in this paper. Firstly, ground TT&C resources are scheduled for an initial ground resources scheduling table. Then, from this initial table, space TT&C resources based on back free time are scheduled for a space-ground integrative resources scheduling table. Finally, from a space-ground cooperative resources scheduling table, space TT&C resources based on conflict resolving are scheduled. The simulation results indicate this heuristic algorithm is valid.

Keywords

constraint theory; cooperative systems; heuristic programming; operations research; scheduling; space telemetry; space vehicles; tracking; back free time; command problem; constraint satisfaction problem; heuristic algorithm; space based characteristics; space ground cooperative TT&C resource scheduling; telemetry problem; tracking problem; Algorithm design and analysis; Heuristic algorithms; Low earth orbit satellites; Optimal scheduling; Processor scheduling; Scheduling; Resource scheduling; Space-ground Cooperative; TT&C; bake free time;

fLanguage

English

Publisher

ieee

Conference_Titel

Artificial Intelligence and Computational Intelligence (AICI), 2010 International Conference on

Conference_Location

Sanya

Print_ISBN

978-1-4244-8432-4

Type

conf

DOI

10.1109/AICI.2010.209

Filename

5655385