Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu. Blind Searches
|
|
- Elfrieda Lane
- 6 years ago
- Views:
Transcription
1 Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Blind Searches
2 Blind Searches Function GENERAL-SEARCH (problem, QUEUING-FN) returns a solution or failure nodes = MAKE-QUEUE(MAKE-NODE(INITIAL-STATE[problem])) Loop do If nodes is empty then return failure node = REMOVE-FRONT(nodes) If GOAL-TEST[problem] applied to STATE(node) succeeds then return node nodes = QUEUING-FN(nodes, EXPAND(node, OPERATORS[problem])) End Loop End Function
3 Blind Searches The difference between searches lies in the order in which nodes are selected for expansion The search always visits the first node in the fringe queue REMOVE The only way to control the ordering INSERT
4 Breadth First Search
5 Breadth First Search - Method Expand Root Node First Expand all nodes at level 1 before expanding level 2 OR Expand all nodes at level d before expanding nodes at level d+1
6 Breadth First Search - Implementation Use a queuing function that adds nodes to the end of the queue Function BREADTH-FIRST-SEARCH(problem) returns a solution or failure Return GENERAL-SEARCH (problem, ENQUEUE-AT-END)
7 Breadth First Search - Implementation CD AB DC E EF G A B C D E D E F G node = REMOVE-FRONT(nodes) If GOAL-TEST[problem] applied to STATE(node) succeeds then return node nodes = QUEUING-FN(nodes, EXPAND(node, G51IAI Blind OPERATORS[problem])) Searches
8 The example node set Initial state A B C D E F Goal state G H I J K L M N O P Q R S T U V W X Y Z Press space to see a BFS of the example node set
9 Node We The then B search is backtrack expanded then moves to then expand to removed the node first from C, node the queue. and in the The queue. process revealed Press continues. nodes space Press to are continue. added spaceto the END of the queue. Press space. A This Node We begin node A is removed is with then our expanded from initial the state: to queue. reveal the Each node further revealed labeled (unexpanded) A. node Press is added space nodes. to continue the Press END space of the queue. Press space to continue the search. B C D E F G H I J K L M N O P Q R S T U Node L is located and the search returns a solution. Press space to end. Press space to begin continue the the search search Size of Queue: Queue: A B, C, D, E, F, G, H, I, J, K, L, Empty J, K, G, C, F, M, D, E, H, I, L, K, J, G, L, H, D, F, M, E, I, N, L, K, G, J, M, H, I, E, F, O, N, M, K, L, J, G, H, I, FN, O, P, K, M, J, L, N, HI, O, Q, P, K, L, JM, O, N, P, Q, R, LM, O, P, N, Q, S, R, Q, NO, P, T, R, S, QR UP ST Nodes expanded: Current FINISHED Action: Expanding Backtracking SEARCH Current level: n/a 0 12 BREADTH-FIRST SEARCH PATTERN
10 Evaluating Breadth First Search Observations Very systematic If there is a solution breadth first search is guaranteed to find it If there are several solutions then breadth first search will always find the shallowest goal state first and if the cost of a solution is a nondecreasing function of the depth then it will always find the cheapest solution Path cost
11 Evaluating Breadth First Search Evaluating against four criteria Optimal Complete Time complexity Space complexity
12 Evaluating Breadth First Search Evaluating against four criteria Complete? Yes Optimal? Yes
13 Evaluating Breadth First Search Evaluating against four criteria Space Complexity O(b d ) Time Complexity O(b d ) i.e. number of leaves 1 + b + b 2 + b b d-1 i.e. O(b d ) b: the average branching factor d: is the depth of the search tree Note : The space/time complexity could be less as the solution may be found somewhere before the d th level (depends on the problem).
14 Exponential Growth Exponential growth quickly makes complete state space searches unrealistic If the branching factor was 10, by level 5 we would need to search 100,000 nodes, i.e. 10 5
15 Exponential Growth Depth Nodes Time Memory millisecond 100 bytes second 11 kilobytes 4 11, seconds 1 megabyte minutes 111 megabytes hours 11 gigabytes days 1 terabyte years 111 terabytes years 11,111 terabytes Time and memory requirements for breadth-first search, assuming a branching factor of 10, 100 bytes per node and searching 1000 nodes/second
16 Breadth First Search - Observations Space is more of a factor to breadth first search than time Time is still an issue Who has 35 years to wait for an answer to a level 12 problem (or even 128 days to a level 10 problem)
17 Breadth First Search - Observations It could be argued that as technology gets faster then exponential growth will not be a problem But even if technology is 100 times faster we would still have to wait 35 years for a level 14 problem and what if we hit a level 15 problem!
18 Uniform Cost Search (vs. BFS)
19 Uniform Cost Search (vs. BFS) BFS will find the optimal (shallowest) solution as long as the cost is a function of the depth Suppose that we have a tree in which all the weights of branches are one Weight of a path from the root to a node N is just the depth of node N
20 Uniform Cost Search (vs. BFS) Uniform Cost Search can be used when this is not the case will find the cheapest solution provided that the cost of the path never decreases as we proceed along the path Uniform Cost Search works by expanding the lowest cost node on the fringe
21 Uniform Cost Search (vs. BFS) Cost of a node n the total cost of the path from the root to n Search all nodes of cost c before those of cost c+1 In BFS deeper nodes always arrive after shallower nodes In UCS the costs of new nodes do not have such a nice pattern
22 Uniform Cost Search - implementation In UCS we need to 1. explicitly store the cost g of a node 2. explicitly use such costs in deciding the ordering in the queue Always remove the smallest cost node first sort the queue in increasing order alternatively, search the queue and remove the smallest cost Nodes removed by cost, not by order of arrival
23 Uniform Cost Search - Example A 1 10 S 5 B G C BFS will find the path SAG, with a cost of 11, but SBG is cheaper with a cost of 10 UCS will find the cheaper solution (SBG). It will find SAG but will not see it as it is not at the head of the queue
24 Node Once We Node We now node A start is S expand removed is B with has our the been from node initial from expanded the at state the queue the front and it is and expand removed of the the revealed queue, it from the node nodes queue A. (node Press are and G) added space the is added revealed to the continue. to queue. the node queue. The The (node queue G) is is then added. again sorted The sorted on queue path on path is cost. again cost. Nodes sorted Note, with on we path cheaper have cost. now path Note, found cost node a have goal G priority.in state now appears but do this not in case recognise the the queue queue it twice, as will it is once be not Node as at G10 the A (1), front and node once of the B as (5), queue. G11. followed As Node G10 by is B at is node the cheaper front C (15). of Press the node. queue, space. Press we space. now proceed to goal state. Press space. 1 A 10 S 5 B 5 G 15 C Press space to begin the search The goal state is achieved and the path S-B-G is returned. In relation to path cost, UCS has found the optimal route. Press space to end. Size of Queue: 13 0 Nodes expanded: Queue: A, SB, G10, Empty G11, B, G11, CCC15 Current FINISHED action: Waiting. Backtracking Expanding SEARCH Current level: n/a 01 2 UNIFORM COST SEARCH PATTERN
25 Uniform Cost Search - properties Completeness: If there is a path to a goal then UCS will find it If there is no path, then UCS will eventually report that the goal is unreachable Optimality: UCS will report a minimum cost path (there might be many)
26 UCS vs. BFS - queue Breadth First Search Nodes added to the end of the queue Uniform Cost Search Nodes ordered by their cost Queue Open nodes/fringe nodes First node removed/expended during the search
27 UCS vs. BFS complete & optimal Breadth First Search Optimal Only if the branch cost is the same Uniform Cost Search Optimal Even if the branch cost is different Complete Systematic search throughout the whole tree
28 UCS vs. BFS complexity Time and space complexity O(b d ) (bounded by b d ) UCS is usually better than BFS UCS = BFS When all solutions rather than just one solution is needed When all branches have the same cost We are talking about the worst case scenario
29 Uniform Cost Search - implementation Expansion Number Node Name (order of expansion) Blank if in fringe Any needed maths. Usually: values of g, h, and/or f S A 1 10 B C G
30 In terms of a search tree we could represent the UCS example as follows... Expansion Order (blank if still in fringe) 1 A g= G g = 11 S g=0 1 5 B g=5 3 G 4 5 g = 10 Maths: g 15 Note that G is split into two nodes corresponding to the two Press paths. space to begin the search C g=15 The goal state is achieved. In relation to path cost, UCS has found the optimal route with 4 expansions. S A 1 10 B 5 5 G UNIFORM COST SEARCH PATTERN15 5 C
31 Depth First Search
32 Depth First Search - Method Expand Root Node First Explore one branch of the tree before exploring another branch
33 Depth First Search - Implementation Use a queuing function that adds nodes to the front of the queue Function DEPTH-FIRST-SEARCH(problem) returns a solution or failure Return GENERAL-SEARCH(problem, ENQUEUE-AT- FRONT)
34 Depth First Search - Observations Space complexity Only needs to store the path from the root to the leaf node as well as the unexpanded nodes For a state space with a branching factor of b and a maximum depth of m, DFS requires storage of bm nodes Time complexity b m in the worst case
35 Depth First Search - Observations If DFS goes down a infinite branch it will not terminate if it does not find a goal state If it does find a solution there may be a better solution at a lower level in the tree Therefore, depth first search is neither complete nor optimal
36 The example node set Initial state A B C D E F Goal state G H I J K L M N O P Q R S T U V W X Y Z Press space to see a BFS of the example node set
37 Depth Limited Search (vs. DFS)
38 Depth Limited Search (vs. DFS) DFS may never terminate as it could follow a path that has no solution on it DLS solves this by imposing a depth limit, at which point the search terminates at that particular branch
39 Depth Limited Search - Observations Can be implemented by the general search algorithm using operators which keep track of the depth Choice of depth parameter is important Too deep is wasteful of time and space Too shallow and we may never reach a goal state
40 Depth Limited Search - Observations Completeness If the depth parameter, l, is set deep enough then we are guaranteed to find a solution if one exists Therefore it is complete if l>=d (d=depth of solution)
41 Depth Limited Search - Observations Space requirements O(bl) Time requirements O(b l ) DLS is not optimal
42 Map of Romania Odarea Neamt Zerind Iasi Arad Sibiu Fararas Vaslui Timisoara Lugoj Rimnicu Vilcea Pitesti Urziceni Hirsova Dobreta Mehadia Craiova On the Romania map there are 20 towns so any town is reachable in 19 steps Bucharest Giurgui Eforie In fact, any town is reachable in 10 steps
43 Iterative Deepening Search (vs. DLS)
44 Iterative Deepening Search (vs. DLS) The problem with DLS is choosing a depth parameter Setting a depth parameter to 19 is obviously wasteful if using DLS IDS overcomes this problem by trying depth limits of 0, 1, 2,, n. In effect it is combining BFS and DFS
45 Iterative Deepening Search - Observations IDS may seem wasteful as it is expanding the same nodes many times In fact, IDS expands just 11% more nodes of those by BFS or DLS If b = 10, d = 5 N(IDS) = 123,450, N(BFS) = 100,000 Time Complexity = O(b d ) Space Complexity = O(bd)
46 Iterative Deepening Search - Observations For large search spaces, where the depth of the solution is not known, IDS is normally the preferred search method Self study
47 The example node set Initial state A B C D E F Goal state G H I J K L M N O P Q R S T U V W X Y Z Press space to see a IDS of the example node set
48 A We Node begin A is with then our expanded initial state: and removed the node labeled from the A. queue. This node Press is added space. to the queue. Press space to continue As this is the 0 th iteration of the search, we cannot search past any level greater than zero. This iteration now ends, and we begin the 1 st iteration. Press space to begin the search Size of Queue: 10 Queue: A Empty Nodes expanded: 01 Current Action: Expanding Current level: n/a 0 ITERATIVE DEEPENING SEARCH PATTERN (0 th ITERATION)
49 Node We The now B search is back expanded now track moves to and expand removed to level node one from C, of and the queue. the the process node Press set. continues. space. Press space Press to space. continue A Node We again A is expanded, begin with then our removed initial state: from the the node queue, labeled and A. the Note revealed that the nodes 1 st iteration are added carries to on the from front the. Press 0 th, and space. therefore the nodes expanded value is already set to 1. Press space to continue B C D E F As this is the 1 st iteration of the search, we cannot search past any level greater than level one. This iteration now ends, and we begin a 2 nd iteration. Press space to begin continue the the search search Size of Queue: Queue: A B, C, D, E, FEmpty C, FD, E, D, FE, E, F F Nodes expanded: Current Action: Backtracking Expanding Current level: n/a 01 ITERATIVE DEEPENING SEARCH PATTERN (1 st ITERATION)
50 The Node We After now search B expanding is move expanded then to moves level node and two G to the we level of revealed backtrack the one node of the nodes set. to expand node Press added set. space node to Press the to H. continue. space front The process of to the continue queue. then Press continues space until to continue. goal state. Press space B A We Again, Node again A we is begin removed expand with node from our A the initial to reveal queue state: the and the level each node one revealed labeled nodes. node Press A. is Note added space. that to the the 2 nd front of iteration the queue. carries Press on space. from the 1 st, and therefore the nodes expanded value is already set to 7 (1+6). Press space to continue the search C D E F G H I J K L Node L is located on the second level and the search returns a solution on its second iteration. Press space to end. Press space to continue the search Size of Queue: Queue: A B, G, H, C, I, J, D, K, L, Empty J, D, E, H, C, L, D, F E, D, C, E, F E, D, F FE, F Nodes expanded: Current SEARCH Action: Expanding Backtracking FINISHED Current level: n/a 0 12 ITERATIVE DEEPENING SEARCH PATTERN (2 nd ITERATION)
51 Repeated States - Three Methods 1. Do not generate a node that is the same as the parent node Or Do not return to the state you have just come from 2. Do not create paths with cycles in them. To do this we can check each ancestor node and refuse to create a state that is the same as this set of nodes
52 Repeated States - Three Methods 3. Do not generate any state that is the same as any state generated before This requires that every state is kept in memory (meaning a potential space complexity of O(b d )) The three methods are shown in increasing order of computational overhead in order to implement them
53 Blind Searches Summary Evaluation Breadth First Uniform Cost Depth First Depth Limited Iterative Deepening Time B D B D B M B L B D Space B D B D BM BL BD Optimal? Yes Yes No No Yes Complete? Yes Yes No Yes, if L >= D Yes B = Average branching factor D = Depth of solution M = Maximum depth of the search tree L = Depth Limit
54 Summary of Blind Search Blind searches (Chapter 3 AIMA) Breadth first Uniform cost Depth first Depth limited
Problem 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 informationClustering (Un-supervised Learning)
Clustering (Un-supervised Learning) Partition-based clustering: k-mean Goal: minimize sum of square of distance o Between each point and centers of the cluster. o Between each pair of points in the cluster
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 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 informationIntroduction to Artificial Intelligence. Informed Search
Introduction to Artificial Intelligence Informed Search Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2004/2005 B. Beckert: KI für IM p.1 Outline Best-first search A search Heuristics B. Beckert:
More 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 informationCS486/686 Lecture Slides (c) 2015 P.Poupart
1 2 Solving Problems by Searching [RN2] Sec 3.1-3.5 [RN3] Sec 3.1-3.4 CS486/686 University of Waterloo Lecture 2: May 7, 2015 3 Outline Problem solving agents and search Examples Properties of search algorithms
More informationCS486/686 Lecture Slides (c) 2014 P.Poupart
1 2 1 Solving Problems by Searching [RN2] Sec 3.1-3.5 [RN3] Sec 3.1-3.4 CS486/686 University of Waterloo Lecture 2: January 9, 2014 3 Outline Problem solving agents and search Examples Properties of search
More informationIntroduction to Artificial Intelligence (G51IAI)
Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Heuristic Searches Blind Search vs. Heuristic Searches Blind search Randomly choose where to search in the search tree When problems get large,
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 informationInformed search algorithms
Informed search algorithms Chapter 4, Sections 1 2 Chapter 4, Sections 1 2 1 Outline Best-first search A search Heuristics Chapter 4, Sections 1 2 2 Review: Tree search function Tree-Search( problem, fringe)
More informationInformed search algorithms. Chapter 4, Sections 1 2 1
Informed search algorithms Chapter 4, Sections 1 2 Chapter 4, Sections 1 2 1 Outline Best-first search A search Heuristics Chapter 4, Sections 1 2 2 Review: Tree search function Tree-Search( problem, fringe)
More informationCOSC343: Artificial Intelligence
COSC343: Artificial Intelligence Lecture 18: Informed search algorithms Alistair Knott Dept. of Computer Science, University of Otago Alistair Knott (Otago) COSC343 Lecture 18 1 / 1 In today s lecture
More informationInformed search algorithms
Artificial Intelligence Topic 4 Informed search algorithms Best-first search Greedy search A search Admissible heuristics Memory-bounded search IDA SMA Reading: Russell and Norvig, Chapter 4, Sections
More 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 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 informationAGENTS AND ENVIRONMENTS. What is AI in reality?
AGENTS AND ENVIRONMENTS What is AI in reality? AI is our attempt to create a machine that thinks (or acts) humanly (or rationally) Think like a human Cognitive Modeling Think rationally Logic-based Systems
More informationCS: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 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 informationArtificial Intelligence
Artificial Intelligence hapter 1 hapter 1 1 Iterative deepening search function Iterative-Deepening-Search( problem) returns a solution inputs: problem, a problem for depth 0 to do result Depth-Limited-Search(
More 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 informationInformed 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 informationInformed Search and Exploration
Ch. 03 p.1/47 Informed Search and Exploration Sections 3.5 and 3.6 Ch. 03 p.2/47 Outline Best-first search A search Heuristics, pattern databases IDA search (Recursive Best-First Search (RBFS), MA and
More informationSolving Problems by Searching
Solving Problems by Searching Agents, Goal-Based Agents, Problem-Solving Agents Search Problems Blind Search Strategies Agents sensors environment percepts actions? agent effectors Definition. An agent
More informationSolving Problems by Searching
Solving Problems by Searching Agents, Goal-Based Agents, Problem-Solving Agents Search Problems Blind Search Strategies Agents sensors environment percepts actions? agent effectors Definition. An agent
More informationAGENTS AND ENVIRONMENTS. What is AI in reality?
AGENTS AND ENVIRONMENTS What is AI in reality? AI is our attempt to create a machine that thinks (or acts) humanly (or rationally) Think like a human Cognitive Modeling Think rationally Logic-based Systems
More 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 informationInformed Search and Exploration
Ch. 03b p.1/51 Informed Search and Exploration Sections 3.5 and 3.6 Nilufer Onder Department of Computer Science Michigan Technological University Ch. 03b p.2/51 Outline Best-first search A search Heuristics,
More informationProblem solving and search
Problem solving and search 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 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 informationArtificial 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 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 informationUninformed Search. Remember: Implementation of search algorithms
Uninformed Search Lecture 4 Introduction to Artificial Intelligence Hadi Moradi moradi@usc.edu Remember: Implementation of search algorithms Function General-Search(problem, Queuing-Fn) returns a solution,
More informationPlanning, 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 informationOutline. 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 informationCOMP219: Artificial Intelligence. Lecture 10: Heuristic Search
COMP219: Artificial Intelligence Lecture 10: Heuristic Search 1 Class Tests Class Test 1 (Prolog): Tuesday 8 th November (Week 7) 13:00-14:00 LIFS-LT2 and LIFS-LT3 Class Test 2 (Everything but Prolog)
More informationCOMP9414/ 9814/ 3411: Artificial Intelligence. 5. Informed Search. Russell & Norvig, Chapter 3. UNSW c Alan Blair,
COMP9414/ 9814/ 3411: Artificial Intelligence 5. Informed Search Russell & Norvig, Chapter 3. COMP9414/9814/3411 15s1 Informed Search 1 Search Strategies General Search algorithm: add initial state to
More informationInformed Search and Exploration
Ch. 04 p.1/39 Informed Search and Exploration Chapter 4 Ch. 04 p.2/39 Outline Best-first search A search Heuristics IDA search Hill-climbing Simulated annealing Ch. 04 p.3/39 Review: Tree search function
More informationOverview. Path Cost Function. Real Life Problems. COMP219: Artificial Intelligence. Lecture 10: Heuristic Search
COMP219: Artificial Intelligence Lecture 10: Heuristic Search Overview Last time Depth-limited, iterative deepening and bi-directional search Avoiding repeated states Today Show how applying knowledge
More 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 informationCOMP219: Artificial Intelligence. Lecture 10: Heuristic Search
COMP219: Artificial Intelligence Lecture 10: Heuristic Search 1 Class Tests Class Test 1 (Prolog): Friday 17th November (Week 8), 15:00-17:00. Class Test 2 (Everything but Prolog) Friday 15th December
More 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 informationArtificial Intelligence. Informed search methods
Artificial Intelligence Informed search methods In which we see how information about the state space can prevent algorithms from blundering about in the dark. 2 Uninformed vs. Informed Search Uninformed
More 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 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 informationPEAS: Medical diagnosis system
PEAS: Medical diagnosis system Performance measure Patient health, cost, reputation Environment Patients, medical staff, insurers, courts Actuators Screen display, email Sensors Keyboard/mouse Environment
More 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 informationArtificial 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 informationArtificial Intelligence
Artificial Intelligence Academic year 2016/2017 Giorgio Fumera http://pralab.diee.unica.it fumera@diee.unica.it Pattern Recognition and Applications Lab Department of Electrical and Electronic Engineering
More informationSolving Problems using Search
Solving Problems using Search Artificial Intelligence @ Allegheny College Janyl Jumadinova September 11, 2018 Janyl Jumadinova Solving Problems using Search September 11, 2018 1 / 35 Example: Romania On
More 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 informationIntroduction to Artificial Intelligence (G51IAI) Dr Rong Qu. Problem Space and Search Tree
Introduction to Artificial Intelligence (G51IAI) Dr Rong Qu Problem Space and Search Tree F Trees B J C Nodes H E G Root node Children/parent of nodes Leaves A I Branches D Average branching factor average
More informationProblem Solving and Search. Geraint A. Wiggins Professor of Computational Creativity Department of Computer Science Vrije Universiteit Brussel
Problem Solving and Search Geraint A. Wiggins Professor of Computational Creativity Department of Computer Science Vrije Universiteit Brussel What is problem solving? An agent can act by establishing goals
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 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 informationTDT4136 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 informationCOMP219: Artificial Intelligence. Lecture 7: Search Strategies
COMP219: Artificial Intelligence Lecture 7: Search Strategies 1 Overview Last time basic ideas about problem solving; state space; solutions as paths; the notion of solution cost; the importance of using
More 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 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 informationPrincess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department
Princess Nora University Faculty of Computer & Information Systems ARTIFICIAL INTELLIGENCE (CS 370D) Computer Science Department (CHAPTER-3-PART3) PROBLEM SOLVING AND SEARCH Searching algorithm Uninformed
More informationCS414-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 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 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 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 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 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 informationSearching and NetLogo
Searching and NetLogo Artificial Intelligence @ Allegheny College Janyl Jumadinova September 6, 2018 Janyl Jumadinova Searching and NetLogo September 6, 2018 1 / 21 NetLogo NetLogo the Agent Based Modeling
More informationCS-E4800 Artificial Intelligence
CS-E4800 Artificial Intelligence Jussi Rintanen Department of Computer Science Aalto University January 12, 2017 Transition System Models The decision-making and planning at the top-level of many intelligent
More 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 informationPROBLEM 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 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 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 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 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 informationFoundations 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 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 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 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 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 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 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 informationInformed 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 informationInformed 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 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 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 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 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 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 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 informationWarm- up. IteraAve version, not recursive. class TreeNode TreeNode[] children() boolean isgoal() DFS(TreeNode start)
Warm- up We ll o-en have a warm- up exercise for the 10 minutes before class starts. Here s the first one Write the pseudo code for breadth first search and depth first search IteraAve version, not recursive
More informationInformed 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 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 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 informationInformed Search and Exploration
Informed Search and Exploration Chapter 4 (4.1-4.3) CS 2710 1 Introduction Ch.3 searches good building blocks for learning about search But vastly inefficient eg: Can we do better? Breadth Depth Uniform
More 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 informationSearch. Intelligent agents. Problem-solving. Problem-solving agents. Road map of Romania. The components of a problem. that will take me to the goal!
Search Intelligent agents Reflex agent Problem-solving agent T65 rtificial intelligence and Lisp Peter alenius petda@ida.liu.se epartment of omputer and Information Science Linköping University Percept
More informationWhat is Search? Intro to Search. Search problems. Finding goals in trees. Why is goal search not trivial? Blind Search Methods
What is Search? lind Search Methods Search as an Tool S, DS, DS, US, ids Search is one of the most powerful approaches to problem solving in Search is a universal problem solving mechanism that Systematically
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 information