In Artificial Intelligence (AI), a simple reflex agent selects actions on the basis of.
current percept, completely ignoring rest of the percept history.
A simple reflex agent selects an action using condition–action rules applied to the current percept. It does not retain the percept history or an internal model of earlier states. Therefore, when choosing an action requires historical information absent from the current percept, this architecture cannot distinguish the relevant situations.
Which of the following languages is suitable for artificial intelligence?
Match the search algorithms to the properties below. Assume finite branching, positive step costs, and admissible heuristics for the A* variants.
List I:
(A) Greedy best-first tree search without cycle checking
(B) Standard A* retaining its search frontier
(C) Recursive best-first search (RBFS)
(D) Simplified memory-bounded A* (SMA*)
List II:
(I) Uses \(O(bd)\) memory, where \(b\) is the branching factor and \(d\) is the maximum retained path depth.
(II) Can be incomplete on a finite state graph because it may repeatedly traverse a cycle.
(III) Finds an optimal solution if sufficient memory can retain an optimal path; otherwise finds the best solution reachable within the memory bound.
(IV) May require exponential time and memory in the worst case.
Choose the correct answer from the options given below.