Extended Goal Recognition Design with First-Order Computation Tree Logic
Authors: Tsz-Chiu Au9661-9668
AAAI 2022 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Our experimental results show that the caching mechanism can greatly speed up our EGRD search algorithm by reusing the previous evaluation of FO-CTL sentences. We conducted two experiments to evaluate the EGRD search algorithm. In Experiment 1, we checked how well the EGRD search algorithm scales with the number of goals being recognized. ... In Experiment 2, we evaluated the improvement of the execution time due to the caching mechanism, using the goal query graph in Figure 3. Table 1 shows the results of Experiment 1. ... In Table 2, we can see that the caching mechanism can greatly enhance the performance of the algorithm. |
| Researcher Affiliation | Academia | Tsz-Chiu Au, Department of Computer Science and Engineering, Ulsan National Institute of Science and Technology Ulsan, Republic of Korea chiu@unist.ac.kr |
| Pseudocode | Yes | Algorithm 1: The EGRD search algorithm. ... Algorithm 2: Evaluate a FO-CTL sentence in M = (S, E, G, s0) with a cache C. |
| Open Source Code | No | No explicit statement or link for open-source code release is provided in the paper. |
| Open Datasets | Yes | We adopted four domains in the International Planning Competition: BLOCK-WORLD LOGISTICS, GRID, and DEPOTS. ... The planner we used was Fast Downward (Helmert 2006). |
| Dataset Splits | No | The paper describes generating 'EGRD problem instances' and evaluating on them, but it does not specify explicit training, validation, or test dataset splits in the context of model training/evaluation. |
| Hardware Specification | No | The paper does not provide specific hardware details (e.g., CPU, GPU models, memory) used for running experiments. |
| Software Dependencies | No | The paper mentions 'Fast Downward (Helmert 2006)' as a planner but does not provide specific version numbers for other key software dependencies or libraries used in their implementation. |
| Experiment Setup | Yes | In both experiments, the number of EGRD problem instances in each domain was 50, and Algorithm 1 did not use any heuristic function. |