1
00:00:00,960 --> 00:00:06,300
In the previous video, you saw a proposal of what we will achieve by the end of this course.

2
00:00:06,810 --> 00:00:12,840
But in order to reach that goal of missile solvable, it needs to be divided into smaller steps for

3
00:00:12,840 --> 00:00:13,620
simplicity.

4
00:00:14,460 --> 00:00:19,440
So for the project breakdown, our main solver will compose of five steps.

5
00:00:20,100 --> 00:00:22,200
The first one will be localization.

6
00:00:22,710 --> 00:00:26,390
Here we will try to identify the position of the robot in the maze.

7
00:00:26,670 --> 00:00:28,530
And this will be done at all times.

8
00:00:29,220 --> 00:00:36,900
Next, we will perform mapping in mapping with extract information from the raw image data by creating

9
00:00:36,900 --> 00:00:40,650
the occupancy grid and then converting it into reversible graph.

10
00:00:41,520 --> 00:00:46,590
Then once we have the robot location and the map of the maze, we'll move on to path.

11
00:00:46,590 --> 00:00:50,130
Planning will be identified out towards the maze exit.

12
00:00:50,850 --> 00:00:53,220
This will be done using depth for first.

13
00:00:54,220 --> 00:00:58,750
Then we'll try to find out the shortest path from the start to the goal.

14
00:00:59,470 --> 00:01:02,320
This will be done using Dijkstra and his done.

15
00:01:03,510 --> 00:01:09,390
Finally, once you have all the information that we required, we complete the robot navigation problem

16
00:01:09,690 --> 00:01:13,140
by implementing the motion plan of our Maze Solver Board.

17
00:01:13,980 --> 00:01:19,650
This means that our robot can finally autonomously navigate through the maze.