Informed search:
•That uses problem-specific knowledge beyond the definition of the problem itself.
•It can find solution more efficiently than uninformed search.
•Informed search – Best First Search.
Best-first search
•Idea: use an evaluation function f(n) for each node
Expand most desirable unexpanded node
•Implementation:
Order the nodes in fringe in decreasing order of desirability
•Key component – heuristic function h(n)
h(n) = estimated cost of the cheapest path from node n to goal node.
•Special cases:
–greedy best-first search
–A* search
No comments:
Post a Comment