Example: The 8-puzzle. A2 Uninformed Search. It can be generalized to 15-puzzle, 24-puzzle, or. (n 2 1)-puzzle for n 6. Department of Computer Science
|
|
- Grant Perry
- 6 years ago
- Views:
Transcription
1 2 Uninformed Search Hantao Zhang hzhang/c145 The University of Iowa Department of omputer Science rtificial Intelligence p.1/82 Example: The 8-puzzle It can be generalized to 15-puzzle, 24-puzzle, or (n 2 1)-puzzle for n 6.
2 Example: The 8-puzzle Go from state S to state G (S) (G) R L R D D U D U D U L R U R L L rtificial Intelligence p.3/82 Problem formulation problem is defined by four items: initial state e.g., the starting configuration successor function S(x) = set of action state pairs e.g., for each configuration, we may perform four actions: Move the blank tile up, down, left and right. For each action, we have a new configuration. goal test, e.g., x = the target configuration path cost (additive) e.g., sum of distances, number of actions executed, etc. Usually given as c(x, a, y), the step cost from x to y by action a, assumed to be 0. solution is a sequence of actions leading from the initial state to a goal state
3 Selecting a State Space Real world is absurdly complex state space must be abstracted for problem solving (bstract) state = set of real states (bstract) action = complex combination of real actions e.g., edar Rapids hicago represents a complex set of possible routes, detours, rest stops, etc. For guaranteed realizability, any real state in edar Rapids must get to some real state in hicago. Each abstract action should be easier than the original problem! (bstract) Solution (path-sensitive) solution = set of paths that are solutions in the real world (path-insensitive) solution = set of states that pass the rtificial Intelligence p.5/82 goal test Formulating Problem as a Graph In the graph each node represents a possible state; a node is designated as the initial state; one or more nodes represent goal states, states in which the agent s goal is considered accomplished. each edge represents a state transition caused by a specific agent action; associated to each edge is the cost of performing that transition.
4 Search Graph How do we reach a goal state? initial state S 5 F 2 5 goal states 4 D E G 2 3 There may be several possible ways. Or none! Factors to consider: cost of finding a path; cost of traversing a path. rtificial Intelligence p.7/82 Problem Solving as Search Search space: set of states reachable from an initial state S 0 via a (possibly empty/finite/infinite) sequence of state transitions. To achieve the problem s goal search the space for a (possibly optimal) sequence of transitions starting from S 0 and leading to a goal state; execute (in order) the actions associated to each transition in the identified sequence. Depending on the features of the agent s world the two steps above can be interleaved.
5 Problem Solving as Search Reduce the original problem to a search problem. solution for the search problem is a path initial state goal state. The solution for the original problem is either the sequence of actions associated with the path or the description of the goal state. rtificial Intelligence p.9/82 Example: The 8-puzzle States: Operators: configurations of tiles move one tile Up/Down/Left/Right There are 9! = 362, 880 possible states (all permutations of {, 1, 2, 3, 4, 5, 6, 7, 8}). There are 16! possible states for 15-puzzle. Not all states are directly reachable from a given state. (In fact, exactly half of them are reachable from a given state.) How can a computer represent the states and the state space for this problem?
6 Problem Formulation 1. hoose an appropriate data structure to represent the world states. 2. Define each operator as a precondition/effects pair where the precondition holds exactly in the states the operator applies to, effects describe how a state changes into a successor state by the application of the operator. 3. Specify an initial state. 4. Provide a description of the goal (used to check if a reached state is a goal state). rtificial Intelligence p.11/82 Formulating the 8-puzzle Problem States: each represented by a 3 3 array of numbers in [0...8], where value 0 is for the empty cell becomes =
7 Formulating the 8-puzzle Problem Operators: 24 operators of the form Op (r,c,d) where r,c {1, 2, 3}, d {L,R,U,D}. Op (r,c,d) moves the empty space at position (r,c) in the direction d Op (3,2,L) = rtificial Intelligence p.13/82 Preconditions and Effects Example: Op (3,2,R) Op (3,2,R) = Preconditions: 2] = 0 [3, { Effects: [3, 2] [3, 3] [3, 3] 0 We have 24 operators in this problem formulation too many!
8 etter Formulation States: each represented by a pair (, (i,j)) where: is a 3 3 array of numbers in [0...8] (i,j) is the position of the empty space (0) in the array becomes ( , (3, 2)) rtificial Intelligence p.15/82 etter Formulation Operators: 4 operators of the form Op d where d {L,R,U,D}. Op d moves the empty space in the direction d Op L =
9 Example: Op L Preconditions and Effects ( , (3, 2)) Op = L ( (3, 1)) Let (r 0,c 0 ) be the position of 0 in. Preconditions: c 0 > 1 Effects: [r 0,c 0 ] [r 0,c 0 1] [r 0,c 0 1] 0 (r 0,c 0 ) (r 0,c 0 1) rtificial Intelligence p.17/82 Half states are not reachable? an this be done? any steps = $1,000 award for anyone who can do it!
10 Half states are not reachable? a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 9 Let the 8-puzzle be represented by (a 1, a 2, a 3, a 4, a 5, a 6, a 7, a 8, a 9 ). We say (a i, a j ) is an inversion if neither a i nor a j is blank, i < j and a i > a j The first one has 0 inversions and the second has 1. laim: # of inversions modulo two remains the same after each move. rtificial Intelligence p.19/82 The Water Jugs Problem 3gl 4gl Get exactly 2 gallons of water into the 4gl jug.
11 The Water Jugs Problem States: Determined by the amount of water in each jug. State Representation: Two real-valued variables, J 3,J 4, indicating the amount of water in the two jugs, with the constraints: 0 J 3 3, 0 J 4 4 Initial State Description J 3 = 0, J 4 = 0 Goal State Description: J 4 = 2 non exhaustive description rtificial Intelligence p.21/82 The Water Jugs Problem: Operators F4: fill jug4 from the pump. precond: J 4 < 4 effect: J 4 = 4 E4: empty jug4 on the ground. precond: J 4 > 0 effect: J 4 = 0 E4-3: pour water from jug4 into jug3 until jug3 is full. precond: J 3 < 3, effect: J 3 = 3, J 4 3 J 3 J 4 = J 4 (3 J 3 ) P3-4: pour water from jug3 into jug4 until jug4 is full. precond: J 4 < 4, effect: J 4 = 4, J 3 4 J 4 J 3 = J 3 (4 J 4 ) E3-4: pour water from jug3 into jug4 until jug3 is empty. precond: J 3 + J 4 < 4, effect: J 4 = J 3 + J 4, J 3 > 0 J 3 = 0...
12 The Water Jugs Problem Problem J_3 = 0 J_4 = 0 J_4 = 2 F4 Search Graph J_3 = 0 J_4 = 0 F3 J_3 = 0 J_4 = 4 F3 P4-3 F4 J_3 = 3 J_4 = 0 E3-4 J_3 = 3 J_4 = 4 J_3 = 3 J_4 = 1 J_3 = 0 J_4 = 4 F3 J_3 = 0 J_4 = P3-4 J_3 = 3 J_4 = 3 E4 J_3 = 2 J_4 = 4... E3-4 J_3 = 2 J_4 = 0 J_3 = 0 J_4 = 2 rtificial Intelligence p.23/82 Real-World Search Problems Route Finding (computer networks, airline travel planning system,... ) Travelling Salesman Optimization Problem (package delivery, automatic drills,... ) Layout Problems (VLSI layout, furniture layout, packaging,... ) ssembly Sequencing (assembly of electric motors,... ) Task Scheduling (manufacturing, timetables,... )
13 Problem Solution Path-sensitive Problems whose solution is a description of how to reach a goal state from the initial state: n-puzzle route-finding problem assembly sequencing Path-insensitive Problems whose solution is simply a description of the goal state itself: 8-queen problem scheduling problems layout problems rtificial Intelligence p.25/82 Simple Search Problem Finding a painting in a museum.
14 Hanoi Tower Problem How to move disks from one pile to another, one disk at a time, and no disk can be placed on any smaller disk? rtificial Intelligence p.27/82 More on Graphs graph is a set of notes and edges (arcs) between them. S F D graph is directed if an edge can be traversed only in a specified direction. E G When an edge is directed from n i to n j it is univocally identified by the pair (n i,n j ) n i is a parent (or predecessor) of n j n j is a child (or successor) of n i
15 Directed Graphs S F D path, of length k 0, is a list of k nodes, n 0,n 1,n 2,...,n k, such that (n i,n i+1 ) is an edge for all 0 i < k. Ex: (S,D,E,) For 1 i < j k + 1, N i is a ancestor of N j ; N j is a descendant of N i. graph is cyclic if it has a path starting from and ending into the same node. Ex: (,D,E,) rtificial Intelligence p.29/82 E G From Search Graphs to Search Trees The set of all possible paths of a graph can be represented as a tree. tree is a directed acyclic graph all of whose nodes have at most one parent. root of a tree is a node with no parents. leaf is a node with no children. The branching factor of a node is the number of its children. Graphs can be turned into trees by duplicating nodes and breaking cyclic paths, if any.
16 From Graphs to Trees To unravel a graph into a tree choose a root node and trace every path from that node until you reach a leaf node or a node already in that path. S depth 0 D depth 1 E D depth 2 S F D E G G E F depth 3 D... G depth 4 must remember which nodes have been visited a node may get duplicated several times in the tree the tree has infinite paths only if the graph has infinite non-cyclic paths. rtificial Intelligence p.31/82 Tree Search lgorithms asic idea: simulated exploration of state space by generating successors of already-explored states (a.k.a. expanding states) fringe = the nodes to be expanded function TREE-SERH( problem, strategy) returns a solution, or failure let the fringe contain the initial state of problem loop do end if there are no candidates in fringe then return failure choose a node in fringe for expansion according to strategy if the node contains a goal state then return the solution else expand the node and add the resulting nodes to fringe
17 Implementation: states vs. nodes state is (a representation of) a physical configuration node is a data structure constituting part of a search tree includes parent, children, depth, path cost g(x) States do not have parents, children, depth, or path cost! parent, action State state Node depth = 6 g = 6 The EXPND function creates new nodes, filling in the various fields and using the SUESSORFN of the problem to create the corresponding states. rtificial Intelligence p.33/82 Search Strategies strategy is defined by picking the order of node expansion. Strategies are evaluated along the following dimensions: completeness does it always find a solution if one exists? time complexity number of nodes generated/expanded space complexity maximum number of nodes in memory optimality does it always find a least-cost solution? Time and space complexity are measured in terms of b maximum branching factor of the search tree d depth of the least-cost solution m maximum depth of the state space (may be )
18 Uninformed Search Strategies Uninformed strategies use only the information available in the problem definition readth-first search Depth-first search Depth-limited search Iterative deepening search idirectional search Uniform-cost search rtificial Intelligence p.35/82 readth-first Search Expand shallowest unexpanded node Implementation: fringe is a FIFO queue, i.e., new successors go at end
19 readth-first Search Expand shallowest unexpanded node Implementation: fringe is a FIFO queue, i.e., new successors go at end rtificial Intelligence p.37/82 readth-first Search Expand shallowest unexpanded node Implementation: fringe is a FIFO queue, i.e., new successors go at end
20 readth-first Search Expand shallowest unexpanded node Implementation: fringe is a FIFO queue, i.e., new successors go at end rtificial Intelligence p.39/82 Properties of readth-first Search omplete??
21 Properties of readth-first Search omplete?? Yes (if b is finite) Time?? rtificial Intelligence p.41/82 Properties of readth-first Search omplete?? Yes (if b is finite) Time?? 1 + b + b 2 + b b d + b(b d 1) = O(b d+1 ), i.e., exp. in d Space??
22 Properties of readth-first Search omplete?? Yes (if b is finite) Time?? 1 + b + b 2 + b b d + b(b d 1) = O(b d+1 ), i.e., exp. in d Space?? O(b d+1 ) (keeps every node in memory) Optimal?? rtificial Intelligence p.43/82 Properties of readth-first Search omplete?? Yes (if b is finite) Time?? 1 + b + b 2 + b b d + b(b d 1) = O(b d+1 ), i.e., exp. in d Space?? O(b d+1 ) (keeps every node in memory) Optimal?? Yes (if cost = 1 per step); not optimal in general Space??
23 Properties of readth-first Search omplete?? Yes (if b is finite) Time?? 1 + b + b 2 + b b d = O(b d+1 ), i.e., exp. in d Space?? O(b d+1 ) (keeps every node in memory) Optimal?? Yes (if cost = 1 per step); not optimal in general Space?? It is the big problem; can easily generate nodes at 10M/sec so 24hrs = 860G. rtificial Intelligence p.45/82 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front
24 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front rtificial Intelligence p.47/82 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front
25 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front rtificial Intelligence p.49/82 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front
26 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front rtificial Intelligence p.51/82 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front
27 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front rtificial Intelligence p.53/82 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front
28 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front rtificial Intelligence p.55/82 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front
29 Depth-First Search Expand deepest unexpanded node Implementation: fringe = LIFO queue, i.e., put successors at front rtificial Intelligence p.57/82 Properties of depth-first search omplete??
30 Properties of depth-first search omplete?? No: fails in infinite-depth spaces, spaces with loops Modify to avoid repeated states along path complete in finite spaces Time?? rtificial Intelligence p.59/82 Properties of depth-first search omplete?? No: fails in infinite-depth spaces, spaces with loops Modify to avoid repeated states along path complete in finite spaces Time?? O(b m ): terrible if m is much larger than d but if solutions are dense, may be much faster than breadth-first Space??
31 Properties of depth-first search omplete?? No: fails in infinite-depth spaces, spaces with loops Modify to avoid repeated states along path complete in finite spaces Time?? O(b m ): terrible if m is much larger than d but if solutions are dense, may be much faster than breadth-first Space?? O(bm), i.e., linear space! Optimal?? rtificial Intelligence p.61/82 Properties of depth-first search omplete?? No: fails in infinite-depth spaces, spaces with loops Modify to avoid repeated states along path complete in finite spaces Time?? O(b m ): terrible if m is much larger than d but if solutions are dense, may be much faster than breadth-first Space?? O(bm), i.e., linear space! Optimal?? No
32 Depth-Limited Search = depth-first search with depth limit l, i.e., nodes at depth l have no successors function Depth-Limited-Search (problem, limit) return soln/fail/cutoff return Recursive-DLS(Initial-node(problem), problem, limit) end function function Recursive-DLS (node, problem, limit) return soln/fail/cutoff cutoff-occurred := false; if (Goal-State(problem, State(node))) then return node; else if (Depth(node) == limit) then return cutoff; else for each successor in Expand(node, problem) do result := Recursive-DLS(successor, problem, limit) if (result == cutoff) then cutoff-occurred := true; else if (result!= fail) then return result; end for if (cutoff-occurred) then return cutoff; else return fail; end function rtificial Intelligence p.63/82 Iterative Deepening Search function Iterative-Deepening-Search (problem) return soln for depth from 0 to MX-INT do result := Depth-Limited-Search(problem, depth) if (result!= cutoff) then return result end for end function
33 Iterative deepening search l = 0 Limit = 0 rtificial Intelligence p.65/82 Iterative deepening search l = 1 Limit = 1
34 Limit = 2 Iterative deepening search l = 2 rtificial Intelligence p.67/82 Iterative deepening search l = 3 Limit = 3
35 Properties of iterative deepening search omplete?? rtificial Intelligence p.69/82 Properties of iterative deepening search omplete?? Yes Time??
36 Properties of iterative deepening search omplete?? Yes Time?? (d + 1)b 0 + db 1 + (d 1)b b d = O(b d ) Space?? rtificial Intelligence p.71/82 Properties of iterative deepening search omplete?? Yes Time?? (d + 1)b 0 + db 1 + (d 1)b b d = O(b d ) Space?? O(bd) Optimal??
37 Properties of iterative deepening search omplete?? Yes Time?? (d + 1)b 0 + db 1 + (d 1)b b d = O(b d ) Space?? O(bd) Optimal?? Yes, if step cost = 1 an be modified to explore uniform-cost tree Numerical comparison for b = 10 and d = 5, solution at far right: N(IDS) = , , , 000 = 123, 450 N(FS) = , , , , 990 = 1, 111, 100 rtificial Intelligence p.73/82 idirectional Search Expand th starting node forward and the goal node backward at the same time using breadth-first search Implementation: fringe = two FIFO queues, one for forward nodes and one for backward nodes Each node has a flag: f-visited, b-visited, null solution is found if a b-visited node is found in the forward search or a f-visited node is found in the backward search. omplete?? Yes Time?? # of nodes visited, O(b d/2 ) where d is the distance of the nearest solution Space?? # of nodes with g cost of optimal solution, O(b d/2 ) Optimal?? Yes nodes expanded in increasing order of g(n)
38 idirectional Search: Example rtificial Intelligence p.75/82 Uniform-ost Search Expand least-cost unexpanded node Implementation: fringe = queue ordered by path cost (priority queue) Equivalent to breadth-first if step costs all equal omplete?? Yes, if step cost ǫ Time?? # of nodes with g cost of optimal solution, O(b /ǫ ) where is the cost of the optimal solution Space?? # of nodes with g cost of optimal solution, O(b /ǫ ) Optimal?? Yes nodes expanded in increasing order of g(n)
39 Uniform-ost Search: Example rtificial Intelligence p.77/82 Repeated states Failure to detect repeated states can turn a linear problem into an exponential one! D We may also keep a list of closed nodes to avoid expanding the same node twice.
40 Summary Problem formulation usually requires abstracting away real-world details to define a state space that can feasibly be explored Variety of uninformed search strategies Iterative deepening search uses only linear space and not much more time than other uninformed algorithms rtificial Intelligence p.79/82 Uninformed Search Strategies Strategies Time Space omplete? readth-first Search O(b d ) O(b d ) Yes Depth-first Search O(b m ) O(bm) No Depth-limited Search O(b l ) O(bl) No Iterative Deepening Search O(b d ) O(bd) Yes idirectional Search O(b d/2 ) O(b d/2 ) Yes Uniform ost Search O(b d ) O(b d ) Yes where b is the branching factor, d is the depth of the optimal solution, m is the length of the longest path, l is the limit set by the user.
41 omplexity of Iterative Deepening Search (d + 1)b 0 + db 1 + (d 1)b b d = O(b d ) t first, we show that d i=1 ibi 1 = (d + 1)b d /(b 1) (b d+1 1)/(b 1) 2. Let F(x) = d i=0 xi = (x d+1 1)/(x 1). Take the derivation on both sides, we have F (x) = d i=0 ixi 1 = (d + 1)x d /(x 1) (x d+1 1)/(x 1) 2. So F (b) = d i=0 ibi 1 = (d + 1)b d /(b 1) (b d+1 1)/(b 1) 2. rtificial Intelligence p.81/82 omplexity of Iterative Deepening Search (d + 1)b 0 + db 1 + (d 1)b b d = O(b d ) (d + 1)b 0 + db 1 + (d 1)b b d = d i=0 (d + 1 i)bi = (d + 1) d i=0 bi b d i=1 ibi 1 = (d + 1)(b d+1 1)/(b 1) b d i=1 ibi 1 = (d + 1)(b d+1 1)/(b 1) bf (b) = (d + 1)(b d+1 1)/(b 1) b(d + 1)b d /(b 1) + b(b d+1 1)/(b 1) 2 = (d + 1)/(b 1) + b(b d+1 1)/(b 1) 2 = O(b d )
A2 Uninformed Search
2 Uninformed Search Hantao Zhang http://www.cs.uiowa.edu/ hzhang/c145 The University of Iowa Department of omputer Science rtificial Intelligence p.1/82 Example: The 8-puzzle 2 8 3 1 7 6 4 5 It can be
More 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 informationArtificial Intelligence: Search Part 1: Uninformed graph search
rtificial Intelligence: Search Part 1: Uninformed graph search Thomas Trappenberg January 8, 2009 ased on the slides provided by Russell and Norvig, hapter 3 Search outline Part 1: Uninformed search (tree
More informationProblem solving and search
Problem solving and search hapter 3 hapter 3 1 Outline Problem-solving agents Problem types Problem formulation Example problems asic search algorithms hapter 3 3 Restricted form of general agent: Problem-solving
More informationProblem solving and search
Problem solving and search Chapter 3 Chapter 3 1 Problem formulation & examples Basic search algorithms Outline Chapter 3 2 On holiday in Romania; currently in Arad. Flight leaves tomorrow from Bucharest
More informationProblem solving and search: Chapter 3, Sections 1 5
Problem solving and search: hapter 3, Sections 1 5 1 Outline Problem-solving agents Problem types Problem formulation Example problems asic search algorithms 2 Problem-solving agents estricted form of
More informationProblem solving and search: Chapter 3, Sections 1 5
Problem solving and search: hapter 3, Sections 1 5 S 480 2 Outline Problem-solving agents Problem types Problem formulation Example problems asic search algorithms Problem-solving agents estricted form
More informationArtificial Intelligence Problem Solving and Uninformed Search
Artificial Intelligence Problem Solving and Uninformed Search Maurizio Martelli, Viviana Mascardi {martelli, mascardi}@disi.unige.it University of Genoa Department of Computer and Information Science AI,
More informationMultiagent Systems Problem Solving and Uninformed Search
Multiagent Systems Problem Solving and Uninformed Search Viviana Mascardi viviana.mascardi@unige.it MAS, University of Genoa, DIBRIS Classical AI 1 / 36 Disclaimer This presentation may contain material
More informationArtificial Intelligence, CS, Nanjing University Spring, 2018, Yang Yu. Lecture 2: Search 1.
rtificial Intelligence, S, Nanjing University Spring, 2018, Yang Yu Lecture 2: Search 1 http://lamda.nju.edu.cn/yuy/course_ai18.ashx Problem in the lecture 7 2 4 51 2 3 5 6 4 5 6 8 3 1 7 8 Start State
More informationProblem solving and search
Problem solving and search hapter 3 hapter 3 1 Outline Problem-solving agents Problem types Problem formulation Example problems asic search algorithms hapter 3 3 Example: omania On holiday in omania;
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 informationSolving problems by searching. Chapter 3
Solving problems by searching Chapter 3 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms 2 Example: Romania On holiday in Romania; currently in
More informationProblem solving and search
Problem solving and search hapter 3 hapter 3 1 Outline Problem-solving agents Problem types Problem formulation Example problems asic search algorithms hapter 3 2 estricted form of general agent: Problem-solving
More informationSolving problems by searching
Solving problems by searching Chapter 3 Systems 1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Systems 2 Problem-solving agents Systems 3 Example:
More informationReminders. Problem solving and search. Problem-solving agents. Outline. Assignment 0 due 5pm today
ssignment 0 due 5pm today eminders Problem solving and search ssignment 1 posted, due 2/9 ection 105 will move to 9-10am starting next week hapter 3 hapter 3 1 hapter 3 2 Outline Problem-solving agents
More informationChapter 2. Blind Search 8/19/2017
Chapter 2 1 8/19/2017 Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms 8/19/2017 2 8/19/2017 3 On holiday in Romania; currently in Arad. Flight leaves tomorrow
More informationProblem solving by search
Problem solving by search based on tuart ussel s slides (http://aima.cs.berkeley.edu) February 27, 2017, E533KUI - Problem solving by search 1 Outline Problem-solving agents Problem types Problem formulation
More informationProblem solving and search
Problem solving and search hapter 3 hapter 3 1 eminders ssignment 0 due midnight Thursday 9/8 ssignment 1 posted, due 9/20 (online or in box in 283) hapter 3 2 Outline Problem-solving agents Problem types
More informationITCS 6150 Intelligent Systems. Lecture 3 Uninformed Searches
ITCS 6150 Intelligent Systems Lecture 3 Uninformed Searches Outline Problem Solving Agents Restricted form of general agent Problem Types Fully vs. partially observable, deterministic vs. stochastic Problem
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 informationCS 8520: Artificial Intelligence
CS 8520: Artificial Intelligence Solving Problems by Searching Paula Matuszek Spring, 2013 Slides based on Hwee Tou Ng, aima.eecs.berkeley.edu/slides-ppt, which are in turn based on Russell, aima.eecs.berkeley.edu/slides-pdf.
More 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 informationOutline. Problem solving and search. Problem-solving agents. Example: Romania. Example: Romania. Problem types. Problem-solving agents.
Outline Problem-solving agents Problem solving and search hapter 3 Problem types Problem formulation Example problems asic search algorithms hapter 3 1 hapter 3 3 estricted form of general agent: Problem-solving
More informationProblem-solving agents. Problem solving and search. Example: Romania. Reminders. Example: Romania. Outline. Chapter 3
Problem-solving agents Problem solving and search hapter 3 function imple-problem-olving-gent( percept) returns an action static: seq, an action sequence, initially empty state, some description of the
More informationAI: problem solving and search
: problem solving and search Stefano De Luca Slides mainly by Tom Lenaerts Outline Problem-solving agents A kind of goal-based agent Problem types Single state (fully observable) Search with partial information
More informationCS 380: Artificial Intelligence Lecture #3
CS 380: Artificial Intelligence Lecture #3 William Regli Outline Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms 1 Problem-solving agents Example: Romania
More informationOutline. Solving problems by searching. Problem-solving agents. Example: Romania
Outline Solving problems by searching Chapter 3 Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Systems 1 Systems 2 Problem-solving agents Example: Romania
More informationKI-Programmierung. Basic Search Algorithms
KI-Programmierung Basic Search Algorithms Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2007/2008 B. Beckert: KI-Programmierung p.1 Example: Travelling in Romania Scenario On holiday in Romania;
More informationProblem Solving and Search. Chapter 3
Problem olving and earch hapter 3 Outline Problem-solving agents Problem formulation Example problems asic search algorithms In the simplest case, an agent will: formulate a goal and a problem; Problem-olving
More informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 3, 4/6/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes 4/6/2005 EE562 1 Today: Basic
More informationSolving problems by searching
Solving problems by searching Chapter 3 CS 2710 1 Outline Problem-solving agents Problem formulation Example problems Basic search algorithms CS 2710 - Blind Search 2 1 Goal-based Agents Agents that take
More 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 informationSolving Problem by Searching. Chapter 3
Solving Problem by Searching Chapter 3 Outline Problem-solving agents Problem formulation Example problems Basic search algorithms blind search Heuristic search strategies Heuristic functions Problem-solving
More informationSolving Problems: Blind Search
Solving Problems: Blind Search Instructor: B. John Oommen Chancellor s Professor Fellow: IEEE ; Fellow: IAPR School of Computer Science, Carleton University, Canada The primary source of these notes are
More informationArtificial Intelligence 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 informationProblem solving and search
Problem solving and search Chapter 3 Chapter 3 1 How to Solve a (Simple) Problem 7 2 4 1 2 5 6 3 4 5 8 3 1 6 7 8 Start State Goal State Chapter 3 2 Introduction Simple goal-based agents can solve problems
More informationSolving problems by searching
Solving problems by searching 1 C H A P T E R 3 Problem-solving agents Problem types Problem formulation Example problems Basic search algorithms Outline 2 Problem-solving agents 3 Note: this is offline
More 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 informationProblem solving and search
Problem solving and search Chapter 3 TB Artificial Intelligence Slides from AIMA http://aima.cs.berkeley.edu 1 /1 Outline Problem-solving agents Problem types Problem formulation Example problems Basic
More informationPlanning and search. Lecture 1: Introduction and Revision of Search. Lecture 1: Introduction and Revision of Search 1
Planning and search Lecture 1: Introduction and Revision of Search Lecture 1: Introduction and Revision of Search 1 Lecturer: Natasha lechina email: nza@cs.nott.ac.uk ontact and web page web page: http://www.cs.nott.ac.uk/
More 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 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 informationOutline. Solving problems by searching. Prologue. Example: Romania. Uninformed search
Outline olving problems by searching Uninformed search lides from ussell & Norvig book, revised by ndrea oli Problem-solving agents Problem types Problem formulation Example problems asic search algorithms
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 informationCS 331: Artificial Intelligence Uninformed Search. Real World Search Problems
S 331: rtificial Intelligence Uninformed Search 1 Real World Search Problems 2 1 Simpler Search Problems 3 ssumptions bout Our Environment Fully Observable Deterministic Sequential Static Discrete Single-agent
More informationSolving problems by searching
olving problems by searching Uninformed search lides from ussell & Norvig book, revised by ndrea oli Problem-solving agents Problem types Problem formulation Example problems asic search algorithms Outline
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 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 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 informationPengju
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 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 informationUninformed Search. Problem-solving agents. Tree search algorithms. Single-State Problems
Uninformed Search Problem-solving agents Tree search algorithms Single-State Problems Breadth-First Search Depth-First Search Limited-Depth Search Iterative Deepening Extensions Graph search algorithms
More informationCS 331: Artificial Intelligence Uninformed Search. Real World Search Problems
S 331: rtificial Intelligence Uninformed Search 1 Real World Search Problems 2 1 Simpler Search Problems 3 Static Observable Discrete Deterministic Single-agent ssumptions bout Our Environment 4 2 Search
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 informationChapter 3 Solving problems by searching
1 Chapter 3 Solving problems by searching CS 461 Artificial Intelligence Pinar Duygulu Bilkent University, Slides are mostly adapted from AIMA and MIT Open Courseware 2 Introduction Simple-reflex agents
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 information4. Solving Problems by Searching
COMP9414/9814/3411 15s1 Search 1 COMP9414/ 9814/ 3411: Artificial Intelligence 4. Solving Problems by Searching Russell & Norvig, Chapter 3. Motivation Reactive and Model-Based Agents choose their actions
More 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 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 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 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 informationCS 331: Artificial Intelligence Uninformed Search. Leftovers from last time
S 331: rtificial Intelligence Uninformed Search 1 Leftovers from last time Discrete/ontinuous Discrete: finite number of values eg. Rating can be thumbs up or down ontinuous: infinite continuum of values
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 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 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 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. 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 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 informationRobot Programming with Lisp
6. Search Algorithms Gayane Kazhoyan (Stuart Russell, Peter Norvig) Institute for University of Bremen Contents Problem Definition Uninformed search strategies BFS Uniform-Cost DFS Depth-Limited Iterative
More informationmywbut.com Uninformed Search
Uninformed Search 1 2.4 Search Searching through a state space involves the following: set of states Operators and their costs Start state test to check for goal state We will now outline the basic search
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 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 informationOutline. Solving Problems by Searching. Introduction. Problem-solving agents
Outline Solving Problems by Searching S/ University of Waterloo Sept 7, 009 Problem solving agents and search Examples Properties of search algorithms Uninformed search readth first Depth first Iterative
More 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 D E 1 Unexpanded s: the fringe Tree search nitial state t every point in the search process we keep track of a list of s that haven t been expanded yet: the
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 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 informationSolving Problems by Searching
Solving Problems by Searching CS486/686 University of Waterloo Sept 11, 2008 1 Outline Problem solving agents and search Examples Properties of search algorithms Uninformed search Breadth first Depth first
More 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 informationCS486/686 Lecture Slides (c) 2015 P.Poupart
1 2 Solving Problems by Searching [RN2] Sec 3.1-3.5 [RN3] Sec 3.1-3.4 CS486/686 University of Waterloo Lecture 2: May 7, 2015 3 Outline Problem solving agents and search Examples Properties of search algorithms
More informationProblem-solving agents. Solving Problems by Searching. Outline. Example: Romania. Chapter 3
Problem-solving agents olving Problems by earching hapter 3 function imple-problem-olving-gent( percept) returns an action static: seq, an action sequence, initially empty state, some description of the
More informationCS486/686 Lecture Slides (c) 2014 P.Poupart
1 2 1 Solving Problems by Searching [RN2] Sec 3.1-3.5 [RN3] Sec 3.1-3.4 CS486/686 University of Waterloo Lecture 2: January 9, 2014 3 Outline Problem solving agents and search Examples Properties of search
More 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 informationBlind (Uninformed) Search (Where we systematically explore alternatives)
Blind (Uninformed) Search (Where we systematically explore alternatives) R&N: Chap. 3, Sect. 3.3 5 1 Simple Problem-Solving-Agent Agent Algorithm 1. s 0 sense/read initial state 2. GOAL? select/read goal
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 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 informationSolving Problems by Searching (Blindly)
Solving Problems by Searching (Blindly) R&N: Chap. 3 (many of these slides borrowed from Stanford s AI Class) Problem Solving Agents Decide what to do by finding a sequence of actions that lead to desirable
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 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 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 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 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 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 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 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 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 informationSolving Problems by Searching. AIMA Sections , 3.6
AIMA Sections 3.1 3.3, 3.6 Outline Problem-solving agents Problem types Problem formulation Example problems General search algorithm Problem-solving agents function Simple-Problem--Agent( percept) returns
More informationIntelligent Agents. Foundations of Artificial Intelligence. Problem-Solving as Search. A Simple Reflex Agent. Agent with Model and Internal State
Intelligent s Foundations of Artificial Intelligence Problem-Solving as Search S7 Fall 007 Thorsten Joachims : Anything that can be viewed as perceiving its environment through sensors and acting upon
More informationSolving Problems by Searching
Solving Problems by Searching Agents, Goal-Based Agents, Problem-Solving Agents Search Problems Blind Search Strategies Agents sensors environment percepts actions? agent effectors Definition. An agent
More information