New Metrics and Algorithms for Stochastic Goal Recognition Design Problems
Authors: Christabel Wayllace, Ping Hou, William Yeoh
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Tables 1 and 2 tabulate the results when the number of actions that can be blocked (k) is 1 and 2, respectively. The experiments were conducted on a 3.1GHz quad-core machine with 6GB of RAM and we imposed a timeout of 2 days. We compared three algorithms to compute the wcdag: ENUM, which explicitly enumerates through all policies using Equation 4 and both VI and TVI as described in Section 5. We also computed the wcd using the REDUCE-WCD algorithm with optimization [Wayllace et al., 2016] (labeled as R-W(O)). To compute the ecd, we only compared VI and TVI because explicit enumeration of policies is not needed as it is equivalent to evaluating a single policy. |
| Researcher Affiliation | Academia | Christabel Wayllace Computer Science Department New Mexico State University Las Cruces, NM 88003, USA cwayllac@cs.nmsu.edu Ping Hou Computer Science Department New Mexico State University Las Cruces, NM 88003, USA phou@cs.nmsu.edu William Yeoh Computer Science Department New Mexico State University Las Cruces, NM 88003, USA wyeoh@cs.nmsu.edu |
| Pseudocode | No | The paper describes algorithms in prose and mathematical equations but does not include structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide concrete access to source code, nor does it explicitly state that source code for its methodology is being released. |
| Open Datasets | Yes | The first domain is called ROOM, which is used in the Non Deterministic Track of the 2006 ICAPS International Planning Competition.3 It is a grid world where the actions as well as the transition probabilities are defined individually for each state. ... The remaining domains were used in the Probabilistic Track of 2004 ICAPS International Planning Competition:4 BLOCKSWORLD is the traditional domain with a 25% probability of slippage each time a block is picked up or put down; the goal state defines the last position of every block. |
| Dataset Splits | No | The paper describes the domains and instances used (e.g., 8-8-3, 32-32-2 for ROOM domain, 5-5-3 for GRID-NAVIGATION), but it does not specify any training, validation, or test dataset splits. The problem is framed as finding optimal actions in a given domain, not training a model on data splits. |
| Hardware Specification | Yes | The experiments were conducted on a 3.1GHz quad-core machine with 6GB of RAM and we imposed a timeout of 2 days. |
| Software Dependencies | No | The paper does not provide specific ancillary software details with version numbers. It mentions algorithms like Value Iteration (VI) and Topological VI (TVI) but not the software environment or libraries used for their implementation. |
| Experiment Setup | Yes | Tables 1 and 2 tabulate the results when the number of actions that can be blocked (k) is 1 and 2, respectively. The experiments were conducted on a 3.1GHz quad-core machine with 6GB of RAM and we imposed a timeout of 2 days. ... we assumed that all goals have equal weights when computing the ecd in order to have a fair comparison with wcdag. ... in this paper, we assume that the cost of all actions is 1 for simplicity. |