基于超启发式的多星协同任务规划算法研究  

Multi-Star Cooperative Task Planning Based on Hyper-Heuristic Algorithm

作　　者：陈金勇[1,2] 张超[1,2] 李艳斌[2] CHEN Jin-yong;ZHANG Chao;LI Yan-bin(CETC Key Laboratory of Aerospace Information Applications,Shijiazhuang 050081, China;The 54th Research Institute of China Electronics Technology Group Corporation, Shijiazhuang 050081, China)

机构地区：[1]中国电子科技集团公司航天信息应用技术重点实验室,石家庄050081 [2]中国电子科技集团公司第五十四研究所,石家庄050081

出　　处：《中国电子科学研究院学报》2018年第3期254-259,共6页Journal of China Academy of Electronics and Information Technology

摘　　要：针对多星协同任务调度问题,分析了问题实际约束和问题调度目标,提出了多星协同任务规划调度模型。提出了一种新的基于超启发式算法应用框架对多种算法的管理和调度,研究超启发式多星对地观测任务规划求解方法。最后实验数据证明了算法的有效性和适用性。Aiming at multi-satellite collaborative task scheduling problem,the problem of practical constraints and problem scheduling objectives are analyzed. A multi-satellite cooperative task scheduling model is proposed. A new management framework based on hyper-heuristic algorithm is proposed to manage and schedule a variety of algorithms,and the Method of Solving the Multi-satellite Earth Observation Mission Planning with Hyper-Heuristic Algorithm. Finally,experimental data proved the effectiveness and applicability of the algorithm.

关 键 词：超启发式算法 智能优化算法 卫星任务规划 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]