BriefGPT.xyz
Jun, 2011
一元算子“Planning”中的结构和复杂性
Structure and Complexity in Planning with Unary Operators
HTML
PDF
R. I. Brafman, C. Domshlak
TL;DR
本文研究一元运算符领域的因果图与规划复杂度之间的关系,表明有一个多项式时间的规划生成算法存在于这样的领域中,其中的因果图导致一个具有节点入度常数上限的有向树,而图中路径的数量与相关域中的规划复杂度密切相关。
Abstract
unary operator domains
-- i.e., domains in which operators have a single effect -- arise naturally in many control problems. In its most general form, the problem of
strips planning
in
→