HXMT卫星长期任务规划算法  

Long-term Planning Algorithm for the HXMT Mission

作　　者：黄跃[1] 屈进禄[1] 贾淑梅[1] 马想[1] 宋黎明[1] 陈黎[2] 张文昭[2] HUANG Yue;QU Jinlu;JIA Shumei;MA Xiang;SONG Liming;CHEN Li;ZHANG Wenzhao(Key Laboratory of Particle Astrophysics, Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049;Department of Astronomy, Beijing Normal University, Beijing 100875)

机构地区：[1]中国科学院高能物理研究所粒子天体物理重点实验室,北京100049 [2]北京师范大学天文学系,北京100875

出　　处：《空间科学学报》2017年第6期766-772,共7页Chinese Journal of Space Science

基　　金：国家自然科学基金项目(11403026);中国科学院空间科学战略性先导科技专项项目(XDA04010300)共同资助

摘　　要：硬X射线调制望远镜(HXMT)卫星是中国首颗空间X射线天文卫星.为充分利用卫星资源,使科学产出最大化,需要进行长期任务规划.长期任务规划是一个复杂的多目标优化问题.通过分析HXMT观测特点和约束条件,建立了HXMT长期任务规划问题模型,并采用贪婪算法加遗传算法对模型进行求解.实例分析结果表明该方法能够有效解决HXMT长期任务规划问题.Hard X-ray Modulation Telescope （HXMT） satellite is China＇s first space X-ray astron- omy satellite. The planning and scheduling of HXMT observations is a complex multi-objective optimization problem, and the optimization object is to maximize simultaneously the scientific re- turn and the observation efficiency. By analyzing the characteristics of HXMT observations and all the important factors in the efficient scheduling of a celestial source, such as celestial constraints and the additional scientific constraints, the HXMT long-term planning model is established. The greedy algorithm and genetic algorithm are combined to solve the model. Simulation results show that the approach is effective in solving the HXMT long-term planning problem, based on the analysis of thefirst year observations of Suzaku Mission.

关 键 词：硬X射线调制望远镜 长期任务规划 贪婪算法 遗传算法 

分 类 号：V474[航空宇航科学与技术—飞行器设计]