Practicing Doing Stuff with FF in Glitch

Oh hi,

This is Joerg Hoffman's Fast Forward planner.

Fast Forward, or FF, was Awarded for Outstanding Performance at the 2nd International Planning Competition and was Top Performer in the Strips Track of the 3rd International Planning Competition.

Planners take a domain, a description of a few different verbs or operations that the plan will be composed of, and a set of facts, which is a description of a current situation, and devise a plan, instantiating the verbs, to achieve a goal.

In particular, this is using the Logistics domain, where there are packages which need to go to particular locations. There are three cities, c0, c1 and c2. There is an airport in each city - l00 is c0's airport, l10 is c1's airport, l20 is c2's airport. There are three locations in each city - l00, l01, l02 are all in c0, and so on. If the location is in the same city, then you can load the package into a truck and drive there, but if the location is in a different city then you have to load the package into an airplane and fly it there.


ff: parsing domain file
domain 'LOGISTICS-STRIPS' defined
 ... done.
ff: parsing problem file
problem 'LOGISTICS-C3-S3-P9-A3' defined
 ... done.



Cueing down from goal distance:   50 into depth [1]
                                  49            [1]
                                  48            [1]
                                  47            [1]
                                  46            [1]
                                  45            [1]
                                  44            [1]
                                  43            [1]
                                  42            [1][2]
                                  41            [1]
                                  40            [1]
                                  39            [1]
                                  38            [1]
                                  37            [1]
                                  36            [1][2]
                                  35            [1]
                                  34            [1]
                                  33            [1][2]
                                  32            [1]
                                  31            [1]
                                  30            [1]
                                  29            [1]
                                  28            [1][2]
                                  27            [1]
                                  26            [1][2]
                                  25            [1]
                                  24            [1]
                                  23            [1]
                                  22            [1]
                                  21            [1][2]
                                  20            [1]
                                  19            [1]
                                  18            [1]
                                  17            [1]
                                  16            [1]
                                  15            [1]
                                  14            [1]
                                  13            [1]
                                  12            [1]
                                  11            [1]
                                  10            [1]
                                   9            [1]
                                   8            [1]
                                   7            [1]
                                   6            [1]
                                   5            [1]
                                   4            [1]
                                   3            [1]
                                   2            [1]
                                   1            [1]
                                   0            

ff: found legal plan as follows

step    0: LOAD-TRUCK P4 T2 L22
        1: LOAD-TRUCK P7 T0 L01
        2: LOAD-AIRPLANE P6 A1 L20
        3: FLY-AIRPLANE A0 L00 L20
        4: DRIVE-TRUCK T2 L22 L20 C2
        5: UNLOAD-TRUCK P4 T2 L20
        6: LOAD-AIRPLANE P4 A0 L20
        7: DRIVE-TRUCK T1 L12 L10 C1
        8: DRIVE-TRUCK T0 L01 L02 C0
        9: LOAD-TRUCK P2 T0 L02
       10: LOAD-TRUCK P3 T0 L02
       11: DRIVE-TRUCK T0 L02 L00 C0
       12: UNLOAD-TRUCK P2 T0 L00
       13: UNLOAD-TRUCK P3 T0 L00
       14: UNLOAD-TRUCK P7 T0 L00
       15: DRIVE-TRUCK T2 L20 L21 C2
       16: LOAD-TRUCK P1 T2 L21
       17: LOAD-TRUCK P8 T2 L21
       18: LOAD-TRUCK P0 T2 L21
       19: DRIVE-TRUCK T2 L21 L20 C2
       20: UNLOAD-TRUCK P1 T2 L20
       21: UNLOAD-TRUCK P8 T2 L20
       22: LOAD-AIRPLANE P1 A0 L20
       23: LOAD-AIRPLANE P8 A0 L20
       24: UNLOAD-TRUCK P0 T2 L20
       25: FLY-AIRPLANE A0 L20 L10
       26: UNLOAD-AIRPLANE P8 A0 L10
       27: LOAD-TRUCK P8 T1 L10
       28: DRIVE-TRUCK T1 L10 L11 C1
       29: LOAD-TRUCK P5 T1 L11
       30: UNLOAD-TRUCK P8 T1 L11
       31: DRIVE-TRUCK T1 L11 L10 C1
       32: UNLOAD-TRUCK P5 T1 L10
       33: LOAD-AIRPLANE P5 A0 L10
       34: FLY-AIRPLANE A0 L10 L00
       35: LOAD-AIRPLANE P2 A0 L00
       36: LOAD-AIRPLANE P3 A0 L00
       37: UNLOAD-AIRPLANE P1 A0 L00
       38: LOAD-TRUCK P1 T0 L00
       39: DRIVE-TRUCK T0 L00 L01 C0
       40: FLY-AIRPLANE A1 L20 L00
       41: LOAD-AIRPLANE P7 A0 L00
       42: UNLOAD-TRUCK P1 T0 L01
       43: UNLOAD-AIRPLANE P4 A0 L00
       44: FLY-AIRPLANE A0 L00 L20
       45: UNLOAD-AIRPLANE P2 A0 L20
       46: UNLOAD-AIRPLANE P3 A0 L20
       47: LOAD-TRUCK P2 T2 L20
       48: LOAD-TRUCK P3 T2 L20
       49: DRIVE-TRUCK T2 L20 L21 C2
       50: UNLOAD-TRUCK P2 T2 L21
       51: UNLOAD-TRUCK P3 T2 L21
       52: UNLOAD-AIRPLANE P5 A0 L20
       53: FLY-AIRPLANE A0 L20 L10
       54: UNLOAD-AIRPLANE P6 A1 L00
       55: UNLOAD-AIRPLANE P7 A0 L10
     

time spent:    0.00 seconds instantiating 1209 easy, 0 hard action templates
               0.00 seconds reachability analysis, yielding 163 facts and 403 actions
               0.00 seconds creating final representation with 163 relevant facts
               0.00 seconds building connectivity graph
               0.00 seconds searching, evaluating 214 states, to a max depth of 2
               0.00 seconds total time