BTechibtechi.in
Loading Loading
Free IIT Madras BS notes, PYQs and mock tests at btechi.in

AI Search · Automated planning

15 questions · 15 marks · 3 papers

Answer key

Indian Institute of Technology Madras

BS Degree Programme · Examination & Study Paper

AI: Search Methods for Problem Solving

Automated planning

Official Paper

Examination Instructions & Guidelines

Solve on notebook/paper first before checking solutions.
MCQ: Exactly 1 option is correct. Negative marking applies.
MSQ: One or more options correct. Select all to score.
NAT: Numerical response. No negative marking.
Scientific calculator allowed for all calculations.
Official answer key is sealed at the end of this sheet.

End Term · 31 Aug 2025 (FN)End Term

Read the passage below, then answer Q1–Q4
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Based on the above data, answer the given subquestions.
Q1MSQ1 Mark·Choose all correct options
Asked 3 times Key ↓
Which of the following are applicable actions in the start state?
1. APutdown(D)
2. BUnstack(D, B)
3. CUnstack(C, A)
4. DPickup(E)
5. EPickup(A)
6. FStack(B, A)
7. GStack(A, C)
Q2MSQ1 Mark·Choose all correct options
Asked 3 times Key ↓
Which of the following are relevant actions in the goal state?
1. APutdown(D)
2. BUnstack(D, B)
3. CUnstack(C, A)
4. DPickup(E)
5. EPickup(A)
6. FStack(B, A)
7. GStack(A , C)
Q3MSQ1 Mark·Choose all correct options
Asked 2 times Key ↓
In the planning graph, which of the following are mutex action pairs in Layer 1?
1. AUnstack(D, B), Pickup(E)
2. BUnstack(D, B), Unstack(C, A)
3. CPickup(E), Stack(B, A)
4. DPickup(E), Stack(A, C)
Q4MSQ1 Mark·Choose all correct options
Asked 2 times Key ↓
In the planning graph, which of the following are mutex proposition pairs in Layer 1?
1. Aclear(B), holding(C)
2. Bclear(B), clear(A)
3. Cclear(E), on(D, B)
4. Dclear(E), holding(D)

End Term · 31 Aug 2025 (AN)End Term

Read the passage below, then answer Q5–Q8
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below.
Consider the following planning problem.
Based on the above data, answer the given subquestions.
Q5MSQ1 Mark·Choose all correct options
Asked 3 times Key ↓
Which of the following are applicable actions in the start state?
1. APutdown(D)
2. BUnstack(D,A)
3. CUnstack(E,B)
4. DPickup(C)
5. EPickup(A)
6. FStack(A,B)
7. GStack(B,C)
Q6MSQ1 Mark·Choose all correct options
Asked 3 times Key ↓
Which of the following are relevant actions in the goal state?
1. APutdown(D)
2. BUnstack(D,A)
3. CUnstack(E,B)
4. DPickup(C)
5. EPickup(A)
6. FStack(A,B)
7. GStack(B,C)
Q7MSQ1 Mark·Choose all correct options
Asked 2 times Key ↓
In the planning graph, which of the following are mutex action pairs in Layer 1?
1. AUnstack(D,A), Pickup(C)
2. BUnstack(D,A), Unstack(E,B)
3. CPickup(C), Stack(A,B)
4. DPickup(C), Stack(B,C)
Q8MSQ1 Mark·Choose all correct options
Asked 2 times Key ↓
In the planning graph, which of the following are mutex proposition pairs in Layer 1?
1. Aclear(A), holding(E)
2. Bclear(A), clear(B)
3. Cclear(C), on(D,A)
4. Dclear(C), holding(E)

Quiz 2 · 3 Aug 2025 (AN)Quiz 2

Read the passage below, then answer Q9–Q15
AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. Note: this is the same domain description used in the weekly assignments.
Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to dead-ends or cycles.
Tie-breaker: Treat the goal description, preconditions and effects as lists that are accessed from left to right. When the elements in a list are pushed one by one to a stack, the last element in the list will be at the top of the stack. It has the effect of reversing the list.
A planning problem is given below, find a plan using the operators and predicates defined in the blocks-world domain.
Based on the above data, answer the given subquestions
Q9NAT1 Mark·Write the number
Key ↓
What is the length of the optimal plan? Enter the number of actions in the optimal plan. NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: 42
Your answer:
Q10MSQ1 Mark·Choose all correct options
Asked 3 times Key ↓
Which of the following are applicable actions for the given planning problem?
1. APickup(D)
2. BPickup(G)
3. CPickup(M)
4. DUnstack(C,M)
5. EUnstack(E,D)
Q11MSQ1 Mark·Choose all correct options
Asked 3 times Key ↓
Which of the following are relevant actions for the given planning problem?
1. APickup(G)
2. BStack(E,M)
3. CStack(G,E)
4. DUnstack(C,M)
5. EUnstack(E,D)
Q12MCQ1 Mark·Choose one option
Key ↓
Which of the following can be pushed as the first three elements onto the stack by the Goal Stack Planning algorithm? In the representation below the stack has a bottom on the right marked by the entry END. Use appropriate tie-breakers listed in the main data.
1. A{ on(E,M), on(G,E) }; on(E,M); on(G,E); END
2. B{ on(E,M), on(G,E) }; on(G,E); on(E,M); END
3. Con(G,E); on(E,M); { on(E,M), on(G,E) }; END
4. Don(E,M); on(G,E); { on(E,M), on(G,E) }; END
Q13MCQ1 Mark·Choose one option
Key ↓
For the subgoal ordering given in the goal description (and using the given tie breaking rules), which of the following is the first action popped out of the stack in Goal Stack Planning?
1. APickup(G)
2. BStack(G,E)
3. CUnstack(E,D)
4. DUnstack(C,M)
Q14MCQ1 Mark·Choose one option
Key ↓
For the subgoal ordering given in the goal description (and using the given tie breaking rules), does the Goal Stack Planning algorithm find an optimal plan?
1. AYes
2. BNo
3. CCannot be determined
Q15MCQ1 Mark·Choose one option
Key ↓
If the subgoals in the goal description are swapped places then does the Goal Stack Planning algorithm find an optimal plan?
1. AYes
2. BNo
3. CCannot be determined

Official Key

Master Answer Key & Explanations

Official answer keys from IIT Madras BS past papers. Click any question to review.

Reveal Key

Q1B, C, D

Q2F, G

Q3A, B

Q4A, B

Q5B, C, D

Q6F, G

Q7A, B

Q8A, B

Q96

Q10B, D, E

Q11B, C

Q12C

Q13A

Q14B

Q15A

Questions and answer keys are reproduced from the official IIT Madras BS papers. Topics and repeated question types are BTechi’s own grouping. BTechi is not affiliated with IIT Madras.