Path Planning for Smart Car Based on Dijkstra Algorithm and Dynamic Window Approach

Figure 12

Obstacle avoidance test in a complex obstacle environment: (a) specifies the starting point; (b) specify the target point; (c) the starting position of the car; (d) bypass the first obstacle; (e) through box and trash can; (f) bypass trash can; (g) through the trash can and box; (h) adjust heading angle; (i) bypass box; (j) the car arrives at the designated location; (k) car path planning; (l) the console shows that the car has reached the destination (complete the task).

(a)

(b)

(c)

(d)

(e)

(f)

(g)

(h)

(i)

(j)

(k)

(l)