A generally intelligent agent requires an open-scope world model: one rich enough to tackle any of the wide range of tasks it may be asked to solve over its operational lifetime. Unfortunately, planning to solve any specific task using such a rich model is computationally intractable - even for state-of-the-art methods - due to the many states and actions that are necessarily present in the model but irrelevant to that problem. We propose task scoping: a method that exploits knowledge of the initial condition, goal condition, and transition-dynamics structure of a task to automatically and efficiently prune provably irrelevant factors and actions from a planning problem, which can dramatically decrease planning time. We prove that task scoping never deletes relevant factors or actions, characterize its computational complexity, and characterize the planning problems for which it is especially useful. Finally, we empirically evaluate task scoping on a variety of domains and demonstrate that using it as a pre-planning step can reduce the state-action space of various planning problems by orders of magnitude and speed up planning. When applied to a complex Minecraft domain, our approach speeds up a state-of-the-art planner by 30 times, including the time required for task scoping itself.
翻译:一般来说,智能剂需要一种开放范围的世界模型:一个足够丰富的模型,足以处理其运作寿命期间可能要求它解决的任何广泛任务。 不幸的是,计划用这种丰富模型解决任何具体任务,在计算上是难以解决的,即使是最先进的方法,因为模型中存在许多必然存在但与该问题无关的国家和行动。我们提议任务范围界定:一种方法,利用任务初始条件、目标条件和过渡动力结构的知识,自动和有效地从规划问题中排除可能大大缩短规划时间的不相关因素和行动。我们证明任务范围界定从不删除相关因素或行动,其计算复杂性的特点,以及它特别有用的规划问题。最后,我们从经验上评估了不同领域的任务范围,并表明将它作为规划前步骤,可以减少各种规划问题的国家行动空间的规模和速度。当应用于复杂的排雷领域时,我们的方法将加快30次,包括任务范围界定所需的时间。