Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Criticizing solutions to relaxed models yields powerful admissible heuristics
Information Sciences: an International Journal
Time complexity of iterative-deepening-A
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Recent Progress in the Design and Analysis of Admissible Heuristic Functions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Finding optimal solutions to the twenty-four puzzle
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Finding optimal solutions to Rubik's cube using pattern databases
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Prediction of Regular Search Tree Growth by Spectral Analysis
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
Performance evaluation of parallel iterative deepening A* on clusters of workstations
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Finding optimal solutions to the graph partitioning problem with heuristic search
Annals of Mathematics and Artificial Intelligence
Breadth-first heuristic search
Artificial Intelligence
Maximizing over multiple pattern databases speeds up heuristic search
Artificial Intelligence
Duality in permutation state spaces and the dual search algorithm
Artificial Intelligence
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
Linear-time disk-based implicit graph search
Journal of the ACM (JACM)
Multi-valued Pattern Databases
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Using abstraction in Two-Player Games
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
GP-rush: using genetic programming to evolve solvers for the rush hour puzzle
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Space-efficient memory-based heuristics
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Dual search in permutation state spaces
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
New admissible heuristics for domain-independent planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
External-memory pattern databases using structured duplicate detection
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Analyzing the performance of pattern database heuristics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Learning from multiple heuristics
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Predicting the performance of IDA* with conditional distributions
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Additive pattern database heuristics
Journal of Artificial Intelligence Research
Multiple-goal heuristic search
Journal of Artificial Intelligence Research
The generalized A* architecture
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
A general theory of additive state space abstractions
Journal of Artificial Intelligence Research
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Recent progress in heuristic search: a case study of the four-peg towers of Hanoi problem
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Dual lookups in pattern databases
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Breadth-first heuristic search
Artificial Intelligence
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Combining perimeter search and pattern database abstractions
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Using infeasibility to improve abstraction-based heuristics
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Fast directed model checking via Russian Doll abstraction
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
New methods for proving the impossibility to solve problems through reduction of problem spaces
Annals of Mathematics and Artificial Intelligence
Predicting the performance of IDA* using conditional distributions
Journal of Artificial Intelligence Research
Artificial intelligence search algorithms
Algorithms and theory of computation handbook
Inconsistent heuristics in theory and practice
Artificial Intelligence
Heuristic perimeter search: first results
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Generating admissible heuristics by abstraction for search in stochastic domains
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Solving the 24 puzzle with instance dependent pattern databases
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Experiments with multiple abstraction heuristics in symbolic verification
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Learning heuristic functions for large state spaces
Artificial Intelligence
Solving the traveling tournament problem with iterative-deepening A*
Journal of Scheduling
MR-search: massively parallel heuristic search
Concurrency and Computation: Practice & Experience
Evaluation of a simple, scalable, parallel best-first search strategy
Artificial Intelligence
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Predicting the size of IDA*'s search tree
Artificial Intelligence
Stratified tree search: a novel suboptimal heuristic search algorithm
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Information Processing Letters
Forward perimeter search with controlled use of memory
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Towards rational deployment of multiple heuristics in A*
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We describe a new technique for designing more accurate admissible heuristic evaluation functions, based on pattern databases [J. Culberson, J. Schaeffer, Comput. Intelligence 14 (3) (1998) 318-334]. While many heuristics, such as Manhattan distance, compute the cost of solving individual subgoals independently, pattern databases consider the cost of solving multiple subgoals simultaneously. Existing work on pattern databases allows combining values from different pattern databases by taking their maximum. If the subgoals can be divided into disjoint subsets so that each operator only affects subgoals in one subset, then we can add the pattern-database values for each subset, resulting in a more accurate admissible heuristic function. We used this technique to improve performance on the Fifteen Puzzle by a factor of over 2000, and to find optimal solutions to 50 random instances of the Twenty-Four Puzzle.