Latest Execution of Plan Sunday, March 21st, 07:44:43
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.82
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: 54
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%] [110%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%] [110%]
(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
6% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 38.000, admissible cost estimate 0.000
b (37.000 | 10.000)b (36.000 | 10.000)b (33.000 | 15.001)b (32.000 | 20.002)b (29.000 | 40.004)b (28.000 | 40.004)b (25.000 | 45.005)b (23.000 | 63.007)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (37.000 | 10.000)b (36.000 | 10.000)b (35.000 | 15.001)b (31.000 | 20.000)b (29.000 | 30.002)b (28.000 | 30.002)b (27.000 | 40.003)b (26.000 | 40.003)b (25.000 | 45.004)b (24.000 | 45.004)b (23.000 | 50.004)b (21.000 | 55.004)b (19.000 | 60.004)b (17.000 | 60.006)b (15.000 | 65.007)b (11.000 | 70.007)b (9.000 | 80.008)b (7.000 | 85.009)b (6.000 | 98.013)b (3.000 | 108.014)b (2.000 | 108.014)b (1.000 | 118.015)(G);;;; Solution Found
; States evaluated: 184070
; Cost: 118.015
; Time 389.85
0.000: (moveandclean roomba x0y0 x1y0) [10.000]
10.001: (moveandclean roomba x1y0 x1y1) [10.000]
20.002: (moveandclean roomba x1y1 x1y2) [10.000]
30.003: (moveandclean roomba x1y2 x0y2) [10.000]
40.004: (moveandclean roomba x0y2 x0y1) [10.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.005: (get-charge roomba x0y1) [3.000]
50.006: (move roomba x0y1 x1y1) [5.000]
55.007: (move roomba x1y1 x2y1) [5.000]
60.008: (moveandclean roomba x2y1 x3y1) [10.000]
70.009: (moveandclean roomba x3y1 x3y2) [10.000]
80.010: (move roomba x3y2 x4y2) [5.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
85.011: (get-charge roomba x4y2) [3.000]
88.012: (move roomba x4y2 x4y1) [5.000]
93.013: (moveandclean roomba x4y1 x3y1) [10.000]
103.014: (move roomba x3y1 x3y0) [5.000]
108.015: (moveandclean roomba x3y0 x2y0) [10.000]
Executing Problem 4
Number of literals: 70
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
8% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 44.000, admissible cost estimate 0.000
b (43.000 | 10.000)b (42.000 | 10.000)b (41.000 | 20.002)b (40.000 | 25.003)b (39.000 | 40.004)b (38.000 | 40.005)b (37.000 | 55.007)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (43.000 | 10.000)b (42.000 | 10.000)b (39.000 | 20.000)b (37.000 | 25.002)b (35.000 | 30.003)b (31.000 | 35.003)b (29.000 | 45.004)b (28.000 | 45.004)b (27.000 | 55.004)b (25.000 | 60.005)b (23.000 | 78.009)b (23.000 | 60.005)b (22.000 | 78.010)b (21.000 | 88.011)b (21.000 | 83.012)b (20.000 | 83.012)b (19.000 | 93.013)b (17.000 | 98.014)b (17.000 | 85.011)b (15.000 | 90.012)b (14.000 | 103.016)b (13.000 | 110.018)b (11.000 | 110.016)```
Executing Problem 5
Number of literals: 71
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
6% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 52.000, admissible cost estimate 0.000
b (51.000 | 10.000)b (50.000 | 10.000)b (49.000 | 15.001)b (48.000 | 15.001)b (47.000 | 25.003)b (45.000 | 30.004)b (44.000 | 35.005)b (41.000 | 50.007)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (51.000 | 10.000)b (50.000 | 10.000)b (49.000 | 15.001)b (45.000 | 20.000)b (41.000 | 30.002)b (39.000 | 35.003)b (38.000 | 45.004)b (37.000 | 50.004)b (35.000 | 55.004)b (34.000 | 55.005)b (34.000 | 50.005)b (33.000 | 65.007)b (32.000 | 55.006)b (31.000 | 65.007)b (29.000 | 80.011)b (29.000 | 70.008)b (29.000 | 68.008)b (27.000 | 73.009)b (25.000 | 78.009)b (23.000 | 83.012)b (21.000 | 93.013)b (21.000 | 88.013)b (19.000 | 98.014)b (17.000 | 98.014)b (15.000 | 108.015)b (13.000 | 121.018)b (11.000 | 131.019)b (9.000 | 131.019)```
Executing Problem 6
Number of literals: 70
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%]
(battery-amount roomba) has a finite upper bound: [-inf,100.000]
(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
5% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 48.000, admissible cost estimate 0.000
b (47.000 | 10.000)b (46.000 | 10.000)b (41.000 | 20.002)b (40.000 | 25.003)b (37.000 | 45.006)b (36.000 | 45.006)b (35.000 | 50.007)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (47.000 | 10.000)b (46.000 | 10.000)b (41.000 | 15.001)b (37.000 | 20.000)b (36.000 | 20.001)b (33.000 | 30.002)b (31.000 | 35.003)b (29.000 | 45.004)b (27.000 | 45.004)b (26.000 | 45.004)b (23.000 | 60.005)```
Executing Problem 7
Number of literals: 53
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%]
(battery-amount roomba) has a finite upper bound: [-inf,100.000]
(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
; Goals unreachable from the initial state
;; Problem unsolvable!
; Time 0.00
Executing Problem 8
Number of literals: 72
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 = 52.000, admissible cost estimate 0.000
b (51.000 | 5.000)b (50.000 | 5.000)b (49.000 | 15.001)b (48.000 | 15.001)b (45.000 | 25.002)b (43.000 | 30.003)b (42.000 | 30.003)b (41.000 | 40.004)b (40.000 | 40.004)b (39.000 | 50.006)b (38.000 | 58.007)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (49.000 | 10.000)b (48.000 | 10.000)b (47.000 | 15.001)b (43.000 | 20.000)b (42.000 | 20.001)b (41.000 | 30.002)b (39.000 | 30.002)b (38.000 | 30.002)b (37.000 | 40.003)b (36.000 | 40.003)b (35.000 | 55.004)b (33.000 | 60.005)b (33.000 | 45.004)b (32.000 | 58.005)b (32.000 | 55.005)b (32.000 | 50.005)b (29.000 | 55.004)b (27.000 | 80.009)b (27.000 | 80.008)b (25.000 | 83.009)b (24.000 | 98.013)b (21.000 | 108.014)b (19.000 | 121.015)```
Executing Problem 9
Number of literals: 31
Constructing lookup tables: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%] [110%] [120%]
Post filtering unreachable actions: [10%] [20%] [30%] [40%] [50%] [60%] [70%] [80%] [90%] [100%] [110%] [120%]
(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
Initial heuristic = 20.000, admissible cost estimate 0.000
b (17.000 | 5.000)b (16.000 | 5.000)b (13.000 | 25.002)b (12.000 | 25.002)b (11.000 | 30.003)b (10.000 | 30.003)b (9.000 | 35.004)b (8.000 | 35.004)b (5.000 | 45.005)b (4.000 | 45.005)b (3.000 | 50.006)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (13.000 | 10.000)b (12.000 | 10.000)b (11.000 | 20.000)b (10.000 | 20.001)b (9.000 | 25.002)b (8.000 | 25.002)b (5.000 | 35.003)b (4.000 | 35.003)b (3.000 | 40.004)b (2.000 | 40.004)b (1.000 | 50.004)(G);;;; Solution Found
; States evaluated: 95
; Cost: 50.005
; Time 0.06
0.000: (moveandclean roomba x0y0 x1y0) [10.000]
10.001: (moveandclean roomba x1y0 x1y1) [10.000]
20.002: (move roomba x1y1 x2y1) [5.000]
25.003: (moveandclean roomba x2y1 x1y1) [10.000]
35.004: (move roomba x1y1 x1y2) [5.000]
40.005: (moveandclean roomba x1y2 x0y2) [10.000]
Executing Problem 10
Number of literals: 73
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%]
(trash-amount roomba) has a finite lower bound: [0.000,inf]
(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
1% of the ground temporal actions in this problem are compression-safe
Initial heuristic = 52.000, admissible cost estimate 0.000
b (51.000 | 10.000)b (50.000 | 10.000)b (49.000 | 15.001)b (48.000 | 15.001)b (47.000 | 25.002)b (46.000 | 25.002)b (45.000 | 30.003)b (44.000 | 30.003)b (42.000 | 40.004)b (41.000 | 55.006)
Resorting to best-first search
Running WA* with W = 5.000, not restarting with goal states
b (51.000 | 10.000)b (50.000 | 10.000)b (49.000 | 15.001)b (45.000 | 20.000)b (41.000 | 30.002)b (40.000 | 35.003)b (39.000 | 45.004)b (38.000 | 45.004)b (37.000 | 55.004)b (35.000 | 60.005)b (35.000 | 55.004)b (33.000 | 65.007)b (31.000 | 70.007)b (31.000 | 65.008)b (30.000 | 65.009)b (27.000 | 75.009)b (26.000 | 75.010)b (23.000 | 85.011)b (22.000 | 90.013)b (21.000 | 100.014)b (19.000 | 105.015)b (19.000 | 95.012)b (17.000 | 118.016)b (17.000 | 115.016)```