Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 16 Mar 2025 · January 2025 term

Question 25: AUTOMATED PLANNING\ The domain description of a blocks-w…

Question 25

+1 markOne correct option

AUTOMATED PLANNING
The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain description used in the weekly assignments.

text
PREDICATES
armEmpty The arm is not holding any block, it is empty.
holding(X) The arm is holding X.
onTable(X) X is on the table.
clear(X) X has nothing above it, it is clear.
on(X,Y) X is directly on Y.
OPERATORS
Pickup(X): pick up X from the table.
Preconditions: { armEmpty, clear(X), onTable(X) }
Add Effects : { holding(X) }
Del Effects : { armEmpty, onTable(X) }
Putdown(X): place X on the table.
Preconditions: { holding(X) }
Add Effects : { armEmpty, onTable(X) }
Del Effects : { holding(X) }
Unstack(X,Y): pick up X that is directly sitting on Y.
Preconditions: { armEmpty, clear(X), on(X,Y) }
Add Effects : { clear(Y), holding(X) }
Del Effects : { armempty, on(X,Y) }
Stack(X,Y): place X directly on top of Y.
Preconditions: { holding(X), clear(Y) }
Add Effects : { armEmpty, on(X,Y) }
Del Effects : { holding(X), clear(Y) }

Tie-breaker: When actions are chosen non-deterministically, choose actions that lead to a plan. Throw away the actions that lead to deadends and 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.

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. A

    Pickup(C)

  2. B

    Pickup(G)

  3. C

    Stack(A,G)

  4. D

    Stack(G,E)

  5. E

    Unstack(C,A)

  6. F

    Unstack(E,B)

Show answer

Correct answer

  • B

    Pickup(G)

Question 25 of 25 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 16 Mar 2025, in the January 2025 term (IIT M DEGREE AN EXAM QDB2 16 Mar 2025). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  3. Q3SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  4. Q4SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  5. Q5SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  6. Q6SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  7. Q7SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  8. Q8SEARCH\ The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at gr…
  9. Q9TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  10. Q10TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  11. Q11TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  12. Q12TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  13. Q13TSP\ The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in asc…
  14. Q14GAMES\ The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon…
  15. Q15GAMES\ The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon…
  16. Q16GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  17. Q17GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  18. Q18GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  19. Q19GAMES: ALGORITHMS\ The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nod…
  20. Q20AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  21. Q21AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  22. Q22AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  23. Q23AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…
  24. Q24AUTOMATED PLANNING\ The domain description of a blocks-world with a single one-armed robot is provided below. Note: thi…