Heuristic Search in Artificial Intelligence | Heuristic Function in AI | Admissible & Non-admissible |Digital Wave

Heuristic Search in Artificial Intelligence | Heuristic Function in AI | Admissible & Non-admissible

Hi Friends,
I am Rahul Sharma, Welcome to my Youtube channel Digital Wave, Segment- Artificial Intelligence

In this artificial Intelligence Tutorial video I have explained about Heuristic Search in Artificial Intelligence, After watching this video you will be able to provide possible solutions in Artificial Intelligence.

Artificial Intelligence - Heuristic Search
Heuristic Search
Artificial Intelligence
artificial intelligence and Expert Systems
artificial intelligence
Artificial Intelligence Tutorials in hindi
Artificial Intelligence Video Tutorials
Artificial Intelligence Course
Heuristic Search
state space representation
initial state
goal state
search techniques
formal description
ordered pairs
Benefits of artificial intelligence
Artificial intelligence future
Who started AI?
Where is Artificial Intelligence used?
What is the disadvantage of Artificial Intelligence?
Types of artificial intelligence
gate exam Preparations
Machine Learning
Gate exam 2021 Question Bank
Gate exam 2022 Question Bank
PSU Exam 2021
PSU Exam2022

#HeuristicSearchinartificialintelligence
#HeuristicSearchinAI
#HeuristicFunctioninAI
#Admissible
#HeuristicSearchinhindi
#HeuristicSearching
#nonadmissiblefunction
#digitalwave
#MachineLearning
#nonadmissibleHeuristicfunction
#admissibleHeuristicfunction
#GameplayingProblemsinAI
#gameplayingprobleminartificialintelligence
#ArtificialIntelligencekyahai
#ArtificialIntelligenceTutorial
#ArtificialIntelligenceCourse
#MachineLearning
#ExamPreparation
#GateExam2022
#PSUExam2022
#Rahulsharma
#gateexamPreparations
#MachineLearning
#Gateexam2021QuestionBank
#Gateexam2022QuestionBank
#PSUExam2021
#GTUEXAM
#RTUEXAM
#TechnicalPAPER
#WhoisFatherofAI

1. Artificial Intelligence
Heuristic Search

2. Heuristic Search and Heuristic Function
▪HeuristicSearchandHeuristicfunctionareusedininformedsearch.
▪Heuristicsearchisasimplesearchingtechniquethattriestooptimizea
problemusingHeuristicFunction.
▪Optimizationmeansthatwewilltrytosolveaprobleminminimumnumber
ofstepsorcost.

3. Heuristic Function h(n)
▪ItisafunctionH(n)thatgivesanestimationonthecostofgettingfrom
node‘n’tothegoalstate.
▪Ithelpsinselectingoptimalnodeforexpansion.
R1
R2
Mumbai GOA
R1= 340 Km
R2= 270Km
H(300)
H(200)

4. Heuristic Function h(n)
X
Y
Z
(Number of steps to reach the
goal state) or Heuristic value
of x will be :
h(x)=2
(Number of steps to reach the
goal state) or Heuristic value
of x will be :
h(y)=1
Goal State
Start Sate

5. Types of Heuristic Function h(n)
▪TherearetwotypesofHeuristicFunctions:
1.Admissible
2.Non-Admissible

6. Admissible Heuristic Function h(n)
▪Aheuristicfunctionisadmissibleifitneveroverestimatesthecostof
reachingthegoal.
h(n) < = h*(n)
Hereh(n)isheuristiccost,andh*(n)isthe
estimatedcost.
Soheuristiccostshouldbelessthanor
equaltotheestimatedcost.

7. Non-Admissible Heuristic Function h(n)
▪Anon-admissibleheuristicmayoverestimatethecostofreachingthe
goal.
h(n) > h*(n)
Hereh(n)isheuristiccost,andh*(n)isthe
estimatedcost.
Soheuristiccostmaybegreaterthento
theestimatedcost.
total cost = search cost + path cost

8. Admissible Heuristic Function h(n)
A
B
1
E
Heuristic Cost
Start Sate
G
C
D
F Goal State
B= 1+3=43
2
5
1
1
H(C)=4H(D)=5
H(B)=3
H(D)=5
H(C)=4
H(E)=2
H(F)=3
F(n) = H(n) + G(n)
Cost = Heuristic cost + Actual cost
C= 1+4=5
H(B)=3
D= 1+5=6
Actual cost from A to G = 1+3+5+2= 11
H(B)=3 so h(n) =3 and h*(n)=11
H(n)<=h*(n)
3<=11
ADMISSIBLE

9. Non-Admissible Heuristic Function h(n)
A
B
1
E
Heuristic Cost
Start Sate
G
C
D
F Goal State
3
2
5
1
1
H(D)=5
H(B)=3
H(D)=5
H(C)=4
H(E)=3
H(F)=3
F(n) = H(n) + G(n)
Cost = Heuristic cost + Actual cost
Actual cost from A to G(via D)= 1+3= 4
H(D)=5 so h(n) =5 and h*(n)=4
H(n)<=h*(n)
5<=4
NON-ADMISSIBLE
3

10. THANK YOU
➢Subscribe our channel
➢Follow us on Facebook
✓Page name : Digital
Wave ( Link in
Description Box)