Constrained heuristic search

  • Authors:
  • Mark S. Fox;Norman Sadeh;Can Baykan

  • Affiliations:
  • Robotics Institute & Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania;Robotics Institute & Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania;Robotics Institute & Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania

  • Venue:
  • IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1989

Quantified Score

Hi-index 0.00

Visualization

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.