Constrained Heuristic Search
Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Search. Pages 309-314.
Abstract
We propose a model of problem solving that provides both structure and foc~s ~o search. ~he model achieves this by combmmg constramt satisfaction with heuristic search. We introduce the concepts of topology and texture to characterize problem structure and areas to focus attention respectively. The resulting model redu~es search complexity and provides a more prmcipled explanation of the nature and power of heuristics in problem solving. We demonstrate the model of Constrained Heuristic Search in two domains: spatial planning and factory scheduling. In the former we demonstrate significant reductions in search.
@inproceedings{ijcai1989p49,
title = {Constrained Heuristic Search},
author = {Fox, Mark S. and Sadeh, Norman M. and Baykan, Can A.},
booktitle = {Proceedings of the Eleventh International Joint Conference on
Artificial Intelligence, {IJCAI-89}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {N. S. Sridharan},
pages = {309--314},
year = {1989},
month = {8},
note = {Search},
url = {https://ijcai.org/proceedings/1989/49},
}
TY - CPAPER TI - Constrained Heuristic Search AU - Fox, Mark S. AU - Sadeh, Norman M. AU - Baykan, Can A. T2 - Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, IJCAI-89 PB - International Joint Conferences on Artificial Intelligence PY - 1989 SP - 309 EP - 314 UR - https://ijcai.org/proceedings/1989/49 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
