Generalized Best-First Search Strategies and the Optimality of A

Journal of the ACM (JACM)

Volumn 32, Issue 3, 1985, Pages 505-536

  Dechter, Rina ^a   Pearl, Judea ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS;

BEST-FIRST SEARCH STRATEGIES; HEURISTIC SEARCH; SHORTEST PATH ALGORITHMS;

SYSTEMS SCIENCE AND CYBERNETICS;

EID: 0022094206     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/3828.3830     Document Type: Article

References (20)

1. BAGCHI, A., AND MAHANTI, A. Search algorithms under different kinds of heuristics-A comparative study. J. ACM30, 1 (Jan. 1983), 1-21.
2. BARR, A., AND FEIGENBAUM, E. A. Handbook of Artificial Intelligence. William Kaufman, Inc., Los Altos, Calif., 198 1.
3. DREYFUS, S. E., AND LAW, A. M. The Art and Theory ofDynamic Programming. Academic Press, Orlando, 1977.
4. GELPERIN, D. On the optimality of A*. Artif: Zntell. 8, 1 (1977), 69-76.
5. HARRIS, L. R. The heuristic search under conditions of error. Artif: Intell. 5, 3 (1974), 217-234.
6. HART, P. E., NILSSON, N. J., AND RAPHAEL, B. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. SSC-4, 2 (1968), 100-107.
7. HART, P. E., NILSSON, N. J., AND RAPHAEL, B. Correction to a formal basis for the heuristic determination of minimum cost paths. SIGART Newsletter (ACM) 37 (1972), 28-29.
8. IBARAKI, T. The power of dominance relations in branch-and-bound algorithms. J. ACM 24, 2 (Apr. 1977), 264-279.
9. KARP, R. M., AND PEARL, J. Searching for an optimal path in a tree with random costs. Artif: Zntell. 21, I (Mar. 1983), 99-116.
10. LAWLER, E. L. AND WOOD, D. E. Branch-and-bound methods: A survey. Oper. Res. 14, 4 (1966), 699-719.
11. MARTELLI, A. On the complexity of admissible search algorithms. Artif: Intell. 8, 1 (1977), 1-13.
12. MERO, L. A heuristic search algorithm with modifiable estimate. Artif: Intell. 23, 1 (1984) 13-27.
13. NILSSON, N. J. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, New York, 197 1.
14. NILSSON, N. J. Principles of Artificial Intelligence. Tioga, Palo Alto, Calif., 1980.
15. PEARL, J. On the discovery and generation of certain heuristics. AI Magazine (Winter/Spring 1983), 23-33.
16. PEARL, J. HEURISTICS: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, Reading, Mass., 1984.
17. PEARL, J., AND KIM, J. H. Studies in semi-admissible heuristics. IEEE Trans. Pattern Analysis Machine Intell. PAMI-4, 4 (1982), 392-399.
18. POHL, I. First results on the effect of error in heuristic search. Much. Intell. 5 (1969) 219-236.
19. POHL, I. Bi-directional search. In Machine Intelligence, vol. 6, B. Meltzer and D. Michie, Eds. American Elsevier, New York, 1971, pp. 127-140.
20. POHL, I. 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 (Stanford, Calif., Aug. 20-23). William Kaufman, Inc., Los Altos, Calif., 1973.