A* Algorithm

A graph search algorithm that finds the shortest path from a start node to a goal node using a heuristic function to guide the search. A* is optimal and complete when the heuristic is admissible (never overestimates). In robotics, A* is used for grid-based path planning, typically on occupancy grid maps produced by SLAM.