Problem Solving What is AI way of solving problem?

Slides:



Advertisements
Similar presentations
Solving problems by searching Chapter 3. Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms.
Advertisements

INTRODUÇÃO AOS SISTEMAS INTELIGENTES
Additional Topics ARTIFICIAL INTELLIGENCE
Solving problems by searching
Announcements Course TA: Danny Kumar
Solving problems by searching Chapter 3 Artificial Intelligent Team Teaching AI (created by Dewi Liliana) PTIIK 2012.
14 Jan 2004CS Blind Search1 Solving problems by searching Chapter 3.
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.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2007.
May 12, 2013Problem Solving - Search Symbolic AI: Problem Solving E. Trentin, DIISM.
1 Chapter 3 Solving Problems by Searching. 2 Outline Problem-solving agentsProblem-solving agents Problem typesProblem types Problem formulationProblem.
Solving Problem by Searching Chapter 3. Outline Problem-solving agents Problem formulation Example problems Basic search algorithms – blind search Heuristic.
Solving problems by searching Chapter 3. Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms.
Artificial Intelligence for Games Uninformed search Patrick Olivier
14 Jan 2004CS Blind Search1 Solving problems by searching Chapter 3.
14 Jan 2004CS Blind Search1 Solving problems by searching Chapter 3.
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.
CHAPTER 3 CMPT Blind Search 1 Search and Sequential Action.
Search: Representation and General Search Procedure Jim Little UBC CS 322 – Search 1 September 10, 2014 Textbook § 3.0 –
An Introduction to Artificial Intelligence Lecture 3: Solving Problems by Sorting Ramin Halavati In which we look at how an agent.
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.
CS 380: Artificial Intelligence Lecture #3 William Regli.
Problem Solving What is AI way of solving problem?
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.
Problem Solving by Searching Copyright, 1996 © Dale Carnegie & Associates, Inc. Chapter 3 Spring 2004.
Solving problems by searching
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.
Solving problems by searching This Lecture Read Chapters 3.1 to 3.4 Next Lecture Read Chapter 3.5 to 3.7 (Please read lecture topic material before and.
Solving Problems by Searching CPS Outline Problem-solving agents Example problems Basic search algorithms.
1 Solving problems by searching This Lecture Chapters 3.1 to 3.4 Next Lecture Chapter 3.5 to 3.7 (Please read lecture topic material before and after each.
Basic concepts of Searching
AI in game (II) 권태경 Fall, outline Problem-solving agent Search.
Carla P. Gomes CS4700 CS 4700: Foundations of Artificial Intelligence Prof. Carla P. Gomes Module: Search I (Reading R&N: Chapter.
1 Solving problems by searching 171, Class 2 Chapter 3.
Lecture 3: 18/4/1435 Searching for solutions. Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
An Introduction to Artificial Intelligence Lecture 3: Solving Problems by Sorting Ramin Halavati In which we look at how an agent.
SOLVING PROBLEMS BY SEARCHING Chapter 3 August 2008 Blind Search 1.
A General Introduction to Artificial Intelligence.
Artificial Intelligence
Problem Solving Agents
Solving problems by searching 1. Outline Problem formulation Example problems Basic search algorithms 2.
CPSC 420 – Artificial Intelligence Texas A & M University Lecture 3 Lecturer: Laurie webster II, M.S.S.E., M.S.E.e., M.S.BME, Ph.D., P.E.
Artificial Intelligence Lecture No. 6 Dr. Asad Ali Safi ​ Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.
Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Ch. 3 –Problem Solving Agents State space search –Programming Assignment Thursday.
© Copyright 2008 STI INNSBRUCK Intelligent Systems Problem Solving Methods – Lecture 7 Prof. Dieter Fensel (&
Solving problems by searching A I C h a p t e r 3.
G5AIAI Introduction to AI
1 Solving problems by searching Chapter 3. 2 Outline Problem types Example problems Assumptions in Basic Search State Implementation Tree search Example.
Lecture 2: Problem Solving using State Space Representation CS 271: Fall, 2008.
WEEK 5 LECTURE -A- 23/02/2012 lec 5a CSC 102 by Asma Tabouk Introduction 1 CSC AI Basic Search Strategies.
Chapter 3 Solving problems by searching. Search We will consider the problem of designing goal-based agents in observable, deterministic, discrete, known.
Solving problems by searching Chapter 3. Types of agents Reflex agent Consider how the world IS Choose action based on current percept Do not consider.
Solving problems by searching
More with Ch. 2 Ch. 3 Problem Solving Agents
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
ECE 448 Lecture 4: Search Intro
Problem Solving by Searching
Problem Solving as Search
Artificial Intelligence
Solving problems by searching
Solving problems by searching
Artificial Intelligence
EA C461 – Artificial Intelligence Problem Solving Agents
Solving problems by searching
Solving problems by searching
Solving problems by searching
Solving Problems by Searching
Solving Problems by Searching
Solving problems by searching
Presentation transcript:

Problem Solving What is AI way of solving problem?

2 Problem Solving CS 331 Dr M M Awais Example CAR BREAK DOWN

3 Problem Solving CS 331 Dr M M Awais Steps Analyze the problem Represent it Observe the present state Infer actions Solve to achieve the goal Development Phase Implementation Phase

4 Problem Solving CS 331 Dr M M Awais Analyze Identify possible states Identify possible actions Identify possible goals States, Actions, and Goals relate through rules Generate Rules that govern the problem/or are helpful in searching the goal

5 Problem Solving CS 331 Dr M M Awais Analyze: Car Break Down Possible States (that you can observe or measure): –Air fuel ratio –Temperature –Engine sound –Fuel Consumption

6 Problem Solving CS 331 Dr M M Awais Analyze: Goals Reduction in Fuel Consumption High Pickup Low Coolant Temperature High Air-Conditioning Efficiency etc…

7 Problem Solving CS 331 Dr M M Awais Analyze: Actions Change condenser Change carburetor Get wheel alignment Etc…

8 Problem Solving CS 331 Dr M M Awais Analyze: Rules If the air fuel (A/F) ratio is not correct (state observed)THEN Carburetor needs adjustment (action identified)WHICH Will achieve correct A/F ratio (Goal to be achieved)

9 Problem Solving CS 331 Dr M M Awais Represent Problem Convert the problem into a format that is understood by the computer system for automatic processing Numerous Techniques are available Propositional /Predicate Calculus (formal) Semantic / Conceptual Graphs (Graphical) Search Trees (Graph Theory) Rule Based/Expert Systems (Informal) Learning Methods (Statistical/Symbolic)

10 Problem Solving CS 331 Dr M M Awais Represent: Example IF the A/F ratio > 1.5 THEN change carburetor IF coolant temperature > 250 c THEN change condenser MATLAB, Prolog, C++, Lisp As the course progresses we will study more of these representational techniques

11 Problem Solving CS 331 Dr M M Awais Implementation Phase Observe: –Use sensors/stored information/user input to get the information about the present state within the problem domain. Infer: –Use above information to select appropriate actions that will lead to the goal. Achieve Goal: –Apply actions in sequence/parallel to achieve goal

12 Problem Solving CS 331 Dr M M Awais Problem types Deterministic, fully observable Partial Deterministic and observable –Partial knowledge of states and actions

13 Problem Solving CS 331 Dr M M Awais Problem types Deterministic, fully observable  single state problem –know exactly present state; –solution is a sequence of known actions.

14 Problem Solving CS 331 Dr M M Awais Problem types Partial knowledge of states and actions: Non-observable  sensorless or conformant problem May have no idea where one is; solution (if any) is a sequence. As if you are blind folded Nondeterministic and/or partially observable  contingency problem Percepts provide new information about current state solution is a tree or policy; often interleave search and execution. States, actions and Rules of the environment are known, but current state assessment is only possible after observation Unknown state space  exploration problem (“online”) –When states and actions of the environment are unknown.

15 Problem Solving CS 331 Dr M M Awais More Examples Path Finding 8 Puzzle Robot Assembly Primary FOCUS of discussion: How to Analyze a given problem?

16 Problem Solving CS 331 Dr M M Awais Example: Romania

17 Problem Solving CS 331 Dr M M Awais Example: Romania On holiday in Romania; currently in Arad –Flight leaves tomorrow from Bucharest Formulate goal –Be in Bucharest Formulate problem –States: various cities –Actions: drive between cities Find solution –Sequence of cities; e.g. Arad, Sibiu, Fagaras, Bucharest, … Identify Current State Identify Goal Analyze Solution

18 Problem Solving CS 331 Dr M M Awais Example: vacuum world Goal: Clean all the rooms Current State: 5 Single state, start in #5. Solution?? Possible Actions

19 Problem Solving CS 331 Dr M M Awais Example: vacuum world Single state, start in #5. Solution?? [Movement, clean action] [Right, Vacuum]

20 Problem Solving CS 331 Dr M M Awais Example: vacuum world Single state start in #5. Solution?? [Right, Vacuum] Sensorless: start in {1,2,3,4,5,6,7,8} Solution?? Contingency: start in {1,3}. Solution??

21 Problem Solving CS 331 Dr M M Awais Example: vacuum world States?? Initial state?? Actions?? Goal test?? Path cost??

22 Problem Solving CS 331 Dr M M Awais Example: vacuum world States?? two locations with or without dirt: 2 x 2 2 =8 states. Initial state?? Any state can be initial Actions?? {Left, Right, Vacuum} Goal test?? Check whether squares are clean. Cost?? Number of actions to reach goal.

23 Problem Solving CS 331 Dr M M Awais Example: 8-puzzle States?? Initial state?? Actions?? Goal test?? Path cost??

24 Problem Solving CS 331 Dr M M Awais Example: 8-puzzle States?? Integer location of each tile Initial state?? Any state can be initial Actions?? {Left, Right, Up, Down} Goal test?? Check whether goal configuration is reached Cost?? Number of actions to reach goal

25 Problem Solving CS 331 Dr M M Awais Example: 8-queens problem States?? Initial state?? Actions?? Goal test?? Cost??

26 Problem Solving CS 331 Dr M M Awais Example: 8-queens problem Incremental formulation vs. complete-state formulation States?? Initial state?? Actions?? Goal test?? Cost??

27 Problem Solving CS 331 Dr M M Awais Example: robot assembly States?? Initial state?? Actions?? Goal test?? Cost??

28 Problem Solving CS 331 Dr M M Awais Example: robot assembly States?? Real-valued coordinates of robot joint angles; parts of the object to be assembled. Initial state?? Any arm position and object configuration. Actions?? Continuous motion of robot joints Goal test?? Complete assembly (without robot) Cost?? Time to execute

29 Problem Solving CS 331 Dr M M Awais Summary Analyze: –States, Actions, Goals, Rules Represent: –Using any appropriate technique –Estimate the Cost factors (Time and Space Complexity) Implement: –Do actual coding/real world implementation –Validate and Test