List your company

Energy-optimal path planning on Canberra road network

0Preparation Runtime (s)Bellman-Ford
-0.105840.608581.3232.03742Nov 20, 2024

Evaluation results

MethodLinks
Bellman-Ford2024.11012.6320.12120,700
Dijk-costpotAlgorithm Parameters=mg + M g = 4832024.1100.4511.02711,500
Dijk-costpiAlgorithm Parameters=ma + b = 4402024.1100.4510.96411,500
A*- costpotAlgorithm Parameters=λ = 0.8912024.110.570.2330.9445,300
Johnson-πhAlgorithm Parameters=α ∈[253, 615]2024.110.5710.4591.00111,500
A*- costpiAlgorithm Parameters=δ = 1.0092024.110.5730.2110.8984,800
Johnson2024.112.6460.4661.02211,400