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)
In questa pagina del sito puoi guardare il video online Dijkstra's Algorithm vs. A* Search vs. Concurrent Dijkstra's Algorithm della durata di ore minuti seconda in buona qualità , che l'utente ha caricato UNSWMechatronics 24 giugno 2013, condividi il link con amici e conoscenti, su youtube questo video è già stato visto 226,881 volte e gli è piaciuto 925 spettatori. Buona visione!
