A* (A-Star) Pathfinding in Robotics — Complete Guide
196 words · 1 min read
A* finds the shortest path between two points on a grid or graph. It is the most-used pathfinding algorithm in robotics — from Roomba to delivery robots.
The concept concept: A* finds the shortest path between two points
Difficulty 3/5 · ClassroomA* (pronounced 'A-star') is a graph search algorithm that finds the shortest path between two nodes by combining the actual cost so far (g) with a heuristic estimate to the goal (h). Its evaluation function is f(n) = g(n) + h(n).
💡 Think of it like…
Think of it like a household object that does the same job — the underlying idea is the same, just adapted for robots.
Why it matters
Without a* (a-star) pathfinding in robotics — complete guide, many concept systems in robotics simply couldn't work.
A* (A-Star) Pathfinding in Robotics
What is it?
A* (pronounced 'A-star') is a graph search algorithm that finds the shortest path between two nodes by combining the actual cost so far (g) with a heuristic estimate to the goal (h). Its evaluation function is f(n) = g(n) + h(n).
How it works
A* maintains an open set of nodes to expand and a closed set of nodes already evaluated. At each step, it picks the open node with the lowest f score, evaluates its neighbours, updates their costs, and continues until the goal is reached. With an admissible heuristic (e.g., Euclidean distance), A* is guaranteed to find the shortest path.
Real-world example
A Roomba uses A* (or a variant) to plan a path around your room. Google Maps uses A* variants for routing. Most warehouse robots, including GreyOrange Butlers, run A* on a grid representation of the warehouse floor.
Why it matters for robotics
A* is the canonical robotics algorithm taught in every robotics course — from school programs to IIT classes. Understanding A* is the gateway to D*, RRT, and modern motion planners.
See also
Ask R2 Co-pilot anything you didn't understand about A* (A-Star) Pathfinding in Robotics — Complete Guide. It'll explain it plainly.
Keep going
Motion planning
Motion planning determines the precise sequence of joint angles, wheel velocities, or body configurations a ro…
ConceptOccupancy grid
An occupancy grid is a map of the environment divided into a regular grid of cells, where each cell stores a p…
ConceptPath planning
Path planning is the process of finding a route through space from a starting point to a goal, avoiding obstac…
Last updated · 2026-05-21
Community discussion
0 questions & insightsLoading discussion…
Spotted something off? Report an error →