Scribd
Upload
13 views

118007220 _ NAME (AI)

Uploaded by

rimi731303
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views

118007220 _ NAME (AI)

Uploaded by

rimi731303
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

BIRBHUM INSTITUTE OF ENGINEERING AND

TECHNOLOGY

SUB NAME : Artificial intelligence


; SUB CODE : OE – ME 701G
DEPARTMENT OF MECHANICAL ENGINEERING

NAME — ANIMESH MONDAL

ROLL NO.— 11800722085


REG. NO.— 221180120308 of 2022-23
SEM — VII
Heuristic Search Techniques.Discuss about Hill
Climbing,Best - First Search, The A* algorithm,the
AO* ALGORITHM,Problem Reduction,Constraint
Satisfaction, Means-Ends analysis.

Subject name : Artificial


intelligence
Sub code : OE – ME
701G
By
Koushik
Mondal
HEURISTIC SEARCH TECHNIQUE

Heuristic search techniques are strategies used in artificial intelligence and


computer science to find solutions to problems more efficiently by using
heuristic functions. These functions estimate the cost or distance from a given
state to the goal state. Here’s a brief discussion of the mentioned techniques:
Hill Climbing
HILL CLIMBING IS A LOCAL SEARCH ALGORITHM THAT CONTINUOUSLY
MOVES IN THE DIRECTION OF INCREASING VALUE (UPHILL) TO FIND THE
PEAK OF A GIVEN FUNCTION. IT EVALUATES NEIGHBORING STATES AND
MOVES TO THE BEST ONE, AIMING TO REACH THE GLOBAL MAXIMUM OR
MINIMUM

KEY FEATURES:
• Simple and easy to implement.
• May get stuck in local maxima, plateaus, or
ridges.
• Variants include steepest ascent, simple hill
climbing, and stochastic hill climbing
BEST-FIRST SEARCH

• BEST-FIRST SEARCH IS A SEARCH ALGORITHM THAT USES A


PRIORITY QUEUE TO EXPLORE NODES IN AN ORDER BASED
ON A GIVEN HEURISTIC. IT EVALUATES NODES BY COMBINING
THE COST TO REACH THE NODE AND THE ESTIMATED COST
TO REACH THE GOAL FROM THE NODE.
Key Features:
• Uses heuristics to guide the search.
• Includes variants like Greedy Best-First Search
and A* algorithm.
• Can be more efficient than uninformed search
methods.
A* ALGORITHM

• THE A* ALGORITHM IS A POPULAR BEST-FIRST SEARCH THAT USES


BOTH THE ACTUAL COST FROM THE START NODE (G(N)) AND THE
ESTIMATED COST TO THE GOAL (H(N)). THE SUM (F(N) = G(N) + H(N))
IS USED TO PRIORITIZE NODES.

Key Features:
• Optimal and complete if the heuristic is
admissible (never overestimates).
• Balances between greedy search and uniform-
cost search.
• Widely used in pathfinding and graph
traversal.
AO* ALGORITHM
• THE AO* (AND-OR) ALGORITHM IS USED FOR SEARCHING IN PROBLEM SPACES
WHERE SOLUTIONS CAN BE REPRESENTED AS A COMBINATION OF AND AND OR
NODES. IT CONSTRUCTS A SOLUTION GRAPH RATHER THAN A SOLUTION PATH.

Key Features:

• Suitable for problems that can be


decomposed into subproblems.
• Utilizes a combination of forward and
backward search.
• Effective for problem-solving in AND-OR
graphs.
PROBLEM REDUCTION

• PROBLEM REDUCTION INVOLVES BREAKING DOWN A COMPLEX


PROBLEM INTO SMALLER, MORE MANAGEABLE SUBPROBLEMS.
EACH SUBPROBLEM IS SOLVED INDIVIDUALLY, AND THEIR
SOLUTIONS ARE COMBINED TO SOLVE THE ORIGINAL PROBLEM.

Key Features:
Helps in simplifying and structuring complex
problems.Often used in conjunction with search
algorithms.Applicable in fields like dynamic
programming and divide-and-conquer strategies.
CONSTRAINT SATISFACTION

• CONSTRAINT SATISFACTION PROBLEMS (CSPS) INVOLVE FINDING A


SOLUTION THAT SATISFIES A SET OF CONSTRAINTS. VARIABLES ARE
ASSIGNED VALUES FROM A DOMAIN IN SUCH A WAY THAT ALL
CONSTRAINTS ARE MET.

Key Features:
• Common in scheduling, planning, and resource allocation.
• Solved using methods like backtracking, forward checking,
and constraint propagation.
• Allows for a structured approach to solving combinatorial
problems.
MEANS-ENDS ANALYSIS

• MEANS-ENDS ANALYSIS IS A PROBLEM-SOLVING TECHNIQUE THAT INVOLVES


IDENTIFYING THE DIFFERENCES BETWEEN THE CURRENT STATE AND THE
GOAL STATE AND THEN TAKING ACTIONS TO REDUCE THESE DIFFERENCES.

Key Features:
• Involves breaking down the problem into
subgoals.
• Uses both forward and backward reasoning.
• Effective in heuristic problem-solving and
planning.
CONCLUSION

Heuristic search techniques enhance problem-solving capabilities


in AI by providing diverse strategies tailored to specific types of
problems. While each technique has its domain of effectiveness,
they collectively contribute to more efficient and effective
exploration of search spaces, enabling the resolution of complex
challenges in various applications.
REFERENCES
1. S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 3rd Edition,
Prentice
Hall, 2009.
2. E. Rich, K. Knight and K. Knight, Artificial Intelligence, McGraw Hill, 1991.
3. M.C. Trivedi, A Classical Approach to Artificial Intelligence, Khanna Publishing
House,
New Delhi, 2018.

You might also like