APPLICATION OF SUPERVISED LEARNING
ARTIFICIAL INTELLIGENCE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which one is correct in A* search
|
|
f(n)=h(n)
|
|
|
f(n)=g(n)+h(n)
|
|
|
f(n)<=min(g(n), h(n))
|
|
|
h(n)<=c(n, a, n’)+h(n’)
|
Explanation:
Detailed explanation-1: -A* Search Algorithm: A* search is the most commonly known form of best-first search. It uses heuristic function h(n), and cost to reach the node n from the start state g(n). It has combined features of UCS and greedy best-first search, by which it solve the problem efficiently.
Detailed explanation-2: -The A* algorithm uses a heuristic function to help decide which path to follow next. The heuristic function provides an estimate of the minimum cost between a given node and the target node.
Detailed explanation-3: -h is admissible: h(u) <= dist(u, t) (never overestimate) h is monotone: h(u) <= cost(u, v) + h(v) (triangle inequality) 25-Nov-2017
There is 1 question to complete.