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

A Temporal Topological Sort Processing Method for Spacecraft Resources Constraints

作　　者：陈德相 徐瑞[1,2] 崔平远[1,2] 

机构地区：[1]北京理工大学深空探测技术研究所,北京100081 [2]飞行器动力学与控制教育部重点实验室,北京100081

出　　处：《宇航学报》2014年第6期669-676,共8页Journal of Astronautics

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

摘　　要：针对航天器自主任务规划中的资源受限、约束复杂、活动并行等问题,提出了基于时间拓扑排序的航天器资源计算方法。考虑规划结果中资源产生及消耗,采用资源约束网络模型表示规划中动作的资源需求。通过分析资源变化与动作执行时间的关系,在资源处理过程中对资源约束网络的资源突变时刻进行拓扑排序,优化了流量推进路径的选择过程,时间复杂度为O(n2)。数值仿真结果表明,算法提高了规划过程中资源处理的效率。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（n2）. Finally, the numerical simulation result shows that the algorithm improves the efficiency of resource Orocessing.

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

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]