The Algebraic Algorithm for Solving the Path Planning Problem of a Weighted Directed Graph
2014 ◽
Vol 644-650
◽
pp. 1648-1653
◽
Keyword(s):
In this paper, an algebraic algorithm is developed with Min-algebra for the path planning problem of a simple weighted directed graph. According to the algebraic algorithm, the shortest path and its minimum steps will be concluded through the direct distance matrix A. Experimental results show that the algebraic algorithm is suitable for the path planning problem. The shortest path and its length can be gotten rapidly based on the proposed algorithm. Finally, the results are compared to those obtained by the conventional Dijkstra algorithm.
Keyword(s):
Keyword(s):
2021 ◽
Vol 1043
(2)
◽
pp. 022035
Keyword(s):
Keyword(s):