Uninformed search methods
|
|
- Mervyn Rodgers
- 6 years ago
- Views:
Transcription
1 CS 1571 Introuction to AI Lecture 4 Uninforme search methos Milos Hauskrecht milos@cs.pitt.eu 539 Sennott Square Announcements Homework assignment 1 is out Due on Thursay, September 11, 014 before the lecture Theoretical an programming part: Programming part involves Puzzle 8 problem. Course web page: 1
2 Search Search: The process of exploration of the search space Design goal: We want the search to be as efficient as possible The efficiency of the search epens on: The search space an its size Metho use to explore (traverse) the search space Conition to test the satisfaction of the search objective Uninforme search methos rely only on the information available in the problem efinition Breath first search Depth first search Iterative eepening Bi-irectional search For the minimum cost path problem: Uniform cost search
3 Breath first search (BFS) The shallowest noe is expane first Breath-first search Expan the shallowest noe first Implementation: put successors to the en of the queue (FIFO) queue Zerin Sibiu Timisoara Oraea Oraea Fagaras Rimnicu Lugoj Vilcea 3
4 Breath-first search queue Zerin Sibiu Timisoara Zerin Sibiu Timisoara Oraea Oraea Fagaras Rimnicu Lugoj Vilcea Breath-first search queue Sibiu Timisoara Oraea Zerin Sibiu Timisoara Oraea Oraea Fagaras Rimnicu Lugoj Vilcea 4
5 Breath-first search Zerin Sibiu Timisoara queue Timisoara Oraea Oraea Fagaras Romnicu Vilcea Oraea Oraea Fagaras Rimnicu Vilcea Lugoj Breath-first search Zerin Sibiu Timisoara queue Oraea Oraea Fagaras Romnicu Vilcea Lugoj Oraea Oraea Fagaras Rimnicu Lugoj Vilcea 5
6 Properties of breath-first search Completeness:? Optimality:? Time complexity:? Memory (space) complexity:? For complexity use: b maximum branching factor epth of the optimal solution m maximum epth of the search tree Properties of breath-first search Completeness: Yes. The solution is reache if it exists. Optimality:? Time complexity:? Memory (space) complexity:? 6
7 Properties of breath-first search Completeness: Yes. The solution is reache if it exists. Optimality: Yes, for the shortest path. Time complexity:? Memory (space) complexity:? BFS time complexity epth number of noes b = =4 3 3 =8 (b ) (b +1 ) Total noes:? 7
8 BFS time complexity epth number of noes b = =4 3 3 =8 (b ) (b +1 ) Expane noes: O ( b ) 1 Total noes: O ( b ) Properties of breath-first search Completeness: Yes. The solution is reache if it exists. Optimality: Yes, for the shortest path. Time complexity: 1 b b b O( b ) exponential in the epth of the solution Memory (space) complexity:? 8
9 BFS memory complexity Count noes kept in the tree structure or in the queue b epth number of noes = =4 3 3 =8 (b ) (b +1 ) Total noes:? BFS memory complexity Count noes kept in the tree structure or in the queue b epth number of noes = =4 3 3 =8 (b ) (b +1 ) Expane noes: O ( b ) 1 Total noes: O ( b ) 9
10 Properties of breath-first search Completeness: Yes. The solution is reache if it exists. Optimality: Yes, for the shortest path. Time complexity: 1 b b b O( b ) exponential in the epth of the solution Memory (space) complexity: O( b ) noes are kept in the memory BFS time complexity epth number of noes b = =4 3 3 =8 (b ) (b +1 ) Expane noes: O ( b ) 1 Total noes: O ( b ) 10
11 Depth-first search (DFS) The eepest noe is expane first Backtrack when the path cannot be further expane Depth-first search The eepest noe is expane first Implementation: put successors to the beginning of the queue queue Zerin Sibiu Timisoara Oraea Oraea Fagaras Rimnicu Lugoj Vilcea 11
12 Depth-first search Zerin Sibiu Timisoara queue Zerin Sibiu Timisoara Oraea Oraea Fagaras Rimnicu Lugoj Vilcea Depth-first search Zerin Sibiu Timisoara queue Oraea Sibiu Timisoara Oraea Oraea Fagaras Rimnicu Lugoj Vilcea 1
13 Depth-first search Zerin Sibiu Timisoara queue Zerin Sibiu Timisoara Oraea Sibiu Timisoara Oraea Oraea Fagaras Rimnicu Lugoj Vilcea Zerin Sibiu Timisoara Note: Zerin cycle Properties of epth-first search Completeness: Does it always fin the solution if it exists? Optimality:? Time complexity:? Memory (space) complexity:? 13
14 Properties of epth-first search Completeness: No. Infinite loops can occur. Optimality: oes it fin the minimum length path? Time complexity:? Memory (space) complexity:? Properties of epth-first search Completeness: No. Infinite loops can occur. Solution: prevent occurrence of infinite loops. Optimality: oes it fin the minimum length path? Time complexity:? Memory (space) complexity:? 14
15 Properties of epth-first search Completeness: No, if we permit infinite loops. Yes, if we prevent them. Optimality: oes it fin the minimum length path? Time complexity:? Memory (space) complexity:? Properties of epth-first search Completeness: No. If we permit infinite loops. Yes, if we prevent them. Optimality: No. Solution foun first may not be the shortest possible. Time complexity:? Memory (space) complexity:? 15
16 Properties of epth-first search Completeness: No. If we permit infinite loops. Yes, if we prevent them. Optimality: No. Solution foun first may not be the shortest possible. Time complexity: assume a finite maximum tree epth m Memory (space) complexity:? DFS time complexity epth number of noes b 0 1 m 1 1 = =4 3 3 =8 m m - m- Complexity: 16
17 DFS time complexity epth number of noes b 0 1 m 1 1 = =4 3 3 =8 m m - m- Complexity: O ( b m ) Properties of epth-first search Completeness: No. If we permit infinite loops. Yes, if we prevent them. Optimality: No. Solution foun first may not be the shortest possible. Time complexity: O( b m ) exponential in the maximum epth of the search tree m Memory (space) complexity:? 17
18 Properties of epth-first search Completeness: No. If we permit infinite loops. Yes, if we prevent them. Optimality: No. Solution foun first may not be the shortest possible. Time complexity: O( b m ) exponential in the maximum epth of the search tree m Memory (space) complexity:? DFS memory complexity epth number of noes kept b
19 DFS memory complexity epth number of noes kept b = b DFS memory complexity epth number of noes kept b = (b-1) = b 19
20 DFS memory complexity epth number of noes kept b 0 0 m m =b Complexity: DFS memory complexity epth number of noes kept b 0 0 m 1 1=(b-1) 1= (b-1) 3 1 =(b-1) m =b Complexity: O(bm ) 0
21 DFS memory complexity Count noes kept in the tree structure or the queue epth number of noes b 0 1 m 1 = b 3 m Total noes: O(bm ) Properties of epth-first search Completeness: No. If we permit infinite loops. Yes, if we prevent them. Optimality: No. Solution foun first may not be the shortest possible. Time complexity: m O( b ) exponential in the maximum epth of the search tree m Memory (space) complexity: O(bm ) linear in the maximum epth of the search tree m 1
22 Properties of epth-first search Completeness: No. If we permit infinite loops Yes, if we prevent them. Optimality: No. Solution foun first may not be the shortest possible. Time complexity: m O( b ) exponential in the maximum epth of the search tree m Memory (space) complexity: O(bm ) the tree size we nee to keep is linear in the maximum epth of the search tree m Limite-epth epth first search How to eliminate infinite epth-first exploration? Put the limit (l) on the epth of the epth-first exploration Limit l= l Not explore Time complexity: Memory complexity: O( b l ) O (bl ) l - is the given limit
23 Limite epth epth-first search Avois pitfalls of epth first search Use cutoff on the maximum epth of the tree Problem: How to pick the maximum epth? Assume: we have a traveler problem with 0 cities How to pick the maximum tree epth? Limite epth epth-first search Avois pitfalls of epth first search Use cutoff on the maximum epth of the tree Problem: How to pick the maximum epth? Assume: we have a traveler problem with 0 cities How to pick the maximum tree epth? We nee to consier only paths of length < 0 Limite epth DFS Time complexity: O ( b l ) Memory complexity: O(bl ) l - is the limit 3
24 Elimination of state repeats While searching the state space for the solution we can encounter the same state many times. Question: Is it necessary to keep an expan all copies of states in the search tree? Two possible cases: (A) Cyclic state repeats Search tree (B) Non-cyclic state repeats A B A B Elimination of cycles A A Case A: Correspons to the path with a cycle Question: Can the branch (path) in which the same state is visite twice ever be a part of the optimal (shortest) path between the initial state an the goal???? 4
25 Elimination of cycles A A Case A: Correspons to the path with a cycle Question: Can the branch (path) in which the same state is visite twice ever be a part of the optimal (shortest) path between the initial state an the goal? No!! Branches representing cycles cannot be the part of the shortest solution an can be eliminate. Elimination of cycles A A How to check for cyclic state repeats: Check ancestors in the tree structure Caveat: we nee to keep the tree. Do not expan the noe with the state that is the same as the state in one of its ancestors. 5
26 Elimination of non-cyclic state repeats Root of the search tree B noeb-1 B noeb- Case B: noes with the same state are not on the same path from the initial state Question: Is one of the noes noeb-1, noeb- better or preferable? Elimination of non-cyclic state repeats Root of the search tree B noeb-1 B noeb- Case B: noes with the same state are not on the same path from the initial state Question: Is one of the noes noeb-1, noeb- better or preferable? Yes. noeb-1 represents a shorter path from the initial state to B 6
27 Elimination of non-cyclic state repeats Root of the search tree B noeb-1 B noeb- Conclusion: Since we are happy with the optimal solution noeb- can be eliminate. It oes not affect the optimality of the solution. Problem: Noes can be encountere in ifferent orer uring ifferent search strategies. Elimination of non-cyclic state repeats with BFS Root of the search tree B noeb-1 B noeb- Breath FS is well behave with regar to non-cyclic state repeats: noeb-1 is always expane before noeb- Orer of expansion etermines the correct elimination strategy we can safely eliminate the noe that is associate with the state that has been expane before 7
28 Elimination of state repeats for the BFS For the breath-first search (BFS) we can safely eliminate all secon, thir, fourth, etc. occurrences of the same state this rule covers both cyclic an non-cyclic repeats!!! Implementation of all state repeat elimination through marking: All expane states are marke All marke states are store in a hash table Checking if the noe has ever been expane correspons to the mark structure lookup Use hash table to implement marking Elimination of non-cyclic state repeats with DFS Root of the search tree B noeb-1 B noeb- Depth FS: noeb- is expane before noeb-1 The orer of noe expansion oes not imply correct elimination strategy we nee to remember the length of the path between noes to safely eliminate them 8
29 Elimination of all state reunancies General strategy: A noe is reunant if there is another noe with exactly the same state an a shorter path from the initial state Works for any search metho Uses aitional path length information Implementation: hash table with the minimum path value: The new noe is reunant an can be eliminate if it is in the hash table (it is marke), an its path is longer or equal to the value store. Otherwise the new noe cannot be eliminate an it is entere together with its value into the hash table. (if the state was in the hash table the new path value is better an nees to be overwritten.) 9
Informed search methods
CS 2710 Foundations of AI Lecture 5 Informed search methods Milos Hauskrecht milos@pitt.edu 5329 Sennott Square Announcements Homework assignment 2 is out Due on Tuesday, September 19, 2017 before the
More informationBasic Search. Fall Xin Yao. Artificial Intelligence: Basic Search
Basic Search Xin Yao Fall 2017 Fall 2017 Artificial Intelligence: Basic Search Xin Yao Outline Motivating Examples Problem Formulation From Searching to Search Tree Uninformed Search Methods Breadth-first
More informationCOMP219: Artificial Intelligence. Lecture 7: Search Strategies
COMP219: Artificial Intelligence Lecture 7: Search Strategies 1 Overview Last time basic ideas about problem solving; state space; solutions as paths; the notion of solution cost; the importance of using
More informationCS486/686 Lecture Slides (c) 2015 P.Poupart
1 2 Solving Problems by Searching [RN2] Sec 3.1-3.5 [RN3] Sec 3.1-3.4 CS486/686 University of Waterloo Lecture 2: May 7, 2015 3 Outline Problem solving agents and search Examples Properties of search algorithms
More informationCS486/686 Lecture Slides (c) 2014 P.Poupart
1 2 1 Solving Problems by Searching [RN2] Sec 3.1-3.5 [RN3] Sec 3.1-3.4 CS486/686 University of Waterloo Lecture 2: January 9, 2014 3 Outline Problem solving agents and search Examples Properties of search
More informationSolving Problems by Searching
Solving Problems by Searching CS486/686 University of Waterloo Sept 11, 2008 1 Outline Problem solving agents and search Examples Properties of search algorithms Uninformed search Breadth first Depth first
More informationARTIFICIAL INTELLIGENCE SOLVING PROBLEMS BY SEARCHING. Chapter 3
ARTIFICIAL INTELLIGENCE SOLVING PROBLEMS BY SEARCHING Chapter 3 1 PROBLEM SOLVING We want: To automatically solve a problem We need: A representation of the problem Algorithms that use some strategy to
More informationInformed (heuristic) search (cont). Constraint-satisfaction search.
CS 1571 Introduction to AI Lecture 5 Informed (heuristic) search (cont). Constraint-satisfaction search. Milos Hauskrecht milos@cs.pitt.edu 539 Sennott Square Administration PS 1 due today Report before
More informationCAP 4630 Artificial Intelligence
CAP 4630 Artificial Intelligence Instructor: Sam Ganzfried sganzfri@cis.fiu.edu 1 http://www.ultimateaiclass.com/ https://moodle.cis.fiu.edu/ 2 Solving problems by search 3 8-puzzle 4 8-queens 5 Search
More informationArtificial Intelligence: Search Part 1: Uninformed graph search
rtificial Intelligence: Search Part 1: Uninformed graph search Thomas Trappenberg January 8, 2009 ased on the slides provided by Russell and Norvig, hapter 3 Search outline Part 1: Uninformed search (tree
More informationWeek 3: Path Search. COMP9414/ 9814/ 3411: Artificial Intelligence. Motivation. Example: Romania. Romania Street Map. Russell & Norvig, Chapter 3.
COMP9414/9814/3411 17s1 Search 1 COMP9414/ 9814/ 3411: Artificial Intelligence Week 3: Path Search Russell & Norvig, Chapter 3. Motivation Reactive and Model-Based Agents choose their actions based only
More informationSearch Algorithms. Uninformed Blind search. Informed Heuristic search. Important concepts:
Uninformed Search Search Algorithms Uninformed Blind search Breadth-first uniform first depth-first Iterative deepening depth-first Bidirectional Branch and Bound Informed Heuristic search Greedy search,
More informationProblem solving and search
Problem solving and search Chapter 3 Chapter 3 1 How to Solve a (Simple) Problem 7 2 4 1 2 5 6 3 4 5 8 3 1 6 7 8 Start State Goal State Chapter 3 2 Introduction Simple goal-based agents can solve problems
More informationCS:4420 Artificial Intelligence
S:4420 rtificial Intelligence Spring 2018 Uninformed Search esare Tinelli The University of Iowa opyright 2004 18, esare Tinelli and Stuart Russell a a These notes were originally developed by Stuart Russell
More information4. Solving Problems by Searching
COMP9414/9814/3411 15s1 Search 1 COMP9414/ 9814/ 3411: Artificial Intelligence 4. Solving Problems by Searching Russell & Norvig, Chapter 3. Motivation Reactive and Model-Based Agents choose their actions
More informationPEAS: Medical diagnosis system
PEAS: Medical diagnosis system Performance measure Patient health, cost, reputation Environment Patients, medical staff, insurers, courts Actuators Screen display, email Sensors Keyboard/mouse Environment
More informationInformed Search and Exploration
Ch. 03 p.1/47 Informed Search and Exploration Sections 3.5 and 3.6 Ch. 03 p.2/47 Outline Best-first search A search Heuristics, pattern databases IDA search (Recursive Best-First Search (RBFS), MA and
More informationRobot Programming with Lisp
6. Search Algorithms Gayane Kazhoyan (Stuart Russell, Peter Norvig) Institute for University of Bremen Contents Problem Definition Uninformed search strategies BFS Uniform-Cost DFS Depth-Limited Iterative
More informationCS-E4800 Artificial Intelligence
CS-E4800 Artificial Intelligence Jussi Rintanen Department of Computer Science Aalto University January 12, 2017 Transition System Models The decision-making and planning at the top-level of many intelligent
More informationArtificial Intelligence
Artificial Intelligence CSC348 Unit 3: Problem Solving and Search Syedur Rahman Lecturer, CSE Department North South University syedur.rahman@wolfson.oxon.org Artificial Intelligence: Lecture Notes The
More informationCS 4700: Foundations of Artificial Intelligence. Bart Selman. Search Techniques R&N: Chapter 3
CS 4700: Foundations of Artificial Intelligence Bart Selman Search Techniques R&N: Chapter 3 Outline Search: tree search and graph search Uninformed search: very briefly (covered before in other prerequisite
More informationProblem solving and search
Problem solving and search hapter 3 hapter 3 1 Outline Problem-solving agents Problem types Problem formulation Example problems asic search algorithms hapter 3 3 Restricted form of general agent: Problem-solving
More informationAGENTS AND ENVIRONMENTS. What is AI in reality?
AGENTS AND ENVIRONMENTS What is AI in reality? AI is our attempt to create a machine that thinks (or acts) humanly (or rationally) Think like a human Cognitive Modeling Think rationally Logic-based Systems
More informationProblem solving and search
Problem solving and search Chapter 3 Chapter 3 1 Outline Problem-solving agents Problem types Problem formulation Example problems Uninformed search algorithms Informed search algorithms Chapter 3 2 Restricted
More informationAGENTS AND ENVIRONMENTS. What is AI in reality?
AGENTS AND ENVIRONMENTS What is AI in reality? AI is our attempt to create a machine that thinks (or acts) humanly (or rationally) Think like a human Cognitive Modeling Think rationally Logic-based Systems
More informationKI-Programmierung. Basic Search Algorithms
KI-Programmierung Basic Search Algorithms Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2007/2008 B. Beckert: KI-Programmierung p.1 Example: Travelling in Romania Scenario On holiday in Romania;
More informationArtificial Intelligence, CS, Nanjing University Spring, 2018, Yang Yu. Lecture 2: Search 1.
rtificial Intelligence, S, Nanjing University Spring, 2018, Yang Yu Lecture 2: Search 1 http://lamda.nju.edu.cn/yuy/course_ai18.ashx Problem in the lecture 7 2 4 51 2 3 5 6 4 5 6 8 3 1 7 8 Start State
More informationRoute planning / Search Movement Group behavior Decision making
Game AI Where is the AI Route planning / Search Movement Group behavior Decision making General Search Algorithm Design Keep a pair of set of states: One, the set of states to explore, called the open
More informationInformed Search and Exploration
Ch. 03b p.1/51 Informed Search and Exploration Sections 3.5 and 3.6 Nilufer Onder Department of Computer Science Michigan Technological University Ch. 03b p.2/51 Outline Best-first search A search Heuristics,
More informationProblem solving and search
Problem solving and search Chapter 3 Chapter 3 1 Problem formulation & examples Basic search algorithms Outline Chapter 3 2 On holiday in Romania; currently in Arad. Flight leaves tomorrow from Bucharest
More informationCS 771 Artificial Intelligence. Problem Solving by Searching Uninformed search
CS 771 Artificial Intelligence Problem Solving by Searching Uninformed search Complete architectures for intelligence? Search? Solve the problem of what to do. Learning? Learn what to do. Logic and inference?
More informationLecture 4: Search 3. Victor R. Lesser. CMPSCI 683 Fall 2010
Lecture 4: Search 3 Victor R. Lesser CMPSCI 683 Fall 2010 First Homework 1 st Programming Assignment 2 separate parts (homeworks) First part due on (9/27) at 5pm Second part due on 10/13 at 5pm Send homework
More informationCOMP9414/ 9814/ 3411: Artificial Intelligence. 5. Informed Search. Russell & Norvig, Chapter 3. UNSW c Alan Blair,
COMP9414/ 9814/ 3411: Artificial Intelligence 5. Informed Search Russell & Norvig, Chapter 3. COMP9414/9814/3411 15s1 Informed Search 1 Search Strategies General Search algorithm: add initial state to
More informationGraphs vs trees up front; use grid too; discuss for BFS, DFS, IDS, UCS Cut back on A* optimality detail; a bit more on importance of heuristics,
Graphs vs trees up front; use grid too; discuss for BFS, DFS, IDS, UCS Cut back on A* optimality detail; a bit more on importance of heuristics, performance data Pattern DBs? General Tree Search function
More informationSolving Problems using Search
Solving Problems using Search Artificial Intelligence @ Allegheny College Janyl Jumadinova September 11, 2018 Janyl Jumadinova Solving Problems using Search September 11, 2018 1 / 35 Example: Romania On
More information521495A: Artificial Intelligence
521495A: Artificial Intelligence Search Lectured by Abdenour Hadid Associate Professor, CMVS, University of Oulu Slides adopted from http://ai.berkeley.edu Agent An agent is an entity that perceives the
More informationSolving Problems by Searching
Solving Problems by Searching Agents, Goal-Based Agents, Problem-Solving Agents Search Problems Blind Search Strategies Agents sensors environment percepts actions? agent effectors Definition. An agent
More informationSolving Problems by Searching
Solving Problems by Searching Agents, Goal-Based Agents, Problem-Solving Agents Search Problems Blind Search Strategies Agents sensors environment percepts actions? agent effectors Definition. An agent
More informationSearch EECS 395/495 Intro to Artificial Intelligence
Search EECS 395/495 Intro to Artificial Intelligence Doug Downey (slides from Oren Etzioni, based on Stuart Russell, Dan Weld, Henry Kautz, and others) What is Search? Search is a class of techniques for
More informationDFS. Depth-limited Search
DFS Completeness? No, fails in infinite depth spaces or spaces with loops Yes, assuming state space finite. Time complexity? O(b m ), terrible if m is much bigger than d. can do well if lots of goals Space
More informationSearch EECS 348 Intro to Artificial Intelligence
Search EECS 348 Intro to Artificial Intelligence (slides from Oren Etzioni, based on Stuart Russell, Dan Weld, Henry Kautz, and others) What is Search? Search is a class of techniques for systematically
More informationChapter3. Problem-Solving Agents. Problem Solving Agents (cont.) Well-defined Problems and Solutions. Example Problems.
Problem-Solving Agents Chapter3 Solving Problems by Searching Reflex agents cannot work well in those environments - state/action mapping too large - take too long to learn Problem-solving agent - is one
More informationWhy Search. Things to consider. Example, a holiday in Jamaica. CSE 3401: Intro to Artificial Intelligence Uninformed Search
CSE 3401: Intro to Artificial Intelligence Uninformed Search Why Search Required Readings: R & N Chapter 3, Sec. 1-4. Lecture slides adapted from those of Fahiem Bacchus. Successful Success in game playing
More informationCS 8520: Artificial Intelligence
CS 8520: Artificial Intelligence Solving Problems by Searching Paula Matuszek Spring, 2013 Slides based on Hwee Tou Ng, aima.eecs.berkeley.edu/slides-ppt, which are in turn based on Russell, aima.eecs.berkeley.edu/slides-pdf.
More informationInformed search algorithms. Chapter 4, Sections 1 2 1
Informed search algorithms Chapter 4, Sections 1 2 Chapter 4, Sections 1 2 1 Outline Best-first search A search Heuristics Chapter 4, Sections 1 2 2 Review: Tree search function Tree-Search( problem, fringe)
More informationProblem solving and search
Problem solving and search Chapter 3 TB Artificial Intelligence Slides from AIMA http://aima.cs.berkeley.edu 1 /1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic
More informationSolving Problems by Searching
Solving Problems by Searching Berlin Chen 2004 Reference: 1. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Chapter 3 1 Introduction Problem-Solving Agents vs. Reflex Agents Problem-solving
More informationSearch. Intelligent agents. Problem-solving. Problem-solving agents. Road map of Romania. The components of a problem. that will take me to the goal!
Search Intelligent agents Reflex agent Problem-solving agent T65 rtificial intelligence and Lisp Peter alenius petda@ida.liu.se epartment of omputer and Information Science Linköping University Percept
More informationSolving problems by searching
Solving problems by searching 1 C H A P T E R 3 Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Outline 2 Problem-solving agents 3 Note: this is offline
More informationOverview. Path Cost Function. Real Life Problems. COMP219: Artificial Intelligence. Lecture 10: Heuristic Search
COMP219: Artificial Intelligence Lecture 10: Heuristic Search Overview Last time Depth-limited, iterative deepening and bi-directional search Avoiding repeated states Today Show how applying knowledge
More informationCOMP219: Artificial Intelligence. Lecture 10: Heuristic Search
COMP219: Artificial Intelligence Lecture 10: Heuristic Search 1 Class Tests Class Test 1 (Prolog): Tuesday 8 th November (Week 7) 13:00-14:00 LIFS-LT2 and LIFS-LT3 Class Test 2 (Everything but Prolog)
More informationOutline. Solving Problems by Searching. Introduction. Problem-solving agents
Outline Solving Problems by Searching S/ University of Waterloo Sept 7, 009 Problem solving agents and search Examples Properties of search algorithms Uninformed search readth first Depth first Iterative
More informationToday s s lecture. Lecture 2: Search - 1. Examples of toy problems. Searching for Solutions. Victor R. Lesser
Today s s lecture Lecture 2: Search - 1 Victor R. Lesser CMPSCI 683 Fall 2004 Why is search the key problem-solving technique in AI? Formulating and solving search problems. Understanding and comparing
More informationAnnouncements. Project 0: Python Tutorial Due last night
Announcements Project 0: Python Tutorial Due last night HW1 officially released today, but a few people have already started on it Due Monday 2/6 at 11:59 pm P1: Search not officially out, but some have
More informationCOMP219: Artificial Intelligence. Lecture 10: Heuristic Search
COMP219: Artificial Intelligence Lecture 10: Heuristic Search 1 Class Tests Class Test 1 (Prolog): Friday 17th November (Week 8), 15:00-17:00. Class Test 2 (Everything but Prolog) Friday 15th December
More informationArtificial Intelligence. Informed search methods
Artificial Intelligence Informed search methods In which we see how information about the state space can prevent algorithms from blundering about in the dark. 2 Uninformed vs. Informed Search Uninformed
More informationInformed search algorithms
Artificial Intelligence Topic 4 Informed search algorithms Best-first search Greedy search A search Admissible heuristics Memory-bounded search IDA SMA Reading: Russell and Norvig, Chapter 4, Sections
More informationPlanning and search. Lecture 1: Introduction and Revision of Search. Lecture 1: Introduction and Revision of Search 1
Planning and search Lecture 1: Introduction and Revision of Search Lecture 1: Introduction and Revision of Search 1 Lecturer: Natasha lechina email: nza@cs.nott.ac.uk ontact and web page web page: http://www.cs.nott.ac.uk/
More informationUninformed Search. Problem-solving agents. Tree search algorithms. Single-State Problems
Uninformed Search Problem-solving agents Tree search algorithms Single-State Problems Breadth-First Search Depth-First Search Limited-Depth Search Iterative Deepening Extensions Graph search algorithms
More informationUninformed Search. Reading: Chapter 4 (Tuesday, 2/5) HW#1 due next Tuesday
Uninformed Search Reading: Chapter 4 (Tuesday, 2/5) HW#1 due next Tuesday 1 Uninformed Search through the space of possible solutions Use no knowledge about which path is likely to be best Exception: uniform
More informationAr#ficial)Intelligence!!
Introduc*on! Ar#ficial)Intelligence!! Roman Barták Department of Theoretical Computer Science and Mathematical Logic Problem Solving: Uninformed Search Simple reflex agent only transfers the current percept
More informationSolving Problems: Blind Search
Solving Problems: Blind Search Instructor: B. John Oommen Chancellor s Professor Fellow: IEEE ; Fellow: IAPR School of Computer Science, Carleton University, Canada The primary source of these notes are
More informationArtificial Intelligence
Artificial Intelligence Search Marc Toussaint University of Stuttgart Winter 2015/16 (slides based on Stuart Russell s AI course) Outline Problem formulation & examples Basic search algorithms 2/100 Example:
More informationAI: problem solving and search
: problem solving and search Stefano De Luca Slides mainly by Tom Lenaerts Outline Problem-solving agents A kind of goal-based agent Problem types Single state (fully observable) Search with partial information
More informationCS 380: Artificial Intelligence Lecture #3
CS 380: Artificial Intelligence Lecture #3 William Regli Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms 1 Problem-solving agents Example: Romania
More informationProblem Solving and Search
Artificial Intelligence Problem Solving and Search Dae-Won Kim School of Computer Science & Engineering Chung-Ang University Outline Problem-solving agents Problem types Problem formulation Example problems
More informationInformed Search and Exploration
Ch. 04 p.1/39 Informed Search and Exploration Chapter 4 Ch. 04 p.2/39 Outline Best-first search A search Heuristics IDA search Hill-climbing Simulated annealing Ch. 04 p.3/39 Review: Tree search function
More informationChapter 3: Solving Problems by Searching
Chapter 3: Solving Problems by Searching Prepared by: Dr. Ziad Kobti 1 Problem-Solving Agent Reflex agent -> base its actions on a direct mapping from states to actions. Cannot operate well in large environments
More informationArtificial Intelligence
Artificial Intelligence hapter 1 hapter 1 1 Iterative deepening search function Iterative-Deepening-Search( problem) returns a solution inputs: problem, a problem for depth 0 to do result Depth-Limited-Search(
More informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 3, 4/6/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes 4/6/2005 EE562 1 Today: Basic
More informationComputer Science and Software Engineering University of Wisconsin - Platteville. 3. Search (Part 1) CS 3030 Lecture Notes Yan Shi UW-Platteville
Computer Science and Software Engineering University of Wisconsin - Platteville 3. Search (Part 1) CS 3030 Lecture Notes Yan Shi UW-Platteville Read: Textbook Chapter 3.7-3.9,3.12, 4. Problem Solving as
More informationS A E RC R H C I H NG N G IN N S T S A T T A E E G R G A R PH P S
LECTURE 2 SEARCHING IN STATE GRAPHS Introduction Idea: Problem Solving as Search Basic formalism as State-Space Graph Graph explored by Tree Search Different algorithms to explore the graph Slides mainly
More informationOutline. Solving problems by searching. Problem-solving agents. Example: Romania
Outline Solving problems by searching Chapter 3 Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Systems 1 Systems 2 Problem-solving agents Example: Romania
More informationInformed search algorithms
Informed search algorithms Chapter 4, Sections 1 2 Chapter 4, Sections 1 2 1 Outline Best-first search A search Heuristics Chapter 4, Sections 1 2 2 Review: Tree search function Tree-Search( problem, fringe)
More informationSearch I. slides from: Padhraic Smyth, Bryan Low, S. Russell and P. Norvig
Search I slides from: Padhraic Smyth, Bryan Low, S. Russell and P. Norvig Problem-Solving Agents Intelligent agents can solve problems by searching a state-space State-space Model the agent s model of
More informationProblem solving and search: Chapter 3, Sections 1 5
Problem solving and search: hapter 3, Sections 1 5 1 Outline Problem-solving agents Problem types Problem formulation Example problems asic search algorithms 2 Problem-solving agents estricted form of
More informationProblem solving and search: Chapter 3, Sections 1 5
Problem solving and search: hapter 3, Sections 1 5 S 480 2 Outline Problem-solving agents Problem types Problem formulation Example problems asic search algorithms Problem-solving agents estricted form
More informationOutline for today s lecture. Informed Search I. One issue: How to search backwards? Very briefly: Bidirectional search. Outline for today s lecture
Outline for today s lecture Informed Search I Uninformed Search Briefly: Bidirectional Search (AIMA 3.4.6) Uniform Cost Search (UCS) Informed Search Introduction to Informed search Heuristics 1 st attempt:
More informationARTIFICIAL INTELLIGENCE. Pathfinding and search
INFOB2KI 2017-2018 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Pathfinding and search Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from www.cs.uu.nl/docs/vakken/b2ki/schema.html
More informationARTIFICIAL INTELLIGENCE (CSC9YE ) LECTURES 2 AND 3: PROBLEM SOLVING
ARTIFICIAL INTELLIGENCE (CSC9YE ) LECTURES 2 AND 3: PROBLEM SOLVING BY SEARCH Gabriela Ochoa http://www.cs.stir.ac.uk/~goc/ OUTLINE Problem solving by searching Problem formulation Example problems Search
More informationWarm- up. IteraAve version, not recursive. class TreeNode TreeNode[] children() boolean isgoal() DFS(TreeNode start)
Warm- up We ll o-en have a warm- up exercise for the 10 minutes before class starts. Here s the first one Write the pseudo code for breadth first search and depth first search IteraAve version, not recursive
More informationUninformed Search Methods
Uninformed Search Methods Search Algorithms Uninformed Blind search Breadth-first uniform first depth-first Iterative deepening depth-first Bidirectional Branch and Bound Informed Heuristic search Greedy
More informationIntroduction to Artificial Intelligence. Informed Search
Introduction to Artificial Intelligence Informed Search Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2004/2005 B. Beckert: KI für IM p.1 Outline Best-first search A search Heuristics B. Beckert:
More informationCSC 2114: Artificial Intelligence Search
CSC 2114: Artificial Intelligence Search Ernest Mwebaze emwebaze@cit.ac.ug Office: Block A : 3 rd Floor [Slide Credit Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. Reference materials
More informationSolving problems by searching
Solving problems by searching Chapter 3 Systems 1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Systems 2 Problem-solving agents Systems 3 Example:
More informationChapter 3. A problem-solving agent is a kind of goal-based agent. It decide what to do by finding sequences of actions that lead to desirable states.
Chapter 3 A problem-solving agent is a kind of goal-based agent. It decide what to do by finding sequences of actions that lead to desirable states. A problem can be defined by four components : 1. The
More informationChapter 2. Blind Search 8/19/2017
Chapter 2 1 8/19/2017 Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms 8/19/2017 2 8/19/2017 3 On holiday in Romania; currently in Arad. Flight leaves tomorrow
More informationAdditional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication
Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last
More informationSolving Problem by Searching. Chapter 3
Solving Problem by Searching Chapter 3 Outline Problem-solving agents Problem formulation Example problems Basic search algorithms blind search Heuristic search strategies Heuristic functions Problem-solving
More informationLecture 3. Uninformed Search
Lecture 3 Uninformed Search 1 Uninformed search strategies Uninformed: While searching you have no clue whether one non-goal state is better than any other. Your search is blind. You don t know if your
More informationCS 4100 // artificial intelligence
CS 4100 // artificial intelligence instructor: byron wallace Search I Attribution: many of these slides are modified versions of those distributed with the UC Berkeley CS188 materials Thanks to John DeNero
More informationPrincess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department (CHAPTER-3-PART3) PROBLEM SOLVING AND SEARCH Searching algorithm Uninformed
More informationCOSC343: Artificial Intelligence
COSC343: Artificial Intelligence Lecture 18: Informed search algorithms Alistair Knott Dept. of Computer Science, University of Otago Alistair Knott (Otago) COSC343 Lecture 18 1 / 1 In today s lecture
More informationSolving problems by searching. Chapter 3
Solving problems by searching Chapter 3 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms 2 Example: Romania On holiday in Romania; currently in
More informationSolving problems by searching
Solving problems by searching Chapter 3 CS 2710 1 Outline Problem-solving agents Problem formulation Example problems Basic search algorithms CS 2710 - Blind Search 2 1 Goal-based Agents Agents that take
More informationArtificial Intelligence Problem Solving and Uninformed Search
Artificial Intelligence Problem Solving and Uninformed Search Maurizio Martelli, Viviana Mascardi {martelli, mascardi}@disi.unige.it University of Genoa Department of Computer and Information Science AI,
More informationIntroduction to Artificial Intelligence (G51IAI) Dr Rong Qu. Blind Searches
Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Blind Searches Blind Searches Function GENERAL-SEARCH (problem, QUEUING-FN) returns a solution or failure nodes = MAKE-QUEUE(MAKE-NODE(INITIAL-STATE[problem]))
More informationInformed Search and Exploration
Informed Search and Exploration Chapter 4 (4.1-4.3) CS 2710 1 Introduction Ch.3 searches good building blocks for learning about search But vastly inefficient eg: Can we do better? Breadth Depth Uniform
More informationA2 Uninformed Search
2 Uninformed Search Hantao Zhang http://www.cs.uiowa.edu/ hzhang/c145 The University of Iowa Department of omputer Science rtificial Intelligence p.1/82 Example: The 8-puzzle 2 8 3 1 7 6 4 5 It can be
More informationExample: The 8-puzzle. A2 Uninformed Search. It can be generalized to 15-puzzle, 24-puzzle, or. (n 2 1)-puzzle for n 6. Department of Computer Science
2 Uninformed Search Hantao Zhang http://www.cs.uiowa.edu/ hzhang/c145 The University of Iowa Department of omputer Science rtificial Intelligence p.1/82 Example: The 8-puzzle 2 1 7 8 3 6 4 5 It can be
More information