Which search technique is complete and optimal, when h(n) is consistent?
A* Search
A heuristic h(n) is consistent (monotone) when, for every node n and successor n' reached by a step of cost c(n, n'), \(h(n) \le c(n, n') + h(n')\). Only an informed search that combines path cost with the heuristic can exploit this property.
A* expands nodes in order of \(f(n) = g(n) + h(n)\). With a consistent h, the f-values along any path are non-decreasing, so the first time A* selects a goal node for expansion its path cost is minimal; graph-search A* is therefore optimal, and it is complete whenever step costs are positive and the branching factor is finite.
Greedy best-first search orders nodes by h(n) alone and can return a costlier path, so it is not optimal. Depth-first search is neither complete on infinite paths nor optimal. Breadth-first search ignores h(n) and is optimal only when every step has the same cost.
A* Search option is correct.
Similar Questions
In constraint satisfaction problem, constraints can be stated as __________.
Language model used in LISP is __________.
Reasoning strategies used in expert systems include __________.
Forward chaining systems are __________ where as backward chaining systems are __________.
Given the following set of prolog clauses :
father(X, Y) :
parent(X, Y),
male(X),
parent(Sally, Bob),
parent(Jim, Bob),
parent(Alice, Jane),
parent(Thomas, Jane),
male(Bob),
male(Jim),
female(Salley),
female(Alice).
How many atoms are matched to the variable ‘X’ before the query
father(X, Jane) reports a Result ?
Match the following with respect to heuristic search techniques :
List - I List - II (a) Steepest - ascent Hill Climbing (i) Keeps track of all partial paths which can be candidate for further exploration (b) Branch - and - bound (ii) Discover problem state(s) that satisfy a set of constraints (c) Constraint satisfaction (iii) Detects difference between current state and goal state (d) Means - end - analysis (iv) Considers all moves from current state and selects best move Codes :
Match the following knowledge representation techniques with their applications :
List - I List - II (a) Frames (i) Pictorial representation of objects, their attributes and relationships (b) Conceptual dependencies (ii) To describe real world stereotype events (c) Associative networks (iii) Record like structures for grouping closely related knowledge (d) Scripts (iv) Structures and primitives to represent sentences Codes :
Match the following :
List - I List - II (a) Intelligence (i) Contextual, tacit, transfer needs learning (b) Knowledge (ii) Scattered facts, easily transferable (c) Information (iii) Judgemental (d) Data (iv) Codifiable, endorsed with relevance and purpose Codes :
Which of the following is false for the programming language PROLOG ?
________ is used in game trees to reduce the number of branches of the search tree to be traversed without affecting the solution.
Important Questions from Approaches to AI
The process of removing detail from a given state representation is called ______.
In constraint satisfaction problem, constraints can be stated as __________.
Language model used in LISP is __________.
Reasoning strategies used in expert systems include __________.
Forward chaining systems are __________ where as backward chaining systems are __________.
