1. Project on Implementation of Wave Front Planner Algorithm
Submitted to:
Prof. Jaebyung Park
Intelligent Systems & Robotics Lab.
Division of Electronic Engineering
Chonbuk National Univerisity
Presented by:
Ram Kaji Budhathoki
ID :
Robot Vision Lab
Division of Electronics and Information Engineering

2. Introduction
To determine the robot path from any particular start position to the goal position avoiding the obstacles using wave front planner algorithm along with gradient descent algorithm.

3. Methodology Wave Front + Gradient Descent Algorithm An image with
Free space and obstalces
Robot finds path
From start to goal
,if it exists.
An image

4. The Wave Front Planner Algorithm
Consider a two-dimensional space.
The planner starts with the standard binary grid of zeros corresponding to free space and ones to obstacles.
The planner also knows the pixel locations of the start and goal.
The goal pixel is labeled with a two.
In the first step, all zero-valued pixels neighboring the goal are labeled with a three.
Next, all zero-valued pixels adjacent to threes are labeled with four.

5. The wave-front planner Algorithm Contd……
7. This procedure essentially grows a wave front from the goal where at each iteration, all pixels on the wave front have the same path length, measured with respect to the grid, to the goal.
8. This procedure terminates when the wave front reaches the pixel that contains the robot start location.
9. The planner then determines a path via gradient descent on the grid starting from the start.

6. Wave Front Planner :An Example

7. Wave Front Planner :An Example

8. Gradient Descent Algorithm
Starts from the start.
Determines the path one pixel at a time.
Assume that the value of the start pixel is 33.
The next pixel in the path is any neighboring pixel whose value is 32.
The construction of the wave front guarantees that there will always be a neighboring pixel whose value is one less than that of the current pixel
This procedure forms a path in the grid to the goal, i.e., to the pixel whose value is 2.

9. Tracing Path using Gradient Descent

10. Case I

11. Wave Front Formed when Start:(300,290) and Goal:(10,10)

12. Path formed when Start:(300,290 ) and Goal:(10,10)

13. Case II

14. Wave Front formed when Start(10,300) and Goal(250,45)

15. Path Formed when when Start(10,300) and Goal(250,45)

16. Case III

17. Wave Front formed when Start(10,290) Goal(175,30)

18. Path Formed when Start(10,290) and Goal(175,30)

19. THANK YOU.