Problem Representation

Slides:



Advertisements
Similar presentations
Heuristic Search techniques
Advertisements

CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 11, 2013.
BackTracking Algorithms
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
And-Or Graphs CSCE 580 Spr03 Instructor: Marco Valtorta Hrishikesh J. Goradia Seang-Chan Ryu.
Problem Solving and Search Andrea Danyluk September 9, 2013.
Part2 AI as Representation and Search
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.4) January, 14, 2009.
Uninformed Search Jim Little UBC CS 322 – Search 2 September 12, 2014
Alford Academy Business Education and Computing1 Advanced Higher Computing Based on Heriot-Watt University Scholar Materials Problem abstraction and symbolic.
CS 484 – Artificial Intelligence
Best-First Search: Agendas
1 Solving problems by searching Chapter 3. 2 Why Search? To achieve goals or to maximize our utility we need to predict what the result of our actions.
Search: Representation and General Search Procedure Jim Little UBC CS 322 – Search 1 September 10, 2014 Textbook § 3.0 –
Problem Solving and Search in AI Part I Search and Intelligence Search is one of the most powerful approaches to problem solving in AI Search is a universal.
Chapter 12: Expert Systems Design Examples
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) January, 12, 2009.
Search: Representation and General Search Procedure CPSC 322 – Search 1 January 12, 2011 Textbook § 3.0 –
1 Solving problems by searching Chapter 3. 2 Why Search? To achieve goals or to maximize our utility we need to predict what the result of our actions.
1 Chapter 3 Knowledge Representation. 2 Chapter 3 Contents l The need for a good representation l Semantic nets l Inheritance l Frames l Object oriented.
Structures and Strategies for State Space Search
Structures and Strategies for State Space Search
Uninformed Search Reading: Chapter 3 by today, Chapter by Wednesday, 9/12 Homework #2 will be given out on Wednesday DID YOU TURN IN YOUR SURVEY?
1 Chapter 3 Knowledge Representation. 2 Chapter 3 Contents l The need for a good representation l Semantic nets l Inheritance l Frames l Object oriented.
1 Structures and Strategies for State Space Search 3 3.0Introduction 3.1Graph Theory 3.2Strategies for State Space Search 3.3Using the State Space to Represent.
1 Solving problems by searching Chapter 3. 2 Why Search? To achieve goals or to maximize our utility we need to predict what the result of our actions.
C o n f i d e n t i a l Developed By Nitendra NextHome Subject Name: Data Structure Using C Title: Overview of Data Structure.
3.0 State Space Representation of Problems 3.1 Graphs 3.2 Formulating Search Problems 3.3 The 8-Puzzle as an example 3.4 State Space Representation using.
1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
Computer Science CPSC 322 Lecture 4 Search: Intro (textbook Ch: ) 1.
Introduction Of Tree. Introduction A tree is a non-linear data structure in which items are arranged in sequence. It is used to represent hierarchical.
Problems, Problem Spaces and Search
1 Solving problems by searching 171, Class 2 Chapter 3.
Outline Intro to Representation and Heuristic Search Machine Learning (Clustering) and My Research.
Problem solving What is problem solving? Weak and strong methods.
Goal-based Problem Solving Goal formation Based upon the current situation and performance measures. Result is moving into a desirable state (goal state).
Problem Reduction So far we have considered search strategies for OR graph. In OR graph, several arcs indicate a variety of ways in which the original.
Artificial Intelligence Lecture No. 6 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Blind Searches - Introduction.
CPSC 322, Lecture 4Slide 1 Search: Intro Computer Science cpsc322, Lecture 4 (Textbook Chpt ) Sept, 12, 2012.
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Introduction to State Space Search
1 Chapter 3 Knowledge Representation. 2 Chapter 3 Contents l The need for a good representation l Semantic nets l Inheritance l Frames l Object oriented.
State space search Represented by a four-tuple [N,A,S,GD], where: N is the problem space A is the set of arcs (or links) between nodes. These correspond.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.5) Sept, 13, 2013.
G5AIAI Introduction to AI
Lecture 2: Problem Solving using State Space Representation CS 271: Fall, 2008.
How Computers Solve Problems Computers also use Algorithms to solve problems, and change data into information Computers can only perform one simple step.
Biointelligence Lab School of Computer Sci. & Eng. Seoul National University Artificial Intelligence Chapter 8 Uninformed Search.
Knowledge Representation
Introduction to Artificial Intelligence
Artificial Intelligence Lecture No. 6
Introduction Defining the Problem as a State Space Search.
Problem Solving by Searching
STATE SPACE REPRESENTATION
Unit# 9: Computer Program Development
CIS 488/588 Bruce R. Maxim UM-Dearborn
Chapter 6: Transform and Conquer
STATE SPACE REPRESENTATION
Management From the memory view, we can list four important tasks that the OS is responsible for ; To know the used and unused memory partitions To allocate.
Paper by D.L Parnas And D.P.Siewiorek Prepared by Xi Chen May 16,2003
Knowledge Representation
Solving problems by searching
Two – One Problem Legal Moves: Slide Rules: 1s’ move right Hop
Two – One Problem Legal Moves: Slide Rules: 1s’ move right Hop
Solving problems by searching
Directional consistency Chapter 4
Unit II Game Playing.
Presentation transcript:

Problem Representation

CONTENTS State space Representation Problem Reduction Definition Of Problem Representation Methods of problem representation in AI State space Representation Advantages of State Space Representation Disadvantages of State Space Representation Problem Reduction

Definition Of Problem Representation Before a solution can be found, the prime condition is that the problem must be very precisely defined. By defining it properly, one convert the abstract problem into real workable states that are really understood. These states are operated upon by a set of operators and the decision of which operator to be applied, when and where is dictated by the overall control strategy. BACK TO INDEX

Methods of Problem Representation in AI State Space Representation Problem Reduction BACK TO INDEX

State space Representation

Fig-State Space Representation For Coffee Making To Define a Problem as a state space search, We will take the following example: Water Boiled Boiling Water Added Coffee Powder Added Milk Powder Decoction Milk Coffee Added Sugar Palatable Coffee Fig-State Space Representation For Coffee Making

1 5 3 1 2 3 6 8 7 4 5 6 4 2 7 8 Initial State Goal State Thus, A set of all possible states for a given problem is known as the state space of the problem. To explain it in a more detailed manner let us consider another problem of 8-puzzle. The puzzle consists of a square frame containing 8 tiles and an empty slot. The tiles are numbered from 1 to 8. The goal is to get the square in a numerical order. To solve this problem, one needs to have an initial state, a goal state & a set of rules. Following figure shows the initial state and goal state. 1 5 3 1 2 3 6 8 7 4 5 6 4 2 7 8 Initial State Goal State

The rules for this problem are: The state space is now a directed graph with all the states as nodes. A node is said to exist if it is possible to obtain it from the initial state by application of a set of operators. Up:- If the hole is not touching the top frame, move it up. Down:- If the hole is not touching the bottom frame, move it down. Left:- If the hole is not touching the left frame, move it down. Right:- If the hole is not touching the right frame, move it down.

(Fragment of the state space of 8-tile puzzle) BACK TO INDEX

Advantages of State Space Representation State space representation is highly beneficial in AI because they provide all possible states, operations and the goals. If the entire state space representation for problem is given,it is possible to trace the path from the initial state to the goal state & identify the sequence of operators necessary for doing it. BACK TO INDEX

Disadvantages of State Space Representation The major deficiency of this method is that it is not possible to visualize all states for a given problem. The resources of the computer system are limited to handle huge state space representation. BACK TO INDEX

Problem Reduction To overcome the deficiencies of above method, problem reduction technique comes today. In this method, a complex problem is broken down or decomposed into a set of primitive sub-problems. solutions for this primitive sub-problem are easily obtained. For Exp:- Consider the activities that must be done to set right a punctured tyre.

Set right a punctured tyre AND tree Take the tyre to Mechanic Identify the location of puncture Fix the puncture Remove the tyre OR tree Let the mechanic come and take it You yourself remove it Ask your friend to do it Ask the mechanic to do it You yourself take it Drive in your friend’s vehicle Take it in a public transportation system Fig-An AND/OR tree

The top level specifies the overall goal which is combination of tasks given in level2,level3 & level4 indicate primitive sub-problems. The figure given in previous slide is a pictorial representation of problem by an AND/OR tree. An arc( ) connecting different branches is called an AND tree. Normally, the initial complex problem forms the parent node & primitive sub-problems form the leaf node. Between the complex problem and the sub-problem, there exist two kinds of relationships -AND relationship and OR relationship.

In AND relationship, the solution for the problem is obtained by solving all the sub-problems. In OR relationship, the solution for the problem is obtained by solving any of the sub-problems. Most problem that AI attack, do not reduce to pure AND or pure OR trees. A combination of these exist. BACK TO INDEX

THANKS BACK TO INDEX