optimal cost 8.728 m, expanded 5627
w =  1.0: cost ratio 1.0000 (bound 1.0), expanded 5627
w =  1.2: cost ratio 1.0000 (bound 1.2), expanded 4926
w =  1.5: cost ratio 1.0000 (bound 1.5), expanded 4078
w =  2.0: cost ratio 1.0000 (bound 2.0), expanded 3031
w =  3.0: cost ratio 1.0237 (bound 3.0), expanded 3280
w =  5.0: cost ratio 1.0664 (bound 5.0), expanded 3682
w = 10.0: cost ratio 1.0664 (bound 10.0), expanded 4021
inadmissible heuristic 1.5 x octile: cost ratio 1.0000, expanded 4078
inadmissible heuristic 3.0 x octile: cost ratio 1.0237, expanded 3280
h = 0 (Dijkstra): expanded 12760
path-length matrix (m), order ['dock', 'P1', 'P2', 'P3', 'P4']
[[ 0.    4.59  9.66  3.51  8.73]
 [ 4.59  0.    5.18  5.61 10.83]
 [ 9.66  5.18  0.    6.15 12.92]
 [ 3.51  5.61  6.15  0.    6.77]
 [ 8.73 10.83 12.92  6.77  0.  ]]
nearest neighbour order ['dock', 'P3', 'P1', 'P2', 'P4'] 27.215 m ; best order ['dock', 'P1', 'P2', 'P3', 'P4'] 22.696 m ; worst of the 24 orders 39.011 m ; number of orders 24
nearest neighbour is 19.91 percent longer than the best; the worst order is 71.9 percent longer
saved /home/user/Documents/DOCUMENTS_SERVER/SKILL_TRAINING/Internet of Things (IoT) and Robotics/sessions/011-unit11-planning/figures/fig03_weights_visit.png
