1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 11 - Week 8

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

[email protected] 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Artificial Intelligence Search Methods For Problem Solving (course)

Announcements (announcements) About the Course (preview) Ask a Question (forum) Progress (student/home) Mentor (student/mentor)

Unit 11 - Week 8

Course outline

How does an NPTEL online

Assignment 8
course work? The due date for submitting this assignment has passed. Due on 2020-11-11, 23:59 IST.
As per our records you have not submitted this assignment.
Pre-requisite Assignment
1) Which of the following need to be specified while formulating a planning problem? 1 point
Week 0
A set of propositions or predicates to define a state of the world

Week 1 A set of operators or actions to generate successor states of a given state

Goal conditions to be achieved
Week 2 Complete description of the initial state
Either goal conditions or an initial state, but not both.
Week 3
No, the answer is incorrect.
Score: 0
Week 4 Accepted Answers:
A set of propositions or predicates to define a state of the world
Week 5 A set of operators or actions to generate successor states of a given state
Goal conditions to be achieved
Week 6 Complete description of the initial state

2) In the Blocks World domain, actions are 1 point

Week 7
Deterministic
Week 8
Stochastic
Automated Domain Instantaneous
Independent Planning (unit? Durative
unit=45&lesson=180)
No, the answer is incorrect.
The Blocks World Domain Score: 0
(unit?unit=45&lesson=181) Accepted Answers:
Deterministic
State Space Planning:
Instantaneous
Forward and Backward (unit?
unit=45&lesson=182) 3) In the Blocks World domain, as discussed in the lectures, the domain is 1 point
Goal Stack Planning (GSP)
(unit?unit=45&lesson=183)
Static
Multi-agent
GSP: A Detailed Example
(unit?unit=45&lesson=184) Finite
Completely observable
Plan Space Planning (PSP)
(unit?unit=45&lesson=185) Dynamic

PSP: A Tiny Example (unit?

No, the answer is incorrect.
Score: 0
unit=45&lesson=186)
Accepted Answers:
Multi-Armed Robots (unit? Static
unit=45&lesson=187) Finite
Completely observable
Week 8 Feedback : Artificial
Intelligence Search Methods 4) Which of the following statements is/are true about State Space planning? 1 point
for problem Solving (unit?
unit=45&lesson=49) Forward Search Space Planning has a lower branching factor than Backward Search Space Planning
Quiz : Assignment 8 Forward Search Space Planning starts from an Initial state description whereas Backward Search Space Planning starts from the Goal conditions
(assessment?name=207) Forward Search Space Planning explores the state space with the help of applicable actions whereas Backward Search Space Planning explores the
Lecture materials (unit? state space with the help of relevant actions
unit=45&lesson=208) Forward Search Space Planning may return an invalid plan but Backward Search Space Planning always returns a valid plan
Progression is closed over the state space but regression is not closed over the state space
Week 9
No, the answer is incorrect.
Score: 0
Week 10
Accepted Answers:

Week 11

https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=45&assessment=207 1/6
 1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 11 - Week 8

Forward Search Space Planning starts from an Initial state description whereas Backward Search Space
Week 12 Planning starts from the Goal conditions
Forward Search Space Planning explores the state space with the help of applicable actions whereas
DOWNLOAD VIDEOS Backward Search Space Planning explores the state space with the help of relevant actions
Progression is closed over the state space but regression is not closed over the state space

5) Which of the following statements is/are true about Goal Stack Planning? 1 point

It suffers from the curse of high branching factor

It constructs plans in a forward manner
It searches in a goal-directed backward manner
It solves one subgoal completely before attempting another subgoal
It terminates as soon as the last unit subgoal in the stack is solved
It always generates linear plans.
No, the answer is incorrect.
Score: 0
Accepted Answers:
It constructs plans in a forward manner
It searches in a goal-directed backward manner
It solves one subgoal completely before attempting another subgoal
It always generates linear plans.

BEGIN GROUP

A set of grounded-actions and grounded-predicates are listed here. Each item in the list is identified by a unique item number, use the item number in your
answer.

The figure describes a planning problem whose start state and goal states conditions are:

Start: armEmpty Λ on(A,B) Λ on(B,C) Λ onTable(C) Λ clear(A)

Goal: onTable(A) Λ onTable(B) Λ onTable(C)

Note: the start state is represented by the sequence 21,24,29,33,36 (item numbers are in ascending order) and the goal state is represented by 27,28,29.

Now, answer the planning questions based on this information. Wherever applicable, your answer must be a list of comma separated item numbers, and
DO NOT enter any characters other than digits and comma. When more than one action or predicate is applicable then ALWAYS choose the one that has

https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=45&assessment=207 2/6
1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 11 - Week 8

a smaller index, i.e., choose the one that occurs EARLIER in the list --- the questions below are specific to this order of tie breaking

6) What is the optimal plan for the problem? Your answer must be a comma separated list of item numbers

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 13,10,16,11
(Type: String) 13, 10, 16, 11

1 point

7) Is the optimal plan unique? 1 point

Yes
No
No, the answer is incorrect.
Score: 0
Accepted Answers:
Yes

8) Enter the list of applicable actions in the Initial state.

Your answer must be a comma separated list of item numbers in the ascending order.

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 13

1 point

9) What are the first five actions selected by Forward State Space Planning and added to the plan? Remember the TIE-BREAKING policy. Your answer
must be a comma separated list of item numbers.

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 13,1,13,1,13
(Type: String) 13, 1, 13, 1, 13

1 point

10) Does Forward State Space Planning eventually find the optimal plan? 1 point

Yes
No
No, the answer is incorrect.
Score: 0
Accepted Answers:
No

11) Enter the list of relevant actions with respect to the goal conditions? Your answer must be a comma separated list of item numbers in the ascending order

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 10,11,12
(Type: String) 10, 11, 12

1 point

12) Let us add the conditions : {clear(A) Λ clear(B) Λ clear(C)} to the given set of goal conditions. Now the new goal (just for this question) becomes
Goal: onTable(A) Λ onTable(B) Λ onTable(C) Λ clear(A) Λ clear(B) Λ clear(C)

Does the list of relevant actions change? Enter the list of relevant actions with respect to the goal conditions?

Your answer must be a comma separated list of item numbers in the ascending order

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 10,11,12,13,14,15,16,17,18
(Type: String) 10, 11, 12, 13, 14, 15, 16, 17, 18

1 point

13) What would be the first action selected by Backward State Space Planning for the original goal G: onTable(A) Λ onTable(B) Λ onTable(C)? Remember
the TIE-BREAKING policy.

Your answer must be a natural number.

https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=45&assessment=207 3/6
1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 11 - Week 8

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: Numeric) 10

1 point

14) After choosing the action (the answer to the above question), BSSP regresses the goal G to a new goal G’. Enter the list of predicates that are present in
G’.

Your answer must be a comma separated list of item numbers in the ascending order.

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 28, 29, 30
(Type: String) 28,29,30

1 point

15) What are the first five unit predicates pushed on the stack by Goal Stack Planning? Ignore the goal conjuncts pushed onto the stack.

Your answer must be a comma separated list of item numbers

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 27, 28, 29, 31, 28
(Type: String) 27,28,29,31,28

1 point

16) What are the first five unit predicates popped from the stack by Goal Stack Planning? Ignore the goal conjuncts pushed to the stack.

Your answer must be a comma separated list of item numbers

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 29,28,31,36,34
(Type: String) 29, 28, 31, 36, 34

1 point

17) What are the first two actions pushed to the stack by Goal Stack Planning?

Your answer must be a comma separated list of item numbers.

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 11,8
(Type: String) 11, 8

1 point

END GROUP

18) Suppose we are working with three blocks A, B and C in the Blocks World domain. Which of the following could be a valid goal description? 1 point

on(A,B) Λ holding(C) Λ clear(B)

clear(A) Λ clear(B) Λ clear(C)
on(A,B) Λ on(A,C) Λ clear(A)
on(A,B) Λ clear(A) Λ Pickup(C)
on(A,B) Λ holding(C)
on(A,B) Λ clear(C)
No, the answer is incorrect.
Score: 0
Accepted Answers:
clear(A) Λ clear(B) Λ clear(C)
on(A,B) Λ holding(C)
on(A,B) Λ clear(C)

19) Which of the following can be constituents of a partial plan ? 1 point

Initial state description

Goal state description

https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=45&assessment=207 4/6
1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 11 - Week 8

Partially instantiated actions

Ordering and causal links that together impose an ordering on the actions
Binding constraints on variable assignments.
No, the answer is incorrect.
Score: 0
Accepted Answers:
Partially instantiated actions
Ordering and causal links that together impose an ordering on the actions
Binding constraints on variable assignments.

20) Which of the following statements is/are true about Plan Space Planning ? 1 point

It searches in the space of partial plans.

The search begins with an empty plan that stands for all possible plans for a given problem
The initial plan constitutes exactly two actions and no binding constraints
The initial plan has no open goals
The initial plan has no threats
It finds a solution plan only when the subgoals are serializable
No, the answer is incorrect.
Score: 0
Accepted Answers:
It searches in the space of partial plans.
The search begins with an empty plan that stands for all possible plans for a given problem
The initial plan constitutes exactly two actions and no binding constraints
The initial plan has no threats

21) Consider the partial order plan, where A1, A2, A3 and A4 are actions, illustrated in the figure below

What will be the makespan of the above plan in the following cases: (i) one arm robot, (ii) two arm robot and (iii) four arm robot

Your answer should be a list of 3 natural numbers separated by commas.

Enter 1,2,3 if makespans for the cases (i),(ii) and (iii) are 1, 2 and 3, respectively

No, the answer is incorrect.

Score: 0
Accepted Answers:
(Type: String) 4,2,2
(Type: String) 4, 2, 2

1 point

https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=45&assessment=207 5/6
1/23/2021 Artificial Intelligence Search Methods For Problem Solving - - Unit 11 - Week 8

https://onlinecourses.nptel.ac.in/noc20_cs81/unit?unit=45&assessment=207 6/6