Introduction to Artificial Intelligence Lecture 2: Perception & Action

Slides:



Advertisements
Similar presentations
Getting started with ML ML is a functional programming language. ML is statically typed: The types of literals, values, expressions and functions in a.
Advertisements

October 1, 2012Introduction to Artificial Intelligence Lecture 8: Search in State Spaces II 1 A General Backtracking Algorithm Let us say that we can formulate.
Artificial Intelligence Chapter 5 State Machines.
CPSC 322, Lecture 5Slide 1 Uninformed Search Computer Science cpsc322, Lecture 5 (Textbook Chpt 3.4) January, 14, 2009.
January 11, 2006AI: Chapter 2: Intelligent Agents1 Artificial Intelligence Chapter 2: Intelligent Agents Michael Scherger Department of Computer Science.
Search: Representation and General Search Procedure Jim Little UBC CS 322 – Search 1 September 10, 2014 Textbook § 3.0 –
Midterm Exam 2002 Midterm Exam Select one of the following four problems. Write LISP program and answer all associated theoretical questions. 2.
Behavior- Based Approaches Behavior- Based Approaches.
Copyright © Cengage Learning. All rights reserved. CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS THE LOGIC OF COMPOUND STATEMENTS.
UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Ch.2 [P]: Agent Architectures and Hierarchical.
Intelligent Agents: an Overview. 2 Definitions Rational behavior: to achieve a goal minimizing the cost and maximizing the satisfaction. Rational agent:
Computer Organization and Assembly Language: Chapter 7 The Karnaugh Maps September 30, 2013 By Engineer. Bilal Ahmad.
State-Space Searches.
September 10, 2012Introduction to Artificial Intelligence Lecture 2: Perception & Action 1 Boundary-following Robot Rules 1  2  3  4  5.
Positional Number Systems
CS231: Computer Architecture I Laxmikant Kale Fall 2004.
Artificial Intelligence Chapter 2 Stimulus-Response Agents
The Land Around Us An Introduction to Maps By: Mrs. Miles.
Boolean Algebra – the ‘Lingua Franca’ of the Digital World The goal of developing an automata is based on the following (loosely described) ‘ideal’: if.
Artificial Intelligence Lecture 8. Outline Computer Vision Robots Grid-Space Perception and Action Immediate Perception Action Robot’s Perception Task.
Java Software Solutions Lewis and Loftus Chapter 10 1 Copyright 1997 by John Lewis and William Loftus. All rights reserved. Graphical User Interfaces --
1 CO Games Development 1 Week 6 Introduction To Pathfinding + Crash and Turn + Breadth-first Search Gareth Bellaby.
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
Data manipulation, Part one Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas Faculty of Information.
1 Discretizing The Concentration Equation Mike Grimm Math 1110 March 11, 2002.
Karel the Robot A Gentle Introduction to the Art of Programming.
CSC 423 ARTIFICIAL INTELLIGENCE Intelligence Agents.
Artificial Intelligence Intro Agents
An Instructable Connectionist/Control Architecture: Using Rule-Based Instructions to Accomplish Connectionist Learning in a Human Time Scale Presented.
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.
CE Operating Systems Lecture 21 Operating Systems Protection with examples from Linux & Windows.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
Introduction of Intelligent Agents
INTELLIGENT AGENTS. Agents  An agent is anything that can be viewed as perceiving its environment through sensors and acting upon that environment through.
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2007.
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2004.
Lecture 3 Fuzzy sets. 1.1 Sets Elements of sets An universal set X is defined in the universe of discourse and it includes all possible elements.
Chapter 14: Protection Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Apr 11, 2005 Chapter 14: Protection Goals.
Playing Tic-Tac-Toe with Neural Networks
ECE DIGITAL LOGIC LECTURE 15: COMBINATIONAL CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 10/20/2015.
February 9, 2016Introduction to Artificial Intelligence Lecture 5: Perception & Action 1 Frege Notes In order to use many of the Java math functions in.
Chapter 12 Theory of Computation Introduction to CS 1 st Semester, 2014 Sanghyun Park.
Artificial Intelligence Chapter 7 Agents That Plan Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Advanced Tables. Spanning Columns and Rows: So far, our tables have been relatively simple, with a uniform grid of rows and columns: XHTML allows us to.
April 5, 2016Introduction to Artificial Intelligence Lecture 17: Neural Network Paradigms II 1 Capabilities of Threshold Neurons By choosing appropriate.
The Agent and Environment Presented By:sadaf Gulfam Roll No:15156 Section: E.
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
State Machines Chapter 5.
Constraint Satisfaction Problems vs. Finite State Problems
Artificial Intelligence Lecture No. 5
Chap 7. Building Java Graphical User Interfaces
Graphical User Interfaces -- Introduction
Karnaugh Maps Topics covered in this presentation: Karnaugh Maps
Quantum One.
Artificial Intelligence Chapter 2 Stimulus-Response Agents
Artificial Intelligence
Matrices and Matrix Operations
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
Pattern Matching Pattern matching allows us to do things like this:
The Alpha-Beta Procedure
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.
Artificial Intelligence Chapter 7 Agents That Plan
Copyright © Cengage Learning. All rights reserved.
State-Space Searches.
State-Space Searches.
TOPIC: - GRID REFERENCE
Midterm Exam Select one of the following four problems. Write LISP program and answer all associated theoretical questions. 2. For Lisp program,
State-Space Searches.
Logical Agents Prof. Dr. Widodo Budiharto 2018
Presentation transcript:

Introduction to Artificial Intelligence Lecture 2: Perception & Action Perception and Action Organisms in the real world have to do two basic things in order to survive: They have to gather information about their environment (perception) and based on this information, they have to manipulate their environment (including themselves) in a way that is advantageous to them (action). The action in turn may cause a change in the organism’s perception, which can lead to a different type of action. We call this the perception-action cycle. September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Introduction to Artificial Intelligence Lecture 2: Perception & Action Perception and Action Complex organisms do not just perceive and act, but they also have an internal state that changes based on the success of previous perception-action cycles. This is the mechanism of learning. Examples? With or without internal state? What is the difference? September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

A Trip (From Real World) to Grid-Space World Grid-space world is an extremely simple model of our own world. We will first consider a very simple robot that lives in grid-space world and has no internal state. s1 s2 s3 s8 s4 s7 s6 s5

Some Rules in Grid-Space World A robot in grid-space world can sense whether neighboring cells are empty or not. The cells can be empty or contain objects or agents. The agents are confined to the floor and can move from cell to cell. September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Introduction to Artificial Intelligence Lecture 2: Perception & Action Perception and Action The robot can move to a free adjacent cell in its column or row. Consequently, there are four possible actions that it can take: north: moves the robot one cell up east: moves the robot one cell to the right south: moves the robot one cell down west: moves the robot one cell to the left September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Immediate Perception-Action Now that we specified the robot’s capabilities, its environment, and its task, we need to give “life” to the robot. In other words, we have to specify a function that maps sensory inputs to movement actions so that the robot will carry out its task. Since we do not want the robot to remember or learn anything, one such function would be sufficient. However, it is useful to decompose it in the following way (next slide): September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Immediate Perception-Action Feature vector X 1 … Sensory input Perceptual processing Action function Action September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Immediate Perception-Action The functional decomposition has two advantages: Multiple action functions can be added that receive the same feature vector as their input, It is possible to add an internal state to the system to implement memory and learning. September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

The Robot’s Perception For our robot, we define four different features x1, …, x4 that are important to it. Each feature has value 1 if and only if at least one of the shaded cells is not free: s5 s6 s7 s4 s8 s3 s2 s1 x1 s5 s6 s7 s4 s8 s3 s2 s1 x2 s5 s6 s7 s4 s8 s3 s2 s1 x3 s5 s6 s7 s4 s8 s3 s2 s1 x4 September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Introduction to Artificial Intelligence Lecture 2: Perception & Action The Robot’s Action To execute action, we define an ordered set of rules: if x1 = 0 and x2 = 0 and x3 = 0 and x4 = 0 move north if x1 = 1 and x2 = 0 move east if x2 = 1 and x3 = 0 move south if x3 = 1 and x4 = 0 move west if x4 = 1 and x1 = 0 move north s5 s6 s7 s4 s8 s3 s2 s1 x1 s5 s6 s7 s4 s8 s3 s2 s1 x2 s5 s6 s7 s4 s8 s3 s2 s1 x3 s5 s6 s7 s4 s8 s3 s2 s1 x4 September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Introduction to Artificial Intelligence Lecture 2: Perception & Action Task Completion Rules 1 2 1 1 3 1 3  2 4 4 4 4 4 4 4 5 1 3 3 5 1 3 2 2 2  3 3 5 2 5 1 3 3 5 3 5 1 4 4 4 3 3 2 1 3 2 2 2 1 3  4 4 4 5 3 5 3  5 4 4 3 September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Introduction to Artificial Intelligence Lecture 2: Perception & Action Perception and Action The robot is supposed to find a cell next to a boundary or object and then follow that boundary forever. s1 s2 s3 s8 s4 s7 s6 s5 September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Introduction to Artificial Intelligence Lecture 2: Perception & Action Production Systems Production systems are a standardized way to represent action functions. A production system consists of an ordered list of production rules (productions). Each rule is written in the form condition  action. A production system is therefore written like: c1  a1 c2  a2  cm  am The action of the first rule whose condition evaluates to 1 is executed. September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action

Introduction to Artificial Intelligence Lecture 2: Perception & Action Production Systems Using Boolean notation, the production system for our boundary-following robot looks like this: x4x1  north x3x4  west x2x3  south x1x2  east 1 north September 10, 2012 Introduction to Artificial Intelligence Lecture 2: Perception & Action