In the previous video, you saw a proposal of what we will achieve by the end of this course.
But in order to reach that goal of missile solvable, it needs to be divided into smaller steps for
simplicity.
So for the project breakdown, our main solver will compose of five steps.
The first one will be localization.
Here we will try to identify the position of the robot in the maze.
And this will be done at all times.
Next, we will perform mapping in mapping with extract information from the raw image data by creating
the occupancy grid and then converting it into reversible graph.
Then once we have the robot location and the map of the maze, we'll move on to path.
Planning will be identified out towards the maze exit.
This will be done using depth for first.
Then we'll try to find out the shortest path from the start to the goal.
This will be done using Dijkstra and his done.
Finally, once you have all the information that we required, we complete the robot navigation problem
by implementing the motion plan of our Maze Solver Board.
This means that our robot can finally autonomously navigate through the maze.