Blocksworld and Standard PDDL Domains
收藏arXiv2025-09-30 收录
下载链接:
https://github.com/rleap-project/d2l
下载链接
链接失效反馈官方服务:
资源简介:
该数据集涵盖了包括Blocksworld中清除障碍物和堆叠两个方块等简单目标的问题,同时也包含了Gripper、Spanner、Miconic和Visitall等标准的PDDL领域问题。实验是在配备Intel i7-8700 CPU和16GB内存限制的条件下进行的。该实现采用了Open-WBO加权最大SAT求解器。该数据集规模宏大,涵盖了不同领域中的多个规划问题,任务旨在实现广义规划。
This dataset contains problem instances with simple objectives such as clearing obstacles and stacking two blocks in the Blocksworld domain, as well as standard PDDL domain problems including Gripper, Spanner, Miconic, and Visitall. All experiments were conducted under the hardware constraints of an Intel i7-8700 CPU and 16 GB of RAM. The implementation adopted the Open-WBO weighted max-SAT solver. This is a large-scale dataset covering multiple planning problems across diverse domains, with the task aimed at achieving generalized planning.
提供机构:
D2L system
搜集汇总
数据集介绍

背景与挑战
背景概述
该数据集包含Blocksworld中的简单目标问题(如清除障碍物和堆叠方块)以及多个标准PDDL领域(如Gripper、Spanner、Miconic和Visitall)的规划问题。实验在Intel i7-8700 CPU和16GB内存限制下进行,使用Open-WBO加权最大SAT求解器实现,旨在通过大规模多领域问题实现广义规划。
以上内容由遇见数据集搜集并总结生成



