Topic 1 Uninformed Search
|
|
- Allan Noel Cannon
- 5 years ago
- Views:
Transcription
1 Topic 1 Uninformed Search [George F Luger Artificial Intelligence Structures and Strategies for Complex Problem Solving. 6 th Ed. Pearson. ISBN: ] 1
2 Contents 1. Depth-First Search (DFS) 2. Breadth-First Search (BFS) 3. Depth-Limited Search (DLS) 4. Iterative-Deepening Search (IDS) 5. Uniform-Cost Search (UCS) 6. Bidirectional Search (BDS) 2
3 Introduction Uninformed search is brute-force (or blind) search. Informed search is heuristic search. A graph is a useful representation for a state space. A graph is made up of nodes (vertices) connected by edges (arcs). A graphs is easily represented by an adjacency matrix. 3
4 1. Depth-First Search (DFS). Search order by DFS 4
5 1. Depth-First Search (DFS) Depth-First Search (DFS) uses a stack (or LIFO) structure to support searching branches to their greatest depth before backtracking to previously unexplored branches. Definition of tree depth: The depth of a tree is the length of the simple path (i.e., no cycle or loop) from the root node to the furthest node. 5
6 1. Depth-First Search (DFS) function DFS; // George F. Luger, Stack open = [Start] // initialize closed = [ ] while open [ ] do // states remain remove leftmost state X from open if X is a goal then return SUCCESS // goal found else generate children of X put X on closed 6
7 1. Depth-First Search (DFS) end if a child Y of X already on open or closed discard Y // loop check put remaining children on left end of open end // end else end // end while return FAIL // no states left 7
8 1. Depth-First Search (DFS). Figure 3.15 Graph for DFS example (U is goal). 8
9 1. Depth-First Search (DFS) 0. open = [A]; closed = [ ] 1. open = [B, C, D]; closed = [A] 2. open = [E, F, C, D]; closed = [B, A] 3. open = [K, L, F, C, D]; closed = [E, B, A] 4. open = [S, L, F, C, D]; closed = [K, E, B, A] 5. open = [L, F, C, D]; closed = [S, K, E, B, A] 6. open = [T, F, C, D]; closed = [L, S, K, E, B, A] 9
10 1. Depth-First Search (DFS) 7. open = [F, C, D]; closed = [T, L, S, K, E, B, A] 8. open = [M, C, D], (as L is already on closed); closed = [F, T, L, S, K, E, B, A] 9. open = [C, D]; closed = [M, F, T, L, S, K, E, B, A] 10. open = [G, H, D]; closed = [C, M, F, T, L, S, K, E, B, A] 11. and so on until either U is found or open = [ ]. 10
11 1. Depth-First Search (DFS) If a search algorithm always finds a solution (if a solution exists) in a graph, the search algorithm is called completeness. If a search algorithm always finds the best solution (i.e., the lowest path cost among all solutions) in a graph, the search algorithm is called optimality. DFS is not complete and optimal. 11
12 1. Depth-First Search (DFS) DFS is best-first search (BestFS) with f(n) = depth(n). 12
13 Contents 1. Depth-First Search (DFS) 2. Breadth-First Search (BFS) 3. Depth-Limited Search (DLS) 4. Iterative-Deepening Search (IDS) 5. Uniform-Cost Search (UCS) 6. Bidirectional Search (BDS) 13
14 2. Breadth-First Search (DFS). Search order by BFS 14
15 2. Breadth-First Search (BFS) Breadth-First Search (BFS) uses a queue (or FIFO) to support search of most recently unexplored nodes first. BFS always expands the shallowest unexpanded node. 15
16 2. Breadth-First Search (BFS) Definition of branching factor (BF): - The node BF is number of children of the node. - If all nodes have the same BF, the tree BF is the node BF. - If the tree is not uniform (i.e., different nodes have different BFs), the tree BF is defined as the average of BFs. 16
17 2. Breadth-First Search (BFS) function BFS // George F. Luger open = [Start] // initialize closed = [ ] while open [ ] do // states remain remove leftmost state X from open if X is a goal then return SUCCESS // goal found else generate children of X put X on closed 17
18 2. Breadth-First Search (BFS) end if a child Y of X already on open or closed discard Y // loop check put remaining children on right end of open end // end else end // end while return FAIL // no states left 18
19 2. Breadth-First Search (BFS). Figure 3.15 Graph for BFS example (U is goal). 19
20 2. Breadth-First Search (BFS) 0. open = [A]; closed = [ ] 1. open = [B, C, D]; closed = [A] 2. open = [C, D, E, F]; closed = [B, A] 3. open = [D, E, F, G, H]; closed = [C, B, A] 4. open = [E, F, G, H, I, J]; closed = [D, C, B, A] 20
21 2. Breadth-First Search (BFS) 5. open = [F, G, H, I, J, K, L]; closed = [E, D, C, B, A] 6. open = [G, H, I, J, K, L, M] (as L is already on open); closed = [F, E, D, C, B, A] 7. open = [H, I, J, K, L, M, N]; closed = [G, F, E, D, C, B, A] 8. and so on until either U is found or open = [ ]. 21
22 2. Breadth-First Search (BFS) BFS is complete if branching factor b is finite. That is, if b is finite, BFS always finds the shallowest solution. BFS is optimal if all step costs are identical. BFS is a special case of uniform-coast search (UCS). That is, when all step costs are equal (i.e., g(n) = depth(n)), UCS becomes (or reproduces) BFS. In other words, BFS is UCS with g(n) = depth(n). BFS is best-first search (BestFS) with f(n) = depth(n). 22
23 Contents 1. Depth-First Search (DFS) 2. Breadth-First Search (BFS) 3. Depth-Limited Search (DLS) 4. Iterative-Deepening Search (IDS) 5. Uniform-Cost Search (UCS) 6. Bidirectional Search (BDS) 23
24 3. Depth-Limited Search (DLS). Search order by DLS (depth limit = 3) 24
25 3. Depth-Limited Search (DLS) function DLS(l); // depth limit / bound l = 0, 1, 2,... open = [Start] // initialize closed = [ ] while open [ ] do // states remain remove leftmost state X from open put X on closed if X is a goal then return SUCCESS // goal found if the depth of X is equal to the depth limit go back to while loop 25
26 3. Depth-Limited Search (DLS) end else generate children of X if a child Y of X already on open or closed discard Y // loop check put remaining children on left end of open end // end else end // end while return FAIL // no states left 26
27 3. Depth-Limited Search (DLS). Figure 3.15 Graph for DLS example (U is goal). 27
28 3. Depth-Limited Search (DLS) 0. open = [A]; closed = [ ] 1. open = [B, C, D]; closed = [A]; X = A; depth(a) = 0 < 2 2. open = [E, F, C, D]; closed = [B, A]; X = B; depth(b) = 1 < 2 3. open = [F, C, D]; closed = [E, B, A]; X = E; depth(e) = 2 = limit 28
29 3. Depth-Limited Search (DLS) 4. open = [C, D]; closed = [F, E, B, A]; X = F; depth(f) = 2 = limit 5. open = [G, H, D]; closed = [C, F, E, B, A]; X = C; depth(c) = 1 < 2 6. open = [H, D]; closed = [G, C, F, E, B, A]; X = G; depth(g) = 2 = limit 29
30 3. Depth-Limited Search (DLS) 7. open = [D]; closed = [H, G, C, F, E, B, A]; X = H; depth(h) = 2 = limit 8. open = [I, J], closed = [D, H, G, C, F, E, B, A]; X = D; depth(d) = 1 < 2 9. open = [J]; closed = [I, D, H, G, C, F, E, B, A]; X = I; depth(i) = 2 = limit 30
31 3. Depth-Limited Search (DLS) 10. open = []; closed = [J, I, D, H, G, C, F, E, B, A]; X = J; depth(j) = 2 = limit 11. open = [ ]. // return FAIL 31
32 3. Depth-Limited Search (DLS) DLS is not complete and optimal. 32
33 Contents 1. Depth-First Search (DFS) 2. Breadth-First Search (BFS) 3. Depth-Limited Search (DLS) 4. Iterative-Deepening Search (IDS) 5. Uniform-Cost Search (UCS) 6. Bidirectional Search (BDS) 33
34 4. Iterative-Deepening Search (IDS). Search order by IDS 34
35 4. Iterative-Deepening Search (IDS) IDS performs a DLS of the state space with a depth bound of 0. If it fails to find a goal, DLS performs another DLS with a depth bound of 1. This continues, increasing the depth bound by one each time. At each iteration, the algorithm performs a complete DLS with the current depth limit. No information about the state space is retained between iterations. 35
36 4. Iterative-Deepening Search (IDS). Figure 3.10 Node order in IDS [Matthew L. Ginsberg] 36
37 4. Iterative-Deepening Search (IDS) IDS is complete if branching factor b is finite. IDS is optimal if all step costs are equal. 37
38 Contents 1. Depth-First Search (DFS) 2. Breadth-First Search (BFS) 3. Depth-Limited Search (DLS) 4. Iterative-Deepening Search (IDS) 5. Uniform-Cost Search (UCS) 6. Bidirectional Search (BDS) 38
39 5. Uniform-Cost Search (UCS) UCS (or Branch and Bound) is a variation of the best-first search (BestFS). Let us denote the following notations. - g(n) is the lowest path cost of going from the start node s to the current node n. - h(n) is the heuristically estimated distance from the current node n to the goal node g. - f(n) = g(n) + h(n) is called a heuristic evaluation function. 39
40 5. Uniform-Cost Search (UCS) f(n) is the heuristically estimated distance from the start node s to the goal node g. UCS uses only g(n) when exploring (examining) each node n. The node with the lowest value of g is expanded first. 40
41 5. Uniform-Cost Search (UCS) UCS expands the node n with the lowest path cost g(n) by storing the frontier as a priority queue ordered by g. UCS expands nodes in order of their optimal path cost. Hence, the first goal node selected for expansion must be the optimal solution. 41
42 5. Uniform-Cost Search (UCS) Algorithm: Uniform-Coast Search // Ariel Felner Input: Source vertex s 0. closed = [] 1. open.insert(s) // open is a priority queue 2. while open empty do 3. u = open.extract_min() 4. if u is a goal then return the corresponding solution 42
43 5. Uniform-Cost Search (UCS) 5. for each vertex v Adj(u) do // for each child v of u 6. g(v) = g(u) + cost(u, v) 7. v = check_for duplicates(v) 8. open.insert(v ) 9. closed.insert(u) 43
44 5. Uniform-Cost Search (UCS) check_for_duplicates(v): Duplicate check is done as follows. When a new node v is generated, we check whether it is already in open. - If v is in open, we keep a single copy of v with the smallest g-value among the two copies (labeled v in the algorithm). - If v is in closed, its new copy is discarded. 44
45 5. Uniform-Cost Search (UCS). Graph for UCS example (start node S, goal node E) 45
46 5. Uniform-Cost Search (UCS) closed = [] open = [S] 1. u = X = S; open = [] v = B: g(v) = g(b) = g(s) + cost(s, B) g(b) = = 80 v = C: g(v) = g(c) = g(s) + cost(s, C) g(c) = = 99 open = [S B(80), S C(99)] closed = [S] 46
47 5. Uniform-Cost Search (UCS) 2. u = X = B; open = [S C(99)] v = D: g(v) = g(d) = g(b) + cost(b, D) g(d) = = 177 open = [S C(99), S B D(177)] closed = [S, B] 47
48 5. Uniform-Cost Search (UCS) 3. u = X = C; open = [S B D(177)] v = E: g(v) = g(e) = g(c) + cost(c, E) g(e) = = 310 open = [S B D(177), S C E(310)] closed = [S, B, C] 48
49 5. Uniform-Cost Search (UCS) 4. u = X = D; open = [S C E(310)] v = E: g(v) = g(e) = g(d) + cost(d, E) g(e) = = 278 open = [S B D E(278), S C E(310)] open = [S B D E(278)] closed = [S, B, C, D] 49
50 5. Uniform-Cost Search (UCS) 5. u = X = E; open = [] u = E is a goal then return the corresponding solution: S B D E(278) v = none closed = [S, B, C, D, E] 6. open = [] stop. The solution path is S B D E(278) 50
51 5. Uniform-Cost Search (UCS) UCS is best-first search (BestFS) with f(n) = g(n). UCS is A * search with h(n) = 0 (i.e., f(n) = g(n)). 51
52 Contents 1. Depth-First Search (DFS) 2. Breadth-First Search (BFS) 3. Depth-Limited Search (DLS) 4. Iterative-Deepening Search (IDS) 5. Uniform-Cost Search (UCS) 6. Bidirectional Search (BDS) 52
53 6. Bidirectional Search (BDS). Search order by BDS 53
54 6. Bidirectional Search (BDS) When the start and goal nodes are known, the bidirectional search (BDS) can be used. The idea behind BDS is to run two search algorithms (e.g., BFS, O(b d )) simultaneously, namely one forward from the initial state and the other backward from the goal - hoping that the two searches meet in the middle. The motivation is that b d/2 + b d/2 is much less than b d. 54
55 6. Bidirectional Search (BDS) BDS is implemented by replacing the goal test with a check to see whether the frontiers of the two searches intersect; if they do, a solution has been found. The time complexity of BDS using breadth-first searches in both directions is O(b d/2 ). The space complexity of BDS is also O(b d/2 ). When the two paths meet at a common node, a complete and optimal solution path is found. 55
56 6. Bidirectional Search (BDS) A major disadvantage of BDS is that BDS requires knowledge of the goal node. The goal node is the most commonly desired node in search, and is therefore not commonly known a priori. 56
57 6. Bidirectional Search (BDS) Notations used s = start (initial) node, t = terminal (goal) node. S = set of nodes reached from s whose minimum distance from s is known. S = set of nodes reached from S by one edge but are not in S. g s (x) = current shortest distance from s to x. g s (s) = 0 57
58 6. Bidirectional Search (BDS) wf(x) = the immediate predecessor node of x along the path from s to x (i.e., parent of x). T = set of nodes which have a path to t whose minimum distance is already found. T = set of nodes reached from T by one edge but are not in T. g t (x) = current shortest distance from x to t. wt(x) = the immediate successor node of x along the path from x to t (i.e., child of x). 58
59 6. Bidirectional Search (BDS) Call the forward algorithm F and the backward algorithm B; we now wish to combine them into a bidirectional search (BDS) algorithm. Algorithm BDS // Ira Pohl 1. (Initialize) Perform F 1 (the first step of the forward algorithm) and B 1. That is, S = {s}, T = {t} 59
60 6. Bidirectional Search (BDS) 2. (Strategy) Decide to go forward (go to Step 3) or backward (go to Step 4). 3. (Forward expansion) Perform F 2. If n T go to Step 5 else go to Step (Backward expansion) Perform B 2. If n S go to Step 5 else go to Step (Terminate) If x S T, stop. The solution path is (s x t). 60
61 6. Bidirectional Search (BDS) Example: Apply the BDS to the figure given below, where start node is A and goal node is I. 61
62 6. Bidirectional Search (BDS) 1. F 1 : S = {A}, B 1 : T = {I} 2. Decide to go to Step F 2 : S = {A, E, B, J}. Go back to Step 2 2. Decide to go to Step B 2 : T = {I, G}. Go back to Step 2 62
63 6. Bidirectional Search (BDS) 2. Decide to go to Step B 3 : T = {I, G, E, H}. n = E S so go to Step x S T = {E}. Stop. The solution path is (A E G I) It is noted that the decision made in Step 2 really affects the performance of the bidirectional search (BDS). 63
64 6. Bidirectional Search (BDS) The cardinality comparison principle can be used for Step 2 as follows. // 2. (Strategy) Decide to go forward (go to Step 3) or backward (go to Step 4). 2. If S < T then go to Step 3 else go to Step 4. 64
65 Exercises 1. Provide the search order for the nodes shown in the figure given below for DFS, BFS, DLS (d = 2), IDS (start depth = 1) and BDS (start node A, goal node N). 65
66 Exercises 2. In general, IDS is better than DFS. Draw a graph to show the case in which DFS is better than IDS. 3. Explain why DLS is not complete in general. 66
67 Exercises 4. Using the UCS algorithm, find the shortest path from the start node A to the goal node F from the figure given below. 67
68 References 1. George F Luger Artificial Intelligence Structures and Strategies for Complex Problem Solving. 6 th Ed. Pearson. ISBN: M. Tim Jones Artificial Intelligence A Systems Approach. Jones & Bartlett Learning. ISBN:
69 References 3. Ben Coppin Artificial Intelligence Illuminated. Jones & Bartlett Learning. ISBN: Ivan Bratko Prolog Programming for Artificial Intelligence. 4 th Ed. Pearson. ISBN:
70 References 5. Stuart J. Russell, Peter Norvig Artificial Intelligence A Modern Approach. 3 rd Ed. Pearson. ISBN: Matthew L. Ginsberg Essentials of Artificial Intelligence. Morgan Kaufmann. ISBN:
Topic 1 Uninformed Search (Updates: Jan. 30, 2017)
Topic 1 Uninformed Search (Updates: Jan. 30, 2017) Uninformed search is brute-force search. Uninformed search is also called blind search. 1. Depth-First Search (DFS) 2. Breadth-First Search (BFS) 3. Depth-Limited
More informationUninformed search strategies (Section 3.4) Source: Fotolia
Uninformed search strategies (Section 3.4) Source: Fotolia Uninformed search strategies A search strategy is defined by picking the order of node expansion Uninformed search strategies use only the information
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 informationSet 2: State-spaces and Uninformed Search. ICS 271 Fall 2015 Kalev Kask
Set 2: State-spaces and Uninformed Search ICS 271 Fall 2015 Kalev Kask You need to know State-space based problem formulation State space (graph) Search space Nodes vs. states Tree search vs graph search
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 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 informationHW#1 due today. HW#2 due Monday, 9/09/13, in class Continue reading Chapter 3
9-04-2013 Uninformed (blind) search algorithms Breadth-First Search (BFS) Uniform-Cost Search Depth-First Search (DFS) Depth-Limited Search Iterative Deepening Best-First Search HW#1 due today HW#2 due
More informationEfficient memory-bounded search methods
Efficient memory-bounded search methods Mikhail Simin Arjang Fahim CSCE 580: Artificial Intelligence Fall 2011 Dr. Marco Voltorta Outline of The Presentation Motivations and Objectives Background - BFS
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 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 informationUninformed (also called blind) search algorithms
Uninformed (also called blind) search algorithms First Lecture Today (Thu 30 Jun) Read Chapters 18.6.1-2, 20.3.1 Second Lecture Today (Thu 30 Jun) Read Chapter 3.1-3.4 Next Lecture (Tue 5 Jul) Chapters
More informationArtificial 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/ Solving problems by searching
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 informationUninformed Search. CS171, Winter 2018 Introduction to Artificial Intelligence Prof. Richard Lathrop. Reading: R&N
Uninformed Search CS171, Winter 2018 Introduction to Artificial Intelligence Prof. Richard Lathrop Reading: R&N 3.1-3.4 Uninformed search strategies Uninformed (blind): You have no clue whether one non-goal
More informationAlgorithms for Data Structures: Uninformed Search. Phillip Smith 19/11/2013
lgorithms for Data Structures: Uninformed Search Phillip Smith 19/11/2013 Representations for Reasoning We know (at least) two models of a world: model of the static states of the world model of the effects
More informationInformed search strategies (Section ) Source: Fotolia
Informed search strategies (Section 3.5-3.6) Source: Fotolia Review: Tree search Initialize the frontier using the starting state While the frontier is not empty Choose a frontier node to expand according
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 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 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 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 informationCOMP9414: Artificial Intelligence Informed Search
COMP9, Wednesday March, 00 Informed Search COMP9: Artificial Intelligence Informed Search Wayne Wobcke Room J- wobcke@cse.unsw.edu.au Based on slides by Maurice Pagnucco Overview Heuristics Informed Search
More informationUninformed Search Strategies AIMA 3.4
Uninformed Search Strategies AIMA 3.4 CIS 391-2015 1 The Goat, Cabbage, Wolf Problem (From xkcd.com) CIS 391-2015 2 But First: Missionaries & Cannibals Three missionaries and three cannibals come to a
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 informationProblem Solving. Russell and Norvig: Chapter 3
Problem Solving Russell and Norvig: Chapter 3 Example: Route finding Example: 8-puzzle 8 2 3 4 7 6 5 6 Initial state 7 8 Goal state Example: 8-puzzle 8 2 7 8 2 3 4 5 6 3 4 7 5 6 8 2 8 2 3 4 7 3 4 7 5 6
More informationState Spaces
Unit-2: CONTENT: Introduction to Search: Searching for solutions, Uninformed search strategies, Informed search strategies, Local search algorithms and optimistic problems, Adversarial Search, Search for
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: Artificial Intelligence Informed Search
COMP9, Monday 9 March, 0 Informed Search COMP9: Artificial Intelligence Informed Search Wayne Wobcke Room J- wobcke@cse.unsw.edu.au Based on slides by Maurice Pagnucco Overview Heuristics Informed Search
More informationSearch. CS 3793/5233 Artificial Intelligence Search 1
CS 3793/5233 Artificial Intelligence 1 Basics Basics State-Space Problem Directed Graphs Generic Algorithm Examples Uninformed is finding a sequence of actions that achieve a goal from an initial state.
More informationChapter 4. Uninformed Search Strategies
Chapter 4. Uninformed Search Strategies An uninformed (a.k.a. blind, brute-force) search algorithm generates the search tree without using any domain specific knowledge. The two basic approaches differ
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 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 informationCMU-Q Lecture 2: Search problems Uninformed search. Teacher: Gianni A. Di Caro
CMU-Q 15-381 Lecture 2: Search problems Uninformed search Teacher: Gianni A. Di Caro RECAP: ACT RATIONALLY Think like people Think rationally Agent Sensors? Actuators Percepts Actions Environment Act like
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 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 informationmywbut.com Informed Search Strategies-I
Informed Search Strategies-I 1 3.1 Introduction We have outlined the different types of search strategies. In the earlier chapter we have looked at different blind search strategies. Uninformed search
More informationCPS 170: Artificial Intelligence Search
CPS 170: Artificial Intelligence http://www.cs.duke.edu/courses/spring09/cps170/ Search Instructor: Vincent Conitzer Search We have some actions that can change the state of the world Change resulting
More informationWissensverarbeitung. - 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 information3 SOLVING PROBLEMS BY SEARCHING
48 3 SOLVING PROBLEMS BY SEARCHING A goal-based agent aims at solving problems by performing actions that lead to desirable states Let us first consider the uninformed situation in which the agent is not
More informationArtificial 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 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 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 informationArtificial Intelligence Uninformed search
Artificial Intelligence Uninformed search A.I. Uninformed search 1 The symbols&search hypothesis for AI Problem-solving agents A kind of goal-based agent Problem types Single state (fully observable) Search
More informationAn Appropriate Search Algorithm for Finding Grid Resources
An Appropriate Search Algorithm for Finding Grid Resources Olusegun O. A. 1, Babatunde A. N. 2, Omotehinwa T. O. 3,Aremu D. R. 4, Balogun B. F. 5 1,4 Department of Computer Science University of Ilorin,
More informationExpert 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 informationSearch: Advanced Topics and Conclusion
Search: Advanced Topics and Conclusion CPSC 322 Lecture 8 January 24, 2007 Textbook 2.6 Search: Advanced Topics and Conclusion CPSC 322 Lecture 8, Slide 1 Lecture Overview 1 Recap 2 Branch & Bound 3 A
More informationProblem Solving & Heuristic Search
190.08 Artificial 2016-Spring Problem Solving & Heuristic Search Byoung-Tak Zhang School of Computer Science and Engineering Seoul National University 190.08 Artificial (2016-Spring) http://www.cs.duke.edu/courses/fall08/cps270/
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 informationUninformed Search Strategies AIMA
Uninformed Search Strategies AIMA 3.3-3.4 CIS 421/521 - Intro to AI - Fall 2017 1 Review: Formulating search problems Formulate search problem States: configurations of the puzzle (9! configurations) Actions:
More informationSolving Problems by Searching
INF5390 Kunstig intelligens Solving Problems by Searching Roar Fjellheim Outline Problem-solving agents Example problems Search programs Uninformed search Informed search Summary AIMA Chapter 3: Solving
More informationUninformed search strategies
Uninformed search strategies A search strategy is defined by picking the order of node expansion Uninformed search strategies use only the informa:on available in the problem defini:on Breadth- first search
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 informationUninformed Search. Day 1 & 2 of Search. Russel & Norvig Chap. 3. Material in part from
Uninformed Day & 2 of Russel & Norvig Chap. 3 Material in part from http://www.cs.cmu.edu/~awm/tutorials Examples of problems? The Oak Tree Informed versus Uninformed Heuristic versus Blind A Problem a
More informationArtificial Intelligence
Artificial Intelligence Lesson 1 1 About Lecturer: Prof. Sarit Kraus TA: Galit Haim: haimga@cs.biu.ac.il (almost) All you need can be found on the course website: http://u.cs.biu.ac.il/~haimga/teaching/ai/
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 informationSearch : Lecture 2. September 9, 2003
Search 6.825: Lecture 2 September 9, 2003 1 Problem-Solving Problems When your environment can be effectively modeled as having discrete states and actions deterministic, known world dynamics known initial
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 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 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 information521495A: Artificial Intelligence
521495A: Artificial Intelligence Informed Search Lectured by Abdenour Hadid Adjunct Professor, CMVS, University of Oulu Slides adopted from http://ai.berkeley.edu Today Informed Search Heuristics Greedy
More informationCOMP3702/7702 Artificial Intelligence Week2: Search (Russell & Norvig ch. 3)" Hanna Kurniawati"
COMP3702/7702 Artificial Intelligence Week2: Search (Russell & Norvig ch. 3)" Hanna Kurniawati" Last week" What is Artificial Intelligence?" Some history" Agent defined" The agent design problem" Search:
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 informationSolving Problems by Searching
Solving Problems by Searching 1 Terminology State State Space Initial State Goal Test Action Step Cost Path Cost State Change Function State-Space Search 2 Formal State-Space Model Problem = (S, s, A,
More informationSolving Problems by Searching
INF5390 Kunstig intelligens Sony Vaio VPC-Z12 Solving Problems by Searching Roar Fjellheim Outline Problem-solving agents Example problems Search programs Uninformed search Informed search Summary AIMA
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 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 Searching
Problem Solving and Searching CS 171/ 271 (Chapter 3) Some text and images in these slides were drawn from Russel & Norvig s published material 1 Problem Solving Agent Function 2 Problem Solving Agent
More informationWeek 4 Lecture Notes Part 1 Blind Search cont. and Informed Search
Week 4 Lecture Notes Part 1 Blind Search cont. and Informed Search Created by Nicholas Collins (s4291997) and Nicholas Mayer (s4289230) Admin Assignment 1 is due 9 September, not 4 September as it says
More informationCSE 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 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 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 informationAn Exploratory study of Critical Factors Affecting the Efficiency of Uninformed Tree based Search Algorithms
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X Volume 14, Issue 3 Ver II (May - June 2018), PP 06-11 wwwiosrjournalsorg An Exploratory study of Critical Factors Affecting the
More informationUninformed Search strategies. AIMA sections 3.4,3.5
AIMA sections 3.4,3.5 search use only the information available in the problem denition Breadth-rst search Uniform-cost search Depth-rst search Depth-limited search Iterative deepening search Breadth-rst
More informationLecture 3 of 42. Lecture 3 of 42
Search Problems Discussion: Term Projects 3 of 5 William H. Hsu Department of Computing and Information Sciences, KSU KSOL course page: http://snipurl.com/v9v3 Course web site: http://www.kddresearch.org/courses/cis730
More informationSolving 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 informationA4B36ZUI - Introduction ARTIFICIAL INTELLIGENCE
A4B36ZUI - Introduction to ARTIFICIAL INTELLIGENCE https://cw.fel.cvut.cz/wiki/courses/a4b33zui/start Michal Pechoucek, Branislav Bosansky, Jiri Klema & Olga Stepankova Department of Computer Science Czech
More informationSearch: Advanced Topics and Conclusion
Search: Advanced Topics and Conclusion CPSC 322 Lecture 8 January 20, 2006 Textbook 2.6 Search: Advanced Topics and Conclusion CPSC 322 Lecture 8, Slide 1 Lecture Overview Recap Branch & Bound A Tricks
More informationUniformed Search (cont.)
Uniformed Search (cont.) Computer Science cpsc322, Lecture 6 (Textbook finish 3.5) Sept, 16, 2013 CPSC 322, Lecture 6 Slide 1 Lecture Overview Recap DFS vs BFS Uninformed Iterative Deepening (IDS) Search
More informationIntroduction to Intelligent Systems
Problem Solving by Search Objectives Well-Defined Problems Tree search Uninformed search: BFS, DFS, DLS, and IDS Heuristic search: GBFS and A* Reference Russell & Norvig: Chapter 3 Y. Xiang, CIS 3700,
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 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 informationInformed State Space Search B4B36ZUI, LS 2018
Informed State Space Search B4B36ZUI, LS 2018 Branislav Bošanský, Martin Schaefer, David Fiedler, Jaromír Janisch {name.surname}@agents.fel.cvut.cz Artificial Intelligence Center, Czech Technical University
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 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 informationUninformed Search B. Navigating through a search tree. Navigating through a search tree. Navigating through a search tree
Uninformed Search Russell and Norvig chap. 3 Following this, the pong paddle went on a mission to destroy tari headquarters and, due to a mixup, found himself inside the game The Matrix Reloaded. oy, was
More informationUNINFORMED SEARCH. Announcements Reading Section 3.4, especially 3.4.1, 3.4.2, 3.4.3, 3.4.5
UNINFORMED SEARCH Announcements Reading Section 3.4, especially 3.4.1, 3.4.2, 3.4.3, 3.4.5 Robbie has no idea where room X is, and may have little choice but to try going down this corridor and that. On
More informationBlind (Uninformed) Search (Where we systematically explore alternatives)
Blind (Uninformed) Search (Where we systematically explore alternatives) R&N: Chap. 3, Sect. 3.3 5 Slides from Jean-Claude Latombe at Stanford University (used with permission) Simple Problem-Solving-Agent
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 informationProblem Solving as Search. CMPSCI 383 September 15, 2011
Problem Solving as Search CMPSCI 383 September 15, 2011 1 Today s lecture Problem-solving as search Uninformed search methods Problem abstraction Bold Claim: Many problems faced by intelligent agents,
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 informationSearch with Costs and Heuristic Search
Search with Costs and Heuristic Search Alan Mackworth UBC CS 322 Search 3 January 14, 2013 Textbook 3.5.3, 3.6, 3.6.1 1 Today s Lecture Recap from last lecture, combined with AIspace demo Search with costs:
More informationPengju XJTU 2016
Introduction to AI Chapter03 Solving Problems by Uninformed Searching(3.1~3.4) Pengju Ren@IAIR Outline Problem-solving agents Problem types Problem formulation Search on Trees and Graphs Uninformed algorithms
More informationSolving problems by searching
Solving problems by searching CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2014 Soleymani Artificial Intelligence: A Modern Approach, Chapter 3 Outline Problem-solving
More informationProblem Solving Agents
Problem Solving Agents Well-defined Problems Solutions (as a sequence of actions). Examples Search Trees Uninformed Search Algorithms Well-defined Problems 1. State Space, S An Initial State, s 0 S. A
More informationSearching: Where it all begins...
Searching: Where it all begins... CPSC 433 Christian Jacob Dept. of Computer Science Dept. of Biochemistry & Molecular Biology University of Calgary Problem Solving by Searching 1. Introductory Concepts
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 informationLecture 2: Fun with Search. Rachel Greenstadt CS 510, October 5, 2017
Lecture 2: Fun with Search Rachel Greenstadt CS 510, October 5, 2017 Reminder! Project pre-proposals due tonight Overview Uninformed search BFS, DFS, Uniform-Cost, Graph-Search Informed search Heuristics,
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 informationLast time: Problem-Solving
Last time: Problem-Solving Problem solving: Goal formulation Problem formulation (states, operators) Search for solution Problem formulation: Initial state??? 1 Last time: Problem-Solving Problem types:
More informationLecture 14: March 9, 2015
324: tate-space, F, F, Uninformed earch. pring 2015 Lecture 14: March 9, 2015 Lecturer: K.R. howdhary : Professor of (VF) isclaimer: These notes have not been subjected to the usual scrutiny reserved for
More informationCS 5522: Artificial Intelligence II
CS 5522: Artificial Intelligence II Search Algorithms Instructor: Wei Xu Ohio State University [These slides were adapted from CS188 Intro to AI at UC Berkeley.] Today Agents that Plan Ahead Search Problems
More information