TLP-GP: New Results on Temporally-Expressive Planning Benchmarks
TLP-GP: New Results on Temporally-Expressive Planning Benchmarks
复制标题
TLP-GP：时间表达规划基准的新结果
DOI：
10.1109/ictai.2008.90
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
P. Régnier
中科院分区：
文献类型：
--
作者：
Frédéric Maris;P. Régnier
规划的主要挑战之一是考虑到时间维度。在这篇文章中，我们提出了一种简单的方法来处理时间表达问题，即所有可能的解决方案都需要动作的并发。我们的规划器TLP-GP将GRAPHPLAN搜索的一些优势与基于约束和灵活的时间形式化混合在一起。它的语言与PDDL2.1一致，并扩展了其表现力。在新的时间表达基准上的实验测试表明了我们方法的有效性，并展示了解决到目前为止用现有技术无法解决的时间表达问题的实际可能性。
One of the major challenges for planning is to take into account the time dimension. In this paper, we present a simple approach to deal with temporally expressive problems, that is problems for which all possible solutions require concurrency of actions. Our planner TLP-GP mixes some of the advantages of GRAPHPLAN search with a constraint-based and flexible temporal formalism. Its language is consistent with PDDL 2.1 and extends its expressivity. Experimental trials on new temporally expressive benchmarks show the efficiency of our approach and demonstrate the practical possibility of solving temporally expressive problems which up until now were unsolvable by existing techniques.