Quiz Space

AI: Search Methods for Problem Solving · Quiz 2 · 3 Aug 2025 · May 2025 term

Question 21: AUTOMATED PLANNING\ The domain description of a Blocks W…

Question 21

+1 markOne or more correct options

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.

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 placed 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 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

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

Select all that apply.

  1. A

    Pickup(G)

  2. B

    Stack(E,M)

  3. C

    Stack(G,E)

  4. D

    Unstack(C,M)

  5. E

    Unstack(E,D)

Show answer

Correct answers

  • B

    Stack(E,M)

  • C

    Stack(G,E)

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

More questions from this paper

  1. Q1SEARCH\ Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, a…
  2. Q2SEARCH\ Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, a…
  3. Q3SEARCH\ Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, a…
  4. Q4SEARCH\ Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, a…
  5. Q5SEARCH\ Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, a…
  6. Q6SEARCH\ Figure shows an infinite state space with finite branching, where S is the start node and G is the goal node, a…
  7. Q7TSP\ The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.\ For each city the distances…
  8. Q8TSP\ The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.\ For each city the distances…
  9. Q9TSP\ The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.\ For each city the distances…
  10. Q10TSP\ The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.\ For each city the distances…
  11. Q11TSP\ The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.\ For each city the distances…
  12. Q12List the horizon nodes in the best strategy.\ Enter the node labels as a comma separated list in ASCENDING order.\ NO S…
  13. Q13List the horizon nodes pruned by Alpha-Beta algorithm.\ Enter the node labels as a comma separated list in ASCENDING or…
  14. Q14GAMES Based on the above data, answer the given subquestions
  15. Q15Solve the game tree using SSS algorithm. List the horizon nodes (not in the initial cluster) that are assigned SOLVED s…
  16. Q16Select the correct statements about the Alpha-Beta algorithm.
  17. Q17Select the condition that triggers an Alpha-Cut.
  18. Q18For a 2-ply game tree with branching factor 3, the number of strategies for MAX-player is .
  19. Q19AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Note: this i…
  20. Q20AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Note: this i…
  21. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Note: this i…
  22. Q23AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Note: this i…
  23. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Note: this i…
  24. Q25AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. Note: this i…