Iterative deepening A*, or IDA*, is a graph traversal and path search algorithm that finds the shortest path between a start node and a goal node in a weighted graph, combining iterative deepening depth-first search with the heuristic cost estimate used by the A* algorithm. Because it is depth-first it uses less memory than ordinary A*, though unlike A* it does not use dynamic programming and so often explores the same nodes multiple times; it was first described by Richard E. Korf in 1985.
Facts
Classification
Design TechniqueHeuristic or Approximation 1 Sources
1. Iterative Deepening A* Algorithm (Wikipedia)
https://en.wikipedia.org/wiki/Iterative_deepening_A*Quote, https://en.wikipedia.org/wiki/Iterative_deepening_A*
It is a variant of iterative deepening depth-first search that borrows the idea to use a heuristic function to conservatively estimate the remaining cost to get to the goal from the A* search algorithm.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.