The Theoretical Foundation of Computer-Aided Architectural Design

Computer-aided architectural design is a rapidly developing area of research, and the results of recent research and development efforts are now beginning to find widespread practical application. However, the field often presents the appearance of a confused mélange of disconnected theoretical concepts and ad hoc system-implementation projects. The intentions of this paper are to elucidate some of the basic unifying theoretical concepts which form the foundation of much of the work that has been done, to relate these concepts to their historical predecessors, and to use the theoretical framework that is developed to make some comparisons between computer-aided and manual design methods. The questions of how design problems are defined, how potential solutions are represented, how they are generated, and how they are evaluated, are taken up in turn. A distinction is drawn between well-defined and ill-defined design problems. The issues of originality and style are considered. Finally a comparison is made between manual and computer-aided design processes, and the division of tasks between human designer and machine is discussed.

[1]  F. Zwicky,et al.  The Morphological Approach to Discovery, Invention, Research and Construction , 1967 .

[2]  Reyner Banham,et al.  Theory and design in the first machine age , 1967 .

[3]  Richard Fikes,et al.  REF-ARF: A System for Solving Problems Stated as Procedures , 1970, Artif. Intell..

[4]  Catherine Cooke.  Nikolai Krasil'nikov's Quantitative Approach to Architectural Design: An Early Example , 1975 .

[5]  T. R. Featheringham,et al.  On systemic problem solving and the error of the third kind , 1974 .

[6]  George W. Ernst,et al.  GPS : a case study in generality and problem solving , 1971 .

[7]  James R. Slagle.  Artificial intelligence : the heuristic programming approach , 1971 .

[8]  J. Ross Quinlan,et al.  A Formal Deductive Problem-Solving System , 1968, J. ACM.

[9]  A. L. Samuel,et al.  Some studies in machine learning using the game of checkers. II: recent progress , 1967 .

[10]  James R. Slagle,et al.  Experiments With a Multipurpose, Theorem-Proving Heuristic Program , 1968, JACM.

[11]  Charles Babbage,et al.  Charles Babbage and His Calculating Engines: Selected Writings by Charles Babbage and Others , 1962 .

[12]  H. Rittel,et al.  Dilemmas in a general theory of planning , 1973 .

[13]  H. Kay.  HUMAN LEARNING. , 1964, British medical bulletin.

[14]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[15]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[16]  John McCarthy,et al.  The Inversion of Functions Defined by Turing Machines , 1956 .

[17]  Hans J. Bremermann,et al.  Quantum noise and information , 1967 .

[18]  Wayne A. Wickelgren.  How to solve problems , 1974 .

[19]  Marvin Minsky,et al.  Steps toward Artificial Intelligence , 1995, Proceedings of the IRE.

[20]  Nicholas Negroponte,et al.  The architecture machine , 1975, Comput. Aided Des..

[21]  M. Scheerer,et al.  Problem Solving , 1967, Nature.

[22]  A. L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[23]  Franz Reuleaux,et al.  The Kinematics of Machinery , 2016, Nature.

[24]  Richard Bellman,et al.  Decision-making in fuzzy environment , 2012 .

[25]  R. Hursthouse.  THE LOGIC OF DECISION AND ACTION , 1969 .

[26]  Samuel B. Williams,et al.  ASSOCIATION FOR COMPUTING MACHINERY , 2000 .

[27]  Charles M. Eastman,et al.  Cognitive processes and ill-defined problems: a case study from design , 1969, IJCAI 1969.

[28]  W. W. Bledsoe,et al.  A Basic Limitation on the Speed of Digital Computers , 1961 .