%0 Journal Article
%T Automatic Structural Synthesis of Planetary Geared Mechanisms using Graph Theory
%J Journal of Applied and Computational Mechanics
%I Shahid Chamran University of Ahvaz
%Z 2383-4536
%A Nafeh, Hind A.
%A Esmail, Essam L.
%A Abdali, Sajad H.
%D 2023
%\ 04/01/2023
%V 9
%N 2
%P 384-403
%! Automatic Structural Synthesis of Planetary Geared Mechanisms using Graph Theory
%K displacement graph
%K link assortment array
%K rooted parent graph
%K pseudo-isomorphism graph
%K structure synthesis
%K spanning tree
%R 10.22055/jacm.2022.41255.3721
%X Graphs are an effective tool for planetary gear trains (PGTs) synthesis and for the enumeration of all possible PGTs for transmission systems. In the past fifty years, considerable effort has been devoted to the synthesis of PGTs. To date, however, synthesis results are inconsistent, and accurate synthesis results are difficult to achieve. This paper proposes a systematic approach for synthesizing PGTs depending on spanning trees and parent graphs. Trees suitable for constructing rooted graphs are first identified. The parent graphs are then listed. Finally, geared graphs are discovered by inspecting their parent graphs and spanning trees. To precisely detect spanning trees, a novel method based on two link assortment equations is presented. Transfer vertices and edge levels are detected without the use of any computations. This work develops the vertex matrix of the rooted graph, and its distinctive equation is used to arrange the vertex degree arrays according to the vertex levels and eliminate the arrays that violate the distinctive equations. The precise results of the 5-link geared graphs are confirmed to be 24. The disparity between the recent and previous synthesis results can be attributed to the fact that the findings of the current method, which employs rooted graphs, are more comprehensive than those obtained with graphs lacking multiple joints. A novel algorithm for detecting structural isomorphism is proposed. By comparing the vertex degree listings and gear strings, non-isomorphic geared graphs are obtained. The algorithm is simple and computationally efficient. The graph representation is one-to-one with the vertex degree listing and gear string representation. This allows for the storage of a large number of graphs on a computer for later use.
%U https://jacm.scu.ac.ir/article_17792_dc7e60cfc9a50e86d4f8e2837c0120f0.pdf