{"type":"ScholarlyArticle","title":"High-Performance Aast Search Using Rapidly Growing Heuristics","authors":[{"name":"Stephen V. Chenoweth","slug":"stephen-v-chenoweth","given":"Stephen V.","family":"Chenoweth","affiliation":""},{"name":"Henry W. Davis","slug":"henry-w-davis","given":"Henry W.","family":"Davis","affiliation":""}],"abstract":"In high-performance A* searching to solve satisficing problems, there is a critical need to design heuristics which cause low time-complexity. In order for humans or machines to do this effectively, there must be an understanding of the domainindependent properties that such heuristics have . We show that, contrary to common belief, accuracy is not critical; the key issue is whether or not heuristic values are concentrated closely near a rapidly growing \"central function.\" As an application, we show that, by \"multiplying\" heuristics, it is possible to reduce exponential average timecomplexity to polynomial. This is contrary to conclusions drawn from previous studies. Experimental and theoretical examples are given.","doi":null,"url":"https://ijcai.org/proceedings/1991/30","pdf":"https://ijcai.org/proceedings/1991/0030.pdf","markdown":"https://ijcai.org/proceedings/1991/30.md","bibtex":"https://ijcai.org/proceedings/1991/bibtex/30","volume":{"slug":"1991","title":"Proceedings of the Twelfth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1991","url":"https://ijcai.org/proceedings/1991/","year":1991,"location":"Sydney, New South Wales, Australia","dates":"24-30 August 1991","editors":"John Mylopoulos and Ray Reiter","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":30,"pages":{"first":198,"last":202},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}