Outline. Informed Search. Recall: Uninformed Search. An Idea. Heuristics Informed search techniques More on heuristics Iterative improvement
|
|
- Jeffrey Porter
- 5 years ago
- Views:
Transcription
1 Outline Informed Search EE457 pplied rtificial Intelligence Spring 8 Lecture # Heuristics Informed search techniques More on heuristics Iterative improvement Russell & Norvig, chapter 4 Skip Genetic algorithms pages 6- (will be covered in Lecture ) EE457 pplied rtificial Intelligence R. Khoury (8) Page Recall: Uninformed Search Travel blindly until they reach ucharest n Idea It would be better if the agent knew whether or not the city it is travelling to gets it closer to ucharest Of course, the agent doesn t know the exact distance or path to ucharest (it wouldn t need to search otherwise!) The agent must estimate the distance to ucharest EE457 pplied rtificial Intelligence R. Khoury (8) Page EE457 pplied rtificial Intelligence R. Khoury (8) Page 4
2 Heuristic Function More generally: We want the search algorithm to be able to estimate the path cost from the current node to the goal This estimate is called a heuristic function annot be done based on problem formulation Need to add additional information Informed search EE457 pplied rtificial Intelligence R. Khoury (8) Page 5 Heuristic Function Heuristic function h(n) h(n): estimated cost from node n to goal h(n ) < h(n ) means it s probably cheaper to get to the goal from n h(n goal ) = Path cost g(n) Evaluation function f(n) f(n) = g(n) Uniform ost f(n) = h(n) Greedy est-first f(n) = g(n) + h(n) * EE457 pplied rtificial Intelligence R. Khoury (8) Page 6 Greedy est-first Search f(n) = h(n) lways expand the node closest to the goal and ignore path cost omplete only if m is finite Rarely true in practice Not optimal an go down a long path of cheap actions Time complexity = O(b m ) Space complexity = O(b m ) Greedy est-first Search Upper-bound case: goal is last node of the tree Number of nodes generated: b nodes for each node of m levels (entire tree) Time and space complexity: all generated nodes O(b m ) EE457 pplied rtificial Intelligence R. Khoury (8) Page 7 EE457 pplied rtificial Intelligence R. Khoury (8) Page 8
3 * Search f(n) = g(n) + h(n) est-first search omplete Optimal, given admissible heuristic Never overestimates the cost to the goal Optimally efficient No other optimal algorithm will expand less nodes Time complexity = O(b */є + ) Space complexity = O(b */є + ) * Search Upper-bound case: heuristic is the trivial h(n) = * becomes Uniform ost Search Goal has path cost *, all other actions have minimum cost of є epth explored before taking action *: */є epth of fringe nodes: */є + Space & time complexity: all generated nodes: O(b */є + ) * є є є є є є є є є є є є є є є EE457 pplied rtificial Intelligence R. Khoury (8) Page 9 EE457 pplied rtificial Intelligence R. Khoury (8) Page * Search Using a good heuristic can reduce time complexity an go down to O(bm) However, space complexity will always be exponential * runs out of memory before running out of time Iterative eepening * Search Like Iterative eepening Search, but cut-off limit is f-value instead of depth Next iteration limit is the smallest f-value of any node that exceeded the cut-off of current iteration Properties omplete and optimal like * Space complexity of depth-first search (because it s possible to delete nodes and paths from memory when we explore down to the cut-off limit) Performs poorly if small action cost (small step in each iteration) EE457 pplied rtificial Intelligence R. Khoury (8) Page EE457 pplied rtificial Intelligence R. Khoury (8) Page
4 Simplified Memory-ounded * Uses all available memory When memory limit reached, delete worst leaf node (highest f-value) If equality, delete oldest leaf node SM memory problem If the entire optimal path fills the memory and there is only one non-goal leaf node SM cannot continue expanding Goal is not reachable Simplified Memory-ounded * Space complexity known and controlled by system designer omplete if shallowest goal depth less than memory size Shallowest goal is reachable Optimal if optimal goal is reachable EE457 pplied rtificial Intelligence R. Khoury (8) Page EE457 pplied rtificial Intelligence R. Khoury (8) Page 4 Example: Greedy Search Example: * Search h(n) = straight-line distance rad 66 Zerind 74 Sibiu 5 Timisoara 9 Fagaras 76 Rimnicu 9 ucharest h(n) = straight-line distance rad 66 Zerind 449 Sibiu 9 Timisoara 447 Fagaras 45 Rimnicu 4 Pitesti 47 raiova 56 ucharest EE457 pplied rtificial Intelligence R. Khoury (8) Page 5 EE457 pplied rtificial Intelligence R. Khoury (8) Page 6 4
5 Heuristic Function Properties dmissible Never overestimate the cost onsistency / Monotonicity h(n p ) h(n c ) + cost(n p,n c ) h(n p ) + g(n p ) h(n c ) + cost(n p,n c ) + g(n p ) h(n p ) + g(n p ) h(n c ) + g(n c ) f(n p ) f(n c ) f(n) never decreases as we get closer to the goal omination h (n) h (n) for all n EE457 pplied rtificial Intelligence R. Khoury (8) Page 7 reating Heuristic Functions Found by relaxing the problem Straight-line distance to ucharest Eliminate constraint of traveling on roads 8-puzzle Move each square that s out of place (7) Move by the number of squares to get to place () Move some tiles in place EE457 pplied rtificial Intelligence R. Khoury (8) Page 8 reating Heuristic Functions lock world Move a block on the table or on another block If there s nothing on top of it Possible heuristics for this game. + for each block in the wrong position. + for each block on top of the wrong block. + for every block in the support structure of each block with incorrect support for every block with the correct support structure 5. Partial solving (get to --?-?) EE457 pplied rtificial Intelligence R. Khoury (8) Page 9 reating Heuristic Functions State h h h h4 h5 ½(h+h4) EE457 pplied rtificial Intelligence R. Khoury (8) Page 5
6 reating Heuristic Functions Path to the Goal State Sometimes the path to the goal is irrelevant Only the solution matters h h n-queen puzzle h h4 h5 ½(h+h4).5.5 EE457 pplied rtificial Intelligence R. Khoury (8) Page EE457 pplied rtificial Intelligence R. Khoury (8) Page ifferent Search Problem No longer minimizing path cost Improve quality of state Minimize state cost Maximize state payoff Iterative improvement Example: Iterative Improvement Minimize cost: number of attacks EE457 pplied rtificial Intelligence R. Khoury (8) Page EE457 pplied rtificial Intelligence R. Khoury (8) Page 4 6
7 Example: Travelling Salesman Tree search method Start with home city Visit next city until optimal round trip Iterative improvement method Start with random round trip Swap cities until optimal round trip EE457 pplied rtificial Intelligence R. Khoury (8) Page 5 Value Graphic Visualisation State value / state plot: state space State axis can be states or specific properties Neighbouring states on the axis are states linked by actions or with similar property values State values are computed using a heuristic and do not include path cost State EE457 pplied rtificial Intelligence R. Khoury (8) Page 6 Graphic Visualisation Value State value / state plot: state space Global maximum Local maxima Plateau Global minimum Graphic Visualisation If state payoff is a complex mathematical function depending on one state property - x * x + sin (x)/x + (-x)*cos(5x)/5x x/ State space: x œ [, 8] Max: x = 74 payoff = 66.9 Local minima State EE457 pplied rtificial Intelligence R. Khoury (8) Page 7 EE457 pplied rtificial Intelligence R. Khoury (8) Page 8 7
8 Graphic Visualisation More complex state spaces can have several dimensions Example: States are X-Y coordinates, state value is Z coordinate EE457 pplied rtificial Intelligence R. Khoury (8) Page 9 Graphic Visualisation Each state is a point on the map Each state s value is the distance to the N Tower Locations in water always have the worst value because we can t swim state space X-Y coordinates of the agent Z coordinate for state value Red = minimum distance lue = maximum distance EE457 pplied rtificial Intelligence R. Khoury (8) Page Hill limbing (Gradient escent) Simple but efficient local optimization strategy lways take the action that most improves the state Hill limbing (Gradient escent) Generate random initial state Each iteration Generate and evaluate neighbours at step size Move to neighbour with greatest increase/decrease (i.e. take one step) End when there are no better neighbours EE457 pplied rtificial Intelligence R. Khoury (8) Page EE457 pplied rtificial Intelligence R. Khoury (8) Page 8
9 Example: Travelling to Toronto Trying to get to downtown Toronto Take steps toward the N Tower EE457 pplied rtificial Intelligence R. Khoury (8) Page Hill limbing (Gradient escent) dvantages Fast No search tree isadvantages Gets stuck in local optimum oes not allow worse moves Solution dependant on initial state Selecting step size ommon improvements Random restarts Intelligently-chosen initial state ecreasing step size EE457 pplied rtificial Intelligence R. Khoury (8) Page 4 Simulated nnealing Problem with hill climbing: local best move doesn t lead to optimal goal Solution: allow bad moves Simulated annealing is a popular way of doing that Stochastic search method Simulates annealing process in metallurgy nnealing Tempering technique in metallurgy Weakness and defects come from atoms of crystals freezing in the wrong place (local optimum) Heating to unstuck the atoms (escape local optimum) Slow cooling to allow atoms to get to better place (global optimum) EE457 pplied rtificial Intelligence R. Khoury (8) Page 5 EE457 pplied rtificial Intelligence R. Khoury (8) Page 6 9
10 Simulated nnealing nnealing toms moving towards minimum-energy location in crystal while avoiding bad position. toms are more likely to move out of a bad position if the metal s temperature is high. Simulated nnealing gent modifying state towards state with global optimal value while avoiding local optimum. gents are more likely to accept bad moves if the temperature control parameter has a high value. EE457 pplied rtificial Intelligence R. Khoury (8) Page 7 Simulated nnealing nnealing The metal s temperature starts hot, then it cools off continuously over time until the metal is room temperature Simulated nnealing The temperature control parameter starts with a high value, then it decreases incrementally with each iteration of the search until it reaches a pre-set threshold. EE457 pplied rtificial Intelligence R. Khoury (8) Page 8 Simulated nnealing llow some bad moves ad enough to get out of local optimum Not so bad as to get out of global optimum Probability of accepting bad moves given adness of the move (i.e. variation in state value V) Temperature T P = e - V/T Stochastic search technique EE457 pplied rtificial Intelligence R. Khoury (8) Page 9 Simulated nnealing Generate random initial state and high temperature Each iteration Generate and evaluate a random neighbour If neighbour better than current state ccept Else (if neighbour worse than current state) ccept with probability e - V/T Reduce temperature End when temperature less than threshold EE457 pplied rtificial Intelligence R. Khoury (8) Page 4
11 Simulated nnealing dvantages voids local optima Very good at finding high-quality solutions Very good for hard problems with complex state value functions isadvantage an be very slow in practice Simulated nnealing pplication Traveling-wave tube (TWT) Uses focused electron beam to amplify electromagnetic communication waves Produces high-power radio frequency (RF) signals ritical components in deep-space probes and communication satellites Power efficiency becomes a key issue TWT research group at NS working for over years on improving power efficiency EE457 pplied rtificial Intelligence R. Khoury (8) Page 4 EE457 pplied rtificial Intelligence R. Khoury (8) Page 4 Simulated nnealing pplication Optimizing TWT efficiency Synchronize electron velocity and phase velocity of RF wave Using phase velocity tapper to control and decrease RF wave phase velocity Improving tapper design improves synchronization, improves efficiency of TWT Tapper with simulated annealing algorithm to optimize synchronization oubled TWT efficiency More flexible then past tappers Maximize overall power efficiency Maximize efficiency over various bandwidth Maximize efficiency while minimize signal distortion ssumptions Goal-based agent Environment Fully observable eterministic Sequential Static iscrete Single agent EE457 pplied rtificial Intelligence R. Khoury (8) Page 4 EE457 pplied rtificial Intelligence R. Khoury (8) Page 44
12 ssumptions Updated Utility-based agent Environment Fully observable eterministic Sequential Static iscrete / ontinuous Single agent EE457 pplied rtificial Intelligence R. Khoury (8) Page 45
Outline. Informed Search. Recall: Uninformed Search. An Idea. Heuristics Informed search techniques More on heuristics Iterative improvement
Outline Informed Search ECE457 Applied Artificial Intelligence Fall 2007 Lecture #3 Heuristics Informed search techniques More on heuristics Iterative improvement Russell & Norvig, chapter 4 Skip Genetic
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 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 Best-first search Greedy best-first search A * search Heuristics Memory Bounded A* Search Best-first search Idea: use an evaluation function f(n) for each node
More informationTDDC17. Intuitions behind heuristic search. Recall Uniform-Cost Search. Best-First Search. f(n) =... + h(n) g(n) = cost of path from root node to n
Intuitions behind heuristic search The separation property of GRAPH-SEARCH TDDC17 Seminar III Search II Informed or Heuristic Search Beyond Classical Search Find a heuristic measure h(n) which estimates
More 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. CS 486/686 University of Waterloo May 10. cs486/686 Lecture Slides 2005 (c) K. Larson and P. Poupart
Informed Search CS 486/686 University of Waterloo May 0 Outline Using knowledge Heuristics Best-first search Greedy best-first search A* search Other variations of A* Back to heuristics 2 Recall from last
More informationArtificial Intelligence
Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 16 rd November, 2011 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific
More informationTDDC17. Intuitions behind heuristic search. Best-First Search. Recall Uniform-Cost Search. f(n) =... + h(n) g(n) = cost of path from root node to n
Intuitions behind heuristic search The separation property of GRAPH-SEARCH TDDC17 Seminar III Search II Informed or Heuristic Search Beyond Classical Search Find a heuristic measure h(n) which estimates
More informationCS 380: Artificial Intelligence Lecture #4
CS 380: Artificial Intelligence Lecture #4 William Regli Material Chapter 4 Section 1-3 1 Outline Best-first search Greedy best-first search A * search Heuristics Local search algorithms Hill-climbing
More informationInformed search algorithms. Chapter 4
Informed search algorithms Chapter 4 Material Chapter 4 Section 1 - Exclude memory-bounded heuristic search 3 Outline Best-first search Greedy best-first search A * search Heuristics Local search algorithms
More informationArtificial Intelligence
Artificial Intelligence Information Systems and Machine Learning Lab (ISMLL) Tomáš Horváth 10 rd November, 2010 Informed Search and Exploration Example (again) Informed strategy we use a problem-specific
More informationInformed search algorithms. (Based on slides by Oren Etzioni, Stuart Russell)
Informed search algorithms (Based on slides by Oren Etzioni, Stuart Russell) The problem # Unique board configurations in search space 8-puzzle 9! = 362880 15-puzzle 16! = 20922789888000 10 13 24-puzzle
More informationDr. Mustafa Jarrar. Chapter 4 Informed Searching. Artificial Intelligence. Sina Institute, University of Birzeit
Lecture Notes on Informed Searching University of Birzeit, Palestine 1 st Semester, 2014 Artificial Intelligence Chapter 4 Informed Searching Dr. Mustafa Jarrar Sina Institute, University of Birzeit mjarrar@birzeit.edu
More 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 informationEE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS
EE562 ARTIFICIAL INTELLIGENCE FOR ENGINEERS Lecture 4, 4/11/2005 University of Washington, Department of Electrical Engineering Spring 2005 Instructor: Professor Jeff A. Bilmes Today: Informed search algorithms
More informationOutline. Best-first search
Outline Best-first search Greedy best-first search A* search Heuristics Local search algorithms Hill-climbing search Beam search Simulated annealing search Genetic algorithms Constraint Satisfaction Problems
More information4 INFORMED SEARCH AND EXPLORATION. 4.1 Heuristic Search Strategies
55 4 INFORMED SEARCH AND EXPLORATION We now consider informed search that uses problem-specific knowledge beyond the definition of the problem itself This information helps to find solutions more efficiently
More 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 informationLecture overview. Knowledge-based systems in Bioinformatics, 1MB602, Goal based agents. Search terminology. Specifying a search problem
Lecture overview Knowledge-based systems in ioinformatics, 1M602, 2006 Lecture 6: earch oal based agents earch terminology pecifying a search problem earch considerations Uninformed search euristic methods
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/ Informed search algorithms
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 informationOutline. Best-first search
Outline Best-first search Greedy best-first search A* search Heuristics Admissible Heuristics Graph Search Consistent Heuristics Local search algorithms Hill-climbing search Beam search Simulated annealing
More 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 informationLecture 4: Informed/Heuristic Search
Lecture 4: Informed/Heuristic Search Outline Limitations of uninformed search methods Informed (or heuristic) search uses problem-specific heuristics to improve efficiency Best-first A* RBFS SMA* Techniques
More informationARTIFICIAL INTELLIGENCE. Informed search
INFOB2KI 2017-2018 Utrecht University The Netherlands ARTIFICIAL INTELLIGENCE Informed search Lecturer: Silja Renooij These slides are part of the INFOB2KI Course Notes available from www.cs.uu.nl/docs/vakken/b2ki/schema.html
More informationDFS. Depth-limited Search
DFS Completeness? No, fails in infinite depth spaces or spaces with loops Yes, assuming state space finite. Time complexity? O(b m ), terrible if m is much bigger than d. can do well if lots of goals Space
More informationInformed search methods
CS 2710 Foundations of AI Lecture 5 Informed search methods Milos Hauskrecht milos@pitt.edu 5329 Sennott Square Announcements Homework assignment 2 is out Due on Tuesday, September 19, 2017 before the
More 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. 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 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 informationAr#ficial)Intelligence!!
Introduc*on! Ar#ficial)Intelligence!! Roman Barták Department of Theoretical Computer Science and Mathematical Logic Uninformed (blind) search algorithms can find an (optimal) solution to the problem,
More 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 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 informationCOMP 8620 Advanced Topics in AI
OMP 8620 dvanced Topics in Lecturers: Philip Kilby & Jinbo uang 25/07/2008 1 Part 1: Search Lecturer: r Philip Kilby Philip.Kilby@nicta.com.au Weeks 1-71 (Week 7 is assignment seminars) Part 2: Probabilistic
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 informationSearching. Assume goal- or utilitybased. Next task to achieve is to determine the best path to the goal
Searching Assume goal- or utilitybased agents: state information ability to perform actions goals to achieve Next task to achieve is to determine the best path to the goal CSC384 Lecture Slides Steve Engels,
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
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 informationInformed Search Methods
Informed Search Methods How can we improve searching strategy by using intelligence? Map example: Heuristic: Expand those nodes closest in as the crow flies distance to goal 8-puzzle: Heuristic: Expand
More informationIntroduction to Computer Science and Programming for Astronomers
Introduction to Computer Science and Programming for Astronomers Lecture 9. István Szapudi Institute for Astronomy University of Hawaii March 21, 2018 Outline Reminder 1 Reminder 2 3 Reminder We have demonstrated
More informationArtificial Intelligence
Artificial Intelligence Informed Search and Exploration Chapter 4 (4.1 4.2) A General Search algorithm: Chapter 3: Search Strategies Task : Find a sequence of actions leading from the initial state to
More informationDr. Mustafa Jarrar. Chapter 4 Informed Searching. Sina Institute, University of Birzeit
Lecture Notes, Advanced Artificial Intelligence (SCOM7341) Sina Institute, University of Birzeit 2 nd Semester, 2012 Advanced Artificial Intelligence (SCOM7341) Chapter 4 Informed Searching Dr. Mustafa
More 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 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 informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 2 Outline Local search techniques and optimization Hill-climbing
More informationInformed Search. Best-first search. Greedy best-first search. Intelligent Systems and HCI D7023E. Romania with step costs in km
Informed Search Intelligent Systems and HCI D7023E Lecture 5: Informed Search (heuristics) Paweł Pietrzak [Sec 3.5-3.6,Ch.4] A search strategy which searches the most promising branches of the state-space
More 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
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 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 informationInformed search algorithms. (Based on slides by Oren Etzioni, Stuart Russell)
Informed search algorithms (Based on slides by Oren Etzioni, Stuart Russell) Outline Greedy best-first search A * search Heuristics Local search algorithms Hill-climbing search Simulated annealing search
More 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 informationInformed search algorithms
Informed search algorithms This lecture topic Chapter 3.5-3.7 Next lecture topic Chapter 4.1-4.2 (Please read lecture topic material before and after each lecture on that topic) Outline Review limitations
More informationInformed search algorithms
Informed search algorithms This lecture topic Chapter 3.5-3.7 Next lecture topic Chapter 4.1-4.2 (Please read lecture topic material before and after each lecture on that topic) Outline Review limitations
More 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 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 informationArtificial Intelligence p.1/49. n-queens. Artificial Intelligence p.2/49. Initial state: the empty board or a board with n random
Example: n-queens Put n queens on an n n board with no two queens on the same row, column, or diagonal A search problem! State space: the board with 0 to n queens Initial state: the empty board or a board
More informationDownloaded from ioenotes.edu.np
Chapter- 3: Searching - Searching the process finding the required states or nodes. - Searching is to be performed through the state space. - Search process is carried out by constructing a search tree.
More 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 informationAdvanced A* Improvements
Advanced A* Improvements 1 Iterative Deepening A* (IDA*) Idea: Reduce memory requirement of A* by applying cutoff on values of f Consistent heuristic function h Algorithm IDA*: 1. Initialize cutoff to
More informationS A E RC R H C I H NG N G IN N S T S A T T A E E G R G A R PH P S
LECTURE 2 SEARCHING IN STATE GRAPHS Introduction Idea: Problem Solving as Search Basic formalism as State-Space Graph Graph explored by Tree Search Different algorithms to explore the graph Slides mainly
More informationFoundations of AI. 4. Informed Search Methods. Heuristics, Local Search Methods, Genetic Algorithms
Foundations of AI 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Luc De Raedt and Wolfram Burgard and Bernhard Nebel Contents Best-First Search A* and IDA* Local Search
More information2006/2007 Intelligent Systems 1. Intelligent Systems. Prof. dr. Paul De Bra Technische Universiteit Eindhoven
test gamma 2006/2007 Intelligent Systems 1 Intelligent Systems Prof. dr. Paul De Bra Technische Universiteit Eindhoven debra@win.tue.nl 2006/2007 Intelligent Systems 2 Informed search and exploration Best-first
More informationLocal Search and Optimization Chapter 4. Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld )
Local Search and Optimization Chapter 4 Mausam (Based on slides of Padhraic Smyth, Stuart Russell, Rao Kambhampati, Raj Rao, Dan Weld ) 1 Outline Local search techniques and optimization Hill-climbing
More informationSolving Problems: Intelligent Search
Solving Problems: Intelligent Search Instructor: B. John Oommen Chancellor s Professor Fellow: IEEE; Fellow: IAPR School of Computer Science, Carleton University, Canada The primary source of these notes
More informationFoundations of AI. 4. Informed Search Methods. Heuristics, Local Search Methods, Genetic Algorithms. Wolfram Burgard & Bernhard Nebel
Foundations of AI 4. Informed Search Methods Heuristics, Local Search Methods, Genetic Algorithms Wolfram Burgard & Bernhard Nebel Contents Best-First Search A* and IDA* Local Search Methods Genetic Algorithms
More 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 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 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 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 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 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 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 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 informationChapter4. Tree Search (Reviewed, Fig. 3.9) Best-First Search. Search Strategies. Best-First Search (cont.-2) Best-First Search (cont.
Tree Search (Reviewed, Fig. 3.9) Chapter4 Informed Search and Exploration 20070322 chap4 1 20070322 chap4 2 Search Strategies A search strategy is defined by picking the order of node expansion Uninformed
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 informationInformed search algorithms
Informed search algorithms This lecture topic Chapter 3.5-3.7 Next lecture topic Chapter 4.1-4.2 (Please read lecture topic material before and after each lecture on that topic) Outline Review limitations
More informationArtificial Intelligence
Artificial Intelligence Local Search Vibhav Gogate The University of Texas at Dallas Some material courtesy of Luke Zettlemoyer, Dan Klein, Dan Weld, Alex Ihler, Stuart Russell, Mausam Systematic Search:
More informationInformed Search and Exploration
Artificial Intelligence Informed Search and Exploration Readings: Chapter 4 of Russell & Norvig. Best-First Search Idea: use a function f for each node n to estimate of desirability Strategy: Alwasy expand
More informationDownloded from: CSITauthority.blogspot.com
[Unit : Searching] (CSC 355) Central Department of Computer Science & Information Technology Tribhuvan University 1 Searching search problem Figure below contains a representation of a map. The nodes represent
More informationmywbut.com Informed Search Strategies-II
Informed Search Strategies-II 1 3.3 Iterative-Deepening A* 3.3.1 IDA* Algorithm Iterative deepening A* or IDA* is similar to iterative-deepening depth-first, but with the following modifications: The depth
More informationInformed Search Lecture 5
Lecture 5 How can we exploit problem-specific knowledge to find solutions more efficiently? Where does this knowledge come from and under what conditions is it useful? 1 Agenda Review: Uninformed Search
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 informationProblem Solving: Informed Search
Problem Solving: Informed Search References Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 (Chapters 1,2, and 4) Nilsson, Artificial intelligence: A New synthesis.
More informationCS 771 Artificial Intelligence. Informed Search
CS 771 Artificial Intelligence Informed Search Outline Review limitations of uninformed search methods Informed (or heuristic) search Uses problem-specific heuristics to improve efficiency Best-first,
More 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 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 informationInformed search strategies (Section ) Source: Fotolia
Informed search strategies (Section 3.5-3.6) Source: Fotolia Review: Tree search Initialize the frontier using the starting state While the frontier is not empty Choose a frontier node to expand according
More informationWissensverarbeitung. - Search - Alexander Felfernig und Gerald Steinbauer Institut für Softwaretechnologie Inffeldgasse 16b/2 A-8010 Graz Austria
- Search - Alexander Felfernig und Gerald Steinbauer Institut für Softwaretechnologie Inffeldgasse 16b/2 A-8010 Graz Austria 1 References Skriptum (TU Wien, Institut für Informationssysteme, Thomas Eiter
More informationToday s s lecture. Lecture 3: Search - 2. Problem Solving by Search. Agent vs. Conventional AI View. Victor R. Lesser. CMPSCI 683 Fall 2004
Today s s lecture Search and Agents Material at the end of last lecture Lecture 3: Search - 2 Victor R. Lesser CMPSCI 683 Fall 2004 Continuation of Simple Search The use of background knowledge to accelerate
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 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 informationSearch. Search Trees
Search Search Trees node = state arcs = operators search = control epth E F G Fringe or search frontier branching factor = # choices of each node Search riteria ompleteness: guarantees to find a solution
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 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 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 informationOutline for today s lecture. Informed Search. Informed Search II. Review: Properties of greedy best-first search. Review: Greedy best-first search:
Outline for today s lecture Informed Search II Informed Search Optimal informed search: A* (AIMA 3.5.2) Creating good heuristic functions Hill Climbing 2 Review: Greedy best-first search: f(n): estimated
More informationA.I.: Informed Search Algorithms. Chapter III: Part Deux
A.I.: Informed Search Algorithms Chapter III: Part Deux Best-first search Greedy best-first search A * search Heuristics Outline Overview Informed Search: uses problem-specific knowledge. General approach:
More 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 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 information