贪婪算法与动态规划结合的任务规划方法  

Mission Planning Method of the Greedy Algorithm and Dynamic Programming

作　　者：李博权[1,2,3] 李绪志[2] 王红飞[2] 孟娟[2] 

机构地区：[1]中国科学院光电研究院,北京100094 [2]中国科学院空间应用工程与技术中心,北京100094 [3]中国科学院研究生院,北京100190

出　　处：《微电子学与计算机》2013年第2期144-147,共4页Microelectronics & Computer

基　　金：国家"八六三"计划项目(2007AA120202)

摘　　要：针对大型航天器对地观测载荷多、约束复杂、资源受限的问题,综合分析对地观测载太阳高度角约束、观测模式的约束、数据下传的约束、载荷侧摆约束.把载荷观测约束转换为01背包模型,并将动态规划算法与贪婪思想相融合,提出了贪婪动态规划算法,在相同观测需求下形成固定观测计划,并且解决了区域观测需求与观测冲突.实验结果表明该混合算法在空间多载荷联合对地观测任务规划领域是可行有效的.Big spacecraft has many payloads with complexity constraints and the spacecraft resource-constrained problems. Comprehensive analysis the constraints of the solar altitude angle, the observation mode, the data transmission and the load side of pendulum. Payloads observation constraints are converted to O1 backpack model, combine greedy idea with dynamic programming. Make the fixed observing plan under the same observation needs. Solve regional observation needs and observation conflict with greedy dynamic programming. Experimental results show that the hybrid algorithm is suitable for multiple payloads earth observation mission planning.

关 键 词：任务规划 对地观测 多载荷 协同工作 

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