SINGLE STATE PROBLEM

 When the environment is completely accessible

and the agent can calculate its state after any
sequence of action, we call it a single-state
problem.
 Searching for solutions Solution to an AI problems
involves performing an action to go to one proper
state among possible numerous possible states of
agent. Thus the processes of finding solution can
be boiled down to searching of that best state
among all the possible states.
SINGLE STATE PROBLEM

 Deterministic, accessible
 Agent knows everything about world(the exact
state)
 Calculate optimum action sequence to reach goal
state
 Example: playing chess(any action will result
exact state)
Well defined problems

A problem can be defined by

 –Initial state
 –Actions (Using successor function)
 –Goal test (to determine the goal state)
 –Path cost
 A problem is when defined with these components
is called well defined problem. The actions and
rules should be defined in as general way as
possible.
Examples of Single State Problem
Problem Solving Agent

 Goal Formulation-Set of one or more (desirable) world states.(e.g.

Checkmate in Chess)
 Problem Formulation-What actions and states to consider given a goal
and an initial state
 Search for solution-Given the problem, search for a solution--a sequence
of actions to achieve the goal starting from initial state
 Execution of the solution
Goal Formulation

Specify the objectives to be achieved

 goal - a set of desirable world states in which the
objectives have been achieved
 current / initial situation - starting point for the
goal formulation
 actions - cause transitions between world states
Problem Formulation

Actions and states to consider

 states - possible world states
 accessibility - the agent can determine via its
sensors in which state it is
 consequences of actions - the agent knows the
results of its actions
 levels - problems and actions can be specified at
various levels
 constraints - conditions that influence the
problem-solving process
 performance - measures to be applied
 costs - utilization of resources
exact prediction is possible
state - is known exactly after any sequence of actions
accessibility of the world all essential information can be
obtained through sensors
consequences of actions are known to the agent
 Example:

goal - for each known initial state, there is a unique

goal state that is guaranteed to be reachable via
an action sequence
simplest case, but severely restricted
Example:

Vacuum world,
Limitations:
 Can’t deal with incomplete accessibility
 incomplete knowledge about consequences
changes in the world
 indeterminism in the world, in action