Symmetry-Based Task Reduction for Relaxed Reachability Analysis
Symmetry-Based Task Reduction for Relaxed Reachability Analysis
复制标题
用于宽松可达性分析的基于对称的任务缩减
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
Michael Katz
中科院分区：
文献类型：
--
作者：
Gabriele Röger;Silvan Sievers;Michael Katz
松弛的可及性分析与有效的接地，不变的合成以及基于松弛的启发式方法的计算有关。规划域通常是在提起的表示中指定的，其中任务的大小随世界上对象的数量而呈指数增长。这种增长还会影响放松的可达性分析。我们根据提升表示的对称性提出了一个降低任务，该任务允许对较小的任务执行相同的分析。
Relaxed reachability analysis is relevant to efficient grounding, invariant synthesis as well as the computation of relaxation-based heuristics. Planning domains are typically specified in a lifted representation, where the size of the tasks grows exponentially with the number of objects in the world. This growth also affects the analysis of relaxed reachability. We present a task reduction based on symmetries of the lifted representation that allows to perform the same analysis on smaller tasks.