For convenience of computer progressing, the structure of PGT is usually represented by its topological graph, where a solid vertex, a hollow vertex, a solid edge and a dashed edge represent a link, a multiple joint, a revolute pair and a geared pair, respectively. For example, the topological graph of the PGT in
Figure 2a is shown in
Figure 3a. Multiple joints 12 and 13 in
Figure 3a are equivalent to one multiple joint, namely, the multiple joint formed by central links rotating around the main shaft of AT. The equivalent topological graph of
Figure 3a is shown in
Figure 3b. The topological graphs of the PGTs in
Figure 2b,c are shown in
Figure 3c,d, respectively. The adjacency matrix of a PGT graph is defined by Equation (1), where
n is the total number of vertices (including solid and hollow vertices),
ai,j is the element in
ith row and
jth column of the matrix, and
d is the degree of a hollow vertex. For example, the adjacency matrices of
Figure 3c,d are shown as AM
1 and AM
2 in Equation (2), respectively. A
d-degree hollow vertex is equivalent to (
d − 1) revolute pairs.
The graph in
Figure 3a is a vertex-fractionated graph that can be separated into two independent sub-graphs (namely,
Figure 3c,d) at vertex 2. In reverse, by combining vertex 2 in
Figure 3c and vertex 1 in
Figure 3d, the graph in
Figure 3a can be derived. The DOF equation of a PGT is
where
N,
R and
G are the numbers of links, revolute pairs and geared pairs, respectively. The DOF of the PGT in
Figure 3a is
F = 3(
N − 1) −2
R −
G = 3 × (11 − 1) – 2 × 10
−8 = 2, that is,
Figure 3a represents an 11-link 2-DOF fractionated PGT. Similarly,
Figure 3c,d represent a 4-link 1-DOF and an 8-link 1-DOF non-fractionated PGT, respectively. Generally,
N1-link
F1-DOF and
N2-link
F2-DOF non-fractionated PGTs can be combined to obtained (
N1 +
N2 − 1)-link (
F1 +
F2)-DOF fractionated PGTs. The topological graph of PGT in
Figure 3a can be used to design 7-speed AT mechanisms, but it is not suitable for designing 8-speed and 9-speed AT mechanisms. We aim to synthesize 11-link 2-DOF fractionated topological graphs of PGTs, which can be used to design 7-speed, 8-speed and 9-speed AT mechanisms. This kind of topological graphs are generated by combing two 6-link 1-DOF non-fractionated topological graphs of PGTs.
2.1. Detection of Symmetric Vertices in the PGT Graph
The total number of 6-link 1-DOF non-fractionated PGTs is 81, and the complete database of these PGTs can be found in the literature [
17,
20]. However, not all these 6-link 1-DOF PGTs can be used for the design of AT mechanisms. The constraints to be met for a given 6-link 1-DOF PGT are as follows: (1) there is one and only one multiple joint with the degree of four; (2) the topological graph of PGT is a planar graph in order to avoid link interferences; (3) the planetary gears on the same carrier do not mesh with each other internally; (4) each planetary gear meshes with one sun gear and one ring gear; and (5) the topological graph does not contain any loop composed solely of dashed edges (geared pairs). Among the total of 81 6-link 1-DOF PGT graphs, there are three that meet the aforementioned conditions, as shown in
Figure 4.
Theoretically, any two solid vertices in two 6-link 1-DOF PGT graphs g1 and g2 can be combined to obtain 11-link 2-DOF fractionated PGT graphs. However, a 6-link 1-DOF PGT graph may contain symmetric solid vertices that have identical topological characteristics. If two symmetric solid vertices in graph g1 are combined with one solid vertex from graph g2, respectively, the resulting two 11-link 2-DOF fractionated PGT graphs are isomorphic, meaning they are duplicate graphs with exactly the same topological structures. To avoid generating isomorphic 11-link 2-DOF PGT graphs, it is necessary to first identify non-symmetric vertices in 6-link 1-DOF PGT graphs. This paper proposes a simple method for detecting symmetry vertices, and the detection process is as follows.
Step 1: The weights of vertices in a given PGT graph are determined, and the vertices with the same weight are categorized in the same group. The weight wi of vertex i is the sum of the weights of edges incident with vertex i.
The weights of vertices in the PGT graph can be directly obtained from its adjacency matrix. The weight of vertex
i is the sum of the elements in the
i-th row of the adjacency matrix. For example, the adjacency matrix AM
3 and vertex weights of
Figure 4c are shown in Equation (4). Vertices 1, 6 and 7 have the same weight, so they are placed in the same group. Similarly, vertices 2 and 4 and vertices 3 and 5 are placed in the same groups, respectively. Therefore, the vertex groups are acquired as Group
1 = {1, 6, 7}, Group
2 = {2, 4} and Group
3 = {3, 5}.
Step 2: The weight arrays of vertices in the PGT graph are determined, and vertices with the same weight array are placed in the same group. An array of numbers obtained by arranging the weights of vertices adjacent to vertex i in descending order is called the weight array of vertex i.
For example, vertex 1 in
Figure 4c is adjacent to vertices 2, 4, 6 and 7, whose weights are 6, 6, 4 and 4, respectively. By arranging these four weights in descending order, the weight array of vertex 1 is obtained as (6, 6, 4, 4). Similarly, the weight arrays of vertices 2–7 of
Figure 4c are (8, 8, 4), (6, 6, 4), (8, 8, 4), (6, 6, 4), (8, 4) and (8, 4), respectively. Vertices 2 and 4 have the same weight array, so they are placed in the same group. Similarly, vertices 3 and 5 and vertices 7 and 8 are placed in the same groups, respectively. The groups of vertices are acquired as Group
1 = {1}, Group
2 = {6, 7}, Group
3 = {2, 4} and Group
4 = {3, 5}. The vertices in different groups are clearly asymmetric. However, the vertices in the same group need to be further verified whether they are symmetric.
Step 3: If there is more than one vertex in the same group, the feature code of each vertex in the group is determined, and whether the vertices in the same group are symmetric is also determined by comparing whether their feature codes are the same. The process of obtaining the feature code of vertex i is as follows. New vertex groups are obtained by placing vertex i in the first group alone. The vertices in each group are permuted to obtain all possible ways of relabeling the PGT graph. For each relabeled PGT graph, its number string is obtained by concatenating the triangular elements of its adjacency matrix. The largest number string of all the relabeled PGT graphs is called the feature code of vertex i.
For example, let us consider whether vertices 6 and 7 in Group
2 = {6, 7} are symmetric. The process of obtaining the feature code of vertex 6 in
Figure 4c is as follows. Vertex 6 is placed separately in the first group, and the new vertex groups are acquired as Group
1 = {6}, Group
2 = {1}, Group
3 = {7}, Group
4 = {2, 4} and Group
5 = {3, 5}. According to the permutations of vertices in each group, there are four ways to relabel the vertices in
Figure 4c, namely, 1 ×1 × 1× 2 × 2 = 4. In the first way of relabeling, vertices 6, 1, 7, 2, 4, 3 and 5 in
Figure 4c are, respectively, relabeled as 1 to 7, as shown in
Figure 5a. In the second way of relabeling, vertices 6, 1, 7, 2, 4, 5 and 3 in
Figure 4c are, respectively, relabeled as 1 to 7, as shown in
Figure 5b. Similarly, the other two ways of relabeling are shown in
Figure 5c,d. The adjacency matrices of the four relabeled graphs in
Figure 5 are obtained as AM
4, AM
5, AM
6 and AM
7 in Equation (5), respectively. By concatenating the triangular elements of the adjacency matrix, the number strings of the four graphs in
Figure 5 are obtained and shown in
Table 1. Among the four number strings, NS
d has the maximum value. Therefore, NS
d = 100030-11100-0003-032-23-0 is determined as the feature code of vertex 6 in
Figure 4c. Similarly, the process of obtaining the feature code of vertex 7 in
Figure 4c is as follows. By placing vertex 7 separately in the first group, new vertex groups are obtained as Group
1 = {7}, Group
2 = {1}, Group
3 = {6}, Group
4 = {2, 4} and Group
5 = {3, 5}. There are also four ways to relabel
Figure 4c. The derived feature code of vertex 7 in
Figure 4c is the same as that of vertex 6, i.e., Code
6 = Code
7 = 100030-11100-0003-032-23-0. Therefore, vertices 6 and 7 in
Figure 4c are symmetric, and the reasoning process is as follows. The feature code Code
i of vertex
i has a strict one-to-one correspondence with that vertex. The feature code Code
6 obtained by relabeling vertex 6 as 1 is equal to the feature code Code
7 obtained by relabeling vertex 7 as 1. Hence, vertices 6 and 7 have exactly the same topological characteristics.
The symmetry detection results obtained by applying the above method to the topological graphs in
Figure 4 are as follows. In
Figure 4a, there are no symmetric vertices. In
Figure 4b, vertices 3 and 5 are symmetric, and vertices 6 and 7 are symmetric, which are denoted as S
1 = {3, 5} and S
2 = {6, 7}. In
Figure 4c, vertices 2 and 4 are symmetric, vertices 3 and 5 are symmetric, and vertices 6 and 7 are symmetric, which are denoted as S
1 = {2, 4}, S
2 = {3, 5} and S
3 = {6, 7}.
2.2. Generation of Fractionated PGT Graphs and Functional Diagrams
By combining asymmetric solid vertices in two identical or different 6-link 1-DOF PGT graphs shown in
Figure 4, all non-isomorphic 11-link 2-DOF fractionated PGT graphs can be obtained. For example, symmetric solid vertices in
Figure 4c are S
1 = {2, 4}, S
2 = {3, 5} and S
3 = {6, 7}; hence, the asymmetric solid vertices are {2, 3, 6}. By combining two PGT graphs shown in
Figure 4c (denoted as graphs
g1 and
g2), that is, combining vertices 2, 3 and 6 in graph
g1 with vertices 2, 3 and 6 in graph
g2, in turn, nine non-isomorphic 11-link 2-DOF fractionated PGT graphs can be obtained, as shown in
Figure 6. Among which, only the graphs shown in
Figure 6a,b,g,h are suitable for designing AT mechanisms. Two multiple joints in these graphs are equivalent to one multiple joint.
The process of sketching functional diagrams corresponding to a fractionated PGT graph is as follows. (a) A fractionated PGT graph can be separated into two independent sub-graphs. For each subgraph, carriers and planetary gears are determined based on the path of revolute edges. In a revolute edge path with the length of two, starting from the hollow vertex, the first solid vertex represents a carrier, and the second solid vertex represents a planetary gear on that carrier. A gear that meshes with the planetary gear is a ring gear or sun gear. (b) All possible functional diagrams of each subgraph of the PGT graph are sketched. (c) The link with the same label in the two separate functional diagrams is connected to obtain the functional diagrams of the fractionated PGT graph. For example, two subgraphs of the first PGT graph in
Figure 6 are shown in
Figure 7. In the first subgraph, the revolute edge paths with the length of two, starting from hollow vertex 1, are paths 1-2-5 and 1-4-3. For path 1-2-5, link 2 is identified as a carrier, link 5 is its corresponding planetary gear, and links 4 and 6 that mesh with link 5 are ring gears or sun gears. For path 1-4-3, link 4 is a carrier, link 3 is its corresponding planetary gear, and links 2 and 7 that mesh with link 3 are ring gears or sun gears. In the second subgraph, the revolute edge paths with the length of two, starting from hollow vertex 8, are paths 8-9-12 and 8-11-10. For path 8-9-12, link 9 is a carrier, link 12 is its corresponding planetary gear, links 2 and 11 that mesh with link 12 as ring gears or sun gears. For path 8-11-10, link 11 is a carrier, link 10 is its corresponding planetary gear, and links 9 and 13 that mesh with link 10 are ring gears or sun gears. By connecting the link with the same label (link 2) in the two separate sub-functional diagrams, all feasible functional diagrams corresponding to the first PGT graph in
Figure 6 are obtained and shown in
Figure 8.