Predicting the performance of IDA using conditional distributions

Journal of Artificial Intelligence Research

Volumn 37, Issue , 2010, Pages 41-83

  Zahavi, Uzi ^a   Felner, Ariel ^b   Burch, Neil ^c   Holte, Robert C ^c  

^a BAR ILAN UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACCURATE PREDICTION; CONDITIONAL DISTRIBUTION; HEURISTIC DISTRIBUTION; SEARCH TREES;

FORECASTING;

EID: 77952682369     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2890     Document Type: Article

References (38)

1. Breyer, T., & Korf, R. (2008). Recent results in analyzing the performance of heuristic search. In Proceedings of the First International Workshop on Search in Artificial Intelligence and Robotics (held in conjunction with AAAI), pp. 24-31.
2. Chenoweth, S. V., & Davis, H. W. (1991). High-performance A* search using rapidly growing heuristics. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), pp. 198-203.
3. Culberson, J. C., & Schaeffer, J. (1994). Efficiently searching the 15-puzzle. Tech. rep. 94-108, Department of Computer Science, University of Alberta.
4. Culberson, J. C., & Schaeffer, J. (1998). Pattern databases. Computational Intelligence, 14(3), 318-334.
5. Dinh, H. T., Russell, A., & Su, Y. (2007). On the value of good advice: The complexity of A* search with accurate heuristics. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07), pp. 1140-1145.
6. Edelkamp, S. (2001a). Planning with pattern databases. In Proceedings of the 6th European Conference on Planning (ECP-01), pp. 13-34.
7. Edelkamp, S. (2001b). Prediction of regular search tree growth by spectral analysis. In Advances in Artificial Intelligence, Joint German/Austrian Conference on AI, (KI/ÖGAI-2001), pp. 154-168.
8. Felner, A., Korf, R. E., & Hanan, S. (2004). Additive pattern database heuristics. Journal of Artificial Intelligence Research, 22, 279-318.
9. Felner, A., Korf, R. E., Meshulam, R., & Holte, R. C. (2007). Compressed pattern databases. Journal of Artificial Intelligence Research, 30, 213-247.
10. Felner, A., Zahavi, U., Schaeffer, J., & Holte, R. C. (2005). Dual lookups in pattern databases. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 103-108.
11. Gaschnig, J. (1979). Performance Measurement and Analysis of Certain Search Algorithms. Ph.D. thesis, Carnegie-Mellon University.
12. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, SCC-4(2), 100-107.
13. Helmert, M., & Röger, G. (2008). How good is almost perfect?. In Proceedings of the Twenty-Third Conference on Artificial Intelligence (AAAI-08), pp. 944-949.
14. Holte, R. C., Felner, A., Newton, J., Meshulam, R., & Furcy, D. (2006). Maximizing over multiple pattern databases speeds up heuristic search. Artificial Intelligence, 170(16- 17), 1123-1136.
15. Holte, R. C., & Hernádvölgyi, I. T. (2004). Steps towards the automatic creation of search heuristics. Tech. rep. TR04-02, Computing Science Department, University of Alberta.
16. Huyn, N., Dechter, R., & Pearl, J. (1980). Probabilistic analysis of the complexity of A*. Artificial Intelligence, 15(3), 241-254.
17. Karp, R. M., & Pearl, J. (1983). Searching for an optimal path in a tree with random costs. Artificial Intelligence, 21(1-2), 99-116.
18. Korf, R. E. (1985). Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
19. Korf, R. E. (1997). Finding optimal solutions to Rubik's Cube using pattern databases. In Proceedings of the Fourteenth Conference on Artificial Intelligence (AAAI-97), pp. 700-705.
20. Korf, R. E. (2007). Analyzing the performance of pattern database heuristics. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07), pp. 1164-1170.
21. Korf, R. E., & Felner, A. (2002). Disjoint pattern database heuristics. Artificial Intelligence, 134(1-2), 9-22.
22. Korf, R. E., & Reid, M. (1998). Complexity analysis of admissible heuristic search. In Proceedings of the Fifteenth Conference on Artificial Intelligence (AAAI-98), pp. 305-310.
23. Korf, R. E., Reid, M., & Edelkamp, S. (2001). Time complexity of Iterative-Deepening-A*. Artificial Intelligence, 129(1-2), 199-218.
24. Martelli, A. (1977). On the complexity of admissible search algorithms. Artificial Intelligence, 8, 1-13.
25. McDiarmid, C. J. H., & Provan, G. M. (1991). An expected-cost analysis of backtracking and non-backtracking algorithms. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI-91), pp. 172-177.
26. McNaughton, M., Lu, P., Schaeffer, J., & Szafron, D. (2002). Memory-efficient A* heuristics for multiple sequence alignment. In Proceedings of the Eighteenth Conference on Artificial Intelligence (AAAI-02), pp. 737-743.
27. Méro, L. (1984). A heuristic search algorithm with modifiable estimate. Artificial Intelligence, 23(1), 13-27.
28. Pearl, J. (1984). Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison & Wesley.
29. Pohl, I. (1970). Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1(3), 193-204.
30. Pohl, I. (1977). Practical and theoretical considerations in heuristic search algorithms. Machine Intelligence, 8, 55-72.
31. Ratner, D., & Warmuth, M. K. (1986). Finding a shortest solution for the n × n extension of the 15-puzzle is intractable. In Proceedings of the Fifth Conference on Artificial Intelligence (AAAI-86), pp. 168-172.
32. Ruml, W. (2002). Adaptive Tree Search. Ph.D. thesis, Harvard University.
33. Sen, A. K., Bagchi, A., & Zhang, W. (2004). Average-case analysis of best-first search in two representative directed acyclic graphs. Artificial Intelligence, 155(1-2), 183-206.
34. Zahavi, U., Felner, A., Burch, N., & Holte, R. C. (2008). Predicting the performance of IDA* with conditional distributions. In Proceedings of the Twenty-Third Conference on Artificial Intelligence (AAAI-08), pp. 381-386.
35. Zahavi, U., Felner, A., Holte, R., & Schaeffer, J. (2006). Dual search in permutation state spaces. In Proceedings of the Twenty-First Conference on Artificial Intelligence (AAAI-06), pp. 1076-1081. (Pubitemid 44705419)
36. Zahavi, U., Felner, A., Holte, R. C., & Schaeffer, J. (2008). Duality in permutation state spaces and the dual search algorithm. Artificial Intelligence, 172(4-5), 514-540.
37. Zahavi, U., Felner, A., Schaeffer, J., & Sturtevant, N. R. (2007). Inconsistent heuristics. In Proceedings of the Twenty-Second Conference on Artificial Intelligence (AAAI-07), pp. 1211-1216.
38. Zhou, R., & Hansen, E. A. (2004). Space-efficient memory-based heuristics. In Proceedings of the Nineteenth Conference on Artificial Intelligence (AAAI-04), pp. 677-682.