-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathoutput_djikstra.txt
63 lines (56 loc) · 6.88 KB
/
output_djikstra.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
-------------------------------------------------
The mapname is window.txt
The boundary is [[ 0. -5. 0. 10. 20. 6. 120. 120. 120.]]
The path is given by [(3.8, 0.0, 1.0), (3.8, 0.0, 1.4), (3.8, 0.4, 1.4), (4.2, 0.4, 1.4), (4.2, 0.8, 1.4), (4.2, 0.8, 1.8), (4.2, 1.2, 1.8), (4.2, 1.6, 1.8), (4.2, 2.0, 1.8), (4.2, 2.4, 1.8), (4.2, 2.8, 1.8), (4.2, 2.8, 2.2), (4.2, 3.2, 2.2), (4.2, 3.6, 2.2), (4.6, 3.6, 2.2), (4.6, 4.0, 2.2), (4.6, 4.4, 2.2), (4.6, 4.8, 2.2), (4.6, 4.8, 2.6), (5.0, 4.8, 2.6), (5.4, 4.8, 2.6), (5.4, 5.2, 2.6), (5.4, 5.6, 2.6), (5.8, 5.6, 2.6), (5.8, 5.6, 3.0), (5.8, 5.6, 3.4), (5.8, 5.6, 3.8), (5.8, 5.6, 4.2), (5.8, 5.6, 4.6), (5.8, 6.0, 4.6), (5.8, 6.0, 5.0), (5.8, 6.0, 5.4)]
The cost is 12.400000000000004
The number of nodes sampled to reach = 10780
The length of the path is 32
------------------------------------------------
-------------------------------------------------
The mapname is maze.txt
The boundary is [[-15. -15. 0. 15. 15. 6. 120. 120. 120.]]
The path is given by [(-8.0, -8.0, 3.8), (-7.6, -8.0, 3.8), (-7.2, -8.0, 3.8), (-6.8, -8.0, 3.8), (-6.4, -8.0, 3.8), (-6.4, -7.6, 3.8), (-6.4, -7.2, 3.8), (-6.0, -7.2, 3.8), (-5.6, -7.2, 3.8), (-5.2, -7.2, 3.8), (-4.8, -7.2, 3.8), (-4.4, -7.2, 3.8), (-4.0, -7.2, 3.8), (-3.6, -7.2, 3.8), (-3.6, -6.8, 3.8), (-3.6, -6.4, 3.8), (-3.2, -6.4, 3.8), (-3.2, -6.0, 3.8), (-3.2, -5.6, 3.8), (-3.2, -5.2, 3.8), (-2.8, -5.2, 3.8), (-2.8, -4.8, 3.8), (-2.8, -4.4, 3.8), (-2.4, -4.4, 3.8), (-2.0, -4.4, 3.8), (-1.6, -4.4, 3.8), (-1.2, -4.4, 3.8), (-0.8, -4.4, 3.8), (-0.4, -4.4, 3.8), (0.0, -4.4, 3.8), (0.4, -4.4, 3.8), (0.8, -4.4, 3.8), (1.2, -4.4, 3.8), (1.6, -4.4, 3.8), (2.0, -4.4, 3.8), (2.4, -4.4, 3.8), (2.8, -4.4, 3.8), (2.8, -4.0, 3.8), (2.8, -3.6, 3.8), (2.8, -3.2, 3.8), (2.8, -2.8, 3.8), (2.8, -2.4, 3.8), (2.8, -2.0, 3.8), (2.8, -1.6, 3.8), (2.8, -1.2, 3.8), (2.8, -0.8, 3.8), (2.8, -0.4, 3.8), (2.8, 0.0, 3.8), (2.8, 0.4, 3.8), (2.8, 0.8, 3.8), (2.8, 1.2, 3.8), (2.8, 1.6, 3.8), (2.8, 2.0, 3.8), (2.8, 2.4, 3.8), (2.8, 2.8, 3.8), (3.2, 2.8, 3.8), (3.6, 2.8, 3.8), (4.0, 2.8, 3.8), (4.4, 2.8, 3.8), (4.8, 2.8, 3.8), (5.2, 2.8, 3.8), (5.6, 2.8, 3.8), (6.0, 2.8, 3.8), (6.0, 3.2, 3.8), (6.0, 3.6, 3.8), (6.0, 4.0, 3.8), (6.0, 4.4, 3.8), (6.0, 4.8, 3.8), (6.0, 5.2, 3.8), (6.0, 5.6, 3.8), (6.0, 6.0, 3.8)]
The cost is 27.999999999999964
The number of nodes sampled to reach = 60535
The length of the path is 71
------------------------------------------------
-------------------------------------------------
The mapname is monza.txt
The boundary is [[ 0. 0. 0. 4.3 20. 5. 120. 120. 120. ]]
The path is given by [(0.2, 15.0, 3.0), (0.6, 15.0, 3.0), (0.6, 14.6, 3.0), (1.0, 14.6, 3.0), (1.4, 14.6, 3.0), (1.8, 14.6, 3.0), (1.8, 14.6, 3.4), (2.2, 14.6, 3.4), (2.6, 14.6, 3.4), (3.0, 14.6, 3.4), (3.4, 14.6, 3.4), (3.8, 14.6, 3.4), (3.8, 14.2, 3.4), (3.8, 13.8, 3.4), (3.8, 13.4, 3.4), (3.8, 13.0, 3.4), (3.8, 12.6, 3.4), (3.8, 12.2, 3.4), (3.8, 11.8, 3.4), (3.8, 11.8, 3.8)]
The cost is 7.600000000000001
The number of nodes sampled to reach = 2536
The length of the path is 20
------------------------------------------------
-------------------------------------------------
The mapname is flappy_bird.txt
The boundary is [[ 0. 0. 0. 20. 5. 6. 120. 120. 120.]]
The path is given by [(0.6, 0.6, 5.4), (1.0, 0.6, 5.4), (1.4, 0.6, 5.4), (1.4, 0.6, 5.0), (1.4, 1.0, 5.0), (1.8, 1.0, 5.0), (1.8, 1.4, 5.0), (2.2, 1.4, 5.0), (2.6, 1.4, 5.0), (2.6, 1.8, 5.0), (3.0, 1.8, 5.0), (3.0, 2.2, 5.0), (3.4, 2.2, 5.0), (3.4, 2.2, 4.6), (3.4, 2.2, 4.2), (3.8, 2.2, 4.2), (3.8, 2.6, 4.2), (3.8, 3.0, 4.2), (3.8, 3.4, 4.2), (3.8, 3.8, 4.2), (3.8, 3.8, 3.8), (3.8, 3.8, 3.4), (3.8, 3.8, 3.0), (3.8, 3.8, 2.6), (3.8, 3.8, 2.2), (3.8, 3.8, 1.8)]
The cost is 10.000000000000004
The number of nodes sampled to reach = 2631
The length of the path is 26
------------------------------------------------
-------------------------------------------------
The mapname is tower.txt
The boundary is [[ 0. 0. 0. 5. 5. 20. 120. 120. 120.]]
The path is given by [(0.6, 0.6, 0.6), (0.6, 0.6, 1.0), (0.6, 0.6, 1.4), (1.0, 0.6, 1.4), (1.0, 0.6, 1.8), (1.0, 0.6, 2.2), (1.4, 0.6, 2.2), (1.8, 0.6, 2.2), (1.8, 1.0, 2.2), (1.8, 1.0, 2.6), (1.8, 1.0, 3.0), (1.8, 1.0, 3.4), (1.8, 1.0, 3.8), (1.8, 1.0, 4.2), (1.8, 1.0, 4.6), (1.8, 1.4, 4.6), (1.8, 1.4, 5.0), (1.8, 1.4, 5.4), (1.8, 1.4, 5.8), (2.2, 1.4, 5.8), (2.6, 1.4, 5.8), (2.6, 1.4, 6.2), (2.6, 1.4, 6.6), (2.6, 1.4, 7.0), (2.6, 1.4, 7.4), (2.6, 1.4, 7.8), (2.6, 1.4, 8.2), (2.6, 1.4, 8.6), (2.6, 1.4, 9.0), (2.6, 1.4, 9.4), (2.6, 1.4, 9.8), (2.6, 1.4, 10.2), (3.0, 1.4, 10.2), (3.4, 1.4, 10.2), (3.8, 1.4, 10.2), (3.8, 1.8, 10.2), (3.8, 2.2, 10.2), (3.8, 2.6, 10.2), (3.8, 3.0, 10.2), (3.8, 3.4, 10.2), (3.8, 3.8, 10.2), (3.8, 3.8, 10.6), (3.8, 3.8, 11.0), (3.8, 3.8, 11.4), (3.8, 3.8, 11.8)]
The cost is 17.6
The number of nodes sampled to reach = 5262
The length of the path is 45
------------------------------------------------
-------------------------------------------------
The mapname is single_cube.txt
The boundary is [[ -5. -5. -5. 10. 10. 10. 120. 120. 120.]]
The path is given by [(0.4, 0.4, 0.4), (0.8, 0.4, 0.4), (1.2, 0.4, 0.4), (1.2, 0.4, 0.8), (1.2, 0.4, 1.2), (1.6, 0.4, 1.2), (2.0, 0.4, 1.2), (2.4, 0.4, 1.2), (2.8, 0.4, 1.2), (2.8, 0.4, 1.6), (2.8, 0.4, 2.0), (2.8, 0.4, 2.4), (3.2, 0.4, 2.4), (3.6, 0.4, 2.4), (4.0, 0.4, 2.4), (4.4, 0.4, 2.4), (4.8, 0.4, 2.4), (4.8, 0.4, 2.8), (5.2, 0.4, 2.8), (5.6, 0.4, 2.8), (5.6, 0.4, 3.2), (5.6, 0.4, 3.6), (5.6, 0.4, 4.0), (5.6, 0.4, 4.4), (5.6, 0.4, 4.8), (5.6, 0.8, 4.8), (5.6, 1.2, 4.8), (5.6, 1.6, 4.8), (5.6, 2.0, 4.8), (5.6, 2.4, 4.8), (5.6, 2.8, 4.8), (5.6, 3.2, 4.8), (5.6, 3.6, 4.8), (5.6, 4.0, 4.8), (5.6, 4.4, 4.8), (5.6, 4.8, 4.8), (5.6, 5.2, 4.8), (5.6, 5.2, 5.2), (5.6, 5.2, 5.6), (5.6, 5.6, 5.6), (6.0, 5.6, 5.6), (6.0, 6.0, 5.6)]
The cost is 16.400000000000006
The number of nodes sampled to reach = 42448
The length of the path is 42
------------------------------------------------
-------------------------------------------------
The mapname is room.txt
The boundary is [[ 0. 0. 0. 10. 10. 3. 120. 120. 120.]]
The path is given by [(0.6, 0.6, 0.6), (1.0, 0.6, 0.6), (1.4, 0.6, 0.6), (1.4, 1.0, 0.6), (1.8, 1.0, 0.6), (2.2, 1.0, 0.6), (2.2, 1.4, 0.6), (2.6, 1.4, 0.6), (3.0, 1.4, 0.6), (3.0, 1.8, 0.6), (3.4, 1.8, 0.6), (3.4, 2.2, 0.6), (3.8, 2.2, 0.6), (4.2, 2.2, 0.6), (4.6, 2.2, 0.6), (4.6, 2.6, 0.6), (5.0, 2.6, 0.6), (5.4, 2.6, 0.6), (5.8, 2.6, 0.6), (5.8, 3.0, 0.6), (6.2, 3.0, 0.6), (6.2, 3.4, 0.6), (6.6, 3.4, 0.6), (6.6, 3.8, 0.6), (6.6, 4.2, 0.6), (6.6, 4.6, 0.6), (6.6, 5.0, 0.6), (6.6, 5.4, 0.6), (6.6, 5.8, 0.6), (7.0, 5.8, 0.6), (7.0, 6.2, 0.6), (7.0, 6.6, 0.6), (7.4, 6.6, 0.6), (7.4, 7.0, 0.6), (7.8, 7.0, 0.6), (7.8, 7.4, 0.6), (7.8, 7.4, 1.0), (7.8, 7.8, 1.0), (7.8, 7.8, 1.4), (7.8, 7.8, 1.8)]
The cost is 15.600000000000007
The number of nodes sampled to reach = 3794
The length of the path is 40
------------------------------------------------