Anytime heuristic search

Journal of Artificial Intelligence Research

Volumn 28, Issue , 2007, Pages 267-297

  Hansen, Eric A ^a   Zhou, Rong ^b  

^a MISSISSIPPI STATE UNIVERSITY   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; RECURSIVE FUNCTIONS; UNCERTAINTY ANALYSIS;

HEURISTIC SEARCH; RECURSIVE BEST FIRST SEARCH (RBFS); SEQUENCE ALIGNMENT;

HEURISTIC ALGORITHMS;

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

References (40)

1. Bagchi, A., & Mahanti, A. (1983). Search algorithms under different kinds of heuristics - a comparative study. Journal of the ACM, 30(1), 1-21.
2. Bagchi, A., & Srimani, P. (1985). Weighted heuristic search in networks. Journal of Algorithms, 6, 550-576.
3. Bonet, B., & Geffner, H. (2001). Planning as heuristic search. Artificial Intelligence, 129(1), 5-33.
4. Carillo, H., & Lipman, D. (1988). The multiple sequence alignment problem in biology. SIAM Journal of Applied Mathematics, 48(5), 1073-1082.
5. Chakrabarti, P., Ghosh, S., & DeSarkar, S. (1988). Admissibility of AO* when heuristics overestimate. Artificial Intelligence, 34(1), 97-113.
6. Davis, H., Bramanti-Gregor, A., & Wang, J. (1988). The advantages of using depth and breadth components in heuristic search. In Ras, Z., & Saitta, L. (Eds.), Methodologies for Intelligent Systems 3, pp. 19-28.
7. Dechter, R., & Pearl, J. (1985). Generalized best-first search strategies and the optimality of A*. Journal of the ACM, 32(3), 505-536.
8. Gasching, J. (1979). Performance measurement and analysis of certain search algorithms. Ph.D. thesis, Carnegie-Mellon University. Department of Computer Science.
9. Hansen, E., Zilberstein, S., & Danilchenko, V. (1997). Anytime heuristic search: First results. Tech. rep. 97-50, Univ. of Massachusetts/ Amherst, Dept. of Computer Science.
10. Hansen, E., & Zilberstein, S. (2001). LAO*: A heuristic search algorithm that finds solutions with loops. Artificial Intelligence, 129(1-2), 35-62.
11. Hansson, O., & Mayer, A. (1990). Probabilistic heuristic estimates. Annals of Mathematics and Artificial Intelligence, 2, 209-220.
12. Harris, L. (1974). The heuristic search under conditions of error. Artificial Intelligence, 5(3), 217-234.
13. Hart, P., Nilsson, N., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics (SSC), 4(2), 100-107.
14. Haslum, P., & Geffner, H. (2000). Admissible heuristics for optimal planning. In Proceedings of the 5th International Conference on Artifial Intelligence Planning and Scheduling (AIPS-00), pp. 140-149. AAAI Press.
15. Ikeda, T., & Imai, T. (1994). Fast A* algorithms for multiple sequence alignment. In Genome Informatics Workshop 94, pp. 90-99.
16. Ikeda, T., & Imai, H. (1999). Enhanced A* algorithms for multiple alignments: Optimal alignments for several sequences and k-opt approximate alignments for large cases. Theoretical Computer Science, 210(2), 341-374.
17. Kaindl, H., & Kainz, G. (1997). Bidirectional heuristic search reconsidered. Journal of Artificial Intelligence Research, 7, 283-317.
18. Kobayashi, H., & Imai, H. (1998). Improvement of the A* algorithm for multiple sequence alignment. In Proceedings of the 9th Workshop on Genome Informatics (GIW'98), pp. 120-130. Universal Academy Press, Inc.
19. Koll, A., & Kaindl, H. (1992). A new approach to dynamic weighting. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI-92), pp. 16-17. John Wiley and Sons.
20. Korf, R. (1985). Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27(1), 97-109.
21. Korf, R. (1990). Real-time heuristic search. Artificial Intelligence, 42(2-3), 197-221.
22. Korf, R. (1993). Linear-space best-first search. Artificial Intelligence, 62(1), 41-78.
23. Likhachev, M., Gordon, G., & Thrun, S. (2004). ARA*: Anytime A* with provable bounds on sub-optimality. In Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference (NIPS-03). MIT Press.
24. Long, D., & Fox, M. (2003). The 3rd international planning competition: Results and analysis. Journal of Artificial Intelligence Research, 20, 1-59.
25. Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley.
26. Pearl, J., & Kim, J. (1982). Studies in semi-admissible heuristics. IEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-4(4), 392-399.
27. Pemberton, J. (1995). k-best: A new method for real-time decision making. In Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pp. 227-233. Morgan Kaufmann.
28. Pohl, I. (1970a). First results on the effect of error in heuristic search. Machine Intelligence, 5, 219-236.
29. Pohl, I. (1970b). Heuristic search viewed as path finding in a graph. Artificial Intelligence, 1(3), 193-204.
30. Pohl, I. (1973). The avoidance of (relative) catastrophe, heuristic competence, genuine dynamic weighting and computational issues in heuristic problem-solving. In Proceedings of the 3rd International Joint Conference on Artificial Intelligence (IJCAI-73), pp. 12-17. Morgan Kaufmann.
31. Rao, V., Kumar, V., & Korf, R. (1991). Depth-first vs. best-first search. In Proceedings of the 9th National Conference on Artificial Intelligence (AAAI-91), pp. 434-440. AAAI/MIT Press.
32. Ratner, D., & Pohl, I. (1986). Joint and LPA*: Combination of approximation and search. In Proceedings of the 5th National Conference on Artificial Intelligence (AAAI-86), pp. 173-177. AAAI/MIT Press.
33. Russell, S., & Wefald, E. (1991). Do the Right Thing: Studies in Limited Rationality. MIT Press.
34. Sarkar, U., Chakrabarti, P., Ghose, S., & DeSarkar, S. (1991). Reducing reexpansions in iterative-deepening search by controlling cutoff bounds. Artificial Intelligence, 50(2), 207-221.
35. Shimbo, M., & Ishida, T. (2003). Controlling the learning process of real-time heuristic search. Artificial Intelligence, 146(1), 1-41.
36. Wah, B., & Shang, Y. (1994). A comparative study of IDA*-style searches. In Proceedings of the 6th International Conference on Tools with Artificial Intelligence (ICTAI-94), pp. 290-296. IEEE Computer Society.
37. Yoshizumi, T., Miura, T., & Ishida, T. (2000). A* with partial expansion for large branching factor problems. In Proceedings of the 17th National Conference on Artificial Intelligence (AAAI-2000), pp. 923-929. AAAI/MIT Press.
38. Zhou, R., & Hansen, E. (2002). Multiple sequence alignment using Anytime A*. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-02), pp. 975-6. AAAI/MIT Press.
39. Zhou, R., & Hansen, E. (2004). K-group A* for multiple sequence alignment with quasi-natural gap costs. In Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI-04), pp. 688-695. IEEE Computer Society.
40. Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. AI Magazine, 17(3), 73-83.