There are a set of divers, each of who can carry four tanks of air. These divers must be hired to go into an underwater cave and either take photos or prepare the way for other divers by dropping full tanks of air. The cave is too narrow for more than one diver to enter at a time.
The cave system is represented by an undirected acyclic graph. Divers have a single point of entry. Certain leaf nodes of the cave branches are objectives that the divers must photograph. Swimming and photographing both consume air tanks. Divers must exit the cave and decompress at the end. They can therefore only make a single trip into the cave.
Certain divers have no confidence in other divers and will refuse to work if someone they have no confidence in has already worked. Divers have hiring costs inversely proportional to how hard they are to work with.
Nathan Robinson, Christian Muise, and Charles Gretton
| file | original name |
|---|---|
| domain.pddl | domain.pddl |
| instance-1.pddl | testing01.pddl |
| instance-2.pddl | testing01_easy.pddl |
| instance-3.pddl | testing02_easy.pddl |
| instance-4.pddl | testing03_easy.pddl |
| instance-5.pddl | testing04_easy.pddl |
| instance-6.pddl | testing05A_easy.pddl |
| instance-7.pddl | testing06A_easy.pddl |
| instance-8.pddl | testing07_easy.pddl |
| instance-9.pddl | testing08_easy.pddl |
| instance-10.pddl | testing09_easy.pddl |
| instance-11.pddl | testing10_easy.pddl |
| instance-12.pddl | testing11_easy.pddl |
| instance-13.pddl | testing12_easy.pddl |
| instance-14.pddl | testing13_easy.pddl |
| instance-15.pddl | testing14_easy.pddl |
| instance-16.pddl | testing15_easy.pddl |
| instance-17.pddl | testing16_easy.pddl |
| instance-18.pddl | testing18A_easy.pddl |
| instance-19.pddl | testing18_easy.pddl |
| instance-20.pddl | testing20A_easy.pddl |