Scribd
Upload
21 views6 pages

Under These Assumptions, The Solution To Any Problem Is A Fixed Sequence of Actions

The document discusses problem solving by intelligent agents. It defines the key concepts of goal formulation, problem formulation, search, and the components of a well-defined problem including the initial state, actions, transition model, goal test, and cost. Problem solving agents aim to find sequences of actions that lead to desirable goal states in a systematic search process.

Uploaded by

Mariam shahid
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
21 views6 pages

Under These Assumptions, The Solution To Any Problem Is A Fixed Sequence of Actions

The document discusses problem solving by intelligent agents. It defines the key concepts of goal formulation, problem formulation, search, and the components of a well-defined problem including the initial state, actions, transition model, goal test, and cost. Problem solving agents aim to find sequences of actions that lead to desirable goal states in a systematic search process.

Uploaded by

Mariam shahid
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/ 6

Chap 3: SOLVING PROBLEMS BY SEARCHING

Monday, October 26, 2020 1:08 PM

Goal: Intelligent agents are supposed to maximize their performance


measure. As we mentioned earlier, achieving this is sometimes simplified if
the agent can adopt a goal and aim at satisfying it.

Goal formulation, based on the current situation and the agent’s performance
measure, is the first step in problem solving.

Problem formulation: Problem formulation is the process of deciding what


actions and states to consider, given a goal.

Assumptions: We assume that the environment is observable, so the agent


always knows the current state. We also assume the environment is discrete, so
at any given state there are only finitely many actions to choose from. We will
assume the environment is known, so the agent knows which states are reached
by each action. Finally, we assume that the environment is deterministic, so each
action has exactly one outcome.
Under these assumptions, the solution to any problem is a fixed sequence of
actions.

Search: The process of looking for a sequence of actions that reaches the goal is
called search.
Solution: A search algorithm takes a problem as input and returns a solution in
the form of an action sequence.

Execution: Once a solution is found, the actions it recommends can be carried


out. This is called the execution phase.

Problem Solving Agent: one kind of goal-based agent called a problem-solving


agent that decides what to do by systematically finding sequences of actions
that lead to desirable states (goal)

Well-defined problems and solutions: A problem can be defined formally by


five components:

1. Initial state: The initial state that the agent starts in. For example, the
AI-Lec3 Page 1
1. Initial state: The initial state that the agent starts in. For example, the
initial state for our agent in A to F might be described as In(A)

2. Actions: A description of the possible actions available to the agent. Given


a particular state s, ACTIONS(s) returns the set of actions that can be
executed in s. We say that each of these actions is applicable in s. For
example, from the state In(A), the applicable actions are {Go(B), Go(H)}.

3. Transition model successor, State space: A description of what each


action does; the formal name for this is the transition model, specified by a
function RESULT(s, a) that returns the state that results from doing action
a in state s. We also use the term successor to refer to any state reachable
from a given state by a single action For example, we have
RESULT(In(A),Go(H)) = In(H) .
Together, the initial state, actions, and transition model implicitly define
the state space of the problem

4. Goal, goal test: The goal test, which determines whether a given state is a
goal state.

5. Cost: The problem-solving agent chooses a cost function that reflects its
own performance measure. A path cost function that assigns a numeric
cost to each path.

AI-Lec3 Page 2
AI-Lec3 Page 3
AI-Lec3 Page 4
AI-Lec3 Page 5
AI-Lec3 Page 6

You might also like