Q#1: In AI, planning refers to:
(A) Generating a sequence of actions to achieve a goal
(B) Random exploration of states
(C) BFS expansion only
(D) DFS only
Answer: (A) Generating a sequence of actions to achieve a goal
Q#2: A planning problem consists of:
(A) Initial state, goal, actions
(B) Variables only
(C) BFS nodes
(D) Random assignment
Answer: (A) Initial state, goal, actions
Q#3: STRIPS stands for:
(A) Stanford Research Institute Problem Solver
(B) Random planning method
(C) BFS algorithm
(D) DFS method
Answer: (A) Stanford Research Institute Problem Solver
Q#4: STRIPS represents actions using:
(A) Preconditions, add-list, delete-list
(B) Variables only
(C) BFS nodes
(D) Random values
Answer: (A) Preconditions, add-list, delete-list
Q#5: Preconditions of an action specify:
(A) Conditions that must hold before the action
(B) Effects after action
(C) BFS nodes
(D) Random assignments
Answer: (A) Conditions that must hold before the action
Q#6: Add-list of an action specifies:
(A) Facts added to the state after execution
(B) Facts removed
(C) BFS nodes
(D) DFS only
Answer: (A) Facts added to the state after execution
Q#7: Delete-list of an action specifies:
(A) Facts removed from the state after execution
(B) Facts added
(C) BFS only
(D) DFS only
Answer: (A) Facts removed from the state after execution
Q#8: Classical planning assumes:
(A) Deterministic, fully observable environment
(B) Random environment
(C) Partially observable
(D) Stochastic environment
Answer: (A) Deterministic, fully observable environment
Q#9: Partial-order planning allows:
(A) Actions to be partially ordered
(B) BFS expansion only
(C) DFS only
(D) Random assignment
Answer: (A) Actions to be partially ordered
Q#10: Total-order planning requires:
(A) Complete sequence of actions
(B) Partial ordering
(C) BFS only
(D) DFS only
Answer: (A) Complete sequence of actions
Q#11: Planning graph is used in:
(A) Graphplan algorithm
(B) BFS only
(C) DFS only
(D) Random search
Answer: (A) Graphplan algorithm
Q#12: Levels in planning graph represent:
(A) States and actions at different time steps
(B) BFS nodes
(C) DFS depth
(D) Random values
Answer: (A) States and actions at different time steps
Q#13: Mutex in planning graph stands for:
(A) Mutual exclusion between actions or states
(B) BFS node
(C) DFS only
(D) Random assignment
Answer: (A) Mutual exclusion between actions or states
Q#14: Regression planning works by:
(A) Planning backward from the goal
(B) Planning forward from initial state
(C) BFS only
(D) DFS only
Answer: (A) Planning backward from the goal
Q#15: Progression planning works by:
(A) Planning forward from initial state
(B) Planning backward
(C) BFS only
(D) DFS only
Answer: (A) Planning forward from initial state
Q#16: Heuristic search can improve planning by:
(A) Guiding search toward goal efficiently
(B) Random moves
(C) BFS only
(D) DFS only
Answer: (A) Guiding search toward goal efficiently
Q#17: Planning as search represents:
(A) Each node as a state, edges as actions
(B) Variables only
(C) BFS nodes
(D) Random values
Answer: (A) Each node as a state, edges as actions
Q#18: Graphplan algorithm generates:
(A) All possible actions at each level efficiently
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) All possible actions at each level efficiently
Q#19: 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#20: Causal link in planning represents:
(A) An action that achieves a condition needed by another action
(B) BFS node
(C) DFS only
(D) Random assignment
Answer: (A) An action that achieves a condition needed by another action
Q#21: Threats in plan-space planning are:
(A) Actions that can invalidate a causal link
(B) BFS only
(C) DFS only
(D) Random values
Answer: (A) Actions that can invalidate a causal link
Q#22: Contingent planning handles:
(A) Uncertainty in action outcomes
(B) Deterministic actions only
(C) BFS only
(D) DFS only
Answer: (A) Uncertainty in action outcomes
Q#23: Conditional planning includes:
(A) Branching depending on observation results
(B) BFS nodes
(C) DFS only
(D) Random values
Answer: (A) Branching depending on observation results
Q#24: Hierarchical Task Network (HTN) planning decomposes:
(A) Tasks into subtasks
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Tasks into subtasks
Q#25: Operator in HTN represents:
(A) Primitive action
(B) High-level task
(C) BFS node
(D) Random value
Answer: (A) Primitive action
Q#26: Method in HTN represents:
(A) Decomposition of a task into subtasks
(B) Primitive action
(C) BFS node
(D) DFS only
Answer: (A) Decomposition of a task into subtasks
Q#27: Planning with uncertainty may use:
(A) Markov decision processes (MDPs)
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Markov decision processes (MDPs)
Q#28: MDPs include:
(A) States, actions, transition model, reward function
(B) BFS nodes
(C) DFS only
(D) Random values
Answer: (A) States, actions, transition model, reward function
Q#29: Value iteration in planning computes:
(A) Optimal value function
(B) BFS nodes
(C) DFS only
(D) Random assignment
Answer: (A) Optimal value function
Q#30: Policy in planning maps:
(A) States to actions
(B) BFS nodes
(C) DFS only
(D) Random values
Answer: (A) States to actions
Q#31: Partial observability requires:
(A) Belief states
(B) BFS only
(C) DFS only
(D) Random values
Answer: (A) Belief states
Q#32: Planning domain definition language (PDDL) is used to:
(A) Describe planning problems formally
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Describe planning problems formally
Q#33: Classical planning assumes:
(A) Deterministic, fully observable, static environment
(B) Uncertain environment
(C) Dynamic environment
(D) Random search
Answer: (A) Deterministic, fully observable, static environment
Q#34: Planning complexity increases with:
(A) Number of actions and goals
(B) BFS nodes only
(C) DFS only
(D) Random assignment
Answer: (A) Number of actions and goals
Q#35: Satisficing planning aims to:
(A) Find a good enough plan, not necessarily optimal
(B) Find optimal plan
(C) BFS only
(D) DFS only
Answer: (A) Find a good enough plan, not necessarily optimal
Q#36: Optimal planning aims to:
(A) Find minimal cost plan
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Find minimal cost plan
Q#37: Planning graphs help to:
(A) Identify reachable actions and mutual exclusions
(B) BFS nodes
(C) DFS only
(D) Random assignments
Answer: (A) Identify reachable actions and mutual exclusions
Q#38: Planning as heuristic search uses:
(A) Heuristics to guide exploration of states
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Heuristics to guide exploration of states
Q#39: Landmark in planning is:
(A) A fact that must be true at some point in any valid plan
(B) BFS node
(C) DFS only
(D) Random value
Answer: (A) A fact that must be true at some point in any valid plan
Q#40: Relaxed planning ignores:
(A) Delete effects
(B) Add effects
(C) BFS only
(D) DFS only
Answer: (A) Delete effects
Q#41: Heuristic from relaxed planning graph estimates:
(A) Distance to goal
(B) BFS nodes
(C) DFS only
(D) Random value
Answer: (A) Distance to goal
Q#42: Planning under uncertainty often uses:
(A) Contingent or probabilistic planning
(B) Classical planning
(C) BFS only
(D) DFS only
Answer: (A) Contingent or probabilistic planning
Q#43: Probabilistic planning uses:
(A) Actions with stochastic outcomes
(B) Deterministic actions
(C) BFS only
(D) DFS only
Answer: (A) Actions with stochastic outcomes
Q#44: Planning and scheduling are related because:
(A) Actions must respect temporal and resource constraints
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Actions must respect temporal and resource constraints
Q#45: Temporal planning considers:
(A) Action durations and deadlines
(B) BFS only
(C) DFS only
(D) Random values
Answer: (A) Action durations and deadlines
Q#46: Resource-constrained planning considers:
(A) Limited availability of resources
(B) BFS nodes
(C) DFS only
(D) Random assignment
Answer: (A) Limited availability of resources
Q#47: Plan validation checks:
(A) Whether a plan achieves goals without conflicts
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Whether a plan achieves goals without conflicts
Q#48: Multi-agent planning requires:
(A) Coordination among agents
(B) BFS only
(C) DFS only
(D) Random assignment
Answer: (A) Coordination among agents
Q#49: Plan repair is used when:
(A) Initial plan fails due to changes or unexpected events
(B) BFS only
(C) DFS only
(D) Random value
Answer: (A) Initial plan fails due to changes or unexpected events
Q#50: The main goal of AI planning is to:
(A) Generate sequences of actions to achieve goals efficiently
(B) BFS only
(C) DFS only
(D) Random assignments
Answer: (A) Generate sequences of actions to achieve goals efficiently