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)
En esta página del sitio puede ver el video en línea Dijkstra's Algorithm vs. A* Search vs. Concurrent Dijkstra's Algorithm de Duración hora minuto segunda en buena calidad , que subió el usuario UNSWMechatronics 24 junio 2013, comparta el enlace con amigos y conocidos, en youtube este video ya ha sido visto 226,881 veces y le gustó 925 a los espectadores. Disfruta viendo!
