Interactive Narrative Planning in The Best Laid Plans
Authors: Stephen Ware, R. Young, Christian Stith, Phillip Wright
AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Glaive typically finds dozens of solutions if any exist, and planning takes about 2 seconds depending on the speed of the computer on which it is running. |
| Researcher Affiliation | Academia | Stephen G. Ware University of New Orleans Department of Computer Science 2000 Lakeshore Drive New Orleans, LA 70148, USA R. Michael Young and Phillip Wright North Carolina State University Department of Computer Science 890 Oval Drive Raleigh, NC 27695, USA Christian Stith Clemson University Digital Production Arts 100 Mc Adams Hall Clemson, SC 29634, USA |
| Pseudocode | No | The paper describes the system and its components but does not include any structured pseudocode or algorithm blocks. |
| Open Source Code | Yes | The Best Laid Plans is freely available to play and modify: http://liquidnarrative.csc.ncsu.edu/blp/ |
| Open Datasets | No | The paper describes a custom virtual environment for the game The Best Laid Plans, but does not provide access information or specify a publicly available dataset. |
| Dataset Splits | No | The paper describes an interactive game system and its planner, but does not specify any training, validation, or test dataset splits. |
| Hardware Specification | No | The paper mentions 'depending on the speed of the computer on which it is running' but does not provide specific hardware details such as CPU/GPU models or memory. |
| Software Dependencies | Yes | The client is the 3D virtual world and interface, which was created with the Unity 3D game engine. The server ... was created with Java 1.7 |
| Experiment Setup | Yes | The Best Laid Plans is a small but non-trivial virtual environment containing 9 characters, 15 locations, and 17 items. Agents can take 10 different kinds of actions and cast four kinds of spells. Each time the player acts out a plan, Glaive searches the first 5000 nodes in the problem s search space to find a plan in which the NPCs thwart the goblin. |