期刊文献+

基于改进蚁群算法的敏捷成像卫星任务调度方法 被引量:18

Tasks scheduling method for an agile imaging satellite based on improved ant colony algorithm
原文传递
导出
摘要 针对敏捷成像卫星观测任务调度问题,综合考虑卫星最长连续工作时间、任务间卫星姿态调整时间、能量、容量等约束建立了任务调度模型.考虑到密集任务间的相互影响,着重分析了任务间卫星姿态调整时间约束,并给出调姿时间求解方法.提出一种改进蚁群算法对问题进行求解,借鉴蚁群系统(ACS)和最大最小蚂蚁系统(MMAS)的思想设计寻优策略和信息素更新策略.并结合实际约束,引入最早、最晚可观测时间和任务优先级等因素来控制转移概率.实验算例验证了模型和算法的有效性. The observing task scheduling problem of an agile imaging satellite is studied. The scheduling model is founded considering the complex constraints as the maximal successive working duration, the attitude changing duration between tasks, energy and capacity restriction. Considering the influence among intensive observing tasks, the attitude changing duration is analyzed and a calculating method is given. An improved ant colony algorithm based on ant colony system (ACS) and max-rain ant system (MMAS) is designed to solve the problem. The factors of task priority and bounds of the visible time are introduced into transfer rules. Simulation results show the efficiency of our approach.
出处 《系统工程理论与实践》 EI CSSCI CSCD 北大核心 2012年第11期2533-2539,共7页 Systems Engineering-Theory & Practice
基金 国家安全重大基础研究项目(97361361)
关键词 任务调度 建模 蚁群算法 敏捷成像卫星 tasks scheduling modeling ant colony algorithm agile imaging satellite
  • 相关文献

参考文献15

  • 1Lemaitre M, Verfaillie G, Jouhaud F, et al. Selecting and scheduling observations of agile satellites[J]. Aerospace Science and Technology, 2002, 6(5): 367 -381.
  • 2Sebbag I. Pleiades: A multi-missions concept and a partnership program[EB/OL]. French Space Agency, (2011- 04-18)[2011-06-20]. http://smsc.cnes.fr/PLEIADES/.
  • 3Cordeau F, Laporte G. ROADEF;2003 Challenge: Booklet of Abstracts[M]. France: ROADEF Society, 2003.
  • 4Wang H S. A two-phase ant colony algorithm for multi-echelon defective supply chain network design[J]. European Journal of Operational Research, 2009, 192(1): 243 -252.
  • 5Dorigo M, Stutzle T. Ant Colony Optimization: Overview and Recent Advances[M]. Handbook of Metaheuristics: International Series in Operations Research and Management Science, Berlin: Springer, 2010, 146:227- 263.
  • 6Benoist T, Rottembourg B. Upper bounds for revenue maximization in a satellite scheduling problem[J]. 4OR: A Quarterly Journal of Operations Research, 2004, 2(3): 235 -249.
  • 7Wang P, Reinelt G, Gao P, et al. A model, a heuristic and a decision support system to solve the scheduling problem of an earth observing satellite constellation[J]. Computers and Industrial Engineering, 2011, 61(2): 322-335.
  • 8Shi X H, Wang L P, Zhou Y, et al. An ant colony optimization method for prize collecting traveling saleman problem with time windows[C]// Proceedings of the 4th International Conference on Natural Computation, Shanghai: IEEE, 2008:480 -484.
  • 9Beaumet G, Verfaillie G. Charmeau M. Decision-making on-board an autonomous agile earth-observing satel- lite[EB/OL]. Scheduling and Planning Applications woRKshop, (2010-06-04)[2011-06-20]. http://decsai.ugr.es/ lcv/SPARK/08/wsProgram.html.
  • 10Li Y, Xu M, Wang R. Scheduling observations of agile satellites with combined genetic algorithm[C]//Proceedings the 3th International Conference on Natural Computation, Shanghai: IEEE, 2007: 29-33.

二级参考文献4

共引文献62

同被引文献192

引证文献18

二级引证文献119

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部