The multidisciplinary combinatorial approach (MCA) and its applications in engineering

The current paper describes the Multidisciplinary Combinatorial Approach (MCA), the idea of which is to develop discrete mathematical representations, called “Combinatorial Representations” (CR) and to represent with them various engineering systems. During the research, the properties and methods embedded in each representation and the connections between them were investigated thoroughly, after which they were associated with various engineering systems to solve related engineering problems. The CR developed up until now are based on graph theory, matroid theory, and discrete linear programming, whereas the current paper employs only the first two. The approach opens up new ways of working with representations, reasoning and design, some of which are reported in the paper, as follows: 1) Integrated multidisciplinary representation—systems which contain interrelating elements from different disciplines are represented by the same CR. Consequently, a uniform analysis process is performed on the representation, and thus on the whole system, irrespective of the specific disciplines, to which the elements belong. 2) Deriving known methods and theorems—new proofs to known methods and theorems are derived in a new way, this time on the basis of the combinatorial theorems embedded in the CR. This enables development of a meta-representation for engineering as a whole, through which the engineering reasoning becomes convenient. In the current paper, this issue is illustrated on structural analysis. 3) Deriving novel connections between remote fields—new connections are derived on the basis of the relations between the different combinatorial representations. An innovative connection between mechanisms and trusses, shown in the paper, has been derived on the basis of the mutual dualism between their corresponding CR. This new connection alone has opened several new avenues of research, since knowledge and algorithms from machine theory are now available for use in structural analysis and vice versa. Furthermore, it has opened opportunities for developing new design methods, in which, for instance, structures with special properties are developed on the basis of known mechanisms with special properties, as demonstrated in this paper. Conversely, one can use these techniques to develop special mechanisms from known trusses.

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

[2]  Kenneth Preiss,et al.  Graph theory representations of engineering systems and their embedded knowledge , 1999, Artif. Intell. Eng..

[3]  Steven J. Fenves,et al.  NETWORK-TOPOLOGICAL FORMULATION OF STRUCTURAL ANALYSIS , 1963 .

[4]  W. W. Bledsoe,et al.  Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[5]  R. Spence,et al.  Tellegen's theorem and electrical networks , 1970 .

[6]  G. Laman On graphs and rigidity of plane skeletal structures , 1970 .

[7]  K. C Ng,et al.  Electrical network theory , 1977 .

[8]  G. C. Andrews,et al.  The vector-network model: A new approach to vector dynamics , 1975 .

[9]  Herbert A. Simon,et al.  The Sciences of the Artificial , 1970 .

[10]  Arthur G. Erdman,et al.  Modern kinematics : developments in the last forty years , 1993 .

[11]  Offer Shai,et al.  The duality relation between mechanisms and trusses , 2001 .

[12]  J. Maxwell,et al.  The Scientific Papers of James Clerk Maxwell: On the Calculation of the Equilibrium and Stiffness of Frames , 1864 .

[13]  Michael R. Genesereth,et al.  Logical foundations of artificial intelligence , 1987 .

[14]  Narsingh Deo,et al.  Graph Theory with Applications to Engineering and Computer Science , 1975, Networks.

[15]  N.R. Malik,et al.  Graph theory with applications to engineering and computer science , 1975, Proceedings of the IEEE.

[16]  Robert Johnson,et al.  Structural Analysis , 2020, Multiphysics Modeling with Application to Biomedical Engineering.

[17]  Christoph M. Hoffmann,et al.  GEOMETRIC CONSTRAINT SOLVING IN ℜ2 AND ℜ3 , 1995 .

[18]  Ali Kaveh,et al.  Optimal Structural Analysis , 1997 .

[19]  F. Freudenstein,et al.  On a theory for the type synthesis of mechanisms , 1966 .

[20]  Ali Kaveh Graphs and structures , 1991 .

[21]  Ferdinand Freudenstein,et al.  An Application of Boolean Algebra to the Motion of Epicyclic Drives , 1971 .

[22]  Offer Shai,et al.  Isomorphic Representations and Well-Formedness of Engineering Systems , 1999, Engineering with Computers.

[23]  R. G. Coyle,et al.  Introduction to system dynamics , 1996 .

[24]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[25]  Offer Shai,et al.  COMBINATORIAL REPRESENTATIONS IN STRUCTURAL ANALYSIS , 2001 .

[26]  L. Lovász,et al.  On Generic Rigidity in the Plane , 1982 .

[27]  O. Shai Deriving structural theorems and methods using Tellegen's theorem and combinatorial representations , 2001 .

[28]  A. Recski Matroid theory and its applications in electric network theory and in statics , 1989 .