In partial order plan.A. Relationships between the actions of the behavior are set prior to the actionsB. Relationships between the actions of the behavior are not set until absolutely necessaryChoose the correct option.

Either A or B can be true depending upon situation

What are you predicating by the logic: ?x: €y: loyalto(x, y).

Everyone is not loyal to someone

____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.

Hierarchical task network (HTN)

Explore topic-wise MCQs in Artificial Intelligence.

This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Artificial Intelligence knowledge and support exam preparation. Choose a topic below to get started.

1.	In partial order plan.A. Relationships between the actions of the behavior are set prior to the actionsB. Relationships between the actions of the behavior are not set until absolutely necessaryChoose the correct option.
A.	A is true
B.	B is true
C.	Either A or B can be true depending upon situation
D.	Neither A nor B is true
Answer» B. B is true

Discussion

2.	Planning graphs works only for prepositional planning problems.
A.	True
B.	False
Answer» B. False

Discussion

3.	One the main drawback of this type of planning system is that it requires a lot of computational powers at each node.
A.	True
B.	False
Answer» B. False

Discussion

4.	What are you predicating by the logic: ?x: €y: loyalto(x, y).
A.	Everyone is loyal to someone
B.	Everyone is loyal to all
C.	Everyone is not loyal to someone
D.	Everyone is loyal
Answer» B. Everyone is loyal to all

Discussion

5.	_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic.
A.	BFS/DFS
B.	A*
C.	Graph-Plan
D.	Greedy
Answer» D. Greedy

Discussion

6.	__________ algorithm translates a planning problem in to prepositional axioms.
A.	GraphPlan
B.	SatPlan
C.	Greedy
D.	None of the mentioned
Answer» C. Greedy

Discussion

7.	____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.
A.	GraphPlan
B.	Hierarchical task network (HTN)
C.	SatPlan
D.	None of the mentioned
Answer» C. SatPlan

Discussion

8.	Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow.
A.	True
B.	False
Answer» B. False

Discussion

9.	Planning problem can be described as a propositional logic.
A.	True
B.	False
Answer» B. False

Discussion

10.	A re planning agent uses execution monitoring and splices in repairs as needed.
A.	True
B.	False
Answer» B. False

Discussion

Explore topic-wise MCQs in Artificial Intelligence.

In partial order plan.A. Relationships between the actions of the behavior are set prior to the actionsB. Relationships between the actions of the behavior are not set until absolutely necessaryChoose the correct option.

Planning graphs works only for prepositional planning problems.

One the main drawback of this type of planning system is that it requires a lot of computational powers at each node.

What are you predicating by the logic: ?x: €y: loyalto(x, y).

_____________ algorithms is used to extract the plan directly from the planning graph, rather than using graph to provide heuristic.

__________ algorithm translates a planning problem in to prepositional axioms.

____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.

Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow.

Planning problem can be described as a propositional logic.

A re planning agent uses execution monitoring and splices in repairs as needed.