Preliminary report on a system for general space planning

Authors:
Charles M. Eastman
Affiliations:
Carnegie-Mellon Univ., Pittsburgh, PA
Venue:
Communications of the ACM
Year:
1972

Citing 2
Cited 6

An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions

Journal of the ACM (JACM)
Representations for space planning

Communications of the ACM

An algorithm for exhaustive generation of building floor plans

Communications of the ACM
A heuristic problem solving design system for equipment or furniture layouts

Communications of the ACM
A Planning Aid: An Intelligent Modeling System for Planning Problems Based on Constraint Satisfaction

IEEE Transactions on Knowledge and Data Engineering
Heuristic algorithms for automated space planning

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics

Artificial Intelligence
Floor plan design using block algebra and constraint satisfaction

Advanced Engineering Informatics

Quantified Score

Hi-index	48.25

Visualization

Abstract

A computer language and a set of programs within that language are described which allow the formulating and solving of a class of space planning problems. The language is an extension of Algol and includes means to represent spaces and objects, to manipulate them, and to test the resulting arrangements according to a variety of constraints. The algorithms used to solve problems expressed in this language rely on heuristic programming. Both the language and the search algorithms are detailed.