A heuristic search algorithm with modifiable estimate
Artificial Intelligence
Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
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
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
Prediction of Regular Search Tree Growth by Spectral Analysis
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Memory-efficient A* heuristics for multiple sequence alignment
Eighteenth national conference on Artificial intelligence
Performance measurement and analysis of certain search algorithms.
Performance measurement and analysis of certain search algorithms.
Adaptive tree search
Average-case analysis of best-first search in two representative directed acyclic graphs
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
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
On the value of good advice: the complexity of A* search with accurate heuristics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
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
Predicting the performance of IDA* with conditional distributions
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
Additive pattern database heuristics
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
An expected-cost analysis of backtracking and non-backtracking algorithms
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
High-performance A* search using rapidly growing heuristics
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Dual lookups in pattern databases
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Searching for an optimal path in a tree with random costs
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
Inconsistent heuristics in theory and practice
Artificial Intelligence
Iterative-Deepening search with on-line tree size prediction
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
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
Predicting the size of depth-first branch and bound search trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Heuristic search when time matters
Journal of Artificial Intelligence Research
Iterative-deepening search with on-line tree size prediction
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Korf, Reid, and Edelkamp introduced a formula to predict the number of nodes IDA* will expand on a single iteration for a given consistent heuristic, and experimentally demonstrated that it could make very accurate predictions. In this paper we show that, in addition to requiring the heuristic to be consistent, their formula's predictions are accurate only at levels of the brute-force search tree where the heuristic values obey the unconditional distribution that they defined and then used in their formula. We then propose a new formula that works well without these requirements, i.e., it can make accurate predictions of IDA*'s performance for inconsistent heuristics and if the heuristic values in any level do not obey the unconditional distribution. In order to achieve this we introduce the conditional distribution of heuristic values which is a generalization of their unconditional heuristic distribution. We also provide extensions of our formula that handle individual start states and the augmentation of IDA* with bidirectional pathmax (BPMX), a tech nique for propagating heuristic values when inconsistent heuristics are used. Experimental results demonstrate the accuracy of our new method and all its variations.