通过半 naive Datalog 评估实现并行提升规划
Parallel Lifted Planning via Semi-Naive Datalog Evaluation
AI总结:
本文提出一种基于半 naive Datalog 评估的并行提升规划方法,通过两级并行性提升规划效率,在多核环境下实现显著加速。
摘要:
本文提出一种基于半 naive Datalog 评估的并行提升规划方法,通过两级并行性提升规划效率,在多核环境下实现显著加速。
英文摘要:
Lifted classical planners operate directly on first-order planning tasks to avoid the computationally demanding grounding step. However, lifted planning is typically slower, as planners must repeatedly instantiate ground structures during search. Many core components of lifted classical planning, such as successor generation, axiom evaluation, task grounding, and delete-relaxed heuristics, have previously been studied through the lens of Datalog evaluation. We build upon this line of work and extend it by developing and analyzing an execution model with two levels of parallelism: rule-level parallelism and grounding parallelism. We further specialize this solver for planning-specific workloads with a grounder based on clique enumeration, which we extend to support semi-naive Datalog evaluation. Our experimental evaluation using greedy best-first search with the FF heuristic shows that our implementation already solves more tasks than the baselines on a single core, and the gap widens as additional cores are used. Moreover, on hard-to-ground tasks where on average 97.6% of the total runtime is spent in Datalog execution, the proposed execution model exhibits an average parallel fraction of 92.4%, while achieving up to a 6-fold speedup on 8 cores in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。