Computing Applicability Conditions for Plans with Loops
Computing Applicability Conditions for Plans with Loops
复制标题
计算带循环的计划的适用性条件
DOI：
--
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
S. Zilberstein
中科院分区：
文献类型：
--
作者：
Siddharth Srivastava;N. Immerman;S. Zilberstein
规划界早就认识到在规划中包含循环的效用。计划中的循环有助于增加其适用性和表示的紧凑性。然而，由于缺乏对动作循环的正确性和安全性进行推理的方法，寻找这类计划的进展一直受到限制。我们提出了一种新的算法来确定一般类型的动作循环的适用性和进展。这些方法可用于在保证终止的情况下，指导对具有循环的规划的搜索，使其具有更大的适用性，也可用于计算后的规划的后处理，以精确地表征其适用性。实验结果证明了这些算法的有效性。
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representation. However, progress in finding such plans has been limited largely due to lack of methods for reasoning about the correctness and safety properties of loops of actions. We present novel algorithms for determining the applicability and progress made by a general class of loops of actions. These methods can be used for directing the search for plans with loops towards greater applicability while guaranteeing termination, as well as in post-processing of computed plans to precisely characterize their applicability. Experimental results demonstrate the efficiency of these algorithms.