Heuristic Algorithms for Automated Space Planning
Proceedings of the Second International Joint Conference on Artificial Intelligence. Pages 27-38.
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 efficientl y solved a variety of problems. Developments allowing even greater efficiencies are also outlined.
Charles M. Eastman. 1971. Heuristic Algorithms for Automated Space Planning. In Proceedings of the Second International Joint Conference on Artificial Intelligence, IJCAI-71. IJCAI, 27–38. https://ijcai.org/proceedings/1971/3
Eastman, C. M. (1971). Heuristic Algorithms for Automated Space Planning. In Proceedings of the Second International Joint Conference on Artificial Intelligence, IJCAI-71 (pp. 27–38). IJCAI. https://ijcai.org/proceedings/1971/3
@inproceedings{ijcai1971p3,
title = {Heuristic Algorithms for Automated Space Planning},
author = {Eastman, Charles M.},
booktitle = {Proceedings of the Second International Joint Conference on
Artificial Intelligence, {IJCAI-71}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {D.C. Cooper},
pages = {27--38},
year = {1971},
url = {https://ijcai.org/proceedings/1971/3},
}
TY - CPAPER TI - Heuristic Algorithms for Automated Space Planning AU - Eastman, Charles M. T2 - Proceedings of the Second International Joint Conference on Artificial Intelligence, IJCAI-71 PB - International Joint Conferences on Artificial Intelligence PY - 1971 SP - 27 EP - 38 UR - https://ijcai.org/proceedings/1971/3 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
