# 1

A*search Minimizing the total estimated cost: Def:
The most widely-known form of best first search is called a*search. It evaluates nodes by combining g(n),the cost to reach the node and h(n),the cost to get from the node to the goal: F(n)=g(n)+h(n). • Here f(n)->estimated cost of the cheapest solution g(n)->the path cost from start node to node n h(n)->estimated cost of the cheapest path from n to node. • A*search is both complete and optimal. • The optimality of a*is straightforward to analyse if it is used with TREE SEARCH.  H(n) is admissible heuristic. An favorable example is straight-line distance because the shortest path between any two points is

 to ensure that there is a optimal path. F(n)<=c*<f(G2) so G2 will not be expanded and a* must return an optimal solution.here g2 appears on the fringe h(g2)=0.1 straightline. extending the graph search. A*search using  . it should have the requirement of consistency. F(g2)=g(G2)+h(G2)=g(G2)>C*. The general form of triangle inequality is H(n)<=c(n.every consistent heuristic is also admissible. Z A S F B T R P A general proof of a*search using TREE SEARCH is optiamal if h(n)is admissible.n’)+h(n’). there two ways to solve this problem: 1. Therefore.a. F(n)=g(n)+h(n)<c*.from this equation we know that .

Therefore.the condition for sub exponential growth is that |h(n)-h*(n)| <=o(log h*(n)) where h*(n)-true cost of getting from n to the goal. then the values of f(n) along any path are non-decreasing. optimal and optimally efficient among all the algorithms. it is said that a*search is complete.n’) we have. .a.then g(n’)=g(n)+c(n. A*expands all nodes with f (n) <c*. The proof follows directly from the definition of consistency.. Drawbacks: it keeps all generated nodes in memory. Suppose n’is a successor of n. Another important consequence of consistency is the following :  If h(n)is consistent. a*search is complete.a. A* might then expand some of the nodes right on the “goal contour”. if c*is the cost of the path then 1. in mathematical notation .n’) +h(n’)>=g(n)+h(n)=f(n). F(n’)=g(n’)+h(n’)=g(n)+c(n. It usually runs out of space long before it runs out of time. 2.1 graph search is optimal if h (n ) is consistent.

1 .

Sign up to vote on this title