Following it is the representation HTN planning domain for the teaching activities, and the overall architecture of DTPS.
并介绍了如何设计一个用于描述教学活动的HTN规划的领域表示，以及DTPS系统的整体架构。
Ordered task decomposition (OTD) algorithm is an efficient algorithm for hierarchical task network (HTN) planning.
顺序任务分解算法(otd)是层次任务网规划(HTN)中的一种高效求解算法。
The agent's planning forms a partial ordered plan tree using HTN method.
主体规划使用HTN方法，形成偏序规划树。
HTN (Hierarchical task network) planning has the power of representing and decomposing task network as well dispatching the subtasks, and also can accomplish the tasks network.
层次任务网络具有任务描述和分解、任务分派、任务完成的能力以及约束机制和冲突解决机制，可以高效地对复杂问题进行规划。
HTN (Hierarchical task network) planning has the power of representing and decomposing task network as well dispatching the subtasks, and also can accomplish the tasks network.
层次任务网络具有任务描述和分解、任务分派、任务完成的能力以及约束机制和冲突解决机制，可以高效地对复杂问题进行规划。
应用推荐