Let's look at an example of a maze, this is no longer a car, but this is closer to what we're going to program.
Suppose we start from the start, our goal is to reach the goal, and there are many closed grids along the way. The robot can go up, down, left,
Moving right, how many steps does the robot take from the start point to the end point?
Assuming we think of the path planning problem as a search problem, if you've taken our AI course, you know what it is.
Let's start with a 6x5 grid world, starting at the top left corner and ending at the bottom right corner. Still seal some grids,
This could be a robot walking through a city map or a parking lot. Or search through a street maze, for simplicity, in this example we assume the robot has 4 movements, up and down, left and right.
No uncertainty modeling is needed in this example, path planning is all about finding the shortest sequence of actions.
Guide our bot from the start state to the end state. Please master how many movements do I need from start to finish?
