南京航空航天大学学报（英文版）2023，Vol.40Issue(3)：307-322,16.DOI:10.16356/j.1005-1120.2023.03.007
超额订购下天文卫星短期任务的聚类规划方法
Clustering-Scheduling Methods for Oversubscribed Short-Term Tasks of Astronomical Satellites
摘要
Abstract
When the observation requirement from users exceeds the satellite's observation capability,astronomy satellite task scheduling becomes an oversubscription problem.For the oversubscribed task scheduling of astronomical satellites,a framework with a clustering phase and a short-term task scheduling phase is designed.First,a task clustering model is established to reduce the size of the oversubscribed task.Second,using the clustered results as input,we develop a mathematical model of short-term scheduling for the tasks.Finally,we propose an improved artificial bee colony algorithm with adaptive hybrid search strategies(DirectABC).It introduces an adaptive elite global-local search strategy and an adaptive variable neighborhood optimal search strategy to the basic artificial bee colony algorithm(BasicABC).The proposed algorithm demonstrates superior optimum-searching capability and a faster convergence speed in the simulation.In addition,it effectively reduces the number of tasks in the clustering phase and improves task completion in the short-term task scheduling phase.关键词
天文卫星任务规划/超订购问题/任务聚类/短期任务规划/人工蜂群算法Key words
astronomy satellite task scheduling/oversubscription problem/task clustering/short-term task scheduling/artificial bee colony algorithm分类
航空航天引用本文复制引用
尹晓丹,白萌,李卓恒..超额订购下天文卫星短期任务的聚类规划方法[J].南京航空航天大学学报（英文版）,2023,40(3):307-322,16.基金项目
This work was supported by the Stra-tegic Priority Research Program of the Chinese Academy of Sciences(No.XDA15040100),and the Youth Innovation Promotion Association of the Chinese Academy of Sciences(No.2021146).The authors would like to acknowledge the following people for their assistance:HU Tai,LIU Yurong,and GUO Guohang,all with the Laboratory of Sat-ellite Operations Technology,Space Science Mission Opera-tions Center,National Space Science Center. （No.XDA15040100）
