2015-8-26 EIE426-AICV 1 Introduction to Artificial Intelligence Filename: eie426-intro-0809.ppt.
-
Upload
abigayle-kelley -
Category
Documents
-
view
217 -
download
0
Transcript of 2015-8-26 EIE426-AICV 1 Introduction to Artificial Intelligence Filename: eie426-intro-0809.ppt.
23/4/19 EIE426-AICV 2
Contents
A typical definition of Artificial Intelligence (AI)
The Turing test
AI applications
Topics Covered by AI
Basic knowledge representation schemes
Basic problem solving paradigms
Brief history of AI
The State of the Art
23/4/19 EIE426-AICV 3
What is AI?
The development of theories and techniques required to provide a computational engine the abilities to perceive, think and act, in an intelligent matter, in a complex environment.
Systems that think like humans Systems that think rationally
Systems that act like humans Systems that act rationally
23/4/19 EIE426-AICV 4
Engineering Goal: to solve real-world problems using AI ideas about representing knowledge, using knowledge, and assembling systems.
Scientific Goal: to determine which ideas about representing knowledge, using knowledge, and assembling systems explains various sorts of intelligence.
Artificialintelligence
Computer science and engineering
psychologypsychology
What is AI? (cont.)
23/4/19 EIE426-AICV 5
The Turing Test
Computing machinery and intelligence, Turing 1950 “Can machines think?” “Can machines behave
intelligently?” Operational test for intelligent behavior: the Imitation Game
23/4/19 EIE426-AICV 6
The Turing Test (cont.)
The Turing test measures the performance of an allegedly intelligent machine against that of a human being.
Three important features of the test:1. An objective notion of intelligence2. Preventing us from being sidetracked by confusing and
currently unanswerable questions3. Eliminating any bias in favor of living organisms
The problem: Turing test is not reproducible, constructive, or amenable to mathematical analysis.
Some Turing Test Questions “What is the meaning of life?” “Why is the sky blue?” “How are you?” “Is OJ guilty?” “Which came first, the chicken or the egg?” “What word rhymes with Orange?” “What is love?” and “How does love feel?” “Boxers or briefs?” “Who is your best friend?” “Do you prefer open minds or only open preferred minds?” “Please respond only when I say 'Simon Says'.” “Do you think that I should undergo an operation to remove my brain and
install a computer in my head?” “Tell me about your childhood.” “How are you feeling today?” “When were you born?”
23/4/19 EIE426-AICV 7
23/4/19 EIE426-AICV 8
AI Applications
Perception Vision Speech
Natural language Understanding Generation Translation
Commonsense reasoning Robot control (http://www.cs.rochester.edu/u/jag/demos/demos.html)
Mundane Tasks
demo
23/4/19 EIE426-AICV 9
Games Chess Backgammon Checkers Go
Mathematics Geometry Logic Integral calculus Proving properties of programs
Formal Tasks
AI Applications (cont.)
23/4/19 EIE426-AICV 10
Engineering Design Fault finding Manufacturing planning
Scientific analysis Medical diagnosis Financial analysis
Expert Tasks
AI Applications (cont.)
23/4/19 EIE426-AICV 11
Example: Airport Resource Information System
Arrange gates for flights considering the seat capacity, time to take off, connected flights, weather condition, emergent factors, etc.
23/4/19 EIE426-AICV 12
Topics Covered by AI search and game-playing (√) logical systems knowledge (expert) systems (√) planning systems (√) uncertainty - probability and decision theory machine learning (√) computational intelligence
- artificial neural networks (ANN’s)
- fuzzy systems (FS’s), and
- evolutionary algorithms (EA’s) (√) natural language processing (NLP) (√) perception (√) robotics (√) philosophical issues (√)
√: to be taught
23/4/19 EIE426-AICV 13
Relationships among various topics
Search
Vision
PlanningMachine Learning
Knowledge RepresentationLogic
Expert SystemsRoboticsNLP
23/4/19 EIE426-AICV 14
Semantics nets (a subset: frames) √ Predicate logic Production rules √
A representation is a set of conventions about how to describe a class of things. A description makes use of the conventions of a representation to describe some particular thing.
Representation Techniques:
Knowledge Representation
23/4/19 EIE426-AICV 15
Example: The Farmer, Fox, Goose, and Grain
A farmer wants to move himself, a silver fox, a fat goose, and some tasty grain across a river. Unfortunately, his boat is so tiny he can take only one of his possessions across on any trip. Worse yet, an unattended fox will eat a goose, and an unattended goose will eat grain, so the farmer must not leave the fox alone with the goose or the goose alone with the grain. How can he do?
23/4/19 EIE426-AICV 17
Powerful Idea:
A lexical part - vocabulary A structural part - constraints A procedural part - access procedures A semantic part - meaning
Once a problem is described using an appropriate representation, the problem is almost solved.
A Representation has Four Fundamental Parts:
23/4/19 EIE426-AICV 18
Semantic Nets
A semantic net is a representation
In which Lexically, there are nodes, links, and application-specific link labels. Structurally, each link connects a tail node to a head node. Semantically, the nodes and links denote application-specific entities.
With constructors that Construct a node Construct a link, given a link label and two nodes to be connected
With readers that Produce a list of all links departing from a given node Produce a list of all links arriving at a given node Produce a tail node, given a link Produce a head node, given a link Produce a link label, given a link
23/4/19 EIE426-AICV 20
Problem Solving Paradigms
Describe and match √ Generate and test √ Means-ends analysis √ Problem-reduction √ Search √ Rule-based systems √ Predicate calculus
23/4/19 EIE426-AICV 21
To identify an object using describe and match, Describe the object using a suitable representation. Match the object description against library descriptions until there
is a satisfactory match or there are no more library descriptions. If you find a satisfactory match, announce it; otherwise, announce
failure.
The Describe-And-Match Method
23/4/19 EIE426-AICV 25
The Generate-And-Test Method
To perform generate and test, Until a satisfactory solution is found or no more candidate
solutions can be generated, Generate a candidate solution. Test the candidate solution.
If an acceptable solution is found, announce it; otherwise, announce failure.
Three properties for a good generator: complete, nonredundant, informed.
23/4/19 EIE426-AICV 26
The Means-Ends Analysis Method
A state space is a representation
That is a semantic net
in which The nodes denote states. The links denote transitions between states.
23/4/19 EIE426-AICV 28
Algorithm: Means-Ends Analysis(Simple version)
To perform means-ends analysis, Until the goal is reached or no more procedures are available,
Describe the current state, the goal state, and the difference between the two.
Use the difference between the current state and goal state, possibly with the description of the current state or goal state, to select a promising procedure.
Use the promising procedure and update the current state. If the goal is reached, announce success; otherwise, announce failure.
Key idea is to reduce difference between the current state and the goal state.
23/4/19 EIE426-AICV 29
The Task:
A robot moves a desk with two things on it from one room to another.
23/4/19 EIE426-AICV 30
A Robot’s Operators
Operator Preconditions Results
PUSH(obj, loc) at(robot,obj)^ large(obj)^ clear(obj)^ armempty
at(obj, loc)^ at(robot, loc)
CARRY(obj, loc) at(robot,obj) ^ at(obj, loc)^ at(robot, loc)
WALK(loc)
none
at(robot, loc)
PICKUP(obj) at(robot, obj) holding(obj)
PUTDOWN(obj) holding(obj) holding(obj)
PLACE(obj1, obj2) at(robot, obj2)^ holding(obj1)
on(obj1, obj2)
small(obj)
23/4/19 EIE426-AICV 33
Algorithm: Means-Ends Analysis(Advanced Version)
1 Compare CURRENT to GOAL. If there are no differences between them then return.
2 Otherwise, select the most important difference and reduce it by doing the following until success or failure is signaled:(a) Select an as yet untried operator O that is applicable to the
current difference. If there are no such operators, then signal failure.
(b)Attempt to apply O to CURRENT. Generate descriptions of two states: O-START, a state which O’s preconditions are satisfied and O-RESULT, the state that would result if O were applied in O-START.
(c)If (FIRST-PART MEA(CURRENT, O-START)) and(LAST-PART MEA(O-RESULT, GOAL))are successful, then signal success and return the result of concatenatingFIRST-PART, O, and LAST-PART.
23/4/19 EIE426-AICV 36
Problem-Solving Methods Often Work Together
PolyU HK Airport
HK Airport Bejing Airport
Bejing UBejing Airport
Problem reduction
Walk Taxi Train
Means-ends analysis
PolyU Bejing U
23/4/19 EIE426-AICV 37
AI Prehistory
Philosophy logic, methods of reasoning, mind as physical system, foundations of learning, language, rationality
Mathematics formal representation and proof algorithms,computation, (un)decidability, (in)tractability, probability
Psychology adaptation, phenomena of perception and motor control, experimental techniques
Linguistics knowledge representation, grammarNeuroscience physical substrate for mental activityControl theory stability, simple optimal agent designs
23/4/19 EIE426-AICV 39
The State of the Art
Autonomous planning and scheduling: NASA’s Remote Agent Game playing: IBM’s Deep Blue Autonomous control: the ALVINN computer vision system, to
steer a car to keep it following a lane (2850 miles, 98% of the time) Medical diagnosis Logistics planning: DRAT (Dynamic Analysis and Replanning
Tool) Robotics: HipNav (a system that uses computer vision techniques
to create a 3-D model of a patient’s internal anatomy and then uses robotic control to guide the insertion of a hip replacement prosthesis.
Language understanding and problem solving: PROVERB (a computer program that solves crossword puzzles better than most humans)