Depth-first iterative-deepening: an optimal admissible tree search
Artificial Intelligence
Complexity analysis admissible heuristic search
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A space-time tradeoff for memory-based heuristics
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Time complexity of iterative-deepening-A
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Disjoint pattern database heuristics
Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Maximizing over multiple pattern databases speeds up heuristic search
Artificial Intelligence
Additive pattern database heuristics
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
Comparing best-first search and dynamic programming for optimal multiple sequence alignment
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
Active Learning of Group-Structured Environments
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Very large pattern databases for heuristic search
Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing
Predicting the performance of IDA* using conditional distributions
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
We introduce a model for predicting the performance of IDA* using pattern database heuristics, as a function of the branching factor of the problem, the solution depth, and the size of the pattern databases. While it is known that the larger the pattern database, the more efficient the search, we provide a quantitative analysis of this relationship. In particular, we show that for a single goal state, the number of nodes expanded by IDA* is a fraction of (logb s + 1)/s of the nodes expanded by a brute-force search, where b is the branching factor, and s is the size of the pattern database. We also show that by taking the maximum of at least two pattern databases, the number of node expansions decreases linearly with s compared to a brute-force search. We compare our theoretical predictions with empirical performance data on Rubik's Cube. Our model is conservative, and overestimates the actual number of node expansions.