Home » mcq » Artificial intelligence » __________ algorithm translates a planning problem in to prepositional axioms. A. GraphPlan B. SatPlan C. Greedy D. None of the mentioned
GraphPlan
SatPlan
Greedy
None of the mentioned
Answer is Wrong!
Answer is Right!
The correct answer is A. GraphPlan.
GraphPlan is a planning algorithm that translates a planning problem into a propositional calculus problem. It then uses a SAT solver to find a solution to the propositional calculus problem, which is a solution to the planning problem.
SatPlan
41.5 48.3 47.8C117.2 448 288 448 288 448s170.8 0 213.4-11.5c23.5-6.3 42-24.2 48.3-47.8 11.4-42.9 11.4-132.3 11.4-132.3s0-89.4-11.4-132.3zm-317.5 213.5V175.2l142.7 81.2-142.7 81.2z"/>
Subscribe on YouTube
is a complete algorithm, which means that it will always find a solution to a planning problem if one exists. However, it can be slow, especially for large planning problems.
Greedy is a heuristic algorithm that does not guarantee to find a solution to a planning problem. However, it is often much faster than GraphPlan.
None of the mentioned is not a correct answer.