On A* as a Special Case of Ordered Search
Abstract
The A* admissibility and optimality proofs presented to date have been based on overly restrictive assumptions about the relationship between real and estimated costs. This paper shows that idealism, accuracy and selectivity, properties hitherto thought to be unique to A*, are in fact common to all ordered searches, and do not require the evaluation function / = g+ h traditionally assumed. Consequently, much of A* theory can be greatly simplified.
Cite
Text
Schoppers. "On A* as a Special Case of Ordered Search." International Joint Conference on Artificial Intelligence, 1983.Markdown
[Schoppers. "On A* as a Special Case of Ordered Search." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/schoppers1983ijcai-special/)BibTeX
@inproceedings{schoppers1983ijcai-special,
title = {{On A* as a Special Case of Ordered Search}},
author = {Schoppers, Marcel},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1983},
pages = {783-785},
url = {https://mlanthology.org/ijcai/1983/schoppers1983ijcai-special/}
}