| 引用本文: | 梁彦刚,王伟林.在轨服务航天器任务指派问题.[J].国防科技大学学报,2013,35(5):26-30,51.[点击复制] |
| LIANG Yangang,WANG Weilin.Research on mission assignment of on-orbit servicing spacecraft[J].Journal of National University of Defense Technology,2013,35(5):26-30,51[点击复制] |
|
| |
|
|
| 本文已被：浏览 7139次 下载 6782次 |
| 在轨服务航天器任务指派问题 |
| 梁彦刚, 王伟林 |
|
(国防科技大学 航天科学与工程学院， 湖南 长沙 410073)
|
| 摘要: |
| 一个在轨服务可有多种服务选择，必须进行合理的任务指派。首先求解服务航天器满足燃耗约束下的可达区域，筛选出满足可达范围要求的目标航天器。然后，以任务执行时间、燃料消耗和航天器服务优先级为优化目标，研究多目标的任务指派问题。通过设计决策变量，考虑时间、燃耗等约束，建立了基于0-1整数规划的任务模型，采用NSGA- Ⅱ算法，求得问题的Pareto最优集，得到多组可供任务设计者选择自己偏好的折中方案。给出了两个多目标优化的仿真算例，算例一给出了任务指派的一般研究结论，算例二对比了另外一种算法：分层-加权法。仿真结果表明利用给出的方法可以较好地解决多目标下在轨服务任务指派问题。 |
| 关键词: 在轨服务 可达区域 任务指派 多目标 整数规划 NSGA-Ⅱ |
| DOI： |
| 投稿日期：2013-02-03 |
| 基金项目:国家863计划资助项目 |
|
| Research on mission assignment of on-orbit servicing spacecraft |
| LIANG Yangang, WANG Weilin |
|
(College of Aerospace Science and Engineering, National University of Defense Technology, Changsha 410073, China)
|
| Abstract: |
| One mission of on-orbit servicing can be fulfilled in many ways, and proper mission assignment must be guaranteed. In light of this, first, the reachable domain of service spacecraft was resolved and the target spacecraft which satisfies the reachable domain was filtered. Then the assignment of servicing based on the optimization of multi-objective, including time, fuel consumption and priority, was studied. The best plan was achieved by building the model of 0-1 integer programming and taking the NSGA-Ⅱ algorithm with the constraint of time and fuel consumption. Finally two examples of simulation were given, one demonstrating the general results of the above method, either compared with another algorithm. The simulation results indicate that the above method is effective in solving the problem of mission assignment for on-orbit servicing. |
| Keywords: on-orbit servicing reachable domain mission assignment multi-objective integer programming NSGA-Ⅱ |
|
|
