Q#1: Knowledge representation in planning is used to:
(A) Encode states, actions, and goals
(B) Randomly assign values
(C) BFS expansion only
(D) DFS depth control
Answer: (A) Encode states, actions, and goals
Q#2: A state in planning is:
(A) Complete description of the world at a time
(B) An action only
(C) BFS node
(D) Random value
Answer: (A) Complete description of the world at a time
Q#3: A goal in planning represents:
(A) Desired state to achieve
(B) Initial state only
(C) BFS node
(D) Random assignment
Answer: (A) Desired state to achieve
Q#4: Actions in planning are represented by:
(A) Preconditions, add-effects, delete-effects
(B) Variables only
(C) BFS nodes
(D) Random values
Answer: (A) Preconditions, add-effects, delete-effects
Q#5: Preconditions specify:
(A) Conditions that must hold before an action
(B) Effects after action
(C) BFS nodes
(D) Random assignments
Answer: (A) Conditions that must hold before an action
Q#6: Add-effects specify:
(A) Facts added after action
(B) Facts removed
(C) BFS only
(D) DFS only
Answer: (A) Facts added after action
Q#7: Delete-effects specify:
(A) Facts removed after action
(B) Facts added
(C) BFS only
(D) DFS only
Answer: (A) Facts removed after action
Q#8: STRIPS is a classical formalism for:
(A) Representing planning actions
(B) Random planning
(C) BFS only
(D) DFS only
Answer: (A) Representing planning actions
Q#9: A planning problem is formally represented as:
(A) (S, A, γ, G) – states, actions, transition function, goal
(B) BFS tree
(C) DFS only
(D) Random assignment
Answer: (A) (S, A, γ, G) – states, actions, transition function, goal
Q#10: Transition function γ defines:
(A) Resulting state of applying an action in a state
(B) BFS node
(C) DFS depth
(D) Random value
Answer: (A) Resulting state of applying an action in a state
Q#11: Planning graphs represent:
(A) Levels of states and actions over time
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Levels of states and actions over time
Q#12: Nodes in planning graph represent:
(A) States or actions
(B) BFS nodes only
(C) DFS depth
(D) Random values
Answer: (A) States or actions
Q#13: Edges in planning graph represent:
(A) Possible transitions between states and actions
(B) BFS nodes only
(C) DFS depth
(D) Random assignments
Answer: (A) Possible transitions between states and actions
Q#14: Mutex relations in planning graphs represent:
(A) Mutual exclusion of actions or states
(B) BFS nodes
(C) DFS only
(D) Random assignment
Answer: (A) Mutual exclusion of actions or states
Q#15: Action schemas describe:
(A) General action templates with parameters
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) General action templates with parameters
Q#16: Parameters in action schemas are:
(A) Variables that must be instantiated to constants
(B) BFS nodes
(C) DFS only
(D) Random values
Answer: (A) Variables that must be instantiated to constants
Q#17: Instantiated action is called:
(A) Ground action
(B) Schema only
(C) BFS node
(D) Random assignment
Answer: (A) Ground action
Q#18: Planning as search represents:
(A) Nodes as states, edges as actions
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Nodes as states, edges as actions
Q#19: Forward search in planning applies:
(A) Actions from the initial state toward the goal
(B) Backward search only
(C) BFS nodes
(D) DFS only
Answer: (A) Actions from the initial state toward the goal
Q#20: Regression (backward) search applies:
(A) Actions backward from goal toward initial state
(B) Forward search only
(C) BFS nodes
(D) DFS only
Answer: (A) Actions backward from goal toward initial state
Q#21: Partial-order planning represents:
(A) Plans with partially ordered actions
(B) Totally ordered BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Plans with partially ordered actions
Q#22: Causal links in partial-order planning represent:
(A) Dependencies between actions
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Dependencies between actions
Q#23: Threats occur when:
(A) An action can invalidate a causal link
(B) BFS nodes
(C) DFS only
(D) Random value
Answer: (A) An action can invalidate a causal link
Q#24: Threats can be resolved by:
(A) Promotion or demotion of actions
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Promotion or demotion of actions
Q#25: States can be represented as:
(A) Sets of propositions (facts)
(B) BFS nodes
(C) DFS only
(D) Random values
Answer: (A) Sets of propositions (facts)
Q#26: Goals are represented as:
(A) Set of desired propositions
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Set of desired propositions
Q#27: Heuristic functions in planning estimate:
(A) Distance to goal
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Distance to goal
Q#28: Relaxed planning ignores:
(A) Delete effects
(B) Add effects
(C) BFS nodes
(D) DFS only
Answer: (A) Delete effects
Q#29: Landmark facts are:
(A) Must be achieved in any valid plan
(B) BFS nodes
(C) DFS only
(D) Random values
Answer: (A) Must be achieved in any valid plan
Q#30: Hierarchical Task Network (HTN) planning uses:
(A) Task decomposition
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Task decomposition
Q#31: HTN methods describe:
(A) How to decompose high-level tasks into subtasks
(B) Primitive actions only
(C) BFS nodes
(D) DFS only
Answer: (A) How to decompose high-level tasks into subtasks
Q#32: Primitive actions are:
(A) Directly executable actions
(B) High-level tasks
(C) BFS nodes
(D) DFS only
Answer: (A) Directly executable actions
Q#33: Knowledge representation allows:
(A) Efficient reasoning about actions and effects
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Efficient reasoning about actions and effects
Q#34: Planning under uncertainty may use:
(A) Belief states
(B) Deterministic states
(C) BFS only
(D) DFS only
Answer: (A) Belief states
Q#35: Belief states represent:
(A) Set of possible world states
(B) Single deterministic state
(C) BFS nodes
(D) DFS only
Answer: (A) Set of possible world states
Q#36: Contingent planning handles:
(A) Conditional actions based on observations
(B) Deterministic actions
(C) BFS nodes
(D) DFS only
Answer: (A) Conditional actions based on observations
Q#37: Probabilistic planning represents:
(A) Actions with uncertain outcomes
(B) Deterministic actions
(C) BFS only
(D) DFS only
Answer: (A) Actions with uncertain outcomes
Q#38: Planning knowledge should be:
(A) Expressive, clear, and efficiently usable
(B) Random assignments
(C) BFS only
(D) DFS only
Answer: (A) Expressive, clear, and efficiently usable
Q#39: STRIPS-like representations are limited to:
(A) Classical deterministic planning
(B) Probabilistic planning
(C) BFS nodes
(D) DFS only
Answer: (A) Classical deterministic planning
Q#40: Knowledge about resources helps in:
(A) Resource-constrained planning
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Resource-constrained planning
Q#41: Temporal knowledge helps to:
(A) Reason about action durations and deadlines
(B) BFS nodes
(C) DFS only
(D) Random assignment
Answer: (A) Reason about action durations and deadlines
Q#42: Planning knowledge can be represented in:
(A) Logic, PDDL, HTN, or graphs
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Logic, PDDL, HTN, or graphs
Q#43: Action preconditions are used to:
(A) Determine applicability of actions
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Determine applicability of actions
Q#44: Action 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#45: Forward search uses:
(A) Knowledge about initial state and actions
(B) Goal only
(C) BFS nodes
(D) DFS only
Answer: (A) Knowledge about initial state and actions
Q#46: Regression search uses:
(A) Knowledge about goal and actions
(B) Initial state only
(C) BFS nodes
(D) DFS only
Answer: (A) Knowledge about goal and actions
Q#47: Mutex relations prevent:
(A) Conflicting actions or facts
(B) BFS nodes
(C) DFS only
(D) Random assignment
Answer: (A) Conflicting actions or facts
Q#48: Planning heuristics speed up:
(A) Search for feasible plans
(B) BFS nodes only
(C) DFS only
(D) Random assignments
Answer: (A) Search for feasible plans
Q#49: Knowledge representation for planning allows:
(A) Verification and validation of plans
(B) BFS nodes only
(C) DFS only
(D) Random assignments
Answer: (A) Verification and validation of plans
Q#50: The main goal of knowledge representation in planning is:
(A) Encode information to generate efficient and correct plans
(B) BFS nodes only
(C) DFS only
(D) Random assignments
Answer: (A) Encode information to generate efficient and correct plans