[amp_mcq option1=”Planning algorithm” option2=”Graphplan” option3=”Hill-climbing search” option4=”All of the mentioned” correct=”option1″]
The correct answer is: A. Planning algorithm
A planning algorithm is a computer program that takes as input a description of a problem and produces a plan that solves the problem. The plan is a sequence of actions that, if executed, will achieve the desired goal.
Graphplan is a planning algorithm that uses a planning graph to represent the problem. The planning graph is a directed graph that contains nodes for states and edges for actions. The goal state is represented by a node in the graph, and the initial state is represented by another node in the graph. The edges in the graph represent actions that can be taken to transition from one state to another.
Hill-climbing search is a search algorithm that starts at a given state and repeatedly moves to a neighboring state that is better than the current state. The search continues until a goal state is reached or until no better state can be found.
Hill-climbing search is not a planning algorithm because it does not take into account the goals of the problem. It simply moves to a neighboring state that is better than the current state, without considering whether the neighboring state is closer to the goal state.
Therefore, the correct answer is: A. Planning algorithm