Scribd
Upload
32 views6 pages

Iai 4

Classical planning techniques in AI generate action sequences to transition from an initial state to a goal state using search algorithms and heuristics. State space search explores possible states to find solutions, with key concepts including states, actions, and transitions. Applications range from robotics and puzzle solving to automated planning and gaming.

Uploaded by

ssathvika2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
32 views6 pages

Iai 4

Classical planning techniques in AI generate action sequences to transition from an initial state to a goal state using search algorithms and heuristics. State space search explores possible states to find solutions, with key concepts including states, actions, and transitions. Applications range from robotics and puzzle solving to automated planning and gaming.

Uploaded by

ssathvika2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Classical planning techniques in AI:

*Classical planning techniques are used to generate sequences of actions


that transition from an initial state to a goal state in a deterministic
environment.

*These techniques rely on search algorithms, heuristics, and logical


representations to generate optimal plans.

State Space search in AI:

*State space search is a core technique in AI, enabling the exploration of


possible states to find solutions.

*The objective is to find a sequence of actions that transitions the system


from the initial state to the goal state, following a path through the state
space.

*Think of it like a maze: Each position is a state, each move is an Action,


you search from the initial state to the goal state.

Key concepts:

*State: A representation of the current situation or configuration of the


world.

Example: The robot in room A.

*Initial state: Where the search starts.

Example: Robot starts in room A.

*Goal state: The desired outcome the agent is trying to reach.

Example: Robot should reach room C.

*Actions(Operations ): Available choices that can change one state to


another.

Example: Move from room A to room B.

*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.

*Robotics: A robot navigating through a maze can be modelled as a state


space search problem, where each state represents the robot’s position,
and the transitions represent its movement from 1 point to another.
Steps in state space search:

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).

Step 5: Address state repetition (In large state spaces, it is common to


encounter repeated states).

Ste 6: End the search (The search concludes when the goal state is
reached).

State space representation:

*State space search problems can be represented in 2 main main forms:


Tree representations and graph representations.

*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 in state space search:

*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).

Applications of state space search:

*State space search is fundamental to many AI applications, where


problem-solving, planning and decision making are required.

*Robotics: In robotics, state space search is used for pathfinding and


navigation tasks.

*Automated planning: State space search plays a key role in automated


planning systems, which are used to determine sequences of actions that
will achieve specific goals.
*Gaming: In game AI, state space search is used to explore possible game
moves and strategies.

Planning with state space search:


Forward state space planning:

*Forward state space planning is also called as progression planning.

*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:

*Start with the initial state.

*Generate applicable actions (whose preconditions are satisfied in the


current state).

*Apply an action to generate a new state.


*Repeat this process to explore the state space.

*Stop when a state satisfies the goal conditions.

You might also like