面向动作序列的敏捷卫星任务规划问题  

Action planning for agile earth-observing satellite mission planning problem

作　　者：孙凯[1] 白国庆[1] 陈英武[1] 贺仁杰[1] 邢立宁[1] 

机构地区：[1]国防科技大学信息系统与管理学院,湖南长沙410073

出　　处：《国防科技大学学报》2012年第6期141-147,共7页Journal of National University of Defense Technology

基　　金：国家自然科学基金资助项目(70601035;70801062)

摘　　要：针对新一代敏捷卫星对地观测任务规划问题,考虑了直拍直传、立体成像、多条带拼接等复杂任务需求和观测、数据下传、对日定向等九种卫星动作,在任务规划的同时进行卫星动作规划。设计并实现了前瞻启发式构造算法,算法满足卫星存储、能量等复杂约束,在前瞻过程中每次决定当前任务是否安排。采用基于专家知识的多种启发式规则决定任务安排与安排卫星动作序列。仿真实例及实际工程应用表明,算法可以在很短的时间内给出较好的结果,证明了本文方法对于敏捷卫星任务规划问题的适用性。The mission of Earth observing satellite （EOS） is to acquire photographs of specified areas on Earth surface at the requests of users. The goal is to select a feasible task sequence to maximize the sum of weights. This research presents the mission planning problem of the next-generation agile Earth-observing satellite （AEOS）. The complex user requests （including multi-strip area, real time download request, and stereoscopic request） and complex satellite constraints were considered, covering eight satellite actions （including observe action, data download, SSR Erase action, attitude movement, heliocentric pointing, geocentric pointing, and instrument action）. A chronological look ahead algorithm was designed to solve the problem, heuristic rules based on expert knowledge were used to make choices and arrange satellite actions, which satisfy all satellite physical constraints and operational constraints. For the current experiment instances and applications, the algorithm can give results in very short time. Experiment results suggest that our algorithm works well for the agile earth-observing satellite planning problem.

关 键 词：敏捷卫星 对地观测 任务规划 动作规划 启发式 

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