# mcq-AI Planning and Acting in the Real World

Posted by

The "Answers" given with the Question is "not verified". To view Verified answers click on the button below.

Planning and Acting in the Real World

1. The process by which the brain orders actions needed to complete a specific task is referred as ____________
a) Planning problem
b) Partial order planning
c) Total order planning
d) Both Planning problem & Partial order planning
Explanation: None.

2. The famous spare tire problem or Scheduling classes for bunch of students or Air cargo transport are the best example of ____________
a) Planning problem
b) Partial Order planning problem
c) Total order planning
d) None of the mentioned
Explanation: None.

3. To eliminate the inaccuracy problem in planning problem or partial order planning problem we can use ___________________ data structure/s.
a) Stacks
b) Queue
c) BST (Binary Search Tree)
d) Planning Graphs
Explanation: A planning graph can be used to give better heuristic estimates.

4. Planning graphs consists of ____________
a) a sequence of levels
b) a sequence of levels which corresponds to time steps in the plan
c) a sequence of actions which corresponds to the state of the system
d) none of the mentioned
Explanation: Planning graphs is a sequence of levels, which corresponds to time steps in the plan where level 0 is the initial state at start.

5. Planning graphs works only for prepositional planning problems.
a) True
b) False
Explanation: Planning graphs work only for propositional planning problems-ones with no variables. Both STRIPS and ADL representations can be propositionalized. For problems with large numbers and objects, this could result in a very substantial blowup in the number of action schemata.

6. _____________ 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
Explanation: None.

7. Planning problem can be described as a propositional logic.
a) True
b) False
Explanation: Yes, The approach we take is based on testing the satisfiability of a logical sentence rather than on proving a theorem. We will be finding models of propositional sentences that look like this: Initial state /\ all possible action descriptions /\ goal.

8. What is the other name of each plan resulted in partial order planning?
a) Polarization
b) Linearization
c) Solarization
d) None of the mentioned
Explanation: Each and every total order plan is also called as linearization of the partial-order plan.

9. What are the two major aspects which combines AI Planning problem?
a) Search & Logic
b) Logic & Knowledge Based Systems
c) FOL & Logic
d) Knowledge Based Systems
Explanation: None.

10. __________ algorithm translates a planning problem in to prepositional axioms.
a) GraphPlan
b) SatPlan
c) Greedy
d) None of the mentioned
Explanation: The SATPLAN algorithm translates a planning problem into propositional axioms and applies a satisfiability algorithm to find a model that corresponds a valid plan.

11. ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.
a) GraphPlan
c) SatPlan
d) None of the mentioned
Explanation: None.

12. Standard planning algorithms assumes environment to be ___________
a) Deterministic
b) Fully observable
c) Single agent
d) Stochastic
Explanation: It assumes complete and correct information, deterministic and fully-observable environment, which many domains violates.

13. Conditional Plans allows the agent to sense the world during execution to decide what branch of plan to follow.
a) True
b) False
Explanation: Conditional plans do exists in real world planning problems. Incomplete information can be dealt by planning to use sensing actions to obtain the information needed.

14. A re-planning agent uses execution monitoring and splices in repairs as needed.
a) True
b) False