Quiz Space

AI: Search Methods for Problem Solving · End Term · 28 Apr 2024 · January 2024 term

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

Question 23

+1 markOne or more correct options

AUTOMATED PLANNING
The domain description of a Blocks World with a single one-armed robot is given below. This is the same domain used in the assignments.

In the planning graph, which of the following are mutex action pairs in Layer 1?

Select all that apply.

  1. A
  2. B
  3. C
  4. D
  5. E
Show answer

Correct answers

  • B
  • D
See the whole paperTake it as a mock test

Question 23 of 26 in the IIT Madras BS AI: Search Methods for Problem Solving (AI Search Methods) End Term paper sat on 28 Apr 2024, in the January 2024 term (IIT M DEGREE FN EXAM QDB1 28 Apr 2024). It carries 1 mark.

More questions from this paper

  1. Q1Figure question
  2. Q2What is the path found by the Best First Search algorithm? Enter the path as a comma separated list of node labels.\ NO…
  3. Q3What is the path found by A search algorithm? Enter the path as a comma separated list of node labels.\ NO SPACES, TABS…
  4. Q4What is the path found by Branch-and-Bound search algorithm? Enter the path as a comma separated list of node labels.\ …
  5. Q5For the given map, which algorithm finds the shortest path from S to G?
  6. Q6What can you say about the heuristic function for the given graph?
  7. Q7TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  8. Q8TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  9. Q9TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  10. Q10TSP Branch-and-Bound\ The TSP Branch-and-Bound algorithm is solving a TSP instance where the cities are A, B, C, .... a…
  11. Q11GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  12. Q12GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  13. Q13GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  14. Q14GAMES\ The figure shows a game tree with evaluation function values at the leaf nodes.\ The leaf nodes are labeled from…
  15. Q15PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  16. Q16PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  17. Q17PROBLEM DECOMPOSITION\ The figure shows an AND-OR graph that depicts how a problem S can be decomposed into one or more…
  18. Q18RULE BASED EXPERT SYSTEMS\ A Rete Net for classifying lenses based on surface properties (convex, concave, planar, radi…
  19. Q19RULE BASED EXPERT SYSTEMS\ A Rete Net for classifying lenses based on surface properties (convex, concave, planar, radi…
  20. Q20RULE BASED EXPERT SYSTEMS\ A Rete Net for classifying lenses based on surface properties (convex, concave, planar, radi…
  21. Q21AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. This is the …
  22. Q22AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. This is the …
  23. Q24AUTOMATED PLANNING\ The domain description of a Blocks World with a single one-armed robot is given below. This is the …
  24. Q25CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…
  25. Q26CONSTRAINT SATISFACTION\ The set of junctions (L, W, Y and T type junctions) that occur in a 2D line drawing of trihedr…