首页|基于HTN的巡视器动态规划方法

基于HTN的巡视器动态规划方法

扫码查看
为提升深空探测任务中巡视器动态规划处理效率,从航天工程实践经验出发,结合分层任务网络(hierarchical task network,HTN)理论研究成果,提出巡视器领域知识建模方法以及动态规划流程。针对经典动作规划系统不能处理时态约束关系的问题,在建模中引入受限状态事件的表示方法。针对动态规划中的时态约束关系,拓展Allen区间代数的定义,提出事件、全局时间点和虚拟事件的时序逻辑判断方法。针对动态规划中存在的状态空间一致性问题,提出虚拟指令继承原有状态空间的方法。研究结果完善了 HTN在航天领域的知识建模方法,解决了经典动作规划缺少时间信息约束的缺陷。所提出的虚拟事件、虚拟指令解决动态规划状态判定方法,可有效提高深空探测任务中巡视器遥操作的工作效能和地面中心进行事件处理的灵活性。
Dynamic planning method based HTN for rover
In order to improve the efficiency of dynamic planning processing for inspectors in deep space exploration missions,a knowledge modeling method and dynamic planning process are proposed for inspectors based on practical experience in aerospace engineering,combined with the theoretical research results of hierarchical task network(HTN).To address the issue of classical action planning systems not being able to handle temporal constraint relationships,a representation method for constrained state events is introduced in modeling.To address the temporal constraints in dynamic programming,the definition of Allen interval algebra is extended,and a temporal logic judgment method for events,global time points,and virtual events is proposed.A method for virtual instructions to inherit the original state space is proposed to address the issue of state space consistency in dynamic planning.The research results have improved the knowledge modeling method of HTN in the aerospace field,solved the defect of lack of time information constraints in classical action planning.The proposed virtual events and virtual instructions to solve dynamic planning state judgment can effectively improve the work efficiency of remote operation of the inspector in deep space exploration tasks and the flexibility of event processing in the ground center.

hierarchical task network(HTN)dynamic programmingvirtual instructionteleoperation

师明、高宇辉、张弓

展开 >

北京航天飞行控制中心,北京 100094

航天飞行动力学技术重点实验室,北京 100094

分层任务网络 动态规划 虚拟指令 遥操作

国家自然科学基金

72131009

2024

系统工程与电子技术
中国航天科工防御技术研究院 中国宇航学会 中国系统工程学会

系统工程与电子技术

CSTPCD北大核心
影响因子:0.847
ISSN:1001-506X
年,卷(期):2024.46(2)
  • 28