HyperTensioN与全阶前向分解优化
HyperTensioN and Total-order Forward Decomposition optimizations
摘要:
分层任务网络(HTN)规划者使用具有额外领域知识的分解过程来生成规划,以引导对规划任务的搜索。当领域专家开发HTN描述时,他们可能会重复描述相同的前提条件,或者很少使用或可能被分解的方法。通过利用三级编译器设计,我们可以轻松地支持更多的语言描述和预处理优化,当链接时可以大大提高这些领域的运行时效率。在本文中,我们使用HTN IPC 2020中使用的HyperTensioN HTN规划器来评估此类优化。
英文摘要:
Hierarchical Task Networks (HTN) planners generate plans using a decomposition process with extra domain knowledge to guide search towards a planning task. While domain experts develop HTN descriptions, they may repeatedly describe the same preconditions, or methods that are rarely used or possible to be decomposed. By leveraging a three-stage compiler design we can easily support more language descriptions and preprocessing optimizations that when chained can greatly improve runtime efficiency in such domains. In this paper we evaluate such optimizations with the HyperTensioN HTN planner, used in the HTN IPC 2020.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。