What is Intelligence composed

of?

Learning Intelligence Reasoning

Linguistic
Problem
Perception Intelligence
Solving
Reasoning

• Judgement

• Making Decisions

• Prediction
Learning

• Gaining Knowledge
Perception

• Acquiring

• Interpreting

• Selecting

• Organizing sensor information

Problem Solving

• Working through details of a problem to reach

solution
Linguistic Intelligence

• Comprehend speak and write the verbal & written

languages.

• It is important in interpersonal communication.

Agents in AI
Agents

• AI system can be defined as study of rational agents

and its environment.

• Agents sense the environments through sensors and

it’s act on their environment through
actuators(device).
Agents

• AI agent can have mental properties like

knowledge, belief, intention etc.,
What is Agent?

• Agent can be anything that perceive environment

through sensors and act upon that environment
through actuators
Types of Agent

• Human Agent

• Robotic Agent

• Software Agent
Human Agent
• Eyes, ears and other organs which works for
sensors, hands and legs works for actuators.
Robotic Agent
• Cameras, IR range finder, Various motors for
actuators.
S/W Agent
• Key strokes
Sensors
•It is a device which detects the change
in the environment and sends the
information to other electronic device.
•An agent observes the environment
through sensors only.
Actuators
• It is a component of machine that converts
energy into motion.
• It is only responsible for moving and controlling
the system.
Effectors
• It is a device which affects the environment.
• It can be legs, wings, arms, fingers etc.,
Sensors

Percepts
Environment Agent
Action
Types of Agents

• Agents can be grouped into five classes based on their degree of

perceived intelligence and capacity.

• Simple reflex agent

• Model based reflex agent

• Goal based agents

• Utility based agent

• Learning agent
Simple Reflex Agent [condition-action
rule]
• This agent works only on the basis of current
perception and it does not bother about the
previous state in which the system was.
• This type of agent is based upon the condition
action rule.
Example

• If the condition is true, action is taken else not.

• In ATM agent system if PIN matches with given
account number then customer gets money.
Problems faced:
• Very limited intelligence.

• No knowledge about the non-perceptual parts of

the state.
• Operating in a partially observable environment,
infinite loops are unavoidable.
Model based reflex agents:
• It works by finding a rule whose condition matches
the current situation.
• It can handle partially observable environments.
• Updating the state requires information about
• How the world evolves independently from the
agent and
• How the agent actions affect the world.
Model based reflex agents:
Example:
• A car driving agent which maintains its own
internal state and then take action as environment
appears to it.
Goal based agents:
• The goal based agent works simply towards to
achieving the goal.
• For tricky goals it needs searching and planning.
• They are dynamic in nature.
• We can quickly change goal based agent’s
behaviour for new/unknown goal.
• Eg : Agent searching a solution for 8-queen puzzle.
Utility based agents:
• These agents are similar to the goal based agent but provide an extra
component of utility measurement which makes them different by
providing a measure of success at a given state.
• It act based not only goals but also the best way to achieve the goal.
• It is useful where when there are multiple possible alternatives, and
an agent has to choose.
• Eg : Military planning robot which provides certain plan of action to
be taken. It’s environment is too complex, and expected performance
is also high.
Learning agent:
• It can learn from its past experience on it has a
learning capabilities.
• It starts to act with basic knowledge and then
able to act and adapt automatically through
learning.
• A learning agent has mainly four conceptual
components, which are
Learning Element
• It is responsible for making improvements by
learning from environment.
Critic
• Learning elements takes feedback from critic
which describes that how well the agent is doing
with respect to a fixed performance standard.
Performance Element
• It is responsible for selecting external action.
Problem Generator
• The component is responsible for suggesting
actions that will lead to new and informative
experiences.

Eg: Aeroplane driving agent which continuously

learns from environment and then do safe plane
driving.
Agents Environment in AI
• An environment is everything in the world which
surrounds the agent, but it is not a part of an
agent itself.
• An environment can be described as a situation
in which an agent is present.
• Features of Environment:
• An environment can have various features from
the point of view of an agent.
 Fully Observable Vs Partially Observable
• If an agent sensor can sense the complete state of an
environment at each point of time then it is a fully
observable environment.

• Else it is a partially observable.

 Deterministic Vs Stochastic

Deterministic Stochastic

If an agents current state and A stochastic environment is

random in nature and cannot be
selected action can completely determined completely by an
determine the next state of agent.
environment, then such
environment is called
deterministic.
 Episodic Vs Sequential

Episodic Sequential

In episodic environment, there is In sequential, an agent requires

many of past actions, to
a series of one slot actions and determine the next best actions.
only the current percept is
required for the action.
 Single Vs Multi Agent

Single Multi agent

Only one agent is involved in an If multiple agents are operating in

an environment, then such an
environment and operating by environment is called a multi
itself, then such an environment agent.
is called single agent.
 Static Vs Dynamic

• If environment can change itself while an agent

is deliberating then such such environment is
called dynamic.
• Else it is static
Problem Solving

• Problem solving in games such as “sudoku”. It can

be done by building an AI system to solve that
particular problem.
• To do, this one needs to define the problem
statement first and then generating the solution
by keeping the condition in mind.
Problem Solving

• Chess, sudoku, Tower of Hanoi problem,

Travelling salesman problem, Water jug
problem, N-Queen problem.
Problem Searching

• In general searching is finding.

• Searching is the most commonly used technique

of problem solving in AI.
The process of solving a problem consists of five
steps:

• Define the problem

• Analyse the problem

• Identification of Solution

• Choosing the solution

• Implementation
Properties of search algorithm

• The essential properties of search algorithm to

complete the efficiency of these algorithms.

1. Completeness: A search algorithm is said to be

complete if guarantee to return a solution if at
least any solution exist for any random i/p.
Properties of search algorithm

2. Optimality: If a solution found for an algorithm

is guaranteed to be the best solution(lowest path
cost) among all other solution, then such solution
for is said to be optimal solution.
Properties of search algorithm

3. Time Complexity: Time complexity is a measure

of time for an algorithm to complete its task.

4. Space Complexity: It is the maximum storage

required at any point during the search, as the
complexity of the problem.
Types of search algorithm

Based on the search problems we can classify the

search algorithm into two types,
• Uninformed Search [Blind Search]

• Informed Search [Heuristic Search]

Uninformed Search [Blind Search]
• Breadth First Search

• Uniform Cost Search

• Depth First Search

• Depth Limited Search

• Iterative Deeping Depth First Search

• Bidirectional Search
Informed Search [Heuristic Search]
• Best First Search

• A* Search

• AO* Search

• Problem Reduction

• Hill Climbing
Informed Search [Heuristic Search]
• Best First Search

• A* Search

• AO* Search

• Problem Reduction

• Hill Climbing
Uninformed Search [Blind Search] / Brute Force Way
• The uniformed search does not contain any domain knowledge such as
closeness, the location of the goal.
• It operates in a brute force way, as it only includes information about
how to traverse the tree and how to identify leaf and goal nodes.
• Uninformed search applies a way in which search tree is searched
without any information about the search space like initial state
operators and test for the goal. So, it is called blind search. It examines
each node until it achieves the goal node.
Informed Search [Heuristic Search]
• It uses domain knowledge, the problem information
is available which can guide the search.
• Informed search strategies can find a solution more
efficient than an uninformed. Informed search is
also called as Heuristic Search.
Informed Search [Heuristic Search]
• A Heuristic is a way which might not always be
guaranteed for the best solution but guaranteed
to find a good solution in a reasonable time.
• It can solve much complex problem which could
not be solved in another way.
Uninformed Search Algorithms
Breadth First Search:
• It is the most common search strategy for traversing a
tree or graph.
• This algorithm searches breadth wise in a tree or graph.
So, it is called as breadth-first search.
• BFS algorithm starts searching from the root node of
the tree and expands all successor node at the current
level.
Breadth First Search:
• BFG algorithm is example of general graph search
algorithm.
• BFS implemented FIFO queue data structure.
• Advantages:
• BFS will provide a solution if any solution exists.
• If there are more than one solution for a given problem,
then BFS will provide minimal solution which requires
the least no of steps.
Breadth First Search:
• Disadvantages:
• It requires lot of memory.
• It requires lot of time.