Home > AI Searching Techniques > Iterative Deepening A* Search

Iterative Deepening A* Search

Modification of A* search use f-cost limit as depth bound

  • Increase threshold as minimum of f(.) of previous cycle
  • Each iteration expands all nodes inside the contour for current f-cost
  • complete and optimal
  • Same order of node expansion
  • Storage Efficient – practical

IDA* do not remember history

Therefore cannot avoid repeated states

  1. No comments yet.
  1. No trackbacks yet.
You must be logged in to post a comment.