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

Slides:

Advertisements

Similar presentations

© 2004 Goodrich, Tamassia Depth-First Search1 DB A C E.

Advertisements

Artificial Intelligence By Mr. Ejaz CIIT Sahiwal.

State Space Representation and Search

Depth-First Search1 Part-H2 Depth-First Search DB A C E.

Problem Solving Agents A problem solving agent is one which decides what actions and states to consider in completing a goal Examples: Finding the shortest.

Solving Problems by Searching Currently at Chapter 3 in the book Will finish today/Monday, Chapter 4 next.

CS 480 Lec 3 Sept 11, 09 Goals: Chapter 3 (uninformed search) project # 1 and # 2 Chapter 4 (heuristic search)

CMSC 471 Spring 2014 Class #4 Thu 2/6/14 Uninformed Search Professor Marie desJardins,

CS 484 – Artificial Intelligence1 Announcements Department Picnic: today, after class Lab 0 due today Homework 2 due Tuesday, 9/18 Lab 1 due Thursday,

Chapter 4 Search Methodologies.

Breadth-First and Depth-First Search

Lecture 16: Tree Traversal.

© 2006 Pearson Addison-Wesley. All rights reserved14 A-1 Chapter 14 excerpts Graphs (breadth-first-search)

Touring problems Start from Arad, visit each city at least once. What is the state-space formulation? Start from Arad, visit each city exactly once. What.

Artificial Intelligence (CS 461D)

Artificial Intelligence Lecture No. 7 Dr. Asad Safi Assistant Professor, Department of Computer Science, COMSATS Institute of Information Technology.

Artificial Intelligence for Games Depth limited search Patrick Olivier

Depth-First Search1 DB A C E. 2 Outline and Reading Definitions (§6.1) Subgraph Connectivity Spanning trees and forests Depth-first search (§6.3.1) Algorithm.

1 Chapter 4 Search Methodologies. 2 Chapter 4 Contents l Brute force search l Depth-first search l Breadth-first search l Properties of search methods.

Using Search in Problem Solving

1 Solving Problems by Searching. 2 Terminology State State Space Initial State Goal Test Action Step Cost Path Cost State Change Function State-Space.

© 2004 Goodrich, Tamassia Depth-First Search1 DB A C E.

Informed Search CSE 473 University of Washington.

Pathfinding Algorithms Josh Palmer Rachael Beers.

UNIVERSITY OF SOUTH CAROLINA Department of Computer Science and Engineering CSCE 580 Artificial Intelligence Problem Spaces and Search Fall 2008 Jingsong.

Blind Search-Part 2 Ref: Chapter 2. Search Trees The search for a solution can be described by a tree - each node represents one state. The path from.

Alyce Brady CS 510: Computer Algorithms Depth-First Graph Traversal Algorithm.

CSC344: AI for Games Lecture 4: Informed search

Depth-First Search Lecture 24 COMP171 Fall Graph / Slide 2 Depth-First Search (DFS) * DFS is another popular graph search strategy n Idea is similar.

For Friday Finish chapter 3 Homework: –Chapter 3, exercise 6 –May be done in groups. –Clarification on part d: an “action” must be running the program.

Artificial Intelligence Course outline Introduction Problem solving Generic algorithms Knowledge Representation and Reasoning Expert Systems Uncertainty.

Dijkstra’s Algorithm and Heuristic Graph Search David Johnson.

Review: Search problem formulation Initial state Actions Transition model Goal state (or goal test) Path cost What is the optimal solution? What is the.

Problem Solving and Search Andrea Danyluk September 11, 2013.

CSC 213 – Large Scale Programming. Today’s Goals  Make Britney sad through my color choices  Revisit issue of graph terminology and usage  Subgraphs,

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

Introduction to search Chapter 3. Why study search? §Search is a basis for all AI l search proposed as the basis of intelligence l inference l all learning.

CS 416 Artificial Intelligence Lecture 4 Uninformed Searches (cont) Lecture 4 Uninformed Searches (cont)

State-Space Searches. 2 State spaces A state space consists of A (possibly infinite) set of states The start state represents the initial problem Each.

Artificial Intelligence

For Friday Finish reading chapter 4 Homework: –Lisp handout 4.

For Monday Read chapter 4, section 1 No homework..

Search with Costs and Heuristic Search 1 CPSC 322 – Search 3 January 17, 2011 Textbook §3.5.3, Taught by: Mike Chiang.

Lecture 3: Uninformed Search

Search CPSC 386 Artificial Intelligence Ellen Walker Hiram College.

Artificial Intelligence for Games Informed Search (2) Patrick Olivier

For Friday Read chapter 4, sections 1 and 2 Homework –Chapter 3, exercise 7 –May be done in groups.

Search (continued) CPSC 386 Artificial Intelligence Ellen Walker Hiram College.

Depth-First Search1 DB A C E. 2 Depth-first search (DFS) is a general technique for traversing a graph A DFS traversal of a graph G – Visits all the vertices.

1 Subgraphs A subgraph S of a graph G is a graph such that The vertices of S are a subset of the vertices of G The edges of S are a subset of the edges.

Depth-First Search Lecture 21: Graph Traversals

Search Techniques CS480/580 Fall Introduction Trees: – Root, parent, child, sibling, leaf node, node, edge – Single path from root to any node Graphs:

CHAPTER 2 SEARCH HEURISTIC. QUESTION ???? What is Artificial Intelligence? The study of systems that act rationally What does rational mean? Given its.

3.5 Informed (Heuristic) Searches This section show how an informed search strategy can find solution more efficiently than uninformed strategy. Best-first.

Graph Searching CSIT 402 Data Structures II. 2 Graph Searching Methodology Depth-First Search (DFS) Depth-First Search (DFS) ›Searches down one path as.

Search Methodologies Fall 2013 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.

CHAPTER 13 GRAPH ALGORITHMS ACKNOWLEDGEMENT: THESE SLIDES ARE ADAPTED FROM SLIDES PROVIDED WITH DATA STRUCTURES AND ALGORITHMS IN C++, GOODRICH, TAMASSIA.

For Monday Read chapter 4 exercise 1 No homework.

CSC 213 – Large Scale Programming Lecture 31: Graph Traversals.

Brute Force and Exhaustive Search Brute Force and Exhaustive Search Traveling Salesman Problem Knapsack Problem Assignment Problem Selection Sort and Bubble.

Brute Force and Exhaustive Search Brute Force and Exhaustive Search Traveling Salesman Problem Knapsack Problem Assignment Problem Selection Sort and Bubble.

Artificial Intelligence Solving problems by searching.

Artificial Intelligence Lecture 6: Search Methods III

Depth-First Search D B A C E Depth-First Search Depth-First Search

CSE 4705 Artificial Intelligence

Depth-First Search D B A C E Depth-First Search Depth-First Search

Artificial Intelligence

Depth-First Search D B A C E Depth-First Search Depth-First Search

Search Exercise Search Tree? Solution (Breadth First Search)?

Depth-First Search D B A C E 4/13/2019 5:23 AM Depth-First Search

Presentation transcript:

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

Search Methodologies ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

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

Traversing a MAZE ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

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)

ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

Simple tree ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

Implementation DFS ARTIFICIAL INTELLIGENCE LECTURES BY ENGR. QAZI ZIA

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

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

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

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

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

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