Presentation is loading. Please wait.

Presentation is loading. Please wait.

Artificial Intelligence LECTURE 4 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA.

Similar presentations


Presentation on theme: "Artificial Intelligence LECTURE 4 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA."— Presentation transcript:

1 Artificial Intelligence LECTURE 4 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

2 Search Methodologies ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

3 Topics 1.Why Humans Use Depth-First Search? 2.Example 1: Traversing a Maze 3.Example 2: Searching for a Gift 4.Implementing Depth-First and Breadth-First Search 5.Example:Web Spidering 6.Depth-First Iterative Deepening 7.Using Heuristics for Search 8.Informed and Uninformed Methods 9.Choosing a Good Heuristic 10.The 8-Puzzle ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

4 Traversing a MAZE ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

5 DFS and Maze Traversal The DFS algorithm is similar to a classic strategy for exploring a maze ◦We mark each intersection, corner and dead end (vertex) visited ◦We mark each corridor (edge ) traversed ◦We keep track of the path back to the entrance (start vertex) by means of a rope (recursion stack)

6 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

7

8 Simple tree ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

9 Implementation DFS ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

10

11 Imple.. BFS ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

12

13 Depth-First Iterative Deepening Depth-First Iterative Deepening, or DFID (also called Iterative Deepening Search or IDS), is an exhaustive search technique that combines depth-first with breadth-first search. The DFID algorithm involves repeatedly carrying out depth-first searches on the tree, starting with a depth-first search limited to a depth of one, then a depth-first search of depth two, and so on, until a goal node is found. ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

14

15 Search… Monotonicity Example: The Modified Traveling Salesman Hill Climbing Steepest Ascent Hill Climbing Foothills, Plateaus, and Ridges Best-First Search Beam Search Identifying Optimal Paths A* Algorithms Uniform Cost Search Greedy Search Example: The Knapsack Problem ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

16

17 Searching for a Gift ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

18 Artificial Intelligence LECTURE 5 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

19 Topics 1. Monotonicity 2.Example: The Modified Traveling Salesman 3.Hill Climbing 4.Steepest Ascent Hill Climbing 5.Foothills, Plateaus, and Ridges 6.Best-First Search 7.Beam Search 8.Identifying Optimal Paths 9. A* Algorithms 10.Uniform Cost Search 11. Greedy Search 12.Example: The Knapsack Problem ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA


Download ppt "Artificial Intelligence LECTURE 4 ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA."

Similar presentations


Ads by Google