宇航学报

宇航学报 ›› 2014, Vol. 35 ›› Issue (6): 669-676.doi: 10.3873/j.issn.1000-1328.2014.06.008

• 飞行器设计与力学 • 上一篇    下一篇

航天器资源约束的时间拓扑排序处理方法

陈德相，徐瑞，崔平远   

  1. 1.北京理工大学深空探测技术研究所，北京 100081；
    2.飞行器动力学与控制教育部重点实验室，北京 100081
  • 收稿日期:2013-06-03 修回日期:2013-10-11 出版日期:2014-06-15 发布日期:2014-06-25
  • 基金资助:

    国家重点基础研究发展计划(2012CB720000)；国家自然科学基金(60803051)；高等学校博士学科点专项科研基金 (20111101110001)；北京理工大学创新团队

A Temporal Topological Sort Processing Method for Spacecraft Resources Constraints

CHEN De xiang,  XU Rui,  CUI Ping yuan   

  1. 1.Institute of Deep Space Exploration Technology，Beijing Institute of Technology，Beijing 100081，China；
    2.Key Laboratory of Dynamics and Control of Flight Vehicle，Ministry of Education，Beijing 100081，China
  • Received:2013-06-03 Revised:2013-10-11 Online:2014-06-15 Published:2014-06-25

PDF

690

摘要：

针对航天器自主任务规划中的资源受限、约束复杂、活动并行等问题，提出了基于时间拓扑排序的航天器资源计算方法。考虑规划结果中资源产生及消耗，采用资源约束网络模型表示规划中动作的资源需求。通过分析资源变化与动作执行时间的关系，在资源处理过程中对资源约束网络的资源突变时刻进行拓扑排序，优化了流量推进路径的选择过程，时间复杂度为O(n 2 )。数值仿真结果表明，算法提高了规划过程中资源处理的效率。

关键词: 航天器任务规划, 时间拓扑排序, 资源约束网络

Abstract:

Considering the limited resource, complex constraint and parallel activities, autonomous planning of spacecraft mission is investigated in this paper. A method for calculating the spacecraft resource based on the temporal topological sort is proposed. In consideration of resource production and consumption in the planning result, a resource constraint network model is introduced to express resource requirement for each activity. According to the analysis of the relations between resource changes and activity executing time, the resource mutation time of the resource constraint network is topologically sorted in the resource processing. The selection process of flow pushing path is optimized, and the time complexity is O(n 2 ). Finally, the numerical simulation result shows that the algorithm improves the efficiency of resource processing.

Key words: Spacecraft mission planning, Temporal topological sort; , Resource constraint network

中图分类号: