graph-based shortest path optimization dijkstra algorithm improvement

graph-based shortest path optimization dijkstra algorithm improvement

in this paper we introduce the draft of a new graph-based algorithm for optimization of shortest path problem. our algorithm is based on the dijkstra and a* algorithm, which is usually used for path planning. it was tested on the shortest path planning problem against dijkstra classic implementation.

the comparison of these results showed that the proposed algorithm exhibited a promising convergence rate toward an optimal solution. the time is the total length or time that we estimate for the shortest path in a graph. in most of the tested cases, our proposed algorithm managed to find a solution faster than the a* algorithm; in five cases, the graph-based algorithm found a solution at the same time as the a* algorithm. our results also showed that the manner of priority calculation had a non-negligible impact on solutions, and that an appropriately chosen priority calculation could improve them.