Scribd
Upload
8 views

unit-01-4(notes)

The document provides an overview of intelligent agents and problem-solving in artificial intelligence, focusing on the processes involved in generating solutions through search techniques. It discusses the characteristics of problem-solving agents, the steps in solving problems by searching, and introduces various search algorithms, including uninformed and informed search strategies. Key concepts such as search space, goal test, and properties of searching algorithms are also covered, along with specific algorithms like Breadth-First Search and Depth-First Search.

Uploaded by

mrrandom663
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

unit-01-4(notes)

The document provides an overview of intelligent agents and problem-solving in artificial intelligence, focusing on the processes involved in generating solutions through search techniques. It discusses the characteristics of problem-solving agents, the steps in solving problems by searching, and introduces various search algorithms, including uninformed and informed search strategies. Key concepts such as search space, goal test, and properties of searching algorithms are also covered, along with specific algorithms like Breadth-First Search and Depth-First Search.

Uploaded by

mrrandom663
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

UNIT:1

Introduction: Intelligent Agents: Agents and Environments, The concept of rationality, Nature of
Environments, Structure of Environments. (Refer the presentation files shared)

Problem Solving: Solving Problems by Searching: Problem solving agents, Uninformed Search
strategies, Avoiding repeated states, Informed Searches and Exploration, Informed search
strategies, Heuristic functions, Local search algorithms and optimization problems.

➢ Problem solving in AI

▪ Problem solving is a process of generating solutions from observed data.


▪ Problem-solving in AI refers to the process of finding a sequence of actions that leads from a given
initial state to a desired goal state using computational techniques and algorithms. It involves
defining the problem, searching through possible solutions, and selecting the best one based on
certain criteria.
▪ In Artificial Intelligence, Search techniques are universal problem-solving methods.

➢ Problem solving agents:


Problem solving agents are intelligent systems designed to achieve specific goals by searching through
a search space.

▪ These agents are goal-oriented, they have an aim to achieve.


▪ They are rational, making decisions that maximize their chances of success.
▪ These agents follow a systematic approach, exploring different states and actions to find the best path
to their goal.
▪ E.g.: GPS Navigation system
It starts at the current location and calculates the best route(actions) to the destination.

➢ Solving problems by searching:


The process of problem-solving using searching consists of the following steps:

 Define the problem- Analyze the problem- Detailed specification of inputs and acceptable system
solutions.
 Analyse the problem thoroughly
 Identification of possible solutions (Knowledge Representation)- Collect detailed information
about the problem and define all possible techniques
 Choosing the optimal solution - Selection of best techniques

➢ Search Algorithm Terminologies:


Search: Searching is a step-by-step procedure to solve a search-problem in a given search space. A
search problem can have three main factors:

Search Space: Search space represents a set of possible solutions, which a system may have.

Start State: It is a state from where agent begins the search.

Goal test: It is a function which observe the current state and returns whether the goal state is achieved
or not.

Search tree: A tree representation of search problem is called Search tree. The root of the search tree is
the root node which is corresponding to the initial state.

Actions: It gives the description of all the available actions to the agent.

Transition model: A description of what each action do, can be represented as a transition model.

Path Cost: It is a function which assigns a numeric cost to each path.

Solution: It is an action sequence which leads from the start node to the goal node.

Optimal Solution: If a solution has the lowest cost among all solutions.

Properties of Searching Algorithms:


These properties are used to compare the efficiency of the different types of searching algorithms.

• Completeness-A search algorithm is said to be complete when it gives a solution or returns any
solution for a given random input.

• Optimality-If a solution found is best (lowest path cost) among all the solutions identified, then
that solution is said to be an optimal one.

• Time complexity-The time taken by an algorithm to complete its task is called time complexity.
If the algorithm completes a task in a lesser amount of time, then it is an efficient one.

• Space complexity-It is the maximum storage or memory taken by the algorithm at any time while
searching.
Type of Searching Algorithms:
we know that in order to solve a problem (in order to search for a solution from the problem space), we
need to apply some sort of search strategy.

Based on the search problems, we can classify the search algorithms into uninformed (Blind search)
search and informed search (Heuristic search) algorithms.

➢ Uninformed search

➢ Informed search

Uninformed Search:

Uninformed search also known as Blind search, is a search technique that explores (starts searching) a
problem space without any specific knowledge or information about the problem other than the initial
state and the possible actions to take.

• The uninformed search algorithm does not have any domain knowledge such
as closeness, location of the goal state, etc. it behaves in a brute-force way.

• It only knows the information about how to traverse the given tree and how to
find the goal state.

• It examines each node of the tree until it achieves the goal node.

• This algorithm is also known as Blind Search algorithm or Brute-Force algorithm.

The uninformed search strategies are of six types-

1. Breadth-First Search (BFS)

2. Depth-First Search (DFS)

3. Depth-limited Search

4. Iterative deepening depth-first search

5. Bidirectional Search

6. Uniform Cost Search

1.1. Breadth First Search


 It is of the most common search strategies. It generally starts from the root node and examines
the neighbor nodes and then moves to the next level.
 It uses First-in First-out (FIFO) strategy as it gives the shortest path to achieving the solution.
 BFS is used where the given problem is very small and space complexity is not considered.

Algorithm:

step 01: Enter starting node in Queue.

step 02: If queue is empty, return fail and stop.

step 03: If, first element in queue is goal node, then return success and stop.

else, remove and expand first element in queue and place children/successor unvisited nodes at
the end of the queue.

step 04: Repeat from step 02.

E.g.:
1.2. Depth First Search

 It uses Last-in First-out (LIFO) strategy, i.e. it uses a stack data structure for implementation.
 The stack is used for keeping track of all visited nodes.
 DFS are used for detecting cycles in graph, path finding etc.

Algorithm:

step 01: Push the root node in the stack.

step 02: while (stack is not empty)

2.1. Pop a node from the stack

2.1.1. If node is a goal node return success.


2.1.2. Push all children/unvisited nodes into the stack.

step 03: Return failure.

E.g.:

You might also like