arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1110.1016cs.AI
收藏

规划的工程基准:用于IPC-4确定性部分的领域

Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4

Max Planck Institute for Computer Science(马克斯·普朗克计算机科学研究所);Universität Dortmund(多特蒙德大学);The Australian National University(澳大利亚国立大学);Deutsche Telekom Laboratories(德国电信实验室);PUC-Rio(里约热内卢天主教大学);Universität Freiburg(弗莱堡大学)

S. Edelkamp, R. Englert, J. Hoffmann, F. Liporace, S. Thiebaux, S. Trueg

摘要:

在一般推理机制的研究领域中,有适当的基准是必不可少的。理想的情况是,基准应反映所开发技术的可能应用。在人工智能规划中,研究人员越来越倾向于从国际规划竞赛(IPC)中使用的基准集合中提取测试示例。因此,在第四个IPC(IPC-4)的组织(确定性部分)中,作者投入了大量精力来创建一组有用的基准。他们来自五个不同的(潜在的)现实世界的规划应用:机场地面交通控制,石油衍生物在管道网络中的运输,模型检查安全属性,电源恢复,UMTS呼叫建立。调整和准备这样一个应用程序作为IPC中的基准,涉及到不可避免的(通常是激烈的)简化,以及领域编码之间的仔细选择和工程。在IPC中,我们第一次使用编译来用简单的语言(如MAPS)来表达复杂的领域特征,而不仅仅是在简单的语言子集中丢弃更有趣的问题约束。本文解释和讨论了五个应用领域及其适应性,以形成IPC-4中使用的PDDL测试套件。我们总结了已知的理论结果的域的结构特性,关于其计算复杂性和证明其拓扑结构下的h+函数(一个理想化版本的放松计划启发式)的属性。我们提出了新的(经验)结果照明的性质,如质量最广泛的启发式功能(规划图,串行规划图,和放松计划),增长的命题表示实例大小,以及可用于实现每个事实的行动的数量;我们讨论这些数据与最好的结果,由不同种类的规划人员参加IPC-4。

英文摘要:

In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the developed technology. In AI Planning, researchers more and more tend to draw their testing examples from the benchmark collections used in the International Planning Competition (IPC). In the organization of (the deterministic part of) the fourth IPC, IPC-4, the authors therefore invested significant effort to create a useful set of benchmarks. They come from five different (potential) real-world applications of planning: airport ground traffic control, oil derivative transportation in pipeline networks, model-checking safety properties, power supply restoration, and UMTS call setup. Adapting and preparing such an application for use as a benchmark in the IPC involves, at the time, inevitable (often drastic) simplifications, as well as careful choice between, and engineering of, domain encodings. For the first time in the IPC, we used compilations to formulate complex domain features in simple languages such as STRIPS, rather than just dropping the more interesting problem constraints in the simpler language subsets. The article explains and discusses the five application domains and their adaptation to form the PDDL test suites used in IPC-4. We summarize known theoretical results on structural properties of the domains, regarding their computational complexity and provable properties of their topology under the h+ function (an idealized version of the relaxed plan heuristic). We present new (empirical) results illuminating properties such as the quality of the most wide-spread heuristic functions (planning graph, serial planning graph, and relaxed plan), the growth of propositional representations over instance size, and the number of actions available to achieve each fact; we discuss these data in conjunction with the best results achieved by the different kinds of planners participating in IPC-4.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑