Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
A*

A*

Ratings: (0)|Views: 73 |Likes:
Published by Sergey

More info:

Published by: Sergey on Mar 31, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PPT, PDF, TXT or read online from Scribd
See more
See less

06/14/2009

pdf

text

original

 
 
Introduction to Artificial Intelligence
A* Search
Ruth BergmanFall 2004
 
 
Best-First SearchReview
Advantages
 –Takes advantage of domain information to guide search –Greedy advance to the goal
Disadvantages
 –Considers cost to the goal from the current state –Some path can continue to look good according to theheuristic function
321x111x
At this point the path is morecostly than the alternate path
 
 
The A* Algorithm
Consider the overall cost of the solution. f(n) = g(n) + h(n) where g(n) is the path cost to node n think of f(n) as an estimate of the cost of the best solution
going through the node n
332x345x321x111x

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->