Generalized planningstudies the representation, computation and evaluation of solutions that are valid for multiple planning instances. These are topics studied since the early days of AI. However, in recent years, we are experiencing the appearance of novel formalisms to compactly represent generalized planning tasks, the solutions to these tasks (calledgeneralized plans) and efficient algorithms to compute generalized plans. The paper reviews recent advances in generalized planning and relates them to existing planning formalisms, such asplanning with domain control knowledgeand approaches forplanning under uncertainty, that also aim at generality.

中文翻译：

---

广义规划的回顾

广义规划研究对多个规划实例有效的解决方案的表示、计算和评估。这些是自人工智能早期以来研究的主题。然而，近年来，我们正在经历新的形式主义的出现，以紧凑地表示广义规划任务，这些任务的解决方案（称为综合计划) 和计算广义计划的有效算法。本文回顾了广义规划的最新进展，并将其与现有的规划形式联系起来，例如具有领域控制知识的规划和方法不确定性下的规划，这也是针对一般性的。