Outline. Where Do Heuristics Come From? Part 3. Question. Max ing Multiple Heuristics
|
|
- Marvin Brandon Morrison
- 5 years ago
- Views:
Transcription
1 Outline Where Do Heuristics Come From? Part Robert C. Holte Computing Science Department University of Alberta 00, Robert Holte Heuristics/Holte Part, Slide Part : Introduction Part : Details Part : Pattern Database Enhancements Taking the maximum of two or more PDBs Compression and Dovetailing of PDBs Additive PDBs Customized PDBs Multiple Lookups in One PDB Bonus! Related Algorithm (CFPD) Heuristics/Holte Part, Slide Max ing Multiple Heuristics Given heuristics h and h define h(s) = max ( h(s), h(s) ) Preserves key properties: lower bound consistency Question Given a fixed amount of memory, M, which gives the best heuristic? pattern database (PDB) of size M max ing PDBs of size M/ max ing PDBs of size M/ etc. Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
2 large pattern database s ϕ half-size pattern databases s ϕ ϕ h(s) h (s) h (s) max Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide Many small pattern databases ϕ h (s) s ϕ n h n (s) Rubik s Cube* PDB Size n Nodes Generated,0,00 8,,89 7,70,800,9,99,,00,09,99,,00,9,89 0,,800,, max Heuristics/Holte Part, Slide 7 * easy problems Heuristics/Holte Part, Slide 8
3 Summary State Space Best n (x)-puzzle 0 9-pancake 0 (8,)-Topspin ( ops) 9 (8,)-Topspin (8 ops) 9 (x)-puzzle + Rubik s Cube -puzzle (additive) -puzzle (additive) 8 Ratio to. Rubik s Cube CPU Time #PDBs Nodes Ratio Time Ratio RATIO = #nodes generated using one PDB of size M #nodes generated using n PDBs of size M/n time/node is.7x higher using six PDBs Heuristics/Holte Part, Slide 9 Heuristics/Holte Part, Slide 0 Early Stopping Techniques for Reducing the Overhead of Multiple PDB lookups IDA* depth bound = 7 g(s) = Stop doing PDB lookups as soon as h > is found. Might result in extra IDA* iterations PDB (s) = next bound is 8 PDB (s) = 7 next bound is 0 Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
4 Consistency-based Bounding Experimental Results PDB (A) = PDB (A) = 7 -puzzle, five additive PDBs (7-7-) Naïve: 0. secs Early Stopping: 0.0 secs Because of consistency: PDB (B) PDB (B) No need to consult PDB Rubik s Cube, six non-additive PDBs Naïve: 7. secs Early Stopping: 8.9 secs Early Stopping and Bounding: 8.8 secs Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide Static Distribution of Heuristic Values max of small PDBs. Why Does Max ing Speed Up Search? -puzzle, 00M states. large PDB..8x nodes generated Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
5 Runtime Distribution of Heuristic Values Example of Max Failing Depth Bound h h max(h,h) ,0,8 8 7, ,79,,0 9,80, 0,97,89 80 TOTAL,8, 8, Heuristics/Holte Part, Slide 7 Heuristics/Holte Part, Slide 8 Approaches Squeezing More into Memory Compress an individual Pattern Database Lossless compression Lossy compression must maintain admissibility Allows you to use a PDB bigger than will fit in memory use multiple PDBs instead of just one Merge two PDBs into one the same size Culberson & Schaeffer s dovetailing Heuristics/Holte Part, Slide 9 Heuristics/Holte Part, Slide 0
6 Compression Results -disk -peg TOH, PDB based on disks No compression: Megs memory,. secs lossless compression: k memory,.8 secs Lossy compression: 9Megs,.9 secs -puzzle, additive PDB triple (7-7-) No compression: 7Megs memory, 0.09 secs Lossy compression, two PDB triples 7Megs memory, 0.0 secs Dovetailing Given PDBs for a state space construct a hybrid containing some entries from each of them, so that the total number of entries is the same as in one of the originals. The hope: almost as good as max, but only half the memory. Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide Dovetailing based on the blank PDB PDB PDB PDB PDB PDB PDB PDB PDB PDB PDB PDB Any colouring is possible???????????? PDB PDB PDB PDB???? PDB PDB?? Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
7 Dovetailing selection rule Dovetailing compared to Max ing Dovetailing requires a rule that maps each state, s, to one of the PDBs. Use that PDB to compute h(s). Any rule will work, but they won t all give the same performance. Intuitively, strict alternation between PDBs expected to be almost as good as max. max failures 7 dovetail failures Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide Experimental Results Culberson & Schaeffer (99): Dovetailing two PDBs reduced #nodes generated by a factor of. compared to using either PDB alone How to generalize Dovetailing to any abstractions of any space? Holte & Newton (unpublished): Dovetailing halved #nodes generated on average Heuristics/Holte Part, Slide 7 Heuristics/Holte Part, Slide 8
8 A Partial-Order on Domain Abstractions Easy to enumerate all possible domain abstractions Domain = blank 7 8 Abstract = blank Lattice of domain abstractions and to define a partial-order on them, e.g. Domain = blank 7 8 Abstract = blank is more abstract than the domain abstraction above. Heuristics/Holte Part, Slide 9 Heuristics/Holte Part, Slide 0 The LCA of Abstractions General Dovetailing Domain = blank 7 8 Abstract = blank Domain = blank 7 8 Abstract = blank blank 7 8 blank LCA = least-abstract common abstraction Given PDB and PDB defined by ϕ and ϕ Find a common abstraction ϕ of ϕ and ϕ Because it is a common abstraction there exist ϕ and ϕ such that ϕ ϕ = ϕ ϕ = ϕ For every pattern, p, defined by ϕ, set SELECT[p] = ϕ or ϕ Keep every entry (p k,h) from PDB i for which SELECT[ϕ i (p k )]=i. Given state s. ϕ s = SELECT[ϕ(s)]. h(s) = PDB[ϕ s (s)] Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
9 Adding instead of Max ing Additive Pattern Databases Under some circumstances it is possible to add the values from two PDBs instead of just max ing them and still have an admissible heuristic. This is advantageous because* h (s) + h (s) max( h (s), h (s) ) * but see slide Compared to Max ing Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide Manhattan Distance Heuristic M.D. as Additive PDBs () For a sliding-tile puzzle, Manhattan Distance looks at each tile individually, counts how many moves it is away from its goal position, and adds up these numbers. ϕ (x)= x if x = blank otherwise PDB [ϕ (s) ] = MD(s) = + + = ϕ (goal) ϕ (s) MD(s) = PDB [ϕ (s) ] + PDB [ϕ (s) ] goal state s + PDB [ϕ (s) ] Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
10 In General Korf & Felner s Method Partition the tiles in groups, G, G, G k Partition the tiles in groups, G, G, G k ϕ i (x)= x if x G i blank otherwise ϕ i (x)= x if x G i blank if x = blank otherwise Moves of cost zero Heuristics/Holte Part, Slide 7 Heuristics/Holte Part, Slide 8 What s the Difference? Compared to Max ing the blank cannot reach this position without disturbing tile or tile. If the PDBs were going to be max d instead of added, we would count all the moves in all the PDBs. Therefore the PDBs for adding have smaller entries than the corresponding PDBs for max ing. In initial experiments on the -puzzle, max ing returns a higher value than adding for about % of the states. Heuristics/Holte Part, Slide 9 Heuristics/Holte Part, Slide 0
11 8-7 Partition (7 million entries) Max ing After Adding * 7 8 tiles retain their identity 7 tiles retain their identity * movement of coloured tiles not counted Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide 7-7- Partition ( million entries) Max ing after Adding For a given 7-7- partition, look up the values and add them. Do this for each of the five 7-7- partitions and take the maximum*. + Also compute Manhattan Distance, and use that if it is largest of all. This was also done for 8-7. Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
12 -Puzzle Results Partition 7-7- n Nodes Generated 7,9 Customized PDBs 8-7,8 8% reduction in #nodes generated, but only 0% reduction in CPU time. Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide Space-Efficient PDBs Zhou & Hansen (AAAI, 00) Do not generate PDB entries that are provably not needed to solve the given problem. Prune abstract state A if f(a) > U, where U is an upper bound on the solution cost at the base level. To work well, needs a heuristic to guide the abstract search and a fairly tight U. Even then requires significantly more memory than Hierarchical IDA*. Silver, 00 Reverse Resumable A* Aims to minimize the number of PDB entries Backward search from abstract goal stops when abstract start is reached If h(x) is needed and has not been computed, resume the abstract search until you get it. Requires abstract Open and Closed lists. Heuristics/Holte Part, Slide 7 Heuristics/Holte Part, Slide 8
13 Super-Customization If customizing an abstraction for a given start state is a good idea, wouldn t it be even better to change abstractions in the middle of the search space to exploit local properties? This does pay off sometimes, even for PDBs: Felner, Korf & Hanan (00) Hernadvolgyi (00; also PhD thesis, chapter ) Multiple Lookups in One Pattern Database Heuristics/Holte Part, Slide 9 Heuristics/Holte Part, Slide 0 Use Symmetries Example c d Domain = blank 7 8 Abstract = blank c a e d e b mirror positions goal 7 distance(pos,c ) = distance(mirror(pos),c) state normal PDB lookup mirror lookup Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
14 Dual PDB Lookups Standard PDB lookup 8 distance? state goal abstract state abstract goal Domain = blank 7 8 Abstract = blank Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide Dual lookup, same PDB Relevance? Why is this lookup abstract state Heuristics/Holte Part, Slide abstract goal relevant to the original state? 8 7 Heuristics/Holte Part, Slide
15 Tile In a PDB for tile, this lookup Two Key Properties () Distances are Symmetric is relevant to the original state. 8 7 Heuristics/Holte Part, Slide 7 () Distances are tile-independent Heuristics/Holte Part, Slide 8 Third Key Property () Can determine which tiles in the given state correspond to the key tiles in the goal state. Domain = blank 7 8 Abstract = blank Fourth Key Property () The tiles that correspond to the key tiles in the goal state occur in the goal state.??? Domain = blank 7 8 Abstract = blank state 7 8 goal 7 state 7 8 goal Heuristics/Holte Part, Slide 9 Heuristics/Holte Part, Slide 0
16 Experimental Results -disk, -peg TOH, PDB of disks Normal: 7. secs Only the dual lookup:. secs Both lookups:. secs -puzzle, additive PDB (8-7) Normal: 0.0 secs Only the dual lookup: 0.07 secs Both lookups: 0.0 secs Heuristics/Holte Part, Slide Dual Not Always Consistent 7 Domain = 7 Abstract = 7 Heuristics/Holte Part, Slide goal (7-pancake puzzle) abstract distance = 0 7 abstract distance = Bidirectional Pathmax h(a) = X Related Algorithm CFPD h(b) = 7 h(c) = X Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide
17 CFDP CFDP - Example Coarse-to-Fine Dynamic Programming Works on continuous or discrete spaces. Most easily explained if space is a trellis (level structure). Abstraction = grouping states on the same level. Multiple levels of abstraction. Resembles refinement, but guaranteed to find optimal solution. Application: finding optimal convex region boundaries in an image. S More A C E H B D F I G Heuristics/Holte Part, Slide Heuristics/Holte Part, Slide CFDP Coarsest States CFDP Abstract Edges S 0 0 A C 0 B D 0 0 G Optimal solution S G 0 E 0 F 0 0 H 0 I More, all > 0 at coarsest level Heuristics/Holte Part, Slide 7 More, all > 0 at coarsest level Heuristics/Holte Part, Slide 8
18 CFDP Refine Optimal Path CFDP Refine Optimal Path Optimal solution 0 S A C G Optimal solution 0 S A C 0 B D 0 G More, all > 0 at coarsest level Heuristics/Holte Part, Slide 9 More, all > 0 at coarsest level Heuristics/Holte Part, Slide 70 CFDP Refine Again CFDP Final Iteration Optimal solution 0 S A C 0 B D 0 0 G Final solution 0 S 0 A C 0 B D 0 0 G 0 0 F 0 0 E 0 F 0 0 I H 0 I More, all > 0 at coarsest level Heuristics/Holte Part, Slide 7 More, all > 0 at Still at the coarsest level coarsest level Heuristics/Holte Part, Slide 7
What is a Pattern Database? Pattern Databases. Success Story #1. Success Story #2. Robert Holte Computing Science Dept. University of Alberta
What is a Pattern Database Pattern Databases Robert Holte Computing Science Dept. University of Alberta November, 00 PDB = a heuristic stored as a lookup table Invented by Culberson and Schaeffer (99)
More informationThe Big Idea. Where Do Heuristics Come From? Puzzles. Applications. (Using Abstraction to Speed Up Search)
Where Do Heuristics Come From? (Using Abstraction to Speed Up Search) Robert C. Holte Computing Science Department University of Alberta The Big Idea Create a simplified version of your problem. Use the
More informationCompressing Pattern Databases
Compressing Pattern Databases Ariel Felner and Ram Meshulam Computer Science Department Bar-Ilan University Ramat-Gan, Israel 92500 Email: felner,meshulr1 @cs.biu.ac.il Robert C. Holte Computing Science
More informationMultiple Pattern Databases
Multiple Pattern Databases R. C. Holte and Jack Newton University of Alberta Computing Science Department Edmonton, Alberta, T6G 2E8, Canada Email: {holte,newton}@cs.ualberta.ca A. Felner and R. Meshulam
More informationMaximizing over multiple pattern databases speeds up heuristic search
Artificial Intelligence 170 (2006) 1123 1136 www.elsevier.com/locate/artint Maximizing over multiple pattern databases speeds up heuristic search Robert C. Holte a,, Ariel Felner b, Jack Newton a, Ram
More informationInconsistent Heuristics
Uzi Zahavi Computer Science Bar-Ilan University Ramat-Gan, Israel 925 zahaviu@cs.biu.ac.il Inconsistent Heuristics Ariel Felner Jonathan Schaeffer and Nathan Sturtevant Information Systems Engineering
More informationPartial Pattern Databases
Partial Pattern Databases Kenneth Anderson, Robert Holte, and Jonathan Schaeffer University of Alberta, Computing Science Department, Edmonton, Alberta, T6G 2E8, Canada {anderson, holte, jonathan}@cs.ualberta.ca
More informationCompressed Pattern Databases
Journal of Artificial Intelligence Research 30 (2007) 213-247 Submitted 12/06; published 10/07 Compressed Pattern Databases Ariel Felner Department of Information Systems Engineering, Ben-Gurion University
More informationRecent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem
Recent Progress in Heuristic Search: A Case Study of the Four-Peg Towers of Hanoi Problem Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, CA 90095 korf@cs.ucla.edu
More informationHeuristic Evaluation Function. 11. Evaluation. Issues. Admissible Evaluations. Jonathan Schaeffer
Heuristic Evaluation Function. Evaluation Jonathan Schaeffer jonathan@cs.ualberta.ca www.cs.ualberta.ca/~jonathan Most of the magic in a single-agent searcher is in the evaluation function To obtain an
More informationFinding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases
Proceedings of the Sixth International Symposium on Combinatorial Search Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases André Grahl Pereira and Marcus Rolf Peter Ritt and
More informationPredicting the Performance of IDA* using Conditional Distributions
Journal of Artificial Intelligence Research 37 (2010) 41-83 Submitted 07/09; published 02/10 Predicting the Performance of IDA* using Conditional Distributions Uzi Zahavi Computer Science Department Bar-Ilan
More informationLecture 5 Heuristics. Last Time: A* Search
CSE 473 Lecture 5 Heuristics CSE AI Faculty Last Time: A* Search Use an evaluation function f(n) for node n. f(n) = estimated total cost of path thru n to goal f(n) = g(n) + h(n) g(n) = cost so far to
More informationSolving Sokoban Optimally using Pattern Databases for Deadlock Detection
Solving Sokoban Optimally using Pattern Databases for Deadlock Detection André G. Pereira, Marcus Ritt, Luciana S. Buriol Institute of Informatics Federal University of Rio Grande do Sul, Brazil {agpereira,marcus.ritt,buriol
More informationAbstraction-Based Heuristics with True Distance Computations
Abstraction-Based Heuristics with True Distance Computations Ariel Felner and Max Barer Information Systems Engineering Deutsche Telekom Labs Ben-Gurion University Be er-sheva, Israel 85104 felner@bgu.ac.il
More informationLossy Compression of Pattern Databases Using Acyclic Random Hypergraphs
Lossy Compression of Pattern Databases Using Acyclic Random Hypergraphs Mehdi Sadeqi and Howard J. Hamilton Department of Computer Science, University of Regina, Canada {sadeqi2m,hamilton}@cs.uregina.ca
More informationCommon Misconceptions Concerning Heuristic Search
Common Misconceptions Concerning Heuristic Search Robert C. Holte Computing Science Department, University of Alberta Edmonton, Canada T6G 2E8 (holte@cs.ualberta.ca Abstract This paper examines the following
More informationAdditive Pattern Database Heuristics
Journal of Artificial Intelligence Research 22 (2004) 279-318 Submitted 04/04; published 11/04 Additive Pattern Database Heuristics Ariel Felner felner@bgu.ac.il Department of Information Systems Engineering,
More informationInformed search algorithms. Chapter 3 (Based on Slides by Stuart Russell, Dan Klein, Richard Korf, Subbarao Kambhampati, and UW-AI faculty)
Informed search algorithms Chapter 3 (Based on Slides by Stuart Russell, Dan Klein, Richard Korf, Subbarao Kambhampati, and UW-AI faculty) Intuition, like the rays of the sun, acts only in an inflexibly
More informationEnhanced Partial Expansion A*
Journal of Artificial Intelligence Research 50 (2014) 141-187 Submitted 9/13; published 5/14 Enhanced Partial Expansion A* Meir Goldenberg Ariel Felner Roni Stern Guni Sharon Ben-Gurion University of the
More informationLearning from Multiple Heuristics
Mehdi Samadi Computing Science University of Alberta Edmonton, Alberta, Canada T6G E8 msamadi@cs.ualberta.ca Learning from Multiple Heuristics Ariel Felner Information Systems Engineering Dept. Deutsche
More informationUsing Lookaheads with Optimal Best-First Search
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI-10) Using Lookaheads with Optimal Best-First Search Roni Stern Tamar Kulberis Ariel Felner Information Systems Engineering
More informationRecent Results from Analyzing the Performance of Heuristic Search
Recent Results from Analyzing the Performance of Heuristic Search Teresa M. Breyer and Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, CA 90095 {treyer,korf}@cs.ucla.edu
More informationExploiting the Rubik s Cube 12-edge PDB by Combining Partial Pattern Databases and Bloom Filters
Exploiting the Rubik s Cube 12-edge PDB by Combining Partial Pattern Databases and Bloom Filters Nathan R. Sturtevant Dept. of Computer Science University of Denver Denver, CO, USA sturtevant@cs.du.edu
More informationEstimating Search Tree Size with Duplicate Detection
Estimating Search Tree Size with Duplicate Detection Levi H. S. Lelis Departamento de Informática Universidade Federal de Viçosa Viçosa, Brazil Roni Stern Information Systems Engineering Ben Gurion University
More informationCoarse-to-Fine Search Techniques
Coarse-to-Fine Search Techniques by Ken Anderson, Nathan Sturtevant, Robert Holte, and Jonathan Schaeffer Technical Report TR 08-05 April 2008 DEPARTMENT OF COMPUTING SCIENCE University of Alberta Edmonton,
More informationEarly Work on Optimization-Based Heuristics for the Sliding Tile Puzzle
Planning, Search, and Optimization: Papers from the 2015 AAAI Workshop Early Work on Optimization-Based Heuristics for the Sliding Tile Puzzle Ariel Felner ISE Department Ben-Gurion University Israel felner@bgu.ac.il
More informationRecursive Best-First Search with Bounded Overhead
Recursive Best-First Search with Bounded Overhead Matthew Hatem and Scott Kiesel and Wheeler Ruml with support from NSF grant IIS-1150068 Wheeler Ruml (UNH) Recursive Best-First Search with Bounded Overhead
More informationBasic Search Algorithms
Basic Search Algorithms Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract The complexities of various search algorithms are considered in terms of time, space, and cost
More informationMoving On. 10. Single-agent Search. Applications. Why Alpha-Beta First?
Moving On 10. Single-agent Search Jonathan Schaeffer jonathan@cs.ualberta.ca www.cs.ualberta.ca/~jonathan Two-player adversary search is nice, but not all interesting problems can be mapped to games Large
More informationUniversity of Alberta. Levi Henrique Santana de Lelis. Doctor of Philosophy. Department of Computing Science
University of Alberta CLUSTER-AND-CONQUER: A PARADIGM FOR SOLVING STATE-SPACE PROBLEMS by Levi Henrique Santana de Lelis A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment
More informationPredicting the Size of IDA* s Search Tree
Predicting the Size of IDA* s Search Tree Levi H. S. Lelis a, Sandra Zilles b, Robert C. Holte a a Computing Science Department, University of Alberta, Edmonton, AB, Canada T6G 2E8 b Department of Computer
More informationInformed search. Soleymani. CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2016
Informed search CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2016 Soleymani Artificial Intelligence: A Modern Approach, Chapter 3 Outline Best-first search Greedy
More informationAdditive Pattern Database Heuristics
Additive Pattern Database Heuristics Ariel Felner Ben-Gurion University of the Negev, Beer-Sheva, Israel Richard E.Korf, University of California,Los Angeles Sarit Hanan Bar-Ilan University, Ramat-Gan,
More informationInformed Search A* Algorithm
Informed Search A* Algorithm CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2018 Soleymani Artificial Intelligence: A Modern Approach, Chapter 3 Most slides have
More informationBootstrap Learning of Heuristic Functions
Proceedings of the Third Annual Symposium on Combinatorial Search (SOCS-10) Bootstrap Learning of Heuristic Functions Shahab Jabbari Arfaee Computing Science Department University of Alberta Edmonton,
More informationParallel Algorithms. Single Agent Search COMP 3705/4705. Parallel Search - Simple approaches. Dovetailing
Parallel Algorithms Single Agent Search COMP 3705/4705 Prof. Nathan Sturtevant Lecture 15 For many years it looked like our problems would be solved by increases in processor speed Moore s law predicts
More informationAnalyzing the Performance of Pattern Database Heuristics
Analyzing the Performance of Pattern Dataase Heuristics Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, CA 90095 korf@cs.ucla.edu Astract We introduce a model
More informationBest-First Frontier Search with Delayed Duplicate Detection
Best-First Frontier Search with Delayed Duplicate Detection Richard E. Korf Computer Science Department University of California, Los Angeles Los Angeles, CA 90095 korf@cs.ucla.edu Abstract Best-first
More informationMinimizing Disk I/O in Two-Bit Breadth-First Search
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008) Minimizing Disk I/O in Two-Bit Breadth-First Search Richard E. Korf Computer Science Department University of California,
More informationPartial-expansion A* with Selective Node Generation
Partial-expansion A* with Selective Node Generation Ariel Felner Nathan Sturtevant Meir Goldenberg CS Department Guni Sharon University of Denver (USA) Roni Stern, Tal Beja Sturtevant@cs.du.edu ISE Department
More informationThe Compression Power of Symbolic Pattern Databases
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling (ICAPS 2008) The Compression Power of Symbolic Pattern Databases Marcel Ball and Robert C. Holte Department of
More informationChapter 11 Search Algorithms for Discrete Optimization Problems
Chapter Search Algorithms for Discrete Optimization Problems (Selected slides) A. Grama, A. Gupta, G. Karypis, and V. Kumar To accompany the text Introduction to Parallel Computing, Addison Wesley, 2003.
More informationSimultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms
Simultaneously Searching with Multiple Settings: An Alternative to Parameter Tuning for Suboptimal Single-Agent Search Algorithms Richard Valenzano, Nathan Sturtevant, Jonathan Schaeffer University of
More informationClass Overview. Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 2. Problem Solving Agents. Problem Solving Agents: Assumptions
Class Overview COMP 3501 / COMP 4704-4 Lecture 2 Prof. JGH 318 Problem Solving Agents Problem Solving Agents: Assumptions Requires a goal Assume world is: Requires actions Observable What actions? Discrete
More informationBlock-Parallel IDA* for GPUs
Proceedings of the Tenth International Symposium on Combinatorial Search (SoCS 2017) Block-Parallel IDA* for GPUs Satoru Horie, Alex Fukunaga Graduate School of Arts and Sciences The University of Tokyo
More informationPSVN Manual (June 20, 2014)
PSVN Manual (June 20, 2014) Robert C. Holte Computing Science Department University of Alberta Edmonton, AB Canada T6G 2E8 (rholte@ualberta.ca) Broderick Arneson Neil Burch Computing Science Department
More informationThe Spurious Path Problem in Abstraction
The Spurious Path Problem in Abstraction Gaojian Fan and Robert C. Holte University of Alberta, Edmonton, Alberta, Canada {gaojian, rholte}@ualberta.ca Abstract Abstraction is a powerful technique in search
More informationExtending Heuris.c Search
Extending Heuris.c Search Talk at Hebrew University, Cri.cal MAS group Roni Stern Department of Informa.on System Engineering, Ben Gurion University, Israel 1 Heuris.c search 2 Outline Combining lookahead
More informationCMPUT 396 Sliding Tile Puzzle
CMPUT 396 Sliding Tile Puzzle Sliding Tile Puzzle 2x2 Sliding Tile States Exactly half of the states are solvable, the other half are not. In the case of 2x2 puzzles, I can solve it if I start with a configuration
More informationFront-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions
Front-to-End Bidirectional Heuristic Search with Near-Optimal Node Expansions Jingwei Chen University of Denver Denver, CO, USA jingchen@cs.du.edu Robert C. Holte University of Alberta Edmonton, AB, Canada
More informationSearch Algorithms for Discrete Optimization Problems
Search Algorithms for Discrete Optimization Problems Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar To accompany the text ``Introduction to Parallel Computing'', Addison Wesley, 2003. Topic
More informationOptimal-Generation Variants of EPEA*
Optimal-Generation Variants of EPEA* Meir Goldenberg, Ariel Felner ISE Department Ben-Gurion University Israel mgoldenbe@gmail.com, felner@bgu.ac.il Nathan Sturtevant CS Department University of Denver
More informationInformed State Space Search B4B36ZUI, LS 2018
Informed State Space Search B4B36ZUI, LS 2018 Branislav Bošanský, Martin Schaefer, David Fiedler, Jaromír Janisch {name.surname}@agents.fel.cvut.cz Artificial Intelligence Center, Czech Technical University
More informationImproving the Efficiency of Depth-First Search by Cycle Elimination
Improving the Efficiency of Depth-First Search by Cycle Elimination John F. Dillenburg and Peter C. Nelson * Department of Electrical Engineering and Computer Science (M/C 154) University of Illinois Chicago,
More informationINTRODUCTION TO HEURISTIC SEARCH
INTRODUCTION TO HEURISTIC SEARCH What is heuristic search? Given a problem in which we must make a series of decisions, determine the sequence of decisions which provably optimizes some criterion. What
More informationarxiv: v1 [cs.ai] 8 May 2017
Block-Parallel IDA* for GPUs (Extended Manuscript) Satoru Horie and Alex Fukunaga Graduate School of Arts and Sciences The University of Tokyo arxiv:1705.02843v1 [cs.ai] 8 May 2017 Abstract We investigate
More informationCS 343: Artificial Intelligence
CS 343: Artificial Intelligence Informed Search Prof. Scott Niekum University of Texas at Austin [These slides based on ones created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley.
More informationPuzzle Solving (single-agent search) Robert Holte Compu.ng Science Department University of Alberta
Puzzle Solving (single-agent search) Robert Holte Compu.ng Science Department University of Alberta 1 Puzzle = 1-player game Examples: Rubik s Cube Sliding-.le puzzle In this talk puzzles have determinis.c
More informationParallel FEM Computation and Multilevel Graph Partitioning Xing Cai
Parallel FEM Computation and Multilevel Graph Partitioning Xing Cai Simula Research Laboratory Overview Parallel FEM computation how? Graph partitioning why? The multilevel approach to GP A numerical example
More informationRobust Bidirectional Search via Heuristic Improvement
Robust via Heuristic Improvement Christopher Wilt and Wheeler Ruml Thanks to Michael Leighton, NSF (grants 0812141 and 1150068) and DARPA (grant N10AP20029) Christopher Wilt (UNH) Robust via Heuristic
More informationHeuristic Functions. Lecture Heuristic Search. Stefan Edelkamp
Heuristic Functions Lecture Heuristic Search Stefan Edelkamp 1 Overview Definition of heuristic estimator functions Admissible heuristics Consistent heuristics Heuristics in Puzzles: (n 2 1)-Puzzle and
More informationBounded Suboptimal Heuristic Search in Linear Space
Proceedings of the Sixth International Symposium on Combinatorial Search Bounded Suboptimal Heuristic Search in Linear Space Matthew Hatem Department of Computer Science University of New Hampshire Durham,
More informationHeuris'c Search. Reading note: Chapter 4 covers heuristic search.
Heuris'c Search Reading note: Chapter 4 covers heuristic search. Credits: Slides in this deck are drawn from or inspired by a multitude of sources including: Shaul Markovitch Jurgen Strum Sheila McIlraith
More informationUniversity of Alberta. Richard Valenzano. Master of Science. Department of Computing Science
University of Alberta SIMULTANEOUSLY SEARCHING WITH MULTIPLE ALGORITHM SETTINGS: AN ALTERNATIVE TO PARAMETER TUNING FOR SUBOPTIMAL SINGLE-AGENT SEARCH by Richard Valenzano A thesis submitted to the Faculty
More informationMove Pruning and Duplicate Detection
Move Pruning and Duplicate Detection Robert C. Holte Computing Science Department University of Alberta Edmonton, AB Canada T6G 2E8 rholte@ualberta.ca Abstract. This paper begins by showing that Burch
More informationLecture 9. Heuristic search, continued. CS-424 Gregory Dudek
Lecture 9 Heuristic search, continued A* revisited Reminder: with A* we want to find the best-cost (C ) path to the goal first. To do this, all we have to do is make sure our cost estimates are less than
More informationDFS* and the Traveling Tournament Problem. David C. Uthus, Patricia J. Riddle, and Hans W. Guesgen
DFS* and the Traveling Tournament Problem David C. Uthus, Patricia J. Riddle, and Hans W. Guesgen Traveling Tournament Problem Sports scheduling combinatorial optimization problem. Objective is to create
More informationEECS 492 Midterm #1. Example Questions. Note: Not a complete exam!
EECS 492 Midterm #1 Example Questions Note: Not a complete exam! General Instructions This exam is closed book, except that you are allowed to refer to a single sheet of paper. You may use a calculator
More informationCS 343H: Artificial Intelligence
CS 343H: Artificial Intelligence Lecture 4: Informed Search 1/23/2014 Slides courtesy of Dan Klein at UC-Berkeley Unless otherwise noted Today Informed search Heuristics Greedy search A* search Graph search
More informationClass Overview. Introduction to Artificial Intelligence COMP 3501 / COMP Lecture 2: Search. Problem Solving Agents
Class Overview COMP 3501 / COMP 4704-4 Lecture 2: Search Prof. 1 2 Problem Solving Agents Problem Solving Agents: Assumptions Requires a goal Assume world is: Requires actions Observable What actions?
More information! A* is best first search with f(n) = g(n) + h(n) ! Three changes make it an anytime algorithm:
Anytime A* Today s s lecture Lecture 5: Search - 4 Hierarchical A* Jiaying Shen CMPSCI 683 Fall 2004 Other Examples of Hierarchical Problem Solving Reviews of A* and its varations 2 Anytime algorithms
More informationSearch Algorithms for Discrete Optimization Problems
Search Algorithms for Discrete Optimization Problems Ananth Grama, Anshul Gupta, George Karypis, and Vipin Kumar To accompany the text ``Introduction to Parallel Computing'', Addison Wesley, 2003. 1 Topic
More informationBounded Suboptimal Search in Linear Space: New Results
Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014) Bounded Suboptimal Search in Linear Space: New Results Matthew Hatem and Wheeler Ruml Department of Computer Science University
More informationSearch. CS 3793/5233 Artificial Intelligence Search 1
CS 3793/5233 Artificial Intelligence 1 Basics Basics State-Space Problem Directed Graphs Generic Algorithm Examples Uninformed is finding a sequence of actions that achieve a goal from an initial state.
More 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 informationDomain-Independent Structured Duplicate Detection
21st National Conference on Artificial Intelligence (AAAI-06) Boston, MA July 2006 Domain-Independent Structured Duplicate Detection Rong Zhou Palo Alto Research Center 3333 Coyote Hill Road Palo Alto,
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 informationEfficient AND/OR Search Algorithms for Exact MAP Inference Task over Graphical Models
Efficient AND/OR Search Algorithms for Exact MAP Inference Task over Graphical Models Akihiro Kishimoto IBM Research, Ireland Joint work with Radu Marinescu and Adi Botea Outline 1 Background 2 RBFAOO
More informationCE 473: Artificial Intelligence. Autumn 2011
CE 473: Artificial Intelligence Autumn 2011 A* Search Luke Zettlemoyer Based on slides from Dan Klein Multiple slides from Stuart Russell or Andrew Moore Today A* Search Heuristic Design Graph search Recap:
More informationCS 4700: Artificial Intelligence
CS 4700: Foundations of Artificial Intelligence Fall 2017 Instructor: Prof. Haym Hirsh Lecture 7 Extra Credit Opportunity: Lecture Today 4:15pm Gates G01 Learning to See Without a Teacher Phillip Isola
More informationsearch, DFS & BrFS; cycle checking & MPC arc costs; heuristics; LCFS, BeFS, A* misc: iterative deepening, etc.
CSC384: Lecture 5 Last time search, DFS & BrFS; cycle checking & MPC Today arc costs; heuristics; LCFS, BeFS, A* misc: iterative deepening, etc. Readings: Today: Ch.4.5, 4.6 Next Weds: class notes (no
More informationThe Compressed Differential Heuristic
The ompressed ifferential Heuristic Meir Goldenberg ISE epartment Ben-Gurion University (Israel) Mgoldenbe@yahoo.ca Nathan Sturtevant S epartment University of enver (USA) Sturtevant@cs.du.edu Ariel Felner
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 informationSpeeding Up the Convergence of Online Heuristic Search. and. Scaling Up Offline Heuristic Search
Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search A Thesis Presented to The Academic Faculty by David A. Furcy In Partial Fulfillment of the Requirements for
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 informationToday. Informed Search. Graph Search. Heuristics Greedy Search A* Search
Informed Search [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at http://ai.berkeley.edu.] Today Informed Search Heuristics
More informationUsing Coarse State Space Abstractions to Detect Mutex Pairs
Using Coarse State Space Abstractions to Detect Mutex Pairs Mehdi Sadeqi Computer Science Department University of Regina Regina, SK, Canada S4S 0A2 (sadeqi2m@cs.uregina.ca) Robert C. Holte Computing Science
More information1 Introduction and Examples
1 Introduction and Examples Sequencing Problems Definition A sequencing problem is one that involves finding a sequence of steps that transforms an initial system state to a pre-defined goal state for
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 informationStructures and Strategies For Space State Search
Structures and Strategies For Space State Search 3.0 Introduction 3.1 Graph Theory 3.2 Strategies for Space State Search 3.3 Using Space State to Represent Reasoning with the Predicate Calculus AI Classnotes
More informationITCS 6150 Intelligent Systems. Lecture 5 Informed Searches
ITCS 6150 Intelligent Systems Lecture 5 Informed Searches Informed Searches We are informed (in some way) about future states and future paths We use this information to make better decisions about which
More informationSpace Filling Curves and Hierarchical Basis. Klaus Speer
Space Filling Curves and Hierarchical Basis Klaus Speer Abstract Real world phenomena can be best described using differential equations. After linearisation we have to deal with huge linear systems of
More informationBreadth-First Heuristic Search
14th International Conference on Automated Planning and Scheduling (ICAPS-04) Whistler, British Columbia, Canada June 3-7, 2004 Breadth-First Heuristic Search Rong Zhou and Eric A. Hansen Department of
More informationBreadth-first heuristic search. Paper by Rong Zhou, Eric A. Hansen Presentation by Salomé Simon
Breadth-first heuristic search Paper by Rong Zhou, Eric A. Hansen Presentation by Salomé Simon Breadth-first tree search 1 2 3 4 5 6 7 Used for search problems with uniform edge cost Prerequisite for presented
More informationLecture 5: Search Algorithms for Discrete Optimization Problems
Lecture 5: Search Algorithms for Discrete Optimization Problems Definitions Discrete optimization problem (DOP): tuple (S, f), S finite set of feasible solutions, f : S R, cost function. Objective: find
More informationBasic Search Algorithms
Basic Search Algorithms Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract The complexities of various search algorithms are considered in terms of time, space, and cost
More informationCSCI 446: Artificial Intelligence
CSCI 446: Artificial Intelligence Informed Search Instructor: Michele Van Dyne [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available
More informationGraph-Based Synopses for Relational Data. Alkis Polyzotis (UC Santa Cruz)
Graph-Based Synopses for Relational Data Alkis Polyzotis (UC Santa Cruz) Data Synopses Data Query Result Data Synopsis Query Approximate Result Problem: exact answer may be too costly to compute Examples:
More informationLogistics. Heuristics & Constraint Satisfaction. Symbolic Integration. 573 Topics. Symbolic Integration. Search. E.g. x 2 e x dx = e x (x 2-2x+2) + C
Logistics Heuristics & Constraint Satisfaction CSE 573 University of Washington Reading for Monday Ch 6 (Game playing) Guest Speaker Henry Kautz Mini Projects A. Game Playing Choose your own game Experiment
More information