APPLICATION OF SUPERVISED LEARNING
ARTIFICIAL INTELLIGENCE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
Which search is complete and optimal when h(n) is consistent?
|
|
A* search
|
|
|
A* Tree search
|
|
|
A* Graph search
|
|
|
Best-first search
|
Explanation:
Detailed explanation-1: -Theorem: If h(n) is consistent, A * using GRAPH-SEARCH is optimal.
Detailed explanation-2: -A* search is optimal if the heuristic is admissible. Admissible makes that whichever node you expand, it makes sure that the current estimate is always smaller than the optimal, so path about to expand maintains a chance to find the optimal path.
Detailed explanation-3: -Complexity. The time complexity of A* depends on the heuristic. In the worst case of an unbounded search space, the number of nodes expanded is exponential in the depth of the solution (the shortest path) d: O(bd), where b is the branching factor (the average number of successors per state).
There is 1 question to complete.