Professional Documents
Culture Documents
By
Shailendra S. Aote
2/3/2016
Course Outcome
On successful completion of the course, students will be able to:
Understand challenges involved in designing intelligent systems by exploring
human intelligence nature and its role in problem solving.
Represent given problem using state space representation and apply informed
and uninformed search techniques on it .
Intelligence
The ability to acquire & apply knowledge to solve a problem.
What is AI
AI is the study of how to make computers to do things which at the
moment , people do better. (Rich & Knight)
Is a branch of computer Science that is concerned with the automation
of intelligent behavior in simple terms.
AI is a way of making a computer thinks intelligently (Mathews)
2/3/2016
Knowledg
e Base
Inference
Engine
User
Interface
Means of utilizing
facts and rules.
Carries out the
search through the
Knowledge base
To
prove
the
hypothesis & to arrive
at a conclusion
Task Domains of AI
Mundane Tasks
Perception
Vision
Speech
Natural language
Understanding
Generation
Translation
Commonsense Reasoning
Robot Control
2/3/2016
Formal Tasks
Games
Chess
Checkers
Mathematics
Geometry
Logic
Proving Properties of Programs
Expert Tasks
Engineering
Design
Manufacturing and Planning
Scientific Analysis
Medical Analysis
Financial Analysis
5
Turing Test
To detect whether the m/c has become intelligent as
human or not.
Room-1
2/3/2016
interrogator
Room-2
AI Techniques
Intelligence requires Knowledge. : It is a method which should be
applied to solve the AI problems by exploiting knowledge.
Search:
It provides a way of solving problems for which no more direct approach
is available.
Use of Knowledge:
It provides a way of solving complex problems
Abstraction:
It provides a way of separating important features from unimportant
2/3/2016
2/3/2016
2.
3.
4.
Choose the best problem solving technique and apply them to the
particular problem.
2/3/2016
10
2/3/2016
4G
3G
11
12
(4,y)
(x,3)
11 (0,2)
12 (2,y)
2/3/2016
(4,y (4 - x))
14
3-Gallon Jug
0
3
0
3
2
2
0
Rule Applied
2
9
2
7
5 or 12
9 or 11
15
Solution-2
(0, 0)
(4, 0)
(1, 3)
(1, 0)
(0, 1)
(4, 1)
(2, 3)
2/3/2016
Rules Applied--??
16
2/3/2016
17
Production Systems
o A production system consists of a collection of productions
(rules), a working memory of facts (database) and an
algorithm for producing new facts from old.
o A rule becomes eligible to "fire" when its conditions match
some set of elements currently in working memory. A
control strategy determines which of several eligible rules
fires next.
2/3/2016
18
Production Systems
To solve a problem using a production system, we must
specify the
Global Database
Rules
Control Strategy
Transforming
a problem statement into these three
components of a production system is called the
representation problem in AI
2/3/2016
19
Control Strategies
It specifies in which order the rules to be fired.
The first requirement of a good CS is that it causes motion.
Every time the rules cant be started from first
rule. (Water Jug problem)
2/3/2016
20
21
Search Techniques
Uninformed Search/Blind Search
Is to generate the successors and distinguish the goal state from non
goal state.
22
Time Complexity
How long does it take to find a solution?
Space Complexity
2/3/2016
23
DFS
Generate And Test
Hill Climbing
Best First
Problem Reduction
Constraint Satisfaction
2/3/2016
24
Depth-first search
Expand one of the nodes at
the deepest level.
2/3/2016
25
6
2/3/2016
26
2/3/2016
27
Hill Climbing
Similar to generate-and-test
Test function + heuristic function
Tell how close to the goal state
EX : In unfamiliar city without a map...
downtown = tall building...
heuristic function = distance between
downtown and tall building
Stop
2/3/2016
2.
29
30
2/3/2016
31
2/3/2016
32
OR Graph
If each of the branches represent an alternative problem solving path it
is called as OR Graph.
Step-2
A
Step-1
A
B
(3)
2/3/2016
(5)
(1)
33
Step-3
Step-4
B
(3)
(5)
(5)
E
(4)
2/3/2016
(6)
(6)
(5)
E
(4)
F
(6)
34
Step-5
A
(5)
G
(6)
(5)
E
(4)
I
(2)
2/3/2016
F
(6)
J
(1)
35
Lists Required?
OPEN:-Nodes that have been generated and have had the heuristic
2/3/2016
36
b)
37
Notations.
F-Heuristic function to be used
g-measure of the cost of getting from the initial state
to the current node.
h Estimate of the additional cost of getting from the
current node to the goal state.
F(x)=g(x)+h(x)
2/3/2016
38
A* Algorithm
1.Place the starting node S on open.
2.If open is empty, Stop & return failure.
3.Remove from open the node n that has the smallest value of f*(n).
If the node is a goal node, return success & Stop. Otherwise.
4. Expand n, generating all of its successor n and place n on closed.
For every successor n, if n is not already on open or closed attach a
back-pointer to n, Compute f*(n) and place it on open.
5.Each n that is already on open or closed should be attached to backpointers which reflect the lowest g*(n) path. If n was on closed and its
39
2/3/2016
40
Open List:
A* search example
Arad
We start with our initial state Arad. We make a node and add
it to the open list. Since its the only thing on the open list,
we expand the node.
Think of the open list as a priority queue (or heap) that sorts
the nodes inside of it according to their g()+h() score.
2/3/2016
41
Open List:
Sibiu
Timisoara
A* search example
Zerind
g()+h()
calculation.
42
Open List:
Rimricu Vicea
Fagaras
A* search example
Weve been
Timisoara to Arad
Zerind
Arad
Oradea
before.
Dont list it
again on the
open list.
43
Open List:
Rimricu Vicea
Fagaras
A* search example
Timisoara
Zerind
Oradea
We see that Rimricu Vicea is at the top of the open list; so, its
the next node we will expand.
2/3/2016
44
Open List:
A* search example
Fagaras
Pitesti
Timisoara
Zerind
Craiova
Sibiu
Oradea
45
Open List:
A* search example
Fagaras
Pitesti
Timisoara
Zerind
Craiova
Oradea
2/3/2016
46
Open List:
Pitesti
Timisoara
A* search example
Zerind
Bucharest
Craiova
Sibiu
Oradea
47
Open List:
Pitesti
Timisoara
A* search example
Zerind
Bucharest
Craiova
Oradea
2/3/2016
48
Open List:
Bucharest
Timisoara
A* search example
Zerind
Craiova
Rimricu Vicea
Oradea
49
Open List:
Bucharest
Timisoara
A* search example
Zerind
Craiova
Oradea
2/3/2016
50
Open List:
Bucharest
Timisoara
A* search example
Zerind
Craiova
Oradea
Problem Characteristics
To choose an appropriate method for a
particular problem:
1) Is the problem decomposable?
2) Can solution steps be ignored or undone?
3) Is the universe predictable?
4) Is a good solution absolute or relative?
5) Is the solution a state or a path?
6) What is the role of knowledge?
7) Does the task require human-interaction?
2/3/2016
52
2/3/2016
53
Symbolic Integration
(1+cos2X)dx
2/3/2016
54
Goal
C
A
ON(B,C)
ON(A,B)
Blocks World
CLEAR(x)
ON(x, Table)
ON(x, y)
55
ON(B, C)
ON(A, B)
CLEAR(A)
ON(A, B)
C
A
2/3/2016
B
B
C
56
Ignorable!
2/3/2016
57
2 8 3
1 2 3
1 6 4
7 6 5
2/3/2016
58
2/3/2016
59
2/3/2016
60
2/3/2016
61
2/3/2016
62
3.
6.
7.
2/3/2016
63
Is Marcus alive?
2/3/2016
64
2/3/2016
65
Solution 1
1. Marcus was man.
4. All men are mortal.
8. Marcus is mortal.
3. Marcus was born in 40 A.D.
7. It is now 2009 A.D.
9. Marcus age is 1961 years.
6. No mortal lives longer than 150 years
10. Marcus is dead.
2/3/2016
axiom 1
axiom 4
1,4
axiom 3
axiom 7
3,7
axiom 6
8,6,9
66
Solution 2
2/3/2016
axiom 7
axiom 5
7,5
axiom 2
11,2
67
2/3/2016
Boston
New York
Miami
Dallas
Sanfransi
sco
Boston
250
1450
1700
1300
New York
250
1200
1500
2900
Miami
1450
1200
1600
3300
Dallas
1700
1500
1600
1700
Sanfransisco
3000
2900
3300
1700
68
2/3/2016
69
2/3/2016
70
2/3/2016
71
2/3/2016
72
Reading Newspaper
Knowledge is required even to be able
to recognize a solution.
Exa-Cricket news(players)
2/3/2016
73
74
Summary
Sr.
No.
Problem Char
Chess
WaterJug
8 Puzzle
Travelling
Salesman
Tower of
Hanoi
Bridge
Decomposable
No
No
No
No
No
No
Ignored
/Undone
No
Yes
Yes
Yes
Yes
No
Universe
predictable
Yes
Yes
Yes
Yes
Yes
No
Absolute/Rela
tive
Any
Path
Any
Path
Any
Path
Best
Any
Any
State/ Path
State
Path
Path
Path
Path
Path
Knowledge
Required
Yes
Yes
Yes
Yes
Yes
Yes
User
Interaction
Yes
No
No
No
No
Yes
2/3/2016
75