Scribd
Upload
68 views4 pages

A Search Minimizing The Total Estimated Cost: Def

A* search is a best-first search algorithm that finds the shortest path between a starting node and goal node. It evaluates nodes using a cost function F(n)=g(n)+h(n), where g(n) is the cost to reach the node from the starting node and h(n) is the estimated cost to reach the goal from the node. A* search is optimal if h(n) is admissible, meaning it does not overestimate the cost to reach the goal. It is also complete, meaning it is guaranteed to find a solution if one exists. A* search using a consistent heuristic is optimal, where consistency means the heuristic never overestimates the actual cost along an optimal path.

Uploaded by

Vishali Dhivya
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
68 views4 pages

A Search Minimizing The Total Estimated Cost: Def

A* search is a best-first search algorithm that finds the shortest path between a starting node and goal node. It evaluates nodes using a cost function F(n)=g(n)+h(n), where g(n) is the cost to reach the node from the starting node and h(n) is the estimated cost to reach the goal from the node. A* search is optimal if h(n) is admissible, meaning it does not overestimate the cost to reach the goal. It is also complete, meaning it is guaranteed to find a solution if one exists. A* search using a consistent heuristic is optimal, where consistency means the heuristic never overestimates the actual cost along an optimal path.

Uploaded by

Vishali Dhivya
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

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

straightline.
Z

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

graph search is optimal if h (n ) is consistent. Another important consequence of consistency is the following : If h(n)is consistent, then the values of f(n) along any path are non-decreasing. The proof follows directly from the definition of consistency. Suppose nis a successor of n;then g(n)=g(n)+c(n,a,n) we have, F(n)=g(n)+h(n)=g(n)+c(n,a,n) +h(n)>=g(n)+h(n)=f(n).. if c*is the cost of the path then 1. A*expands all nodes with f (n) <c*. 2. A* might then expand some of the nodes right on the goal contour. Therefore, a*search is complete. it is said that a*search is complete, optimal and optimally efficient among all the algorithms. in mathematical notation ,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. Drawbacks: it keeps all generated nodes in memory. It usually runs out of space long before it runs out of time.

You might also like