Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 4 Aug 2024 · May 2024 term

Question 22: The domain description of a blocks-world with a single o…

Question 22

+1 markOne or more correct options

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.

PREDICATES

text
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

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

Which of the following are relevant actions for the goal description in the given planning problem?

Select all that apply.

  1. A

    Pickup(B)

  2. B

    Pickup(C)

  3. C

    Putdown(B)

  4. D

    Stack(A,B)

  5. E

    Stack(C,A)

  6. F

    Unstack(C,A)

Show answer

Correct answers

  • C

    Putdown(B)

  • D

    Stack(A,B)

  • E

    Stack(C,A)

Video solution

The video solution to this question is being recorded and will play here. Until then, the answer key is above.

Question 22 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) Quiz 2 paper sat on 4 Aug 2024, in the May 2024 term (IIT M DEGREE AN EXAM QDB2 4 Aug 2024). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  3. Q3The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  4. Q4The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  5. Q5The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  6. Q6The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  7. Q7The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  8. Q8The figure shows a map with several locations on a grid where each tile is 1x1 in size. The locations are at grid point…
  9. Q9The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  10. Q10The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  11. Q11The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  12. Q12The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  13. Q13The distance matrix for 6 cities are provided below. For each city the distances to other cities are listed in ascendin…
  14. Q14The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon nodes …
  15. Q15The figure shows a game tree with evaluations W (win), D (draw) and L (loss) from Max's perspective. The horizon nodes …
  16. Q16The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (num…
  17. Q17The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (num…
  18. Q18The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (num…
  19. Q19The figure shows a game tree with evaluations at the horizon from Max's perspective. The horizon nodes carry evals (num…
  20. Q20The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  21. Q21The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  22. Q23The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  23. Q24The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  24. Q25The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…
  25. Q26The domain description of a blocks-world with a single one-armed robot is provided below. Note: this is the same domain…