Problem Solving Agents
AI
By: Janavi Pattar
Problem-solving agent
A kind of goal-based agent – Choose their actions in order to achieve
Goals.
This Allows the Agent to a way of Choosing among Multiple Possibilities,
selecting the one which reaches a Goal states.
It Requires Searching and Planning Techniques. E.g., GPS – Finding a path
to certain Destination.
It solves problem by,
finding sequences of actions that lead to desirable states (goals)
To solve a problem,
the first step is the goal formulation, based on the current situation
Problem Solving Agents :
• Intelligent Agent are Supposed to “ To Maximize their Performance
Measure ”
Achievement : It can Adopt a Goal and Aim at Satisfying
Steps performed by problem solving
agent
1. Goal Formation
It is the first and simplest step in problem-solving, it organizes the
steps/sequence required to formulate one of the multiple goals
2. Problem Formulation
It is the most important step of problem-solving which decides what
actions should be taken to achieve the formulated goal.
Initial State: it is the starting state of the agent towards its goal. (1 2 3,b 4
6,7 5 7)
Actions: It is the possible actions available to the agent. (Left, Right, Up,
Down)
Goal Test: It determines if the given state is a goal state (1 2 3, 4 5 6,7 8 b)
Path Cost: it assigns a numeric cost to each path that follows the goal.
Cost 1 per action
3. Search Solution
It identifies all the best possible sequence of actions to reach the goal
state from the current state
4. Execution
It executes the best optimal solution from the searching algorithms to
reach the goal state from the current stat.
An optimum solution has the lowest past cost among all the solutions.
Well-defined problems and solutions
A problem is defined by 5 components:
Initial state
Actions
Transition model or (Successor functions)
Goal Test.
Path Cost.
Well-defined problems and solutions
The initial state
that the agent starts in
The set of possible action
Transition model: description of what each action does. (successor functions):
refer to any state reachable from given state by a single action
Initial state, actions and Transition model define the state space
the set of all states reachable from the initial state by any sequence of actions.
A path in the state space:
any sequence of states connected by a sequence of actions.
Well-defined problems and solutions
The goal test
Applied to the current state to test
if the agent is in its goal
Sometimes there is an explicit set of possible goal states. (example: in Amman).
Sometimes the goal is described by the properties
instead of stating explicitly the set of states
Example: Chess
the agent wins if it can capture the KING of the opponent on next move ( checkmate).
no matter what the opponent does
Well-defined problems and solutions
A Path Cost function,
assigns a numeric cost to each path
= performance measure
denoted by g
to distinguish the best path from others
Usually, the path cost is the sum of the step costs of the individual actions (in the action
list)
Formulating problem
Abstraction
the process to take out the irrelevant information
leave the most essential parts to the description of the states ( Remove detail
from representation)
Conclusion: Only the most important parts that are contributing to searching are
used
Any
Questions?
Thank
You