Scribd
Upload
0 views18 pages

Unit 3 Problem Solving

The document discusses problem-solving techniques in AI, emphasizing the use of logical algorithms and search algorithms to find solutions. It outlines the steps involved in problem-solving, including goal formulation, problem formulation, and various components like initial state and path costing. Additionally, it categorizes search algorithms into uninformed and informed types, detailing their characteristics and applications in different contexts.

Uploaded by

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

Unit 3 Problem Solving

The document discusses problem-solving techniques in AI, emphasizing the use of logical algorithms and search algorithms to find solutions. It outlines the steps involved in problem-solving, including goal formulation, problem formulation, and various components like initial state and path costing. Additionally, it categorizes search algorithms into uninformed and informed types, detailing their characteristics and applications in different contexts.

Uploaded by

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

Problem

• Problems are can resolve by logical algorithms,


differential equations, utilizing effective polynomial
and executing all of them with modelling patterns.
• One problem can have multiple solutions by using
different problem-solving techniques.
• In parallel, some problems have unique solutions
and can be only resolved by one method.
• It depends on the nature of the problems that how
many solutions are possible.
Problem Solving
• The reflex agent of AI directly maps states into action.
• Whenever these agents fail to operate in an
environment where the state of mapping is too large
and not easily performed by the agent, then the stated
problem dissolves and sent to a problem-solving
domain which breaks the large stored problem into the
smaller storage area and resolves one by one.
• The final integrated action will be the desired
outcomes.

2
Steps problem-solving
These are the following steps which require to solve a problem :
•Goal Formulation: This one is the first and simple step in problem-solving. It organizes finite
steps to formulate a target/goals which require some action to achieve the goal. Today the
formulation of the goal is based on AI agents.
•Problem formulation: It is one of the core steps of problem-solving which decides what action
should be taken to achieve the formulated goal. In AI this core part is dependent upon software
agent which consisted of the following components to formulate the associated problem.
Components to formulate the associated problem:
•Initial State: This state requires an initial state for the problem which starts the AI agent towards
a specified goal. In this state new methods also initialize problem domain solving by a specific
class.
•Action: This stage of problem formulation works with function with a specific class taken from
the initial state and all possible actions done in this stage.
•Transition: This stage of problem formulation integrates the actual action done by the previous
action stage and collects the final stage to forward it to their next stage.
•Goal test: This stage determines that the specified goal achieved by the integrated transition
model or not, whenever the goal achieves stop the action and forward into the next stage to
determines the cost to achieve the goal.
•Path costing: This component of problem-solving numerical assigned what will be the cost to
achieve the goal. It requires all hardware software and human working cost.

3
Problem Solving Techniques in AI
Search Algorithms
•Search algorithms are one of the common methods to solve
problems in AI.
•The problem solving or rational agents with search algorithms
are used to find the best optimal solution.
•This type of problem-solving technique is often called goal-
based.
time Complexity
Space Complexity
Completeness
Optimality

4
• A search problem consists of:
– A State Space. Set of all possible states where you can
be.
– A Start State. The state from where the search begins.
– A Goal Test. A function that looks at the current state
returns whether or not it is the goal state.
• The Solution to a search problem is a sequence of
actions, called the plan that transforms the start state to
the goal state.
• This plan is achieved through search algorithms.

5
What choices are we searching
through?
– Problem solving
Action combinations (move 1, then move 3, then move 2...)
– Natural language
Ways to map words to parts of speech
– Computer vision
Ways to map features to object model
– Machine learning
Possible concepts that fit examples seen so far
– Motion planning
Sequence of moves to reach goal destination

6
Types of search algorithms

7
Uninformed Search Algorithms:
•The search algorithms in this section have no additional information on
the goal node other than the one provided in the problem definition.
•The plans to reach the goal state from the start state differ only by the
order and/or length of actions.
•Uninformed search is also called Blind search.
•These algorithms can only generate the successors and differentiate
between the goal state and non goal state.
Informed Search Algorithms:
• The algorithms have information on the goal state, which helps in more
efficient searching.
•This information is obtained by something called a heuristic Search.

8
Steps for State Space Search
• Define state space that contains all possible
configurations of relevant objects, without
enumerating.
• Define some initial states and some goal
states.
• Specify rules as possible actions.
• Good control strategy.
S: (S,A,Action(S),Result(S,A),Cost(S,A))
9
Example Problems

10
11
12
13
14
15
16
17
Sample Search Problems
• Graph coloring
• Protein folding
• Game playing
• Airline travel
• Proving algebraic equalities
• Robot motion planning

18

You might also like