Why it matters

A* variants trade different constraints. Understanding shapes right choice.

Advertisement

The architecture

IDA*: iterative deepening + heuristic. O(1) memory.

Weighted A*: f = g + w*h, w > 1.

A* variantsIDA*memory-boundedWeighted A*faster, suboptimalARA*anytimeChoose based on memory + optimality + time constraints
A* variants.
Advertisement

How it works end to end

IDA*: for memory-constrained (embedded, huge search space).

Weighted A*: optimality guarantee within factor w of optimum.

ARA*: incrementally improve solution as time allows.

D*: for dynamic environments (robotics).