EXPERIMENT NO.
2
Date of Performance:
Date of Submission:
AIM: Assignments on State space formulation and PEAS representation for various AI
applications.
THEORY:
1.1 Specifying Task Environment
Task environments, which are essentially the "problems" to which rational agents are the
"solutions.” In designing an agent, the first step must always be to specify the task
environment as fully as possible with the help of PEAS (Performance, Environment,
Actuators, Sensors) description.
1.2 Example of PEAS
Problem Definition:
•PEAS(Performance, Environment, Actuators, Sensors)
•First step to design an agent is to specify task environment as fully as possible.
•While designing a rational agent we have to specify the performance measure, the
environment, and agent’s actuators and sensors.
•We group them under the heading task environment
PEAS Descriptors:
A goal directed agent needs to achieve certain goals. Such an agent selects its actions based
on the goal it has. Many problems can be represented as a set of states and a set of rules of
how one state is transformed to another. Each state is an abstract representation of the
agent's environment. It is an abstraction that denotes a configuration of the agent.
1.3 Problem Formulation
• Formulate a problem as a state space search by showing the legal problem states, the legal
operators, and the initial and goal states .
• A state is defined by the specification of the values of all attributes of interest in the world
• An operator changes one state into the other; it has a precondition which is the value of
certain attributes prior to the application of the operator, and a set of effects, which are the
attributes altered by the operator
• The initial state is where you start
• The goal state is the partial description of the solution
An initial state is the description of the starting configuration of the agent An action or an
operator takes the agent from one state to another state which is called a successor state. A
state can have a number of successor states. A plan is a sequence of actions. The cost of a
plan is referred to as the path cost. The path cost is a positive.
Problem formulation means choosing a relevant set of states to consider, and a feasible set of
operators for moving from one state to another. Search is the process of considering various
possible sequences of operators applied to the initial state, and finding out a sequence which
culminates in a goal state.
Search Problem is formally described as following:
• S: the full set of states
• s0 : the initial state
• A:S→S is a set of operators
• G is the set of final states. Note that G ⊆S
The search problem is to find a sequence of actions which transforms the agent from the
number. In many cases the path∈ cost is computed by taking the sum of the costs of each
action. initial state to a goal state g G. A sequence of states is called a path. The cost of a
path is positive.
1.4 Example of Problem formulation
Problem Formulation:
Agent Type Performance Environment Actuators Sensors
Measure
Smart Water Usage Outdoor Fields, Water Valves, Soil Moisture
Irrigation Efficiency, Soil Gardens, Sprinkler Sensors,
System Moisture Varying Rotation Temperature
Accuracy, Crop Weather Mechanism, Sensors,
Health Impact, Conditions Pump Control Humidity
Energy Sensors, Rain
Consumption, Sensors,
Coverage Sunlight
Uniformity Sensors
Partial Tabulation Chart for Part Picking Robot
Percept Sequence Action
Soil moisture below Starts irrigation in
threshold affected zone
Rain detected or Cancels or postpones
forecasted irrigation
Sunlight intensity Adjusts watering
very high schedule to early
morning/evening
Soil moisture Stops irrigation
reaching optimal
level
Extreme temperature Modifies irrigation
detected amount to prevent
stress
Pump or valve Sends alert and stops
malfunction detected system for safety
CONCLUSION: We have successfully implemented State space formulation and PEAS
representation for various AI applications.
SIGN AND REMARK:
DATE:
R1 (3 R2 (4 R3 (4 R4 (4 Total Signature
Marks) Marks) Marks) Marks)
(15 Marks)
