Heuristic algorithms for automated space planning

Authors:
Charles M. Eastman
Affiliations:
Institute of Physical Planning, Carnegie-Mellon University, Pittsburgh, Penna.
Venue:
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Year:
1971

Citing 7
Cited 1

Realization of a geometry-theorem proving machine

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

Journal of the ACM (JACM)
Preliminary report on a system for general space planning

Communications of the ACM
An approach to computerized space planning using graph theory

DAC '71 Proceedings of the 8th Design Automation Workshop
GSP: A system for computer assisted space planning

DAC '71 Proceedings of the 8th Design Automation Workshop
Computer-aided space planning

DAC '70 Proceedings of the 7th Design Automation Workshop
Computer design of equipment layouts using the design problem solver (dps)

Computer design of equipment layouts using the design problem solver (dps)

About the solution of combinatorial problems with problem solving methods

IJCAI'75 Proceedings of the 4th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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.