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
Answer:A
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. Which of the following search belongs to totally ordered plan search?