欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对航天器自主任务规划中的资源受限、约束复杂、活动并行等问题，提出了基于时间拓扑排序的航天器资源计算方法。考虑规划结果中资源产生及消耗，采用资源约束网络模型表示规划中动作的资源需求。通过分析资源变化与动作执行时间的关系，在资源处理过程中对资源约束网络的资源突变时刻进行拓扑排序，优化了流量推进路径的选择过程，时间复杂度为O（n^2）。数值仿真结果表明，算法提高了规划过程中资源处理的效率。
英文摘要：
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.
同期刊论文项目
同项目期刊论文
期刊信息
位置：