No mystery is a transportation domain designed to study resource constrained planning [1, 2]. In this domain, a truck moves in a weighted graph; a set of packages must be transported between nodes; actions move along edges, and load/unload packages; each move consumes the edge weight in fuel. In brief, no mystery is a straightforward problem similar to the ones contained in many IPC benchmarks.
[1] H. Nakhost, J. Hoffmann, and M. Müller: Improving local search for resource-constrained planning. Technical Report TR 10-02, Dept. of Computing Science, University of Alberta, Edmonton, Alberta, Canada, 2010
[2] J. Hoffmann, H. Kautz, C. Gomes, and B. Selman: SAT Encodings of State-Space Reachability Problems in Numeric Domains. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-07), 2007, pp. 1918–1923
Hootan Nakhost
| file | original name |
|---|---|
| domain.pddl | domain.pddl |
| instance-1.pddl | p01.pddl |
| instance-2.pddl | p02.pddl |
| instance-3.pddl | p03.pddl |
| instance-4.pddl | p04.pddl |
| instance-5.pddl | p05.pddl |
| instance-6.pddl | p06.pddl |
| instance-7.pddl | p07.pddl |
| instance-8.pddl | p08.pddl |
| instance-9.pddl | p09.pddl |
| instance-10.pddl | p10.pddl |
| instance-11.pddl | p11.pddl |
| instance-12.pddl | p12.pddl |
| instance-13.pddl | p13.pddl |
| instance-14.pddl | p14.pddl |
| instance-15.pddl | p15.pddl |
| instance-16.pddl | p16.pddl |
| instance-17.pddl | p17.pddl |
| instance-18.pddl | p18.pddl |
| instance-19.pddl | p19.pddl |
| instance-20.pddl | p20.pddl |