▎Loyal Wingman

A* Pathfinding

Best-first graph search algorithm with admissible heuristics.

Definition

A* combines uniform-cost search with an admissible heuristic to find shortest paths efficiently on a graph or grid. It underpins most autonomous mission planners' coarse routing layers and many modern variants (D* Lite, ARA*, weighted A*) used for replanning under change.

Reference attributes

Origin: Hart, Nilsson, Raphael (1968)
Variants: D* Lite, ARA*, Theta*

Related terms

Rapidly-Exploring Random Tree (RRT)
Sampling-based motion planner for high-dimensional configuration spaces.
Goal-Oriented Action Planning (GOAP)
Lightweight STRIPS-style planner that chains actions by precondition and effect.

#planning#search