{"type":"ScholarlyArticle","title":"Aepsilon - An Efficient Near Admissible Heuristic Search Algorithm","authors":[{"name":"Malik Ghallab","slug":"malik-ghallab","given":"Malik","family":"Ghallab","affiliation":""},{"name":"Dennis G. Allard","slug":"dennis-g-allard","given":"Dennis G.","family":"Allard","affiliation":""}],"abstract":"The algorithm A* (Nilsson, 1979) presents two significant drawbacks. First, in seeking strict optimal solution paths it necessarily has high order of complexity. Second, the algorithm doesnot explicitly descriminate between the cost of a solution path and the cost of finding the solution path. To confront these problems we propose the algorithm A£, a generalization of A*. Instead of seeking an optimal solution, it seeks one which is within a factor (I+E) of optimum (E0). The basic idea is to avoid doing any search at all on most near optimal partial solutions by sticking to a small number of most fruitful paths. Various strategies for searching for near optimal partial solutions are discussed . Experimental results are pres e nted indicating that AE has average complexity of lower order than A* and compares favorably to the related algorithm AE* (Pearl and Kim, 1982).","doi":null,"url":"https://ijcai.org/proceedings/1983/192","pdf":"https://ijcai.org/proceedings/1983/0192.pdf","markdown":"https://ijcai.org/proceedings/1983/192.md","bibtex":"https://ijcai.org/proceedings/1983/bibtex/192","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":192,"pages":{"first":789,"last":790},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}