Artificial Intelligence Lecture 8. Outline Computer Vision Robots Grid-Space Perception and Action Immediate Perception Action Robot’s Perception Task.

Slides:



Advertisements
Similar presentations
Additional Topics ARTIFICIAL INTELLIGENCE
Advertisements

Artificial Intelligence Chapter 5 State Machines.
Introduction to Robotics In the name of Allah. Introduction to Robotics o Leila Sharif o o Lecture #2: The Big.
Movement. Fixed Movement setLocation (x, y) Makes the crab move to a fixed cell x,y Relative Movement The functions: getX() getY() Fetch the x and y coordinate.
ECE 7340: Building Intelligent Robots QUALITATIVE NAVIGATION FOR MOBILE ROBOTS Tod S. Levitt Daryl T. Lawton Presented by: Aniket Samant.
James Tam Introduction To Problem Solving This section will focus on problem solving strategies.
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.
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:
Behaviour Based approaches to robotics Jeremy Wyatt School of Computer Science University of Birmingham.
Raster and Vector 2 Major GIS Data Models. Raster and Vector 2 Major GIS Data Models.
Computer Organization and Assembly Language: Chapter 7 The Karnaugh Maps September 30, 2013 By Engineer. Bilal Ahmad.
Introduction to Artificial Intelligence Lecture 2: Perception & Action
Spatial data models (types)
September 10, 2012Introduction to Artificial Intelligence Lecture 2: Perception & Action 1 Boundary-following Robot Rules 1  2  3  4  5.
Artificial Intelligence Dr. Paul Wagner Department of Computer Science University of Wisconsin – Eau Claire.
Artificial Intelligence Chapter 2 Stimulus-Response Agents
The Land Around Us An Introduction to Maps By: Mrs. Miles.
Robotica Lecture 3. 2 Robot Control Robot control is the mean by which the sensing and action of a robot are coordinated The infinitely many possible.
Complete Coverage Path Planning Based on Ant Colony Algorithm International conference on Mechatronics and Machine Vision in Practice, p.p , Dec.
 The most intelligent device - “Human Brain”.  The machine that revolutionized the whole world – “computer”.  Inefficiencies of the computer has lead.
Distance. Euclidean Distance Minimum distance from a source (Value NoData) Input grid must have at least one source cell with the rest of the grid.
Chapter 4 MOTION.
Karel the Robot A Gentle Introduction to the Art of Programming.
Robotica Lecture 3. 2 Robot Control Robot control is the mean by which the sensing and action of a robot are coordinated The infinitely many possible.
An Instructable Connectionist/Control Architecture: Using Rule-Based Instructions to Accomplish Connectionist Learning in a Human Time Scale Presented.
EKT 221/4 DIGITAL ELECTRONICS II  Registers, Micro-operations and Implementations - Part3.
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.
Chapter Four: Motion  4.1 Position, Speed and Velocity  4.2 Graphs of Motion  4.3 Acceleration.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
Week 2-1: Human Information Processing
Introduction of Intelligent Agents
So, what’s the “point” to all of this?….
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2007.
Rational Agency CSMC Introduction to Artificial Intelligence January 8, 2004.
Playing Tic-Tac-Toe with Neural Networks
For Programming Challenge N. H. N. D. de Silva. Introduction General Game Architecture Server Architecture Joining the game Game initiation Moving and.
February 9, 2016Introduction to Artificial Intelligence Lecture 5: Perception & Action 1 Frege Notes In order to use many of the Java math functions in.
CPSC 420 – Artificial Intelligence Texas A & M University Lecture 2 Lecturer: Laurie webster II, M.S.S.E., M.S.E.e., M.S.BME, Ph.D., P.E.
Intelligent Agents Chapter 2. How do you design an intelligent agent? Definition: An intelligent agent perceives its environment via sensors and acts.
Cupid Shuffle.  Everyone find a line on the floor and face the stage.  Now put your arms stretched out to your sides, you should not be able to touch.
Motion and Force Chapter Three: Motion 3.1 Position and Velocity 3.2 Graphs of Motion 3.3 Acceleration.
Artificial Intelligence Chapter 7 Agents That Plan Biointelligence Lab School of Computer Sci. & Eng. Seoul National University.
Computer Systems Architecture Edited by Original lecture by Ian Sunley Areas: Computer users Basic topics What is a computer?
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.
Artificial Intelligence
March 1, 2016Introduction to Artificial Intelligence Lecture 11: Machine Evolution 1 Let’s look at… Machine Evolution.
CHAPTER 1 Introduction BIC 3337 EXPERT SYSTEM.
State Machines Chapter 5.
Constraint Satisfaction Problems vs. Finite State Problems
Chapter Four: Motion 4.1 Position, Speed and Velocity
Artificial Intelligence Lecture No. 5
Intelligent Agents Chapter 2.
MOTION.
Hong Cheng SEG4560 Computational Intelligence for Decision Making Chapter 2: Intelligent Agents Hong Cheng
MANAGING KNOWLEDGE FOR THE DIGITAL FIRM
Artificial Intelligence Chapter 2 Stimulus-Response Agents
Motion and Force. Motion and Force Chapter Three: Motion 3.1 Position and Velocity 3.2 Graphs of Motion 3.3 Acceleration.
Motion and Force. Motion and Force Chapter Twelve: Distance, Time, and Speed 12.1 Distance, Direction, and Position 12.2 Speed 12.3 Graphs of Motion.
Introduction to Artificial Intelligence Lecture 11: Machine Evolution
Pattern Matching Pattern matching allows us to do things like this:
Motion and Force. Motion and Force Chapter Three: Motion 3.1 Position and Velocity 3.2 Graphs of Motion 3.3 Acceleration.
Lecture 21 Logistics Last lecture Today HW7 due Wednesday
Chapter Four: Motion 4.1 Position, Speed and Velocity
Motion and Force. Motion and Force Chapter Three: Motion 3.1 Position and Velocity 3.2 Graphs of Motion 3.3 Acceleration.
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,
Logical Agents Prof. Dr. Widodo Budiharto 2018
Presentation transcript:

Artificial Intelligence Lecture 8

Outline Computer Vision Robots Grid-Space Perception and Action Immediate Perception Action Robot’s Perception Task Completion Production System Networks

Computer Vision

Robots (Current Stage) built by humans coordinated body movements little learning capabilities no real social interaction or language no consciousness or self-awareness

A Trip to Grid-Space World Grid-space world is an extremely simple model of our own world. It is a three-dimensional space with a floor that is divided into cells by a two-dimensional grid. The cells can be empty or contain objects or agents. There can be walls between sets of cells. The agents are confined to the floor and can move from cell to cell. A robot in grid-space world can sense whether neighboring cells are empty or not.

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.

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. We will first consider a very simple robot that lives in grid-space world and has no internal state. The grid has no tight spaces, that is, spaces between objects and boundaries are only one cell wide.

Perception and Action The robot is supposed to find a cell next to a boundary or object and then follow that boundary forever. As we said, the robot can perceive the state of its neighboring cells: s1s1 s2s2 s3s3 s8s8 s4s4 s7s7 s6s6 s5s5

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

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):

Immediate Perception-Action … … … 1 Action function Sensory input Action Feature vector X Perceptual processing

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.

The Robot’s Perception For our robot, we define four different features x 1, …, x 4 that are important to it. Each feature has value 1 if and only if at least one of the shaded cells is not free: s 5 s 6 s 7 s 4 s 8 s 3 s 2 s 1 x1x1x1x1 s 5 s 6 s 7 s 4 s 8 s 3 s 2 s 1 x2x2x2x2 s 5 s 6 s 7 s 4 s 8 s 3 s 2 s 1 x3x3x3x3 s 5 s 6 s 7 s 4 s 8 s 3 s 2 s 1 x4x4x4x4

The Robot’s Action To execute action, we define an ordered set of rules: if x 1 = 0 and x 2 = 0 and x 3 = 0 and x 4 = 0 move north if x 1 = 1 and x 2 = 0 move east if x 2 = 1 and x 3 = 0 move south if x 3 = 1 and x 4 = 0 move west if x 4 = 1 and x 1 = 0 move north s 5 s 6 s 7 s 4 s 8 s 3 s 2 s 1 x1x1x1x1 s 5 s 6 s 7 s 4 s 8 s 3 s 2 s 1 x2x2x2x2 s 5 s 6 s 7 s 4 s 8 s 3 s 2 s 1 x3x3x3x3 s 5 s 6 s 7 s 4 s 8 s 3 s 2 s 1 x4x4x4x4

Task Completion Rules 1  2  3  4  5

Questions & Answers ???????