Learning Admissible Heuristics while Solving Problems
Proceedings of the Twelfth International Joint Conference on Artificial Intelligence. Automated Reasoning. Pages 184-190.
Abstract
A method is presented that causes A .. to return high quality solutions while solving a set of problems using a non-admissible heuristic. The heuristic guiding the search changes as new information is learned during the search, and it converges to an admissible heuristic which 'contains the insight' of the original nonadmissible one. After a finite number of problems, A .. returns only optimal solutions. Experiments on sliding tile problems suggest that learning occurs very fast. Beginning with hundreds of randomly generated problems and an overestimating heuristic, the system learned sufficiently fast that only the first problem was solved non-optimally. As an application we show how one may construct heuristics for finding high quality solutions at lower cost than those returned by A .. using available admissible heuristics.
@inproceedings{ijcai1991p28,
title = {Learning Admissible Heuristics while Solving Problems},
author = {Bramanti-Gregor, Anna and Davis, Henry W.},
booktitle = {Proceedings of the Twelfth International Joint Conference on
Artificial Intelligence, {IJCAI-91}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John Mylopoulos and Ray Reiter},
pages = {184--190},
year = {1991},
month = {8},
note = {Automated Reasoning},
url = {https://ijcai.org/proceedings/1991/28},
}
TY - CPAPER TI - Learning Admissible Heuristics while Solving Problems AU - Bramanti-Gregor, Anna AU - Davis, Henry W. T2 - Proceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91 PB - International Joint Conferences on Artificial Intelligence PY - 1991 SP - 184 EP - 190 UR - https://ijcai.org/proceedings/1991/28 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
