There is a robot with two grippers. It can carry a ball in each. The goal is to take N balls from one room to another; N rises with problem number. Some planners treat the two grippers asymmetrically, giving rise to an unnecessary combinatorial explosion.
Jana Koehler
file | original name |
---|---|
domain.pddl | domain.pddl |
instance-1.pddl | prob01.pddl |
instance-2.pddl | prob02.pddl |
instance-3.pddl | prob03.pddl |
instance-4.pddl | prob04.pddl |
instance-5.pddl | prob05.pddl |
instance-6.pddl | prob06.pddl |
instance-7.pddl | prob07.pddl |
instance-8.pddl | prob08.pddl |
instance-9.pddl | prob09.pddl |
instance-10.pddl | prob10.pddl |
instance-11.pddl | prob11.pddl |
instance-12.pddl | prob12.pddl |
instance-13.pddl | prob13.pddl |
instance-14.pddl | prob14.pddl |
instance-15.pddl | prob15.pddl |
instance-16.pddl | prob16.pddl |
instance-17.pddl | prob17.pddl |
instance-18.pddl | prob18.pddl |
instance-19.pddl | prob19.pddl |
instance-20.pddl | prob20.pddl |