Step by step Guide: Dijkstra's algorithm for 2D Path Planning

This video covers a step by step guide for explaining how the Dijkstra's algorithm work, for path planning in a 2D grid map.
In the following videos, I will cover A*, D*, LPA*, D*-Lite, RRT, RRT*.
GitHub link: github.com/han...

[@BHARATBANSAL-uf6md]

Good explanation of the Dijkstra;s Algorithm

[@swarak1326]

thank you so much for the video, i found it super helpful in understanding dijkstra!!

[@anukritisingh7204]

this is the best video. thank you so much!!!

[@jephph8204]

Hi! Everyone, this is my first time making a tutorial video. I really appreciate it if you share your comments, what you like in this video, and what you don't like. Thank you very much! : )

[@YnIanIo]

at 5:50 why is it necesary to check for the neighbours which are already set?