Scribd
Upload
8 views

AI Module 1 Lecture 6

This document outlines the learning outcomes for a B.Tech course on Artificial Intelligence, focusing on the A* search algorithm and its components. It details the steps involved in the A* algorithm, including node evaluation and management of OPEN and CLOSED lists. Additionally, it mentions the merits and demerits of the A* algorithm, although specific examples are not provided in the text.

Uploaded by

mi.melonfisher
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

AI Module 1 Lecture 6

This document outlines the learning outcomes for a B.Tech course on Artificial Intelligence, focusing on the A* search algorithm and its components. It details the steps involved in the A* algorithm, including node evaluation and management of OPEN and CLOSED lists. Additionally, it mentions the merits and demerits of the A* algorithm, although specific examples are not provided in the text.

Uploaded by

mi.melonfisher
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

MODULE 1

Scope of AI & Problem Solving


Topic: A*, Problem reduction & constraint satisfaction

B.Tech.(CSE)
Artificial Intelligence (CSE 401)
Learning outcomes

• Students will be able to know about informed search algorithm.

• Students will be able to know about heuristic function.

• Students will be able to understand heuristic search strategies with various examples.

2
Amity School of Engineering and Technology

A*
• Step1: Place the starting node in the OPEN list.
• Step 2: Check if the OPEN list is empty or not, if the list is empty then return failure
and stops.
• Step 3: Select the node from the OPEN list which has the smallest value of
evaluation function (g+h), if node n is goal node then return success and stop,
otherwise
• Step 4: Expand node n and generate all of its successors, and put n into the closed
list. For each successor n', check whether n' is already in the OPEN or CLOSED list, if
not then compute evaluation function for n' and place into Open list.
• Step 5: Else if node n' is already in OPEN and CLOSED, then it should be attached to
the back pointer which reflects the lowest g(n') value.
• Step 6: Return to Step 2.
4
Amity School of Engineering and Technology

A* Example
Amity School of Engineering and Technology

A* Example
Amity School of Engineering and Technology

A* Algorithm
Amity School of Engineering and Technology
Amity School of Engineering and Technology
10
11
12
13
Merit and demerit of A* algorithm
Amity School of Engineering and Technology

Thank You

You might also like