Defining Problems as a State Space Search
The problem-solving agent is sort of goal-based agent which finds a sequence of actions that leads to the desirable state from the initial state. There are certain steps that we need to follow while solving the problems and they are problem formulation, searching, and execution. The first step of problem solving is problem formulation. The formulation of the problem requires defining the problem precisely. It is necessary to define the initial position, final position and acceptable position of the problem. The second step is searching. This step chooses the best technique for the problem solving. The final step is execution. Once the search algorithm returns a solution then the agent executes this solution. The process that is used in the field of computer science, as well as artificial intelligence in which states of an instant are considered with a goal of finding a goal state with the desired property, is known as State Space Search. In state-space search problems are often modeled as a state space or a set of states in which a problem can be in. Thus the states are connected if there is an operation that can be performed to transform the first state into second.
Summary
The problem-solving agent is sort of goal-based agent which finds a sequence of actions that leads to the desirable state from the initial state. There are certain steps that we need to follow while solving the problems and they are problem formulation, searching, and execution. The first step of problem solving is problem formulation. The formulation of the problem requires defining the problem precisely. It is necessary to define the initial position, final position and acceptable position of the problem. The second step is searching. This step chooses the best technique for the problem solving. The final step is execution. Once the search algorithm returns a solution then the agent executes this solution. The process that is used in the field of computer science, as well as artificial intelligence in which states of an instant are considered with a goal of finding a goal state with the desired property, is known as State Space Search. In state-space search problems are often modeled as a state space or a set of states in which a problem can be in. Thus the states are connected if there is an operation that can be performed to transform the first state into second.
Things to Remember
- The problem-solving agent is sort of goal-based agent which finds a sequence of actions that leads to the desirable state from the initial state.
- There are certain steps that we need to follow while solving the problems and they are problem formulation, searching, and execution.
- The first step of problem solving is problem formulation. The formulation of the problem requires defining the problem precisely. It is necessary to define the initial position, final position and acceptable position of the problem.
- The second step is searching. This step chooses the best technique for the problem solving.
- The final step is execution. Once the search algorithm returns a solution then the agent executes this solution.
- The process that is used in the field of computer science, as well as artificial intelligence in which states of an instant are considered with a goal of finding a goal state with the desired property, is known as State Space Search.
- In state-space search problems are often modeled as a state space or a set of states in which a problem can be in.
- Thus the states are connected if there is an operation that can be performed to transform the first state into second.
MCQs
No MCQs found.
Subjective Questions
No subjective questions found.
Videos
No videos found.
Defining Problems as a State Space Search
Problem Solving:
The problem-solving agent is sort of goal-based agent which finds a sequence of actions that leads to the desirable state from the initial state. There are certain steps that we need to follow while solving the problems and they are as follows:
- Problem Formulation: The first step of problem solving is problem formulation. The formulation of the problem requires defining the problem precisely. It is necessary to define the initial position, final position and acceptable position of the problem.
- Searching: The second step is searching. This step chooses the best technique for the problem solving.
- Execution: The final step is execution. Once the search algorithm returns a solution then the agent executes this solution.
State Space Search:
The process that is used in the field of computer science, as well as artificial intelligence in which states of an instant are considered with a goal of finding a goal state with the desired property, is known as State Space Search. In state-space search problems are often modeled as a state space or a set of states in which a problem can be in. Thus the states are connected if there is an operation that can be performed to transform the first state into second.
For example:
A = {0, 1, 2}
B = {1, 2, 3}
A * B = { (0, 1),(0, 2),(0, 3), (1, 1),(1, 2),(1, 3), (2, 1), (2, 2), (2, 3) }
Example: Represent the following water jug problem in state space diagram.
Given two vessels of measuring exactly 4 litres and 3 litres without any marking. Goal state: 2 litres of water in a four-litre vessel.
Let,
x = 4 litre jug
y = 3 litre jug
References:
- Elaine Rich, Kevin Knight 1991, "Artificial Intelligence".
- Nilsson, Nils J. Principles of Artificial Intelligence, Narosa Publishing House New Delhi, 1998.
- Norvig, Peter & Russel, Stuart Artificial Intelligence: A modern Approach, Prentice Hall, NJ, 1995
- Patterson, Dan W. Introduction to Artificial Intelligence and Expert Systems, Prentice Hall of India Private Limited New Delhi, 1998
Lesson
Problem solving
Subject
Computer Engineering
Grade
Engineering
Recent Notes
No recent notes.
Related Notes
No related notes.