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 ad objects, this could result in a very substantial blowup in the number of action schemata. 7. _____________ algorithms is used to extract the plan directly form the planning graph, rather than using graph to provide heuristic.
A. BFS/DFS
B. A*
C. Graph-Plan
D. Greedy
Answer:A
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 ad objects, this could result in a very substantial blowup in the number of action schemata. 7. _____________ algorithms is used to extract the plan directly form the planning graph, rather than using graph to provide heuristic.
A. BFS/DFS B. A* C. Graph-Plan D. Greedy
Explanation: None. 8. Which algorithm place two actions into a plan without specifying which should come first?