A* Pathfinding: How Robots Navigate Around Obstacles
A* explores the map by always trying the most promising square first, using the cost so far plus a guess of the cost left.
The robot repeats this loop many times a second. Tap a step to pause on it.
Picture the map as a grid. A* keeps a list of squares to try. For each one it adds the distance travelled so far to an estimate of the distance still to go, and always expands the lowest total first.
This heads for the goal but never forgets the cost of the route so far, so it finds a shortest path and avoids wasting time searching away from the goal.
A robot finds a short, safe route through clutter, quickly enough to re-plan when something moves.
Trying every route would take too long, and picking routes at random can give long detours or dead ends.
It needs a map, and a good cost estimate. In a huge or changing space, faster or lighter methods are needed.
What does A* use to choose the next square?
Go deeper in the Atlas
Control and Balance
- Feedback Control Explained
- Line Follower Robot
- Why You Don't Fall in a Moving Bus (And Robots Do)
- How Boston Dynamics Robots Keep Their Balance
- How Drones Stay Level in Strong Wind
- PID Controller in 60 Seconds
- ROS 2
- How Robots Learn to Walk
- A* Pathfinding
- State Machine
- Robot Latency
- Reward Hacking
- Sim to Real
- How Humanoid Robots Walk Without Falling (ZMP Explained)
- Gain and Damping
- How Self-Driving Cars Think
- Swarm Robotics
- Robot Dog (Quadruped) Explained
- How a Drone Hovers
- Behavior Tree