Abstract
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.
Publisher
Trans Tech Publications, Ltd.
Reference11 articles.
1. G. Ying. Ai, T. Feng, Q. Song. Di: Operations Research. Beijing: Tsinghua University Press, pp.251-255. (2011).
2. Boris V. Cherkassky, Andrew V. Goldberg, Tomasz Radzik: Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming. 3: P. 129-174. (1996).
3. L. Feng, Zh. Cheng. hu, W. Qing: An Optimum Vehicular Path Algorithm for Traffic Network Based on Hierarchical Spatial Reasoning. Geo - spatial Information Science. 3(4): pp.36-42. (2000).
4. L. Feng: Shortest Path Algorithms: Taxonomy and Advance in Research. Journal of Geomatics Science and Technology. 3(30): pp.269-275. (2001).
5. G.E. Chao, L.L. Qun: The Optimal Path Algorithm Design Based on Bellman-Ford Algorithm. Bulletin of Surveying and Mapping. 8: pp.26-28. (2011).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献