论文标题

Fape:基于约束的生成和分层时间计划的计划者

FAPE: a Constraint-based Planner for Generative and Hierarchical Temporal Planning

论文作者

Bit-Monnot, Arthur, Ghallab, Malik, Ingrand, Félix, Smith, David E.

论文摘要

根据表达式表示,时间计划在许多优势上都具有许多优势。众所周知,时间表提供了所需的表现力,但以搜索效率为代价。我们在这里提出了一个名为Fape的时间计划者,该计划者支持ANML建模语言的许多表达时间特征,而不会失去效率。 Fape的表示将灵活的时间表与可以提供有效控制知识的层次改进方法相干。提出了一种新型的可及性分析技术,并用于开发因果网络以限制搜索空间。它用于设计知情的启发式方法,推理方法和有效的搜索策略。对现场常见基准测试的实验结果可以评估FAPE的组成部分和搜索策略,并将其与IPC计划者进行比较。结果表明,提出的方法与表达式较低的计划者具有竞争力,并且在提供层次控制知识时通常会出色。 Fape是一种自由使用的系统,提供了其他功能,此处未涵盖的其他功能,例如计划与表演的整合以及在可观察到的环境中处理感应动作。

Temporal planning offers numerous advantages when based on an expressive representation. Timelines have been known to provide the required expressiveness but at the cost of search efficiency. We propose here a temporal planner, called FAPE, which supports many of the expressive temporal features of the ANML modeling language without loosing efficiency. FAPE's representation coherently integrates flexible timelines with hierarchical refinement methods that can provide efficient control knowledge. A novel reachability analysis technique is proposed and used to develop causal networks to constrain the search space. It is employed for the design of informed heuristics, inference methods and efficient search strategies. Experimental results on common benchmarks in the field permit to assess the components and search strategies of FAPE, and to compare it to IPC planners. The results show the proposed approach to be competitive with less expressive planners and often superior when hierarchical control knowledge is provided. FAPE, a freely available system, provides other features, not covered here, such as the integration of planning with acting, and the handling of sensing actions in partially observable environments.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源