Pathfinding is the computation of a route between two points in a graph or space, often the shortest or lowest-cost route. It is widely used in games, robotics, and navigation.
Semantic Classification
Content
- Pathfinding searches a representation of an environment, such as a grid or graph, to find a route that connects a start and a goal while respecting obstacles and costs. Algorithms such as A* use heuristics to guide the search efficiently.
- The technique underpins movement of characters in games, route planning for robots, and navigation systems. Choices of representation and heuristic affect both the quality of the path and the time taken to compute it.