Latest Execution of Plan Sunday, March 21st, 02:08:02
Opened this issue · 0 comments
github-actions commented
Below is the output from the latest plan execution
Output
Executing Problem 1
Number of literals: 33
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(steps) has a finite lower bound: [0.000,inf]
Have identified that bigger values of (battery-amount roomba) are preferable
Have identified that smaller values of (trash-amount roomba) are preferable
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
4% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 24.000, admissible cost estimate 0.000
b (23.000 | 10.000)b (22.000 | 10.000)b (21.000 | 20.000)b (20.000 | 20.001)b (17.000 | 25.002)b (16.000 | 30.003)b (15.000 | 45.005)b (14.000 | 45.005)b (13.000 | 55.006)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (23.000 | 10.000)b (22.000 | 10.000)b (21.000 | 20.000)b (20.000 | 20.001)b (17.000 | 25.002)b (13.000 | 35.003)b (9.000 | 45.004)b (8.000 | 45.004)b (5.000 | 55.004)b (4.000 | 58.005)b (3.000 | 60.006)b (2.000 | 60.007)b (1.000 | 70.007)(G);;;; Solution Found
; States evaluated: 2308
; Cost: 70.008
; Time 1.80
0.000: (moveandclean roomba x0y0 x1y0) [10.000]
10.001: (moveandclean roomba x1y0 x2y0) [10.000]
20.002: (moveandclean roomba x2y0 x2y1) [10.000]
30.003: (moveandclean roomba x2y1 x2y2) [10.000]
40.004: (move roomba x2y2 x1y2) [5.000]
45.005: (moveandclean roomba x1y2 x0y2) [10.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.006: (get-charge roomba x0y2) [3.000]
55.007: (move roomba x0y2 x0y1) [5.000]
60.008: (moveandclean roomba x0y1 x0y0) [10.000]
Executing Problem 2
Number of literals: 33
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(steps) has a finite lower bound: [0.000,inf]
Have identified that bigger values of (battery-amount roomba) are preferable
Have identified that smaller values of (trash-amount roomba) are preferable
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
4% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 24.000, admissible cost estimate 0.000
b (23.000 | 15.001)b (22.000 | 15.001)b (21.000 | 30.003)b (20.000 | 35.004)b (19.000 | 40.005)b (18.000 | 45.006)b (17.000 | 63.008)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (23.000 | 10.000)b (22.000 | 10.000)b (21.000 | 20.000)b (20.000 | 20.001)b (19.000 | 25.002)b (15.000 | 30.002)b (14.000 | 30.002)b (11.000 | 40.003)b (10.000 | 40.003)b (9.000 | 45.004)b (8.000 | 45.004)b (5.000 | 55.004)b (4.000 | 55.006)b (3.000 | 60.006)b (2.000 | 60.007)b (1.000 | 70.007)(G);;;; Solution Found
; States evaluated: 2609
; Cost: 70.008
; Time 1.88
0.000: (moveandclean roomba x0y2 x1y2) [10.000]
10.001: (moveandclean roomba x1y2 x2y2) [10.000]
20.002: (moveandclean roomba x2y2 x2y1) [10.000]
30.003: (moveandclean roomba x2y1 x2y0) [10.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.004: (get-charge roomba x2y0) [3.000]
40.005: (move roomba x2y0 x1y0) [5.000]
45.006: (moveandclean roomba x1y0 x0y0) [10.000]
55.007: (move roomba x0y0 x0y1) [5.000]
60.008: (moveandclean roomba x0y1 x0y0) [10.000]
Executing Problem 3
Number of literals: 275
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%]
(steps) has a finite lower bound: [0.000,inf]
Have identified that bigger values of (battery-amount roomba) are preferable
Have identified that smaller values of (trash-amount roomba) are preferable
�[01;34mNo analytic limits found, not considering limit effects of goal-only operators�[00m
7% of the ground temporal actions in this problem are compression-safe
; Goals unreachable from the initial state
;; Problem unsolvable!
; Time 0.06