Chapter 13: Artificial Intelligence Chapter 13 Artificial Intelligence Page 139 Computations that make it possible for a machine to perceive, reason,

Slides:



Advertisements
Similar presentations
Artificial Intelligence
Advertisements

Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Information and Software Technology Option: Artificial intelligence, simulation and modelling.
Chapter 09 AI techniques in different game genres (Puzzle/Card/Shooting)
Information and Software Technology
Programming Types of Testing.
Artificial Intelligence
1 Lecture 35 Brief Introduction to Main AI Areas (cont’d) Overview  Lecture Objective: Present the General Ideas on the AI Branches Below  Introduction.
Chapter 4 DECISION SUPPORT AND ARTIFICIAL INTELLIGENCE
Artificial Intelligence
1 Lecture 33 Introduction to Artificial Intelligence (AI) Overview  Lecture Objectives.  Introduction to AI.  The Turing Test for Intelligence.  Main.
Marakas: Decision Support Systems, 2nd Edition © 2003, Prentice-Hall Chapter Chapter 7: Expert Systems and Artificial Intelligence Decision Support.
Chapter 12: Intelligent Systems in Business
CAPTCHA Prabhakar Verma “08MC30”.
Business Driven Technology Unit 3 Streamlining Business Operations Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution.
Artificial Intelligence
3.11 Robotics, artificial intelligence and expert systems Strand 3 Karley Holland.
Unit 3a Industrial Control Systems
Artificial Intelligence
Fundamentals of Python: From First Programs Through Data Structures
Your Interactive Guide to the Digital World Discovering Computers 2012.
Artificial Intelligence By Ryan Shoultes & Jeremy Creighton.
Succeeding with Technology Information, Decision Support… Decision Making and Problem Solving Management Information Systems Decision Support Systems Group.
Knowledge Base approach for spoken digit recognition Vijetha Periyavaram.
Invitation to Computer Science 5th Edition
Chapter 10 Artificial Intelligence. © 2005 Pearson Addison-Wesley. All rights reserved 10-2 Chapter 10: Artificial Intelligence 10.1 Intelligence and.
Artificial Intelligence (AI) Can Machines Think?.
11 C H A P T E R Artificial Intelligence and Expert Systems.
Artificial Intelligence Introductory Lecture Jennifer J. Burg Department of Mathematics and Computer Science.
Artificial Intelligence
Copyright © 2006, The McGraw-Hill Companies, Inc. All rights reserved. Decision Support Systems Chapter 10.
© 2001 Business & Information Systems 2/e1 Chapter 8 Personal Productivity and Problem Solving.
Fundamentals of Information Systems, Third Edition2 Principles and Learning Objectives Artificial intelligence systems form a broad and diverse set of.
Multimedia and Artificial Intelligence Chapter 12 – Computers: Understanding Technology (Second edition)
Chapter 11 Artificial Intelligence Introduction to CS 1 st Semester, 2015 Sanghyun Park.
Artificial Intelligence By Michelle Witcofsky And Evan Flanagan.
James Tam Introduction To Computer Science In this section you will get an overview of some areas of Computer Science.
How Solvable Is Intelligence? A brief introduction to AI Dr. Richard Fox Department of Computer Science Northern Kentucky University.
I Robot.
Section 2.3 I, Robot Mind as Software McGraw-Hill © 2013 McGraw-Hill Companies. All Rights Reserved.

Introduction to Artificial Intelligence CS 438 Spring 2008 Today –AIMA, Chapter 1 –Defining AI Next Tuesday –Intelligent Agents –AIMA, Chapter 2 –HW: Problem.
AUDIT SOFTWARE Chapter 16. Generalized Audit Software Off-the-shelf software that provides a means to gain access to and manipulate data maintained on.
1 RoboticsPresents KaaShiv InfoTech For Inplant Training / Internship, please download the "Inplant training registration form" from our website
Playing Tic-Tac-Toe with Neural Networks
ITEC 1010 Information and Organizations Chapter V Expert Systems.
ARTIFICIAL INTELLIGENCE include people, procedures, hardware, software, data and knowledge needed to develop computer systems and machines that demonstrated.
Intelligent Control Methods Lecture 2: Artificial Intelligence Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Artificial Intelligence, simulation and modelling.
Uses and Limitations Fall 2013 COMP3710 Artificial Intelligence Computing Science Thompson Rivers University.
Chapter 13 Artificial Intelligence. Artificial Intelligence – Figure 13.1 The Turing Test.
Overview of Artificial Intelligence (1) Artificial intelligence (AI) Computers with the ability to mimic or duplicate the functions of the human brain.
Game programming 1.
Collision Theory and Logic
Artificial Intelligence Chapter 11 – Artificial Intelligence
Artificial intelligence (AI)
Collision Theory and Logic
Introduction Characteristics Advantages Limitations
PART IV: The Potential of Algorithmic Machines.
COMP3710 Artificial Intelligence Thompson Rivers University
ARTIFICIAL INTELLIGENCE.
Artificial Intelligence and Expert Systems
Course Instructor: knza ch
Introduction to Computers
TA : Mubarakah Otbi, Duaa al Ofi , Huda al Hakami
COMP3710 Artificial Intelligence Thompson Rivers University
Introduction to Computers
Artificial Intelligence
Chapter 12: Building Situated Robots
Chapter 4: Writing and Designing a Complete Program
Presentation transcript:

Chapter 13: Artificial Intelligence Chapter 13 Artificial Intelligence Page 139 Computations that make it possible for a machine to perceive, reason, and act in a manner consistent with human behavior form the field known as artificial intelligence. The Turing Test A human questioner inputs questions and guesses which respondent is human, based on the answers given. If the questioner cannot tell which respondent is human, the software passes the test.

Computer Reasoning Chapter 13 Artificial Intelligence Page 140 To simulate logical reasoning, heuristic functions are often used. A heuristic is an artificial measure of how close the computer’s current status is to its problem-solving goal. In the tic-tac-toe example above, when the computer is ready to make an X-move, it uses the heuristic max{F(config), where config can be the result of any O-move}. F(config) = (# of completable rows, columns, and diagonals for X-player) – (# of completable rows, columns, and diagonals for O-player) if config is a non-winning configuration  if config is an X-win ---- if config is an O-win OO X X XOO X X XOO OX X XOO X XO XOO X XO XOO XO X 2-1=13-1=22-1=13-1=2 OO XX X OOO XX X OO XX XO OO XX XO OO XXO X -- 3-2=12-2=03-2=1 OO X XX OOO X XX OO OX XX OO X XXO OO XO XX -- 2-2=0 3-2=1 OO XX X OOO XX X OO OXX X OO XX XO OO XX XO -- 2-1=1 OO X XX OOO X XX OO OX XX OO X XOX OO XO XX -- 3-1=2 1 -- -- -- --

Expert Systems Chapter 13 Artificial Intelligence Page 141 By programming a computer with the assistance of experts in a particular field, an expert system can be developed to perform very specialized tasks. Users in need of expert assistance complete on-line questionnaires and the expert system analyzes their responses and assigns probabilities to various diagnoses.

Neural Networks Chapter 13 Artificial Intelligence Page 142 To simulate learning, certain multiprocessor systems, called neural networks, have been built to “learn” to recognize particular patterns as correct or incorrect, based upon a trial-and-error process. In the example below, a neural network is used to teach a computerized system how to back a truck up to a loading dock. The physical characteristics of the truck are programmed, with the relationship between the steering wheel, the tires, the cab, and the trailer formally calculated. Starting at some initial position, the truck is backed up one meter at a time, with programmed steering; the error in the result is measured and factored into the next attempt, until the error is zero.

Natural Language Processing Chapter 13 Artificial Intelligence Page 143 Written Comprehension: How can a computer be programmed to grasp the syntax and semantics of a natural language? John saw the boy in the park with the telescope. Question: Whose telescope is it? Answer: John’s John saw the boy in the park with the puppy. Question: Whose puppy is it? Answer: The boy’s John saw the boy in the park with the statue. Question: Whose statue is it? Answer: The park’s

Speech Recognition Chapter 13 Artificial Intelligence Page The PC sound card converts analog sound waves spoken into a microphone into a digital format. 2.A software acoustical model breaks the word into phonemes “K” “AH” “M” “P” “Y” “OO” “T” 3.A software language model compares the phonemes to words in its dictionary. “K”“AH”“M”“P”“Y”“OO”“T” CALM COMMA COMPARE COMPETE COMPLETE COMPUTE 4.Once the software decides on the most likely candidate, it displays that word. COMPUTE

Robotics Chapter 13 Artificial Intelligence Page 145 Robots are programmable devices capable of manipulating objects and performing tasks much like humans are able to do. One of the more difficult problems when programming a robot is determining when it is about to collide with something, when it has collided with something, and what to do in response to a collision. Collision Avoidance Use scanners to determine the robot’s proximity to other objects, redirecting the robot when a collision is imminent. Collision Detection Use sensors at strategically located places on the robot to determine if a collision occurs. Collision Reaction Go around? Climb over? Bounce back? Run away? Drop dead?

Robot Challenges Chapter 13 Artificial Intelligence Page 146 Other common human actions that are difficult to program include propelled locomotion and manual manipulation. Walking Gait How can a robot be programmed to propel itself forward on “legs” and still maintain its balance? Grasping How can a robot be programmed to grasp part of a stack of objects, without toppling the rest of the stack?

AI in Games Chapter 13 Artificial Intelligence Page 147 Non-player characters in games need to appear intelligent, even though they are controlled by the game program instead of by a game player. Flocking By providing a group of characters with simple goals and behaviors, a “mob mentality” can be implemented with a minimum of code. Dead Reckoning By having a game-driven predator character react to the anticipated position of its player-driven prey (using the prey’s current position and velocity), a chase can appear more realistic.