{"type":"ScholarlyArticle","title":"A Result on the Computational Complexity of Heuristic Estimates for the A* Algorithm","authors":[{"name":"Marco Valtorta","slug":"marco-valtorta","given":"Marco","family":"Valtorta","affiliation":""}],"abstract":"The performance of a new heuristic search algorithm is analyzed in this paper . The algorithm uses a formal representation {semantic representation) that contains enough information to compute the heuristic evaluation function h(n), as defined in the context of A*, wi thout requiring a human expert to provide it. The heuristic is computed by solving less constrained subproblems {auxiliary problems) of the given problem. The new algorithm is shown to be less efficient than the Dijkstra algorithm, according to the complexity measure \"number of node expansions.\" This proves that it is not efficient to compute heuristics for A* by solving auxiliary problems with backtracking.","doi":null,"url":"https://ijcai.org/proceedings/1983/188","pdf":"https://ijcai.org/proceedings/1983/0188.pdf","markdown":"https://ijcai.org/proceedings/1983/188.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/188","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":188,"pages":{"first":777,"last":778},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}