Explanation: The most-constraint variable heuristic from CSPs can be adapted for planning algorithm and seems to work well. 5. ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.
A. GraphPlan
B. Hierarchical task network (HTN)
C. SatPlan
D. None of the mentioned
Answer:A
Explanation: The most-constraint variable heuristic from CSPs can be adapted for planning algorithm and seems to work well. 5. ____________ planning allows the agent to take advice from the domain designer in the form of decomposition rules.
A. GraphPlan B. Hierarchical task network (HTN) C. SatPlan D. None of the mentioned
Explanation: None. 6. Standard planning algorithms assumes environment to be