首页> 外文期刊>Aerospace science and technology >Task scheduling and attitude planning for agile earth observation satellite with intensive tasks
【24h】

Task scheduling and attitude planning for agile earth observation satellite with intensive tasks

机译:具有密集任务的敏捷地球观测卫星的任务调度和姿态规划

获取原文
获取原文并翻译 | 示例
           

摘要

This paper investigates the task scheduling and attitude planning of single agile earth observation satellite for intensive tasks. We aim to obtain the execution strategy and corresponding attitude path at the same time by the maximization of the total number of imaged tasks together with minimization of the energy cost, where the rectangle strip observation tasks are considered. Denoting the ground task as a time-varying attitude path, the whole collaborative task scheduling and attitude planning problem is modeled in the attitude apace. To prepare for the final solution, we first design a time-dependent mechanism to determinate the start working time, based on which an energy-dependent mechanism is designed to determine the attitude path corresponding for each possible execution strategy. Using the results produced by the mechanisms to construct the evaluation process, we propose a novel pseudospectral cooperative genetic algorithm (PCGA) to obtain the effective execution strategy and attitude path simultaneously. In PCGA, the genetic algorithm is employed to search the optimal solution, while the pseudospectral procedure and cooperative concept are combined into the genetic algorithm framework to further eliminate the uncertainty and obtain a compromise solution between two objectives, respectively. Simulation results demonstrate the effectiveness of proposed model and algorithm. (C) 2019 Elsevier Masson SAS. All rights reserved.
机译:本文研究了用于密集任务的单个敏捷地球观测卫星的任务调度和姿态计划。我们的目标是通过最大化成像任务的总数以及能源成本的最小化来同时获得执行策略和相应的姿态路径,其中考虑了矩形条带观察任务。将地面任务描述为随时​​间变化的态度路径,整个协作任务调度和态度计划问题均以态度空间为模型。为了准备最终解决方案,我们首先设计一种时间相关的机制来确定开始工作时间,在此基础上设计一种能量相关的机制来确定与每种可能的执行策略相对应的态度路径。利用这些机制所产生的结果来构建评估过程,我们提出了一种新的伪谱合作遗传算法(PCGA),以同时获得有效的执行策略和态度路径。在PCGA中,采用遗传算法搜索最优解,同时将伪谱过程和合作概念组合到遗传算法框架中,以进一步消除不确定性并分别获得两个目标之间的折衷解。仿真结果证明了所提模型和算法的有效性。 (C)2019 Elsevier Masson SAS。版权所有。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号