Width-based algorithms search for solutions through a general definition of state novelty. These algorithms have been shown to result in state-of-the-art performance in classical planning, and have been successfully applied to model-based and model-free settings where the dynamics of the problem are given through simulation engines. Width-based algorithms performance is understood theoretically through the notion of planning width, providing polynomial guarantees on their runtime and memory consumption. To facilitate synergies across research communities, this paper summarizes the area of width-based planning, and surveys current and future research directions.

翻译：基于宽度的算法通过对国家新事物的一般定义寻找解决办法。这些算法已证明在古典规划中取得了最先进的表现,并成功地应用于模拟引擎给出问题动态的基于模型和无模型的环境下。基于宽度的算法表现在理论上通过规划宽度的概念来理解,为其运行时间和记忆消耗提供多种保证。为了促进各研究社区之间的协同作用,本文件总结了基于宽度的规划领域,并调查当前和今后的研究方向。