Which AI agent architecture maintains an internal state to track aspects of the environment that cannot be viewed in the current percept?
A model-based reflex agent handles partially observable environments by maintaining an internal model of how the world evolves and how its actions affect the world.
In AI search problem formulation, what are the four fundamental components of a well-defined problem?
A search problem consists of initial state, actions/transition model, goal test, and path cost. Both (A) and (B) are valid components.
Which graph search algorithm expands the node with the lowest cumulative path cost g(n) from the root?
Uniform-Cost Search expands the node with the lowest path cost g(n), guaranteeing an optimal solution when all step costs are non-negative.
What is the primary operational difference between Tree Search and Graph Search?
Graph search maintains a closed list of visited states to avoid infinite loops and redundant exploration of multiple paths to the same state.
What is the maximum space complexity of Depth-First Search (DFS) on a tree with branching factor b and maximum depth m?
DFS has linear space complexity O(b * m) because it only needs to store the current path of nodes from the root along with remaining unexpanded siblings.