{"type":"ScholarlyArticle","title":"The Statistical Inference Method in Heuristic Search Techniques","authors":[{"name":"Ling Zhang","slug":"ling-zhang","given":"Ling","family":"Zhang","affiliation":""},{"name":"Bo Zhang","slug":"bo-zhang","given":"Bo","family":"Zhang","affiliation":""}],"abstract":"In this paper we present a new heuristic searching algorithm by introducing statistical inference method on the basis of algorithm A*, It's called al g orithm SA*, The followin g results have been proved. (1) Al gorithm SA* is super .Lor to al g orith m A*. ( 2 ) The mean complexity of SA* is CN 2 , but in some case A* exhibits exponential complexity (e N) , (J) In a (N ,d,F ) -ga me tree , the mean complexity o f S A* is CN 1 , b ut t~e complexity of other known gamesearching algori thm (-~, SSS* etc.) is at least d>l. (4)The maximal storage-space required by SA* is c,N. Thishows that under a given significance l evel S A* is superior to other known algorithm (e . g , A*, B* , ct..fJ , SS S* etc, ) ,","doi":null,"url":"https://ijcai.org/proceedings/1983/182","pdf":"https://ijcai.org/proceedings/1983/0182.pdf","markdown":"https://ijcai.org/proceedings/1983/182.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/182","volume":{"slug":"1983","title":"Proceedings of the Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1983","url":"https://ijcai.org/proceedings/1983/","year":1983,"location":"Karlsruhe, West Germany","dates":"","editors":"Alan Bundy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Planning and Search","track":"Planning and Search","number":182,"pages":{"first":757,"last":758},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}