Heuristic Algorithms for Automated Space Planning

Eastman, Charles M.

Heuristic Algorithms for Automated Space Planning

IJCAI 1971 pp. 27-39

/ijcai/1971/eastman1971ijcai-heuristic/

Abstract

This paper reviews the major characteristics of existing programs for automatically solving space planning problems. It outlines general features of this class of problem and introduces a set of heuristic decision rules called Constraint Structured Planning, which in preliminary tests have efficiently solved a variety of problems. Developments allowing even greater efficiencies are also outlined.

PDF Semantic Scholar

Cite

Text

Eastman. "Heuristic Algorithms for Automated Space Planning." International Joint Conference on Artificial Intelligence, 1971.

Markdown

[Eastman. "Heuristic Algorithms for Automated Space Planning." International Joint Conference on Artificial Intelligence, 1971.](https://mlanthology.org/ijcai/1971/eastman1971ijcai-heuristic/)

BibTeX

@inproceedings{eastman1971ijcai-heuristic,
  title     = {{Heuristic Algorithms for Automated Space Planning}},
  author    = {Eastman, Charles M.},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1971},
  pages     = {27-39},
  url       = {https://mlanthology.org/ijcai/1971/eastman1971ijcai-heuristic/}
}