论文标题
有效的HTN，用于编码并发计划的条带
An Efficient HTN to STRIPS Encoding for Concurrent Plans
论文作者
论文摘要
分层任务网络（HTN）形式主义用于以将任务分解为siktaks表达各种计划问题。已经提出了许多技术来解决此类层次计划问题。一种特定的技术是将层次规划问题编码为经典条款规划问题。该技术的优点之一是直接从Strips Planners的不断改进中受益。但是，仍然几乎没有有效和表现力的编码。在本文中，我们提出了一个新的HTN，以编码带有并发计划的编码。我们通过实验表明，这对层次IPC基准测试的编码优于先前的方法。
The Hierarchical Task Network (HTN) formalism is used to express a wide variety of planning problems in terms of decompositions of tasks into subtaks. Many techniques have been proposed to solve such hierarchical planning problems. A particular technique is to encode hierarchical planning problems as classical STRIPS planning problems. One advantage of this technique is to benefit directly from the constant improvements made by STRIPS planners. However, there are still few effective and expressive encodings. In this paper, we present a new HTN to STRIPS encoding allowing to generate concurrent plans. We show experimentally that this encoding outperforms previous approaches on hierarchical IPC benchmarks.
