Chapter4. Tree Search (Reviewed, Fig. 3.9) Best-First Search. Search Strategies. Best-First Search (cont.-2) Best-First Search (cont.

Size: px
Start display at page:

Download "Chapter4. Tree Search (Reviewed, Fig. 3.9) Best-First Search. Search Strategies. Best-First Search (cont.-2) Best-First Search (cont."

Transcription

1 Tree Search (Reviewed, Fig. 3.9) Chapter4 Informed Search and Exploration chap chap4 2 Search Strategies A search strategy is defined by picking the order of node expansion Uninformed Search Strategies - By systematically generating new states and testing against the goal. Informed (Heuristic) Search Strategies - By using problem-specific knowledge to find solutions more efficiently. Best-First Search An instance of the general Tree Search. A node is selected for expansion based on an evaluation function, f(n), i.e. an estimate of desirablity Expand most desirable unexpanded node. Can be implemented via a priority queue that will maintain the fringe in ascending order of f-values. Best-first search is venerable but inaccurate chap chap4 4 Best-First Search (cont.-1) Heuristic search uses problem-specific knowledge: evaluation function. Choose the seemingly-best node based on some estimate of the cost of the corresponding solution. Need estimate of the cost to a goal e.g. Depth of the current node Sum of the distances so far Euclidean distance to goal etc. Heuristics: rules of thumb ( 概測法 ) Goal: to find solutions more efficiently chap4 5 Best-First Search (cont.-2) Heuristic function h(n) = estimated cost of the cheapest path from node n to a goal node. (h(n) = 0, for a goal node) Special cases - Greedy Best-First Search (or Greedy Search) Minimizing estimated cost from the node to reach a goal Expanding the node that appears to be closest to goal - A* Search Minimizing the total estimated solution cost Avoid expanding paths that are already expensive chap4 6 1

2 Heuristics Heuristic is derived from heuriskein in Greek, meaning to find or to discover The term heuristics is often used to describe rules of thumb ( 經驗法則 ) or advice that are generally effective, but are not guaranteed to work in every case. In the context of search, a heuristic is a function that takes a state as an argument and returns a number that is an estimate of the merit of the state with respect to the goal chap4 7 Heuristics (cont.) A heuristic algorithm improves the average-case performance, does not necessarily improve the worst-case performance. Not all heuristic functions are beneficial. - The time spent evaluating the heuristic function in order to select a node for expansion must be recovered by a corresponding reduction in the size of the search space explored. - Useful heuristics should be computationally inexpensive! chap4 8 Romania with step costs in km Straight-line distances to Bucharest Greedy Best-First Search Heuristic function: h(n) = estimated best cost to goal from n h(n) = 0 if n is a goal e.g. h SLD (n) = straight-line distance for route-finding Function GREEDY-SEARCH(problem) return a solution or failure return BEST-FIRST-SEARCH(problem, h) chap chap4 10 Greedy Best-First Search Example Greedy Best-First Search Example (cont.-1) Assume that we want to use greedy search to solve the problem of travelling from Arad to Bucharest. The initial state=arad The first expansion step produces: Sibiu, Timisoara and Zerind Greedy best-first will select Sibiu chap chap4 12 2

3 Greedy Best-First Search Example (cont.-2) Greedy Best-First Search Example (cont.-3) If Sibiu is expanded we get: Arad, Fagaras, Oradea and Rimnicu Vilcea Greedy best-first search will select: Fagaras chap4 13 If Fagaras is expanded we get: Sibiu and Bucharest Goal reached!! Yet not optimal (see Arad Sibiu Rimnicu Vilcea Pitesti) chap4 14 Analysis of Greedy Search Complete?? No (start down an infinite path and never return to try other possibilities) (e.g. from Iasi to Fagaras) - Susceptible to false starts Iasi Neamt (dead end) - No Repeated states Checking Iasi Neamt Iasi Neamt Iasi.. (oscillation) Analysis of Greedy Search (cont.) Optimal?? No (same as depth-first search) (e.g. from Arad to Bucharest) Arad Sibiu Fagaras Bucharest (450= , is not shortest) Arad Sibiu Rim Pitesti Bucharest (418= ) Time?? (like depth-first search) -worst:o(b m ), but a good heuristic can give dramatic improvement m: the maximum depth of the search space Space?? O(b m ): keep all nodes in memory chap chap4 16 A* Search function A*-SEARCH(problem) returns a solution or failure return BEST-FIRST-SEARCH(problem, g+h) To minimizing the total estimated solution cost Evaluation function: f(n) = estimated cost of the cheapest solution through n to goal = g(n) + h(n) g(n) = cost so far to reach n h(n) = estimated cost from n to the goal chap4 17 Admissible Heuristic A* search uses an admissible heuristic i.e. h(n) h * (n) where h * (n) is the true cost from n (Also h(n) 0, so h(g) = 0 for any goal G) Theorem: If h(n) is admissible, A* using tree-search is optimal. It is both complete and optimal if h never overestimates the cost to the goal chap4 18 3

4 A* Search Example A* Search Example (cont.-1) Find Bucharest starting at Arad f(arad) = c(??,arad)+h(arad)=0+366=366 Expand Arrad and determine f(n) for each node f(sibiu)=c(arad,sibiu)+h(sibiu)= =393 f(timisoara)=c(arad,timisoara)+h(timisoara)= =447 f(zerind)=c(arad,zerind)+h(zerind)=75+374=449 Best choice is Sibiu chap chap4 20 A* Search Example (cont.-2) A* Search Example (cont.-3) Expand Sibiu and determine f(n) for each node f(arad)=c(sibiu,arad)+h(arad)= =646 f(fagaras)=c(sibiu,fagaras)+h(fagaras)= =415 f(oradea)=c(sibiu,oradea)+h(oradea)= =671 f(rimnicu Vilcea)=c(Sibiu,Rimnicu Vilcea)+h(Rimnicu Vilcea) = =413 Best choice is Rimnicu Vilcea chap4 21 Expand Rimnicu Vilcea and determine f(n) for each node f(craiova)=c(rimnicu Vilcea, Craiova)+h(Craiova)= =526 f(pitesti)=c(rimnicu Vilcea, Pitesti)+h(Pitesti)= =417 f(sibiu)=c(rimnicu Vilcea,Sibiu)+h(Sibiu)= =553 Best choice is Fagaras chap4 22 A* Search Example (cont.-4) A* Search Example (cont.-5) Expand Fagaras and determine f(n) for each node f(sibiu)=c(fagaras, Sibiu)+h(Sibiu)= =591 f(bucharest)=c(fagaras,bucharest)+h(bucharest)=450+0 =450 Best choice is Pitesti chap4 23 Expand Pitesti and determine f(n) for each node f(bucharest)=c(pitesti,bucharest)+h(bucharest)=418+0=418 Best choice is Bucharest Optimal solution (only if h(n) is admissable) Note values along optimal path chap4 24 4

5 Optimality of A* Suppose some suboptimal goal G 2 has been generated and is in the queue. Let n be an unexpanded node on a shortest path to an optimal goal G. Optimality of A* (cont.-1) C* : cost of the optimal solution path A* may expand some nodes before selecting a goal node. Assume: G is an optimal and G 2 is a suboptimal goal. f(g 2 ) = g(g 2 ) + h(g 2 ) = g(g 2 ) > C* (1) For some n on an optimal path to G, if h is admissible, then f(n) = g(n) + h(n) C* (2) From (1) and (2), we have f(n) C* < f(g 2 ) So, A* will never select G 2 for expansion chap chap4 26 Optimality of A* (cont.-2) BUT graph search (instead of tree-search) Discards new paths to repeated state. - Previous proof breaks down Solution: - Add extra bookkeeping i.e. remove more expensive of two paths. - Ensure that optimal path to any repeated state is always first followed. Extra requirement on h(n): consistency (monotonicity) chap4 27 Monotonicity (Consistency) of Heuristic A heuristic is consistent if h(n) c(n, a, n ) + h(n ) The estimated cost of reaching the goal from n is no greater than the step cost of getting to successor n plus the estimated cost of reaching the goal from n If h is consistent, we have f(n ) = g(n ) + h(n ) = g(n) + c(n, a, n ) + h(n ) g(n) + h(n) = f(n) f(n ) f(n) i.e. f(n) is non-decreasing along any path. Theorem: If h(n) is cosisient, A* using graph search is optimal chap4 28 Optimality of A* (cont.-3) A* expands nodes in order of increasing f value Gradually adds f-contours of nodes Contour i has all nodes with f = f i, where f i < f i+1 All nodes with f(n) > C* (optimal solution) are pruned. Analysis of A* Search Complete?? Yes unless there are indefinitely many nodes with f f(g) Space?? O(b d ), keep all nodes in memory Optimal?? Yes, if the heuristic is admissible Optimally Efficient?? Yes i.e. No other optimal algorithm is guaranteed to expand fewer nodes than A* A* is not practical for many large-scale problems. (Since A* usually runs out of space long before it runs out of time.) chap chap4 30 5

6 Memory Bounded Heuristic Search Overcome the space problem of A*, without sacrificing optimality or completeness IDA* (Iterative Deepening A*) - a logical extension of iterative deepening search to use heuristic - the cutoff used is the f-cost (g+h) rather than the depth RBFS (Recursive best-first search) MA* (Memory-bounded A*) SMA* (Simplified MA*) - is similar to A*, but restricts the queue size to fit into the available memory - drop the worst-leaf node when memory is full chap4 31 RBFS (Recursive Best-First Search) chap4 32 RBFS Example RBFS Example (cont.-1) = = = =( )+366 =(140+99) +176 =(140+80) +193 Path until Rumnicu Vilcea is already expanded Above node; f-limit for every recursive call is shown on top. Below node: f(n) The path is followed until Pitesti which has a f-value worse than the f-limit chap4 33 Unwind recursion and store best f-value for current best leaf Pitesti result, f [best] RBFS(problem, best, min(f_limit, alternative)) best is now Fagaras. Call RBFS for new best best value is now chap4 34 RBFS Example (cont.-2) Analysis of RBFS Complete?? Yes Time?? Exponential Space?? O(bd) Optimal?? Yes, if the heuristic is admissible Unwind recursion and store best f-value for current best leaf Fagaras result, f [best] RBFS(problem, best, min(f_limit, alternative)) best is now Rimnicu Viclea (again). Call RBFS for new best. Subtree is again expanded. Best alternative subtree is now through Timisoara Solution is found since because 447 > chap4 35 IDA* and RBFS suffer from too little memory. IDA* retains only one single number (the current f-cost limit) RBFS is a bit more efficient than IDA* Still excessive node generation chap4 36 6

7 Heuristic Functions e.g. for the 8-puzzle branching factor: 3 depth: 22 # of states: 3 22 = 3.1 * ! /2= 181,440 (reachable distinct states) for the 15-puzzle # of states: How to find a good heuristic function? chap4 37 Heuristic Functions (cont.) Two commonly-used candidates h 1 (n) = number of misplaced tiles =8 h 2 (n) = total Manhattan distance (i.e. no. of squares from desired location to each tile) = = chap4 38 Effect of Heuristic Accuracy on Performance If h2(n) >= h1(n) for all n (both admissible) then h2 dominates h1 and is better for search 1200 random problems with solution lengths from 2 to 24. Heuristic Quality Effective branching factor b* is defined by * * 2 N + 1 = 1+ b + ( b ) + L+ ( b ) * d A well-designed heuristic would have a value of b* close to 1, allowing fairly large problems to be solved. A heuristic function h 2 is said to be more informed than h 1 (or h 2 dominates h 1 ) if both are admissible and h 2 dominates (is more informed than) h chap4 39 n h ( n) h ( ), 2 1 n A* using h 2 will never expand more nodes than A* using h chap4 40 Inventing Admissible Heuristics Relaxed problems A problem with fewer restrictions on the actions The cost of an optimal solution to a relaxed problem is an admissible heuristic for the original problem. ABSolver is a program that can generate heuristics automatically from problem definitions, using the relaxed problem method and various other techniques. generated a new heuristic for 8-puzzle better than preexisting heuristic found the first useful heuristic for Rubik s cube puzzle chap4 41 Inventing Admissible Heuristics (cont.-1) e.g. A tile can move from square A to square B if A is horizontally or vertically adjacent to B and B is blank. (P if R and S) 3 Relaxed problems: (a) A tile can move from square A to square B if A is horizontally or vertically adjacent to B. (P if R) --- derive h 2 (b) A tile can move from square A to square B if B is blank. (P if S) (c) A tile can move from square A to square B. (P) --- derive h chap4 42 7

8 Inventing Admissible Heuristics (cont.-2) Composite heuristics Given h 1, h 2, h 3,, h m ; none dominates any others. h(n) = max{h 1 (n), h 2 (n),, h m (n)} Subproblem The cost of the optimal solution of the subproblem is a lower bound on the cost of the complete problem. (To get tiles 1,2,3 and 4 into their correct positions, without worrying about what happens to the other titles.) Pattern databases store the exact solution to for every possible subproblem instance. - The complete heuristic is constructed using the patterns in the DB chap4 43 Inventing Admissible Heuristics (cont.-3) Weighted evaluation function : f w ( n) = (1 w) g( n) + wh( n) Through learning from experience Experience = solving lots of 8-puzzles An inductive learning algorithm can be used to predict costs for other states that arise during search. Search cost Good heuristics should be efficiently computable chap4 44 Local Search and Optimization Previously: systematic exploration of search space. - Path to goal is solution to problem YET, for some problems path is irrelevant. e.g 8-queens What quantities of quarters, nickels, and dimes add up to $17.45 and minimizes the total number of coins Different algorithms can be used - Local search Local Search Algorithms Local search does not keep track of previous solutions - Using a single current state (rather than multiple paths) and move only to neighboring states Advantages - Use a small amount of memory (usually constant amount) - Often find reasonable (note we aren t saying optimal) solutions in infinite search spaces chap chap4 46 Optimization Problems Looking for global maximum (or minimum) To find the best state according to an Objective Function Example f (q, d, n) = 1,000,000, if q* d*0.1 + n*0.05!= To minimize f = q + n + d, otherwise chap chap4 48 8

9 Hill-Climbing Search Hill-Climbing Search (cont.-1) Like climbing Everest in thick fog with amnesia chap4 49 Only record the state and it evaluation instead of maintaining a search tree is a loop that continuously moves in the direction of increasing value - It terminates when a peak is reached. Hill climbing does not look ahead of the immediate neighbors of the current state. Hill-climbing chooses randomly among the set of best successors, if there is more than one. Hill-climbing i.e. greedy local search chap4 50 Hill-climbing example a) b) Hill-Climbing Search (cont.-2) Problems: Local Maxima: search halts prematurely Plateaux: search conducts a random walk a) shows a state of h=17 and the h-value for each possible successor. (h= ) b) A local minimum in the 8-queens state space (h=1). Ridges: search oscillates with slow progress Creating a sequence of local maximum that are not directly connected to each other. From each local maximum, all the available actions point downhill chap chap4 52 Hill-climbing variations Simulated Annealing Stochastic hill-climbing Random selection among the uphill moves. The selection probability can vary with the steepness of the uphill move. First-choice hill-climbing Like stochastic hill climbing but by generating successors randomly until a better one is found. Random-restart hill-climbing Tries to avoid getting stuck in local maxima chap chap4 54 9

10 Simulated Annealing (cont.-1) Idea: escape local maxima by allowing some "bad" moves but gradually decrease their frequency A term borrowed from metalworking - We want metal molecules to find a stable location relative to neighbors - heating causes metal molecules to move around and to take on undesirable locations - during cooling, molecules reduce their movement and settle into a more stable position - annealing is process of heating metal and letting it cool slowly to lock in the stable locations of the molecules Simulated Annealing (cont.-2) Select a random move at each iteration Move to the selected node if it is better than the current node. The probability of moving to a worse node decreases exponentially with the ``badness'' of the move, E T i.e. e Δ / The temperature T changes according to a schedule chap chap4 56 Simulated Annealing (cont.-3) One can prove: If T decreases slowly enough, then simulated annealing search will find a global optimum with probability approaching 1 Widely used in VLSI layout, airline scheduling, etc Local Beam Search Keep track of k states rather than just one Start with k randomly generated states At each iteration, all the successors of all k states are generated If any one is a goal state, stop; else select the k best successors from the complete list and repeat chap chap4 58 Genetic algorithms Genetic Algorithms (cont.-1) A successor state is generated by combining two parent states Start with k randomly generated states (population) A state is represented as a string over a finite alphabet (often a string of 0s and 1s) Evaluation function (fitness function). Higher values for better states. Produce the next generation of states by selection, crossover, and mutation Fitness function: number of non-attacking pairs of queens (min = 0, max = 8 7/2 = 28) 24/( ) = 31% 23/( ) = 29% etc chap chap

11 Genetic Algorithms (cont.-2) chap

CS 380: Artificial Intelligence Lecture #4

CS 380: Artificial Intelligence Lecture #4 CS 380: Artificial Intelligence Lecture #4 William Regli Material Chapter 4 Section 1-3 1 Outline Best-first search Greedy best-first search A * search Heuristics Local search algorithms Hill-climbing

More information

Informed search algorithms. Chapter 4

Informed search algorithms. Chapter 4 Informed search algorithms Chapter 4 Material Chapter 4 Section 1 - Exclude memory-bounded heuristic search 3 Outline Best-first search Greedy best-first search A * search Heuristics Local search algorithms

More information

Informed Search. Notes about the assignment. Outline. Tree search: Reminder. Heuristics. Best-first search. Russell and Norvig chap.

Informed Search. Notes about the assignment. Outline. Tree search: Reminder. Heuristics. Best-first search. Russell and Norvig chap. Notes about the assignment Informed Search Russell and Norvig chap. 4 If it says return True or False, return True or False, not "True" or "False Comment out or remove print statements before submitting.

More information

Artificial Intelligence Informed search. Peter Antal

Artificial Intelligence Informed search. Peter Antal Artificial Intelligence Informed search Peter Antal antal@mit.bme.hu 1 Informed = use problem-specific knowledge Which search strategies? Best-first search and its variants Heuristic functions? How to

More information

Lecture 4: Informed/Heuristic Search

Lecture 4: Informed/Heuristic Search Lecture 4: Informed/Heuristic Search Outline Limitations of uninformed search methods Informed (or heuristic) search uses problem-specific heuristics to improve efficiency Best-first A* RBFS SMA* Techniques

More information

Informed Search. Best-first search. Greedy best-first search. Intelligent Systems and HCI D7023E. Romania with step costs in km

Informed Search. Best-first search. Greedy best-first search. Intelligent Systems and HCI D7023E. Romania with step costs in km Informed Search Intelligent Systems and HCI D7023E Lecture 5: Informed Search (heuristics) Paweł Pietrzak [Sec 3.5-3.6,Ch.4] A search strategy which searches the most promising branches of the state-space

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Dr Ahmed Rafat Abas Computer Science Dept, Faculty of Computers and Informatics, Zagazig University arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ Informed search algorithms

More information

ARTIFICIAL INTELLIGENCE. Informed search

ARTIFICIAL INTELLIGENCE. Informed search INFOB2KI 2017-2018 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Informed 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 information

EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS

EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 4, 4/11/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes Today: Informed search algorithms

More information

Artificial Intelligence

Artificial 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 information

Informed Search and Exploration

Informed 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 information

Outline. Best-first search

Outline. Best-first search Outline Best-first search Greedy best-first search A* search Heuristics Admissible Heuristics Graph Search Consistent Heuristics Local search algorithms Hill-climbing search Beam search Simulated annealing

More information

TDT4136 Logic and Reasoning Systems

TDT4136 Logic and Reasoning Systems TDT4136 Logic and Reasoning Systems Chapter 3 & 4.1 - Informed Search and Exploration Lester Solbakken solbakke@idi.ntnu.no Norwegian University of Science and Technology 18.10.2011 1 Lester Solbakken

More information

2006/2007 Intelligent Systems 1. Intelligent Systems. Prof. dr. Paul De Bra Technische Universiteit Eindhoven

2006/2007 Intelligent Systems 1. Intelligent Systems. Prof. dr. Paul De Bra Technische Universiteit Eindhoven test gamma 2006/2007 Intelligent Systems 1 Intelligent Systems Prof. dr. Paul De Bra Technische Universiteit Eindhoven debra@win.tue.nl 2006/2007 Intelligent Systems 2 Informed search and exploration Best-first

More information

Outline. Best-first search

Outline. Best-first search Outline Best-first search Greedy best-first search A* search Heuristics Local search algorithms Hill-climbing search Beam search Simulated annealing search Genetic algorithms Constraint Satisfaction Problems

More information

Informed Search. Dr. Richard J. Povinelli. Copyright Richard J. Povinelli Page 1

Informed Search. Dr. Richard J. Povinelli. Copyright Richard J. Povinelli Page 1 Informed Search Dr. Richard J. Povinelli Copyright Richard J. Povinelli Page 1 rev 1.1, 9/25/2001 Objectives You should be able to explain and contrast uniformed and informed searches. be able to compare,

More information

Lecture Plan. Best-first search Greedy search A* search Designing heuristics. Hill-climbing. 1 Informed search strategies. Informed strategies

Lecture Plan. Best-first search Greedy search A* search Designing heuristics. Hill-climbing. 1 Informed search strategies. Informed strategies Lecture Plan 1 Informed search strategies (KA AGH) 1 czerwca 2010 1 / 28 Blind vs. informed search strategies Blind search methods You already know them: BFS, DFS, UCS et al. They don t analyse the nodes

More information

Informed Search and Exploration

Informed 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 information

Informed Search and Exploration

Informed 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 information

Informed Search Algorithms. Chapter 4

Informed Search Algorithms. Chapter 4 Informed Search Algorithms Chapter 4 Outline Informed Search and Heuristic Functions For informed search, we use problem-specific knowledge to guide the search. Topics: Best-first search A search Heuristics

More information

Informed Search and Exploration

Informed 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 information

Artificial intelligence 1: informed search

Artificial intelligence 1: informed search Artificial intelligence 1: informed search Lecturer: Tom Lenaerts Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle (IRIDIA) Université Libre de Bruxelles Outline

More information

Informed search algorithms. (Based on slides by Oren Etzioni, Stuart Russell)

Informed search algorithms. (Based on slides by Oren Etzioni, Stuart Russell) Informed search algorithms (Based on slides by Oren Etzioni, Stuart Russell) The problem # Unique board configurations in search space 8-puzzle 9! = 362880 15-puzzle 16! = 20922789888000 10 13 24-puzzle

More information

Informed search algorithms. Chapter 4

Informed search algorithms. Chapter 4 Informed search algorithms Chapter 4 Outline Best-first search Greedy best-first search A * search Heuristics Memory Bounded A* Search Best-first search Idea: use an evaluation function f(n) for each node

More information

Informed search algorithms

Informed 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 information

Informed Search and Exploration

Informed Search and Exploration Informed Search and Exploration Berlin Chen 2005 Reference: 1. S. Russell and P. Norvig. Artificial Intelligence: A Modern Approach, Chapter 4 2. S. Russell s teaching materials AI - Berlin Chen 1 Introduction

More information

Informed search algorithms. Chapter 4, Sections 1 2 1

Informed 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 information

TDDC17. Intuitions behind heuristic search. Recall Uniform-Cost Search. Best-First Search. f(n) =... + h(n) g(n) = cost of path from root node to n

TDDC17. Intuitions behind heuristic search. Recall Uniform-Cost Search. Best-First Search. f(n) =... + h(n) g(n) = cost of path from root node to n Intuitions behind heuristic search The separation property of GRAPH-SEARCH TDDC17 Seminar III Search II Informed or Heuristic Search Beyond Classical Search Find a heuristic measure h(n) which estimates

More information

Informed search algorithms

Informed search algorithms CS 580 1 Informed search algorithms Chapter 4, Sections 1 2, 4 CS 580 2 Outline Best-first search A search Heuristics Hill-climbing Simulated annealing CS 580 3 Review: General search function General-Search(

More information

Informed search algorithms

Informed 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 information

CS:4420 Artificial Intelligence

CS:4420 Artificial Intelligence CS:4420 Artificial Intelligence Spring 2018 Informed Search Cesare Tinelli The University of Iowa Copyright 2004 18, Cesare Tinelli and Stuart Russell a a These notes were originally developed by Stuart

More information

Dr. Mustafa Jarrar. Chapter 4 Informed Searching. Artificial Intelligence. Sina Institute, University of Birzeit

Dr. Mustafa Jarrar. Chapter 4 Informed Searching. Artificial Intelligence. Sina Institute, University of Birzeit Lecture Notes on Informed Searching University of Birzeit, Palestine 1 st Semester, 2014 Artificial Intelligence Chapter 4 Informed Searching Dr. Mustafa Jarrar Sina Institute, University of Birzeit mjarrar@birzeit.edu

More information

Introduction to Artificial Intelligence. Informed Search

Introduction 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 information

Chapter 3: Informed Search and Exploration. Dr. Daisy Tang

Chapter 3: Informed Search and Exploration. Dr. Daisy Tang Chapter 3: Informed Search and Exploration Dr. Daisy Tang Informed Search Definition: Use problem-specific knowledge beyond the definition of the problem itself Can find solutions more efficiently Best-first

More information

TDDC17. Intuitions behind heuristic search. Best-First Search. Recall Uniform-Cost Search. f(n) =... + h(n) g(n) = cost of path from root node to n

TDDC17. Intuitions behind heuristic search. Best-First Search. Recall Uniform-Cost Search. f(n) =... + h(n) g(n) = cost of path from root node to n Intuitions behind heuristic search The separation property of GRAPH-SEARCH TDDC17 Seminar III Search II Informed or Heuristic Search Beyond Classical Search Find a heuristic measure h(n) which estimates

More information

Dr. Mustafa Jarrar. Chapter 4 Informed Searching. Sina Institute, University of Birzeit

Dr. Mustafa Jarrar. Chapter 4 Informed Searching. Sina Institute, University of Birzeit Lecture Notes, Advanced Artificial Intelligence (SCOM7341) Sina Institute, University of Birzeit 2 nd Semester, 2012 Advanced Artificial Intelligence (SCOM7341) Chapter 4 Informed Searching Dr. Mustafa

More information

COMP9414/ 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. 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 information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 16 rd November, 2011 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific

More information

Informed search. Soleymani. CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2016

Informed search. Soleymani. CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2016 Informed search CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2016 Soleymani Artificial Intelligence: A Modern Approach, Chapter 3 Outline Best-first search Greedy

More information

CS 771 Artificial Intelligence. Informed Search

CS 771 Artificial Intelligence. Informed Search CS 771 Artificial Intelligence Informed Search Outline Review limitations of uninformed search methods Informed (or heuristic) search Uses problem-specific heuristics to improve efficiency Best-first,

More information

Outline for today s lecture. Informed Search. Informed Search II. Review: Properties of greedy best-first search. Review: Greedy best-first search:

Outline for today s lecture. Informed Search. Informed Search II. Review: Properties of greedy best-first search. Review: Greedy best-first search: Outline for today s lecture Informed Search II Informed Search Optimal informed search: A* (AIMA 3.5.2) Creating good heuristic functions Hill Climbing 2 Review: Greedy best-first search: f(n): estimated

More information

Informed Search and Exploration for Agents

Informed Search and Exploration for Agents Informed Search and Exploration for Agents R&N: 3.5, 3.6 Michael Rovatsos University of Edinburgh 29 th January 2015 Outline Best-first search Greedy best-first search A * search Heuristics Admissibility

More information

Robot Programming with Lisp

Robot 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 information

CSE 473. Chapter 4 Informed Search. CSE AI Faculty. Last Time. Blind Search BFS UC-BFS DFS DLS Iterative Deepening Bidirectional Search

CSE 473. Chapter 4 Informed Search. CSE AI Faculty. Last Time. Blind Search BFS UC-BFS DFS DLS Iterative Deepening Bidirectional Search CSE 473 Chapter 4 Informed Search CSE AI Faculty Blind Search BFS UC-BFS DFS DLS Iterative Deepening Bidirectional Search Last Time 2 1 Repeated States Failure to detect repeated states can turn a linear

More information

4 INFORMED SEARCH AND EXPLORATION. 4.1 Heuristic Search Strategies

4 INFORMED SEARCH AND EXPLORATION. 4.1 Heuristic Search Strategies 55 4 INFORMED SEARCH AND EXPLORATION We now consider informed search that uses problem-specific knowledge beyond the definition of the problem itself This information helps to find solutions more efficiently

More information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Joschka Boedecker and Wolfram Burgard and Frank Hutter and Bernhard Nebel Albert-Ludwigs-Universität

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Informed Search and Exploration Chapter 4 (4.1 4.2) A General Search algorithm: Chapter 3: Search Strategies Task : Find a sequence of actions leading from the initial state to

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 10 rd November, 2010 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific

More information

Artificial Intelligence: Search Part 2: Heuristic search

Artificial Intelligence: Search Part 2: Heuristic search Artificial Intelligence: Search Part 2: Heuristic search Thomas Trappenberg January 16, 2009 Based on the slides provided by Russell and Norvig, Chapter 4, Section 1 2,(4) Outline Best-first search A search

More information

A.I.: Informed Search Algorithms. Chapter III: Part Deux

A.I.: Informed Search Algorithms. Chapter III: Part Deux A.I.: Informed Search Algorithms Chapter III: Part Deux Best-first search Greedy best-first search A * search Heuristics Outline Overview Informed Search: uses problem-specific knowledge. General approach:

More information

PROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE

PROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE Artificial Intelligence, Computational Logic PROBLEM SOLVING AND SEARCH IN ARTIFICIAL INTELLIGENCE Lecture 3 Informed Search Sarah Gaggl Dresden, 22th April 2014 Agenda 1 Introduction 2 Uninformed Search

More information

Solving Problems: Intelligent Search

Solving Problems: Intelligent Search Solving Problems: Intelligent 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

More information

Informed/Heuristic Search

Informed/Heuristic Search Informed/Heuristic Search Outline Limitations of uninformed search methods Informed (or heuristic) search uses problem-specific heuristics to improve efficiency Best-first A* Techniques for generating

More information

Ar#ficial)Intelligence!!

Ar#ficial)Intelligence!! Introduc*on! Ar#ficial)Intelligence!! Roman Barták Department of Theoretical Computer Science and Mathematical Logic Uninformed (blind) search algorithms can find an (optimal) solution to the problem,

More information

Foundations of AI. 4. Informed Search Methods. Heuristics, Local Search Methods, Genetic Algorithms. Wolfram Burgard & Bernhard Nebel

Foundations of AI. 4. Informed Search Methods. Heuristics, Local Search Methods, Genetic Algorithms. Wolfram Burgard & Bernhard Nebel Foundations of AI 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Wolfram Burgard & Bernhard Nebel Contents Best-First Search A* and IDA* Local Search Methods Genetic Algorithms

More information

Chapters 3-5 Problem Solving using Search

Chapters 3-5 Problem Solving using Search CSEP 573 Chapters 3-5 Problem Solving using Search First, they do an on-line search CSE AI Faculty Example: The 8-puzzle Example: The 8-puzzle 1 2 3 8 4 7 6 5 1 2 3 4 5 6 7 8 2 Example: Route Planning

More information

Informed search algorithms

Informed search algorithms Informed search algorithms This lecture topic Chapter 3.5-3.7 Next lecture topic Chapter 4.1-4.2 (Please read lecture topic material before and after each lecture on that topic) Outline Review limitations

More information

Foundations of AI. 4. Informed Search Methods. Heuristics, Local Search Methods, Genetic Algorithms

Foundations of AI. 4. Informed Search Methods. Heuristics, Local Search Methods, Genetic Algorithms Foundations of AI 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Luc De Raedt and Wolfram Burgard and Bernhard Nebel Contents Best-First Search A* and IDA* Local Search

More information

Informed search algorithms

Informed search algorithms Informed search algorithms This lecture topic Chapter 3.5-3.7 Next lecture topic Chapter 4.1-4.2 (Please read lecture topic material before and after each lecture on that topic) Outline Review limitations

More information

Part I. Instructor: Dr. Wei Ding. Uninformed Search Strategies can find solutions to problems by. Informed Search Strategies

Part I. Instructor: Dr. Wei Ding. Uninformed Search Strategies can find solutions to problems by. Informed Search Strategies Informed Search and Exploration Part I Instructor: Dr. Wei Ding Fall 2010 1 Motivation Uninformed Search Strategies can find solutions to problems by Systematically generating new states Testing them against

More information

Planning, Execution & Learning 1. Heuristic Search Planning

Planning, Execution & Learning 1. Heuristic Search Planning Planning, Execution & Learning 1. Heuristic Search Planning Reid Simmons Planning, Execution & Learning: Heuristic 1 Simmons, Veloso : Fall 2001 Basic Idea Heuristic Search Planning Automatically Analyze

More information

Outline. Informed search algorithms. Best-first search. Review: Tree search. A search Heuristics. Chapter 4, Sections 1 2 4

Outline. Informed search algorithms. Best-first search. Review: Tree search. A search Heuristics. Chapter 4, Sections 1 2 4 Outline Best-first search Informed search algorithms A search Heuristics Chapter 4, Sections 1 2 Chapter 4, Sections 1 2 1 Chapter 4, Sections 1 2 2 Review: Tree search function Tree-Search( problem, fringe)

More information

Artificial Intelligence

Artificial 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 information

Artificial Intelligence. Informed search methods

Artificial 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 information

Wissensverarbeitung. - Search - Alexander Felfernig und Gerald Steinbauer Institut für Softwaretechnologie Inffeldgasse 16b/2 A-8010 Graz Austria

Wissensverarbeitung. - Search - Alexander Felfernig und Gerald Steinbauer Institut für Softwaretechnologie Inffeldgasse 16b/2 A-8010 Graz Austria - Search - Alexander Felfernig und Gerald Steinbauer Institut für Softwaretechnologie Inffeldgasse 16b/2 A-8010 Graz Austria 1 References Skriptum (TU Wien, Institut für Informationssysteme, Thomas Eiter

More information

Artificial Intelligence p.1/49. n-queens. Artificial Intelligence p.2/49. Initial state: the empty board or a board with n random

Artificial Intelligence p.1/49. n-queens. Artificial Intelligence p.2/49. Initial state: the empty board or a board with n random Example: n-queens Put n queens on an n n board with no two queens on the same row, column, or diagonal A search problem! State space: the board with 0 to n queens Initial state: the empty board or a board

More information

Artificial Intelligence Informed search. Peter Antal

Artificial Intelligence Informed search. Peter Antal Artificial Intelligence Informed search Peter Antal antal@mit.bme.hu 1 Informed = use problem-specific knowledge Which search strategies? Best-first search and its variants Heuristic functions? How to

More information

DFS. Depth-limited Search

DFS. 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 information

Foundations of Artificial Intelligence

Foundations of Artificial Intelligence Foundations of Artificial Intelligence 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität

More information

Informed search algorithms. (Based on slides by Oren Etzioni, Stuart Russell)

Informed search algorithms. (Based on slides by Oren Etzioni, Stuart Russell) Informed search algorithms (Based on slides by Oren Etzioni, Stuart Russell) Outline Greedy best-first search A * search Heuristics Local search algorithms Hill-climbing search Simulated annealing search

More information

Informed search algorithms

Informed search algorithms Informed search algorithms This lecture topic Chapter 3.5-3.7 Next lecture topic Chapter 4.1-4.2 (Please read lecture topic material before and after each lecture on that topic) Outline Review limitations

More information

Problem solving and search

Problem 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 information

CS414-Artificial Intelligence

CS414-Artificial Intelligence CS414-Artificial Intelligence Lecture 6: Informed Search Algorithms Waheed Noor Computer Science and Information Technology, University of Balochistan, Quetta, Pakistan Waheed Noor (CS&IT, UoB, Quetta)

More information

Solving Problems using Search

Solving 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 information

Informed Search. Topics. Review: Tree Search. What is Informed Search? Best-First Search

Informed Search. Topics. Review: Tree Search. What is Informed Search? Best-First Search Topics Informed Search Best-First Search Greedy Search A* Search Sattiraju Prabhakar CS771: Classes,, Wichita State University 3/6/2005 AI_InformedSearch 2 Review: Tree Search What is Informed Search?

More information

Solving problems by searching

Solving problems by searching Solving problems by searching Chapter 3 Some slide credits to Hwee Tou Ng (Singapore) Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Heuristics

More information

Downloaded from ioenotes.edu.np

Downloaded from ioenotes.edu.np Chapter- 3: Searching - Searching the process finding the required states or nodes. - Searching is to be performed through the state space. - Search process is carried out by constructing a search tree.

More information

Mustafa Jarrar: Lecture Notes on Artificial Intelligence Birzeit University, Chapter 3 Informed Searching. Mustafa Jarrar. University of Birzeit

Mustafa Jarrar: Lecture Notes on Artificial Intelligence Birzeit University, Chapter 3 Informed Searching. Mustafa Jarrar. University of Birzeit Mustafa Jarrar: Lecture Notes on Artificial Intelligence Birzeit University, 2018 Chapter 3 Informed Searching Mustafa Jarrar University of Birzeit Jarrar 2018 1 Watch this lecture and download the slides

More information

Artificial Intelligence CS 6364

Artificial Intelligence CS 6364 Artificial Intelligence CS 6364 Professor Dan Moldovan Section 4 Informed Search and Adversarial Search Outline Best-first search Greedy best-first search A* search Heuristics revisited Minimax search

More information

Contents. Foundations of Artificial Intelligence. General Algorithm. Best-First Search

Contents. Foundations of Artificial Intelligence. General Algorithm. Best-First Search Contents Foundations of Artificial Intelligence 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Wolfram Burgard, Bernhard Nebel, and Martin Riedmiller Albert-Ludwigs-Universität

More information

Informed search methods

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 information

Informed Search Algorithms

Informed Search Algorithms Informed Search Algorithms CITS3001 Algorithms, Agents and Artificial Intelligence Tim French School of Computer Science and Software Engineering The University of Western Australia 2017, Semester 2 Introduction

More information

Informed Search A* Algorithm

Informed Search A* Algorithm Informed Search A* Algorithm CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018 Soleymani Artificial Intelligence: A Modern Approach, Chapter 3 Most slides have

More information

Expert Systems (Graz) Heuristic Search (Klagenfurt) - Search -

Expert Systems (Graz) Heuristic Search (Klagenfurt) - Search - Expert Systems (Graz) Heuristic Search (Klagenfurt) - Search - Institut für Softwaretechnologie Inffeldgasse 16b/2 A-8010 Graz Austria 1 References Skriptum (TU Wien, Institut für Informationssysteme,

More information

Review Search. This material: Chapter 1 4 (3 rd ed.) Read Chapter 18 (Learning from Examples) for next week

Review Search. This material: Chapter 1 4 (3 rd ed.) Read Chapter 18 (Learning from Examples) for next week Review Search This material: Chapter 1 4 (3 rd ed.) Read Chapter 13 (Quantifying Uncertainty) for Thursday Read Chapter 18 (Learning from Examples) for next week Search: complete architecture for intelligence?

More information

Artificial Intelligence, CS, Nanjing University Spring, 2018, Yang Yu. Lecture 3: Search 2.

Artificial Intelligence, CS, Nanjing University Spring, 2018, Yang Yu. Lecture 3: Search 2. Artificial Intelligence, CS, Nanjing University Spring, 2018, Yang Yu Lecture 3: Search 2 http://cs.nju.edu.cn/yuy/course_ai18.ashx Previously... function Tree-Search( problem, fringe) returns a solution,

More information

Problem solving and search

Problem 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 information

Artificial Intelligence

Artificial 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 information

COSC343: Artificial Intelligence

COSC343: 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 information

Introduction to Artificial Intelligence 2 nd semester 2016/2017. Chapter 4: Beyond Classical Search

Introduction to Artificial Intelligence 2 nd semester 2016/2017. Chapter 4: Beyond Classical Search Introduction to Artificial Intelligence 2 nd semester 2016/2017 Chapter 4: Beyond Classical Search Mohamed B. Abubaker Palestine Technical College Deir El-Balah 1 Outlines local search algorithms and optimization

More information

Informed (Heuristic) Search. Idea: be smart about what paths to try.

Informed (Heuristic) Search. Idea: be smart about what paths to try. Informed (Heuristic) Search Idea: be smart about what paths to try. 1 Blind Search vs. Informed Search What s the difference? How do we formally specify this? A node is selected for expansion based on

More information

Overview. Path Cost Function. Real Life Problems. COMP219: Artificial Intelligence. Lecture 10: Heuristic Search

Overview. 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 information

Heuristic (Informed) Search

Heuristic (Informed) Search Heuristic (Informed) Search (Where we try to choose smartly) R&N: Chap., Sect..1 3 1 Search Algorithm #2 SEARCH#2 1. INSERT(initial-node,Open-List) 2. Repeat: a. If empty(open-list) then return failure

More information

Lars Schmidt-Thieme, Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany, Course on Artificial Intelligence,

Lars Schmidt-Thieme, Information Systems and Machine Learning Lab (ISMLL), University of Hildesheim, Germany, Course on Artificial Intelligence, Course on Artificial Intelligence, winter term 2012/2013 0/25 Artificial Intelligence Artificial Intelligence 2. Informed Search Lars Schmidt-Thieme Information Systems and Machine Learning Lab (ISMLL)

More information

Solving problems by searching

Solving problems by searching Solving problems by searching CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2017 Soleymani Artificial Intelligence: A Modern Approach, Chapter 3 Outline Problem-solving

More information

S 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

S 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 information

DIT411/TIN175, Artificial Intelligence. Peter Ljunglöf. 23 January, 2018

DIT411/TIN175, Artificial Intelligence. Peter Ljunglöf. 23 January, 2018 DIT411/TIN175, Artificial Intelligence Chapters 3 4: More search algorithms CHAPTERS 3 4: MORE SEARCH ALGORITHMS DIT411/TIN175, Artificial Intelligence Peter Ljunglöf 23 January, 2018 1 TABLE OF CONTENTS

More information

CS 4700: Foundations of Artificial Intelligence

CS 4700: Foundations of Artificial Intelligence CS 4700: Foundations of Artificial Intelligence Bart Selman selman@cs.cornell.edu Module: Informed Search Readings R&N - Chapter 3: 3.5 and 3.6 Search Search strategies determined by choice of node (in

More information

COMP219: Artificial Intelligence. Lecture 10: Heuristic Search

COMP219: 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 information

Artificial Intelligence Informed search. Peter Antal Tadeusz Dobrowiecki

Artificial Intelligence Informed search. Peter Antal Tadeusz Dobrowiecki Artificial Intelligence Informed search Peter Antal antal@mit.bme.hu Tadeusz Dobrowiecki tade@mit.bme.hu A.I. 9/17/2018 1 Informed = use problem-specific knowledge Which search strategies? Best-first search

More information