Home > AI Searching Techniques > Iterative Deepening A* Search

Iterative Deepening A* Search

September 4, 2010 Leave a comment Go to comments

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.

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

%d bloggers like this: