………..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
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.
What is the other name of each plan resulted
in partial order planning?
a) Polarization
b) Linearization
c) Solarization
d) None of these
Explanation: Each and every total order plan is also called as linearization of the partial-order plan.
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
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
…………algorithm translates a planning problem in to prepositional axioms.
a) GraphPlan
b) SatPlan
c) Greedy
d) None of these
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.
