Q#1: Classical planning in AI assumes:
(A) Deterministic, fully observable, static environment
(B) Uncertain outcomes
(C) Dynamic environment
(D) Random assignments
Answer: (A) Deterministic, fully observable, static environment
Q#2: A classical planning problem includes:
(A) Initial state, goal state, actions
(B) Random BFS nodes
(C) DFS only
(D) Probabilistic states
Answer: (A) Initial state, goal state, actions
Q#3: STRIPS is a formalism for:
(A) Representing classical planning actions
(B) Probabilistic planning
(C) BFS only
(D) DFS only
Answer: (A) Representing classical planning actions
Q#4: In STRIPS, actions have:
(A) Preconditions, add-list, delete-list
(B) Variables only
(C) BFS nodes
(D) Random assignments
Answer: (A) Preconditions, add-list, delete-list
Q#5: Preconditions specify:
(A) Conditions that must hold to apply the action
(B) Effects after action
(C) BFS nodes
(D) Random values
Answer: (A) Conditions that must hold to apply the action
Q#6: Add-list specifies:
(A) Facts added after action execution
(B) Facts removed
(C) BFS only
(D) DFS only
Answer: (A) Facts added after action execution
Q#7: Delete-list specifies:
(A) Facts removed after action execution
(B) Facts added
(C) BFS only
(D) DFS only
Answer: (A) Facts removed after action execution
Q#8: States in classical planning are:
(A) Sets of propositions (facts)
(B) Random BFS nodes
(C) DFS only
(D) Probabilistic distributions
Answer: (A) Sets of propositions (facts)
Q#9: Goal in classical planning is:
(A) Set of desired propositions
(B) BFS nodes only
(C) DFS only
(D) Random values
Answer: (A) Set of desired propositions
Q#10: Classical planning searches:
(A) Sequence of actions from initial state to goal
(B) Random BFS nodes
(C) DFS only
(D) Probabilistic transitions
Answer: (A) Sequence of actions from initial state to goal
Q#11: Forward search in classical planning:
(A) Starts from initial state applying applicable actions
(B) Starts from goal state
(C) BFS only
(D) DFS only
Answer: (A) Starts from initial state applying applicable actions
Q#12: Regression (backward) search:
(A) Starts from goal and works backward
(B) Starts from initial state
(C) BFS only
(D) DFS only
Answer: (A) Starts from goal and works backward
Q#13: Total-order planning generates:
(A) Fully ordered sequences of actions
(B) Partial-order plans
(C) BFS only
(D) DFS only
Answer: (A) Fully ordered sequences of actions
Q#14: Partial-order planning allows:
(A) Actions partially ordered
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Actions partially ordered
Q#15: Causal links in partial-order planning represent:
(A) Actions that achieve preconditions for other actions
(B) BFS nodes
(C) DFS only
(D) Random values
Answer: (A) Actions that achieve preconditions for other actions
Q#16: Threats in partial-order planning occur when:
(A) An action can negate a causal link
(B) BFS nodes only
(C) DFS only
(D) Random assignment
Answer: (A) An action can negate a causal link
Q#17: Mutex in planning graphs indicates:
(A) Mutual exclusion between actions or facts
(B) BFS nodes only
(C) DFS only
(D) Random values
Answer: (A) Mutual exclusion between actions or facts
Q#18: Planning graphs are used in:
(A) Graphplan algorithm
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Graphplan algorithm
Q#19: Levels in a planning graph alternate between:
(A) State levels and action levels
(B) BFS nodes only
(C) DFS only
(D) Random values
Answer: (A) State levels and action levels
Q#20: Graphplan identifies:
(A) Reachable actions and mutexes efficiently
(B) BFS nodes only
(C) DFS only
(D) Random assignments
Answer: (A) Reachable actions and mutexes efficiently
Q#21: Heuristic search in classical planning uses:
(A) Estimates of distance to goal
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Estimates of distance to goal
Q#22: Relaxed planning heuristic ignores:
(A) Delete effects
(B) Add effects
(C) BFS nodes
(D) DFS only
Answer: (A) Delete effects
Q#23: Landmarks in classical planning are:
(A) Facts that must be true in any valid plan
(B) BFS nodes only
(C) DFS only
(D) Random values
Answer: (A) Facts that must be true in any valid plan
Q#24: Classical planning assumes actions are:
(A) Deterministic
(B) Probabilistic
(C) Random only
(D) BFS nodes
Answer: (A) Deterministic
Q#25: Classical planning assumes environment is:
(A) Fully observable
(B) Partially observable
(C) Stochastic
(D) Random only
Answer: (A) Fully observable
Q#26: Classical planning assumes environment is:
(A) Static
(B) Dynamic
(C) Probabilistic
(D) Random only
Answer: (A) Static
Q#27: Operator in classical planning represents:
(A) Action schema
(B) State only
(C) BFS node
(D) DFS only
Answer: (A) Action schema
Q#28: Ground action is:
(A) An instantiated action schema
(B) Operator only
(C) BFS node
(D) Random value
Answer: (A) An instantiated action schema
Q#29: Preconditions are used to:
(A) Check applicability of actions
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Check applicability of actions
Q#30: Effects are used to:
(A) Update the current state
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Update the current state
Q#31: Classical planning searches can be:
(A) Forward (progression) or backward (regression)
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Forward (progression) or backward (regression)
Q#32: Total-order vs partial-order affects:
(A) Flexibility and branching in plans
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Flexibility and branching in plans
Q#33: Planning graph levels help:
(A) Identify reachable states and actions
(B) BFS nodes only
(C) DFS only
(D) Random values
Answer: (A) Identify reachable states and actions
Q#34: Mutual exclusion relations prevent:
(A) Conflicting actions being chosen together
(B) BFS nodes only
(C) DFS only
(D) Random assignment
Answer: (A) Conflicting actions being chosen together
Q#35: Forward search expands:
(A) Applicable actions from the current state
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Applicable actions from the current state
Q#36: Regression search expands:
(A) Actions that can achieve current subgoal
(B) BFS nodes only
(C) DFS only
(D) Random assignments
Answer: (A) Actions that can achieve current subgoal
Q#37: Classical planning does not handle:
(A) Uncertainty or partial observability
(B) Deterministic actions
(C) BFS nodes
(D) DFS only
Answer: (A) Uncertainty or partial observability
Q#38: Graphplan returns:
(A) Plan extracted from planning graph
(B) BFS nodes only
(C) DFS only
(D) Random assignment
Answer: (A) Plan extracted from planning graph
Q#39: Classical planning aims to find:
(A) Sequence of actions achieving the goal
(B) BFS nodes only
(C) DFS only
(D) Random assignments
Answer: (A) Sequence of actions achieving the goal
Q#40: Forward search can use heuristics to:
(A) Prioritize nodes closer to goal
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Prioritize nodes closer to goal
Q#41: Backward search can be more efficient when:
(A) Goal has fewer variables than initial state
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Goal has fewer variables than initial state
Q#42: STRIPS actions simplify planning by:
(A) Separating preconditions, add, delete lists
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Separating preconditions, add, delete lists
Q#43: Partial-order plans allow:
(A) Flexibility in action execution order
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Flexibility in action execution order
Q#44: Classical planning problems are typically:
(A) NP-hard
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) NP-hard
Q#45: Plan-space planning focuses on:
(A) Actions and causal links
(B) BFS nodes
(C) DFS only
(D) Random values
Answer: (A) Actions and causal links
Q#46: Causal links ensure:
(A) Preconditions are preserved by earlier actions
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Preconditions are preserved by earlier actions
Q#47: Classical planning representation is suitable for:
(A) Deterministic, fully observable domains
(B) Stochastic domains
(C) Partially observable domains
(D) Random assignments
Answer: (A) Deterministic, fully observable domains
Q#48: Grounding actions in classical planning:
(A) Replaces variables with constants
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Replaces variables with constants
Q#49: Heuristic planning can speed up:
(A) Search for feasible classical plans
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Search for feasible classical plans
Q#50: The main objective of classical planning is:
(A) Generate correct action sequence to achieve goal
(B) BFS nodes only
(C) DFS only
(D) Random assignments
Answer: (A) Generate correct action sequence to achieve goal