nextupprevious
Next: Puzzle Up: The GRT Planning System Previous: Gripper

8.6.6.      Hanoi

We ran the planners in 6 hanoi problems, taken by Bonet and Geffner (2001). The six problems have three to eight disks respectively. Figure 21 presents the results.

 

 

Figure 21: Solution length and time (msecs) in the hanoi domain.

 

Regarding the solution length, all the planners found identical plans, with the exception of the last two problems, where Grt found worse plans. Regarding the solution time, Ff was the faster, then came Grt and Hsp-2, then Altalt and last came Stan.

 

nextupprevious
Next: Puzzle Up: The GRT Planning System Previous: Gripper

Ioannis Refanidis

14-8-2001