In artificial intelligence and computer programming, state space planning is a process used in designing programs to search for data or solutions to problems.
The universe of possible solutions to be searched is called the state space.
These are search algorithms in which the search space is a subset of the state space: Each node corresponds to a state of the world, each arc corresponds to a state transition, and the current plan corresponds to the current path in the search space.
This is a choice which generally depends on the nature of the problem.
Forward search is an algorithm that searches forward from the initial state of the world to try to find a state that satisfies the goal formula.