• Home
  • Current congress
  • Public Website
  • My papers
  • root
  • browse
  • IAC-15
  • B6
  • IP
  • paper
  • A INTELLIGENT SCHEDULE METHOD FOR CHINESE TT&C NETWOR

    Paper number

    IAC-15,B6,IP,2,x30871

    Author

    Dr. CHEN YANG, Beijing Institute of Tracking and Telecommunication Technology, China

    Year

    2015

    Abstract
    Nowadays China has above 100 satellites in orbit, which requests more satellite-ground accesses for TT&C (Tracking Telemetry and Command) compared with that of ten years ago. To satisfy the increasing need of communication access, China has set up a large-scaled ground network around globe and a space network consisted of three TDRSS( Tracking and Data Relay Satellite System). Scheduling access requests is referred to as the Satellite Range Scheduling Problem (SRSP). Traditional schedule method used by Chinese TT&C network is mainly facing two problems, the human schedulers’ heavy workload and unacceptable request conflict rate. A more intelligent schedule method is in need for Chinese TT&C network.
    This paper presents an overview of three key issues: 1) how has the problem changed over the last 10 years, 2) what algorithms work best and 3) what objective function is appropriate. Firstly ,we describe the Chinese TT&c application and some of the changes that we have identified in the application based on the data we have collected and based on conversations with human schedulers. We also show how the change in objective function impacts the performance of the solutions. We compared data sets and found significant differences in the problems. Our evaluation of solutions focus on three algorithms: FIFO algorithm, synthesized priority level algorithm, and genetic algorithm. It can be shown that genetic algorithm has advantages over other two algorithms.
    Abstract document

    IAC-15,B6,IP,2,x30871.brief.pdf

    Manuscript document

    (absent)