A Native Qualitative Numeric Planning Solver Based on AND/OR Graph Search
Authors: Hemeng Zeng, Yikun Liang, Yongmei Liu
IJCAI 2022 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Experimental results show that DSET is faster than the FOND-compilation approach by one order of magnitude, and comparable with the FOND+-compilation approach. |
| Researcher Affiliation | Academia | Dept. of Computer Science, Sun Yat-sen University, Guangzhou 510006, China |
| Pseudocode | Yes | Algorithm 1: SIEVE; Algorithm 2: QNP Solver; Algorithm 3: EXPAND(s); Algorithm 4: BACKTRACK |
| Open Source Code | Yes | Based on the proposed approach, we implemented a QNP solver DSET1, meaning Direct Search and Early Terminationtesting. ... 1DSET is available at https://github.com/sysulic/DSET |
| Open Datasets | Yes | Chopping Tree, Nest2, Nest3 and Shoveling Snow are from Srivastava et al. [2011]. Blocks On, Delivery2, Gripper1 and Rewards are from Bonet et al. [2019]. Blocks Clear, Delivery1, Delivery3, Q1, Q2 and Q3 are from Bonet and Geffner [2020] and Q2 is an unsolvable domain. |
| Dataset Splits | No | The paper uses predefined QNP problem domains for evaluation but does not describe training, validation, or test dataset splits in the typical machine learning sense. |
| Hardware Specification | Yes | All the experiments were conducted on a Linux machine with a 2.9GHz Intel 10700 CPU and 4GB of memory. |
| Software Dependencies | No | The paper mentions other solvers like PRP [Muise et al., 2012], FOND-SAT [Geffner and Geffner, 2018], and FOND-ASP [Rodriguez et al., 2021], but it does not provide specific version numbers for these or other software dependencies. |
| Experiment Setup | Yes | The timeout is set to 1800 seconds to prevent a solver from running indefinitely. To eliminate the interference of background processes, for each problem, we run each solver 10 times, which is an empirical value, and take the average as the reported running time. |