Iai 4
Iai 4
Key concepts:
*Transitions: These are the actions or operations that move the system
from one state to another. These can be physical movements (in robotics)
or logical actions (in puzzle-solving), depending on the nature of the
problem.
*State space: All possible states that can be reached using the given
actions from the initial state.
*Path (Plan): A sequence of actions that leads from the initial state to
the goal state.
Real-World examples:
*Puzzle solving: Problems like the 8-puzzle or Rubik’s cube are classic
examples where state space search is used to find the optimal sequence
of moves.
Step 1: Define the state search (identifying all possible states the system
can be in and the transitions between these states).
Step 2: Pick a search strategy (Uniformed search [Breadth First Search BFS
and Depth First Search DFS] and Informed search [A*]).
Step 3: Start the search (The search begins from the initial state).
Step 4: Extend the nodes (During the search, each node is expanded by
generating its successor states).
Ste 6: End the search (The search concludes when the goal state is
reached).
*Both are used to visualize the states and transitions between them, but
their use depends on the nature of the problem and whether or not
repeated states are expected.
*Search strategies dictate how the system navigates through the state
space to find the goal state.
*Two commonly used strategies are Breadth First Search (BFS) and Depth
First Search (DFS).
*It is a planning method in AI where we start from the initial state and
apply actions step by step to reach the goal state.
*It’s like moving forward in time; “If I do this, what will happen next?”.
How it works: