Question 21 : What are present in each level of planning graph?
1. Literals
2. Actions
3. Variables
4. Both Literals & Actions
View Answer   Discuss with Members

Question 22 : What is the starting level of planning graph?
1. Level 3
2. Level 2
3. Level 1
4. Level 0
View Answer   Discuss with Members

Question 23 : What are present in the planning graph?
1. Sequence of levels
2. Literals
3. Variables
4. Heuristic estimates
View Answer   Discuss with Members

Question 24 : Which is used to extract solution directly from the planning graph?
1. Planning algorithm
2. Graphplan
3. Hill-climbing search
4. All of the mentioned
View Answer   Discuss with Members

Question 25 : Which data structure is used to give better heuristic estimates?
1. Forwards state-space
2. Backward state-space
3. Planning graph algorithm
4. None of the mentioned
View Answer   Discuss with Members

Question 26 : Which can be adapted for planning algorithm?
1. Most-constrained variable
2. Most-constrained literal
3. constrained
4. None of the mentioned
View Answer   Discuss with Members

Question 27 : What are not present in finish actions?
1. Preconditions
2. Effect
3. Finish
4. None of the mentioned
View Answer   Discuss with Members

Question 28 : What are not present in start actions?
1. Preconditions
2. Effect
3. Finish
4. None of the mentioned
View Answer   Discuss with Members

Question 29 : What is the other name of each and every total-order plans?
1. Polarization
2. Linearization
3. Solarization
4. None of the mentioned
View Answer   Discuss with Members

Question 30 : How many possible plans are available in partial-order solution?
1. 3
2. 4
3. 5
4. 6
View Answer   Discuss with Members