Constrained Heuristic Search
Conference Paper, Proceedings of 11th International Joint Conference on Artificial Intelligence (IJCAI '89), pp. 309 - 316, August, 1989
Abstract
We propose a model of problem solving that provides both structure and focus to search. The model achieves this by combining constraint 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 reduces search complexity and provides a more principled 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.
BibTeX
@conference{Fox-1989-15508,author = {Mark S. Fox and Norman Sadeh-Koniecpol and Can Baykan},
title = {Constrained Heuristic Search},
booktitle = {Proceedings of 11th International Joint Conference on Artificial Intelligence (IJCAI '89)},
year = {1989},
month = {August},
pages = {309 - 316},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.