论文标题
用于广义计划的C ++程序的代表和合成
Representation and Synthesis of C++ Programs for Generalized Planning
论文作者
论文摘要
本文介绍了通用计划（GP）问题及其解决方案的新颖代表，作为C ++程序。我们的C ++表示允许正式证明终止广义计划，并指定其渐近复杂性W.R.T.世界对象的数量。表征C ++广义计划的复杂性，可以应用组合搜索，该搜索以复杂性顺序列举了可能的GP解决方案的空间。实验结果表明，我们称之为BFGP ++的实施，我们的实施优于先前的GP作为启发式搜索方法，用于计算以编译器式程序为代表的通用计划。最后但并非最不重要的一点是，在经典计划实例上执行C ++程序是一个无确定性的接地且无搜索的过程，因此我们的C ++表示允许我们自动验证数千个对象的大型测试实例中计算的解决方案，其中现成的经典计划者可以将其固定在预处理或搜索中。
The paper introduces a novel representation for Generalized Planning (GP) problems, and their solutions, as C++ programs. Our C++ representation allows to formally proving the termination of generalized plans, and to specifying their asymptotic complexity w.r.t. the number of world objects. Characterizing the complexity of C++ generalized plans enables the application of a combinatorial search that enumerates the space of possible GP solutions in order of complexity. Experimental results show that our implementation of this approach, which we call BFGP++, outperforms the previous GP as heuristic search approach for the computation of generalized plans represented as compiler-styled programs. Last but not least, the execution of a C++ program on a classical planning instance is a deterministic grounding-free and search-free process, so our C++ representation allows us to automatically validate the computed solutions on large test instances of thousands of objects, where off-the-shelf classical planners get stuck either in the pre-processing or in the search.
