Dijkstra's Algorithm vs. A* Search vs. Concurrent Dijkstra's Algorithm
A comparison of two traditional grid based path planning algorithms against a novel concurrent version of Dijkstra's algorithm. This video is aimed at comparing the algorithms from a theoretical point of view. An implementation of the concurrent algorithm in OpenGL+GLSL has recently surpassed the sequential CPU based algorithms due to advances in the number of shader processors in modern GPUs and the improving up and down data bus transfer rates between CPU and GPU based memory.
S. Cossell and J. Guivant, "Parallel evaluation of a spatial traversability cost function on GPU for efficient path planning," Journal of Intelligent Learning Systems and Applications, Vol. 3, No. 4, pp. 191-200, November 2011. (DOI: 10.4236/jilsa.2011.34022)
On this page of the site you can watch the video online Dijkstra's Algorithm vs. A* Search vs. Concurrent Dijkstra's Algorithm with a duration of hours minute second in good quality, which was uploaded by the user UNSWMechatronics 24 June 2013, share the link with friends and acquaintances, this video has already been watched 226,881 times on youtube and it was liked by 925 viewers. Enjoy your viewing!
