Artificial Intelligence

Slides:



Advertisements
Similar presentations
Presentation on Artificial Intelligence
Advertisements

Problem Solving Well-formed predicate calculus expressions provide a means of describing objects and relations in a problem domain and inference rule.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture– 4, 5, 6: A* properties 9 th,10 th and 12 th January,
Formal Description of a Problem
SEARCH ALGORITHMS David Kauchak CS30 – Spring 2015.
SEARCH APPLICATIONS David Kauchak CS30 – Spring 2015.
A RTIFICIAL I NTELLIGENCE Problem-Solving Solving problems by searching.
Artificial Intelligence Problem solving by searching CSC 361
Problem Solving What is AI way of solving problem?
State-Space Searches. State spaces A state space consists of –A (possibly infinite) set of states The start state represents the initial problem Each.
Artificial Intelligence
Toy Problem: Missionaries and Cannibals
Problem solving by Searching Problem Formulation.
Intelligent agents Intelligent agents are supposed to act in such a way that the environment goes through a sequence of states that maximizes the performance.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–1: Introduction 2 nd January
1 Solving Problems by Searching. 2 Terminology State State Space Initial State Goal Test Action Step Cost Path Cost State Change Function State-Space.
Conventional AI Machine Learning Techniques Environmental Mapping Case Statements Statistical Analysis Computational Intelligence Pattern Recognition.
Intelligent agents Intelligent agents are supposed to act in such a way that the environment goes through a sequence of states that maximizes the performance.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–2,3: A* 3 rd and 5 th January, 2012.
Artificial Intelligence Problem solving by searching CSC 361 Prof. Mohamed Batouche Computer Science Department CCIS – King Saud University Riyadh, Saudi.
CS344: Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search.
State-Space Searches.
Copyright R. Weber Search in Problem Solving Search in Problem Solving INFO 629 Dr. R. Weber.
CS344 : Introduction to Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 1 - Introduction.
1 State Space of a Problem Lecture 03 ITS033 – Programming & Algorithms Asst. Prof.
Formal Description of a Problem In AI, we will formally define a problem as –a space of all possible configurations where each configuration is called.
Knowledge and search, page 1 CSI 4106, Winter 2005 Knowledge and search Points Properties of knowledge  Completeness  Objectivity  Certainty  Formalizability.
CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 15/Jan/2007.
State-Space Searches. 2 State spaces A state space consists of A (possibly infinite) set of states The start state represents the initial problem Each.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–1: Introduction.
CS344: Introduction to Artificial Intelligence (associated lab: CS386)
Problem solving by search Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
PROBLEM SOLVING – BASIC SEARCH METHODS 12/8/2015Dr. Sunil Kumar 1.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 3 - Search.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture–2: Introduction: Search+Logic.
CS621 : Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 2 - Search.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 1 - Introduction.
Knowledge Representation Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 13– Search 17 th August, 2010.
Search as a problem solving technique. Consider an AI program that is capable of formulating a desired goal based on the analysis of the current world.
CS344: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 1 to 8– Introduction, Search, A* (has the associated lab course: CS386)
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.
CS621: Artificial Intelligence Pushpak Bhattacharyya CSE Dept., IIT Bombay Lecture 3: Search, A*
Biointelligence Lab School of Computer Sci. & Eng. Seoul National University Artificial Intelligence Chapter 8 Uninformed Search.
Knowledge Representation
5 Day Forecast Mon Tues Wed Thu Fri.
Problem solving by Searching
CS 621 Artificial Intelligence Lecture 1 – 28/07/05
Introduction to Artificial Intelligence
David Kauchak CS30 – Spring 2016
Some problems Cse-402 K3r20,k3r23.
CS344: Artificial Intelligence
CS 2710, ISSP 2160 Foundations of Artificial Intelligence
Some problems Cse-402 K3r20,k3r23.
Haskell Tips You can turn any function that takes two inputs into an infix operator: mod 7 3 is the same as 7 `mod` 3 takeWhile returns all initial.
CS621: Artificial Intelligence
CS621: Artificial Intelligence
Sun Mon Tue Wed Thu Fri Sat
Knowledge Representation
Sun Mon Tue Wed Thu Fri Sat
State-Space Searches.
State-Space Searches.
CS621: Artificial Intelligence
Sun Mon Tue Wed Thu Fri Sat
David Kauchak CS51A – Spring 2019
State-Space Searches.
Artificial Intelligence
Presentation transcript:

Artificial Intelligence CS 344 Artificial Intelligence By Prof: Pushpak Bhattacharya Class on 17/Jan/2007

Search building blocks State Space : Graph of states (Express constraints and parameters of the problem) Operators : Transformations applied to the states. Start state : S0 (Search starts from here) Goal state : {G} - Search terminates here. Cost : Effort involved in using an operator. Optimal path : Least cost path

Examples Problem 1 : 8 – puzzle 4 3 6 1 2 3 2 1 8 4 5 6 5 7 7 8 S0 G Tile movement represented as the movement of the blank space. Operators: L : Blank moves left R : Blank moves right U : Blank moves up D : Blank moves down C(L) = C(R) = C(U) = C(D) = 1

Problem 2: Missionaries and Cannibals boat River boat L Missionaries Cannibals Missionaries Cannibals Constraints The boat can carry at most 2 people On no bank should the cannibals outnumber the missionaries

State : <#M, #C, P> #M = Number of missionaries on bank L #C = Number of cannibals on bank L P = Position of the boat S0 = <3, 3, L> G = < 0, 0, R > Operations M2 = Two missionaries take boat M1 = One missionary takes boat C2 = Two cannibals take boat C1 = One cannibal takes boat MC = One missionary and one cannibal takes boat

<3,3,L> <3,1,R> <2,2,R> <3,3,L> C2 MC <3,1,R> <2,2,R> <3,3,L> Partial search tree

All the three problems mentioned above are to be solved using A* W W W G: States where no B is to the left of any W Operators: 1) A tile jumps over another tile into a blank tile with cost 2 2) A tile translates into a blank space with cost 1 All the three problems mentioned above are to be solved using A*

Where is AI coming into picture in all these!! AI involves search of state space Vision NLP Search Reasoning Learning Knowledge Robotics Expert Systems Planning

Computer Vision Left retina Right retina Problem: Find the corresponding cells in the two retinae; this is a search problem. This information is used for identifying the depth of objects and forming the 3D picture of objects

Robotic Planning C A B B A C Problem: What sequence of arm moves should be followed to reach a particular configuration; again a search problem.

NLP Search needed amongst possibilities to arrive at the right meaning. e.g: “The camera man shot the batsman when he was near the chairman of the selection committee” Different meanings for this sentence. These are to be inferred 1) Who is near chairman 2) Meaning of shot 3) ..... 4) ..... ...... There can be 14 different meanings for the sentence above. Which one to choose as the actual meaning? Another example: “Time flies like an arrow”

Machine Learning Mon Tue Wed Thu Fri R1 R2 R3 R4 Eating at corresponding restaurant on that day caused stomach problem Problem: Infer a hypothesis which generalizes the properties of restaurants on different days, in terms of causing stomach problems