Step by step Guide: A* algorithm | A star for 2D Path Planning

This video covers a step by step guide for explaining how the A* algorithm work, for path planning in a 2D grid map. In the following videos, I will cover D*, LPA*, D*-Lite, RRT, RRT*.

▬ Contents of this video ▬

0:00 Intro
0:22 General concepts of A*
1:50 A* initialization step
2:24 Iteration 1
3:49 Iteration 2
5:37 Iteration 3
7:17 Iteration 4
9:20 the last Iteration 5
10:14 get the path
11:10 compare with Dijkstra's

[jephph]

I set the cost to be 10 in the movements in up/down and left/right directions, and the cost to be 14 in diagonal directions. Their more precise values would be 1 and sqrt(2), but I think using integers 10 and 14 would be helpful for code running speed.

[gahshunker]

why do you take into the account the diagonal neighbors, but when estimating heuristic to the goal, you don't take diagonal paths?

[yoshivayo]

The algorithm is explained but it missed on explaining the why part

[ariton]

How do you decide the parent of a cell?? Im confused about this. Why did you decide for B1 to have C1 as a parent and not C2?

[Faith_Ojumah]

hi, your github link is no longer working

[joviyeung]

Hi do you have a email where i can contact ?