论文标题
使用PDDL中的复杂数据类型进行计划
Planning with Complex Data Types in PDDL
论文作者
论文摘要
实际上，所有计划研究都仅限于以布尔和数字状态变量为代表的州。许多实际问题，例如，在复杂的软件系统内进行计划，需要更复杂的数据类型，甚至在许多情况下甚至实际计划都需要诸如对象集之类的概念，这些概念不方便地在具有标量类型的模型语言中表达。在这项工作中，我们研究了复杂软件系统的建模语言，该语言支持集合，数组，记录和工会等复杂数据类型。我们将广泛的复杂数据类型及其操作减少到布尔逻辑，然后将此表示形式进一步映射到PDDL，以与域无关的PDDL计划者一起使用。我们评估了这种方法的实用性，并为PDDL翻译中出现的某些问题提供了解决方案。
Practically all of the planning research is limited to states represented in terms of Boolean and numeric state variables. Many practical problems, for example, planning inside complex software systems, require far more complex data types, and even real-world planning in many cases requires concepts such as sets of objects, which are not convenient to express in modeling languages with scalar types only. In this work, we investigate a modeling language for complex software systems, which supports complex data types such as sets, arrays, records, and unions. We give a reduction of a broad range of complex data types and their operations to Boolean logic, and then map this representation further to PDDL to be used with domain-independent PDDL planners. We evaluate the practicality of this approach, and provide solutions to some of the issues that arise in the PDDL translation.
