Path planning: choosing the route
INTERMEDIATE · 6 MIN READ
Planning finds a safe route from here to there around obstacles, before the robot moves.
Path planning answers: given a map, how do I get from A to B without hitting anything? The map is turned into a grid or a graph, and an algorithm searches for the best route.
Famous methods include A* (finds the shortest route on a grid) and RRT (grows random branches through crowded space). Planners often also care about smoothness, safety distance and energy.
The robot (🤖) must reach the flag (🏁). Click squares to add or remove walls. The planner (A*) re-plans instantly. Orange is the route it chose.
Route found: 19 steps · squares checked: 47
Wall off the flag completely. A robot with no planner would keep driving into the wall. One with a planner knows there is no route and can stop safely.
A warehouse robot plans a route between shelves to a pick-up spot, then re-plans if a forklift blocks the aisle.
Your robot reaches goals efficiently and avoids obstacles, even in new layouts.
The robot moves in straight lines and bumps into things, or gets stuck in dead ends.
Draw a grid with a few blocked squares. Find the shortest path by hand. You just ran a simple planner.
Common questions
Is path planning AI?
Classic planners are search algorithms, not learned AI. Learning can be added to speed up or improve them.
What if something moves into the path?
The robot re-plans. Fast local avoidance handles sudden obstacles while the global plan is updated.
Keep learning
Get your personal invite link to share R2BOT with friends.
Teachers and bloggers: paste the embed code into your page to show this demo for free.
Plain English. Free. Unsubscribe in one click.