This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Heuristic Search Technique-Algorithm SA
January 1985 (vol. 7 no. 1)
pp. 103-107
Bo Zhang, Department of Computer Engineering and Science, Tsinghua University, Beijing, People's Republic of China.
Ling Zhang, Department of Mathematics, Anqing Teachers' College, Anqing, Anhui, People's Republic of China.
In this paper, we present a new heuristic searching algorithm by introducing the statistical inference method on the basis of algorithm A (or A*). It is called algorithm SA. In a simplified search space, a uniform m-ary tree, we obtain the following result. Using algorithm SA, a goal node can be found with probability one, and its mean complexity is O(N·ln N) where N is the depth at which the goal is located.
Citation:
Bo Zhang, Ling Zhang, "A New Heuristic Search Technique-Algorithm SA," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, no. 1, pp. 103-107, Jan. 1985, doi:10.1109/TPAMI.1985.4767624
Usage of this product signifies your acceptance of the Terms of Use.