Research on Task Planning Problem of Satellite-Ground Time Synchronization

DOI

10.2991/icence-16.2016.69How to use a DOI?

Keywords

satellite-ground time synchronization; ground station scheduling; multi-objective problem; evolutionary algorithm; global navigation satellite system.

Abstract

The task planning of satellite-ground time synchronization (SGTSTP) is a complex multi-objective ground station scheduling problem. In this paper, we establish the problem formulation and analyze the optimization objectives. Based on the complexity analysis, we design a solving framework based on decomposition, which divides the plan horizon into many un-interactional plan periods and execute task planning in each period. In algorithm selection, the MOGA and NSGA2 are selected. At last, two different scale scenarios are designed and the computational result shows that more periods can get better result but spend more time, besides, the MOGA has better performance in efficiency and effect than NSGA2, however NSGA2 can get more solutions in solving SGTSTP.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Zhongshan Zhang
AU  - Weijie Sun
AU  - Jungang Yan
PY  - 2016/09
DA  - 2016/09
TI  - Research on Task Planning Problem of Satellite-Ground Time Synchronization
BT  - Proceedings of the 2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 2016)
PB  - Atlantis Press
SP  - 347
EP  - 356
SN  - 2352-538X
UR  - https://doi.org/10.2991/icence-16.2016.69
DO  - 10.2991/icence-16.2016.69
ID  - Zhang2016/09
ER  -