Scribd
Upload
7 views

Problem Solving Approches To AI Problem

Uploaded by

anika.24bai10420
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Problem Solving Approches To AI Problem

Uploaded by

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

FUTURE OF ARTIFICIAL INTELLIGENCE

• Transportation: Although it could take a decade or more to perfect them, autonomouscars will one day ferry
us from place to place.
• Manufacturing: AI powered robots work alongside humans to perform a limited rangeof tasks like assembly and
stacking, and predictive analysis sensors keep equipment running smoothly.
• Healthcare: In the comparatively AI-nascent field of healthcare, diseases are more quickly and accurately
diagnosed, drug discovery is sped up and streamlined, virtual nursing assistants monitor patients and big data
analysis helps to create a morepersonalized patient experience.
• Education: Textbooks are digitized with the help of AI, early-stage virtual tutors assisthuman instructors and
facial analysis gauges the emotions of students to help determinewho’s struggling or bored and better tailor the
experience to their individual needs.
• Media: Journalism is harnessing AI, too, and will continue to benefit from it. Bloomberg uses Cyborg
technology to help make quick sense of complex financial reports. The Associated Press employs the natural
language abilities of Automated Insights to produce 3,700 earning reports stories per year — nearly four times
more than in the recent past
• Customer Service: Last but hardly least, Google is working on an AI assistant that canplace human-like calls
to make appointments at, say, your neighborhood hair salon. Inaddition to words, the system understands
context and nuance.

PROBLEM SOLVING APPROACH TO TYPICAL AI PROBLEMS


Problem-solving agents
In Artificial Intelligence, Search techniques are universal problem-solving methods.
Rational agents or Problem-solving agents in AI mostly used these search strategies or
algorithms to solve a specific problem and provide the best result. Problem- solving agents are
the goal-based agents and use atomic representation. In this topic, wewill learn various
problem-solving search algorithms.

• Some of the most popularly used problem solving with the help of artificial intelligence
are:

1. Chess.
2. Travelling Salesman Problem.
3. Tower of Hanoi Problem.
4. Water-Jug Problem.
5. N-Queen Problem.

Problem Searching

• In general, searching refers to as finding information one needs.


• Searching is the most commonly used technique of problem solving in artificial
intelligence.

• The searching algorithm helps us to search for solution of particular problem.

Problem: Problems are the issues which comes across any system. A solution is needed to
solve that particular problem.

Steps : Solve Problem Using Artificial Intelligence

• The process of solving a problem consists of five steps. These are:

Figure 1.11 Problem Solving in Artificial Intelligence

Defining The Problem: The definition of the problem must be included precisely. It
should contain the possible initial as well as final situations which should result in acceptable
solution.

1. Analyzing The Problem: Analyzing the problem and its requirement must be done as
few features can have immense impact on the resulting solution.

2. Identification Of Solutions: This phase generates reasonable amount of solutions to


the given problem in a particular range.

3. Choosing a Solution: From all the identified solutions, the best solution is chosen basis
on the results produced by respective solutions.

4. Implementation: After choosing the best solution, its implementation is done.

Measuring problem-solving performance

We can evaluate an algorithm’s performance in four ways:


• Completeness: Is the algorithm guaranteed to find a solution when there is
one?
• Optimality: Does the strategy find the optimal solution?
• Time complexity: How long does it take to find a solution?
• Space complexity: How much memory is needed to perform the search?

Search Algorithm Terminologies

• Search: Searching is a step by step procedure to solve a search-


problem in a givensearch space. A search problem can have three main
factors:

1. Search Space: Search space represents a set of possible solutions,


which a systemmay have.

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

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

• Search tree: A tree representation of search problem is called Search tree.


The root ofthe 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 atransition 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.
8- Puzzle Problem

Figure 1.13 8- Puzzle Problem

States: A state description specifies the location of each of the


eight tiles and the blankin one of the nine squares.
Initial state: Any state can be designated as the initial state.
Note that any given goal can be reached from exactly half of the
possible initial states.

The simplest formulation defines the actions as movements of


the blank space Left, Right, Up, or Down. Different subsets of these are
possible depending on where the blank is.

Transition model: Given a state and action, this returns the


resulting state; for example,if we apply Left to the start state in Figure
1. the resulting state has the 5 and the blank switched.

Goal test: This checks whether the state matches the goal
configuration shown in Figure. Path cost: Each step costs 1, so the
path cost is the number of steps in the path.
Queens Problem

Figure 1.14 Queens Problem

• States: Any arrangement of 0 to 8 queens on the board is a state.


• Initial state: No queens on the board.
• Actions: Add a queen to any empty square.
• Transition model: Returns the board with a queen added to the specified
square.
• Goal test: 8 queens are on the board, none attacked.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy