Questions and published explanations below are available without starting a test. Some questions may not have a published solution yet.
0 / 25 published solutions
Question 2 MCQ · 1.0 marks
**SEARCH**
Figure shows an infinite state space with finite branching, where S is the start node and G is the
goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle.
(Note: circular grid is shown by dashed lines which are not part of the state space.)
Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
**Tie-breaker:** use alphabetical order to break ties.
**Note:** sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions
Does the Breadth First Search find the path to the goal?
6406534432025.
Yes
6406534432026.
No
6406534432027.
Cannot be determined
A published solution is not available for this question yet.
**SEARCH**
Figure shows an infinite state space with finite branching, where S is the start node and G is the
goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle.
(Note: circular grid is shown by dashed lines which are not part of the state space.)
Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
**Tie-breaker:** use alphabetical order to break ties.
**Note:** sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions
Does the Best First Search find the path to the goal?
6406534432028.
Yes
6406534432029.
No
6406534432030.
Cannot be determined
A published solution is not available for this question yet.
**SEARCH**
Figure shows an infinite state space with finite branching, where S is the start node and G is the
goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle.
(Note: circular grid is shown by dashed lines which are not part of the state space.)
Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
**Tie-breaker:** use alphabetical order to break ties.
**Note:** sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions
Does the Branch and Bound algorithm find the path to the goal?
6406534432031.
Yes
6406534432032.
No
6406534432033.
Cannot be determined
A published solution is not available for this question yet.
**SEARCH**
Figure shows an infinite state space with finite branching, where S is the start node and G is the
goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle.
(Note: circular grid is shown by dashed lines which are not part of the state space.)
Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
**Tie-breaker:** use alphabetical order to break ties.
**Note:** sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions
6406534432034.
Yes
6406534432035.
No
6406534432036.
Cannot be determined
A published solution is not available for this question yet.
**SEARCH**
Figure shows an infinite state space with finite branching, where S is the start node and G is the
goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle.
(Note: circular grid is shown by dashed lines which are not part of the state space.)
Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
**Tie-breaker:** use alphabetical order to break ties.
**Note:** sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions
6406534432037.
Yes
6406534432038.
No
6406534432039.
Cannot be determined
A published solution is not available for this question yet.
**SEARCH**
Figure shows an infinite state space with finite branching, where S is the start node and G is the
goal node, and G is at the center of a unit circle, and the remaining nodes are on the unit circle.
(Note: circular grid is shown by dashed lines which are not part of the state space.)
Take the radial distance as the heuristic value:
h(G)=0; h(S)=1; and h(Ak)=1, for all k in {1, 2, . . .}.
MoveGen returns neighbours in alphabetical order (A1,A2,..., G,S).
**Tie-breaker:** use alphabetical order to break ties.
**Note:** sum(1, a, a^2, a^3, ..., a^(n-1)) is given by ((1 - a^n)/(1 - a)).
Based on the above data, answer the given subquestions
Is the heuristic admissible in the given state space?
6406534432040.
Yes
6406534432041.
No
6406534432042.
Cannot be determined
A published solution is not available for this question yet.
**TSP**
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.
The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.
**Attention:** A segment is a two-way edge between two cities. After adding/dropping a permanent
segment, infer as many new permanent segments as possible before computing the lower bound.
What is the lower bound on the cost of the tour as per the TSP BnB algorithm discussed in class?
Enter a natural number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 17
A published solution is not available for this question yet.
**TSP**
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.
The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.
**Attention:** A segment is a two-way edge between two cities. After adding/dropping a permanent
segment, infer as many new permanent segments as possible before computing the lower bound.
What is the first segment (XY) selected for refining S0?
Enter edge label XY
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: XY
A published solution is not available for this question yet.
**TSP**
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.
The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.
**Attention:** A segment is a two-way edge between two cities. After adding/dropping a permanent
segment, infer as many new permanent segments as possible before computing the lower bound.
A published solution is not available for this question yet.
**TSP**
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.
The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.
**Attention:** A segment is a two-way edge between two cities. After adding/dropping a permanent
segment, infer as many new permanent segments as possible before computing the lower bound.
How many tours are represented in the node rs?
Enter a natural number.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42
A published solution is not available for this question yet.
**TSP**
The distance matrix for 5 cities (A to E) and the sorted edge list is provided below.
For each city the distances to other cities are listed in ascending order.
For example, in row one, the distance from A to B is 30, A to C is 32 and so on.
The search tree traversed by TSP BnB shows four segments.
Identify the four segments xy, uv, rs, pq and then answer the given sub-questions.
**Attention:** A segment is a two-way edge between two cities. After adding/dropping a permanent
segment, infer as many new permanent segments as possible before computing the lower bound.
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions
List the horizon nodes in the best strategy.
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z
A published solution is not available for this question yet.
Based on the above data, answer the given subquestions
List the horizon nodes pruned by Alpha-Beta algorithm.
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: X,Y,Z
A published solution is not available for this question yet.
**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.
**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
What is the length of the optimal plan? Enter the number of actions in the optimal plan.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Answer format: 42
A published solution is not available for this question yet.
**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.
**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 **applicable** actions for the given planning problem?
6406534432067.
Pickup(D)
6406534432068.
Pickup(G)
6406534432069.
Pickup(M)
6406534432070.
Unstack(C,M)
6406534432071.
Unstack(E,D)
A published solution is not available for this question yet.
**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.
**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?
6406534432072.
Pickup(G)
6406534432073.
Stack(E,M)
6406534432074.
Stack(G,E)
6406534432075.
Unstack(C,M)
6406534432076.
Unstack(E,D)
A published solution is not available for this question yet.
**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.
**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 can be pushed as the first three elements onto the stack by the Goal Stack
Planning algorithm? In the representation below the stack has a bottom on the right marked by
the entry END. Use appropriate tie-breakers listed in the main data.
6406534432077.
{ on(E,M), on(G,E) }; on(E,M); on(G,E); END
6406534432078.
{ on(E,M), on(G,E) }; on(G,E); on(E,M); END
6406534432079.
on(G,E); on(E,M); { on(E,M), on(G,E) }; END
6406534432080.
on(E,M); on(G,E); { on(E,M), on(G,E) }; END
A published solution is not available for this question yet.
**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.
**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
For the subgoal ordering given in the goal description (and using the given tie breaking rules),
which of the following is the first action popped out of the stack in Goal Stack Planning?
6406534432081.
Pickup(G)
6406534432082.
Stack(G,E)
6406534432083.
Unstack(E,D)
6406534432084.
Unstack(C,M)
A published solution is not available for this question yet.
**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.
**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
For the subgoal ordering given in the goal description (and using the given tie breaking rules),
does the Goal Stack Planning algorithm find an optimal plan?
6406534432085.
Yes
6406534432086.
No
6406534432087.
Cannot be determined
A published solution is not available for this question yet.
**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.
**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
If the subgoals in the goal description are swapped places then does the Goal Stack Planning
algorithm find an optimal plan?
6406534432088.
Yes
6406534432089.
No
6406534432090.
Cannot be determined
**PDSA**
**Section Id :** 64065394330
**Section Number :** 2
**Section type :** Online
**Mandatory or Optional :** Mandatory
**Number of Questions :** 17
**Number of Questions to be attempted :** 17
**Section Marks :** 50
**Display Number Panel :** Yes
**Section Negative Marks :** 0
**Group All Questions :** No
**Enable Mark as Answered Mark for Review and**
No
**Clear Response :**
**Section Maximum Duration :** 0
**Section Minimum Duration :** 0
**Section Time In :** Minutes
**Maximum Instruction Time :** 0
A published solution is not available for this question yet.
