Assembly unit division method based on interaction intention
By establishing a belief-wish-intention cognitive behavior model in the assembly unit division process, enhancing the cognitive ability of parts, the problem of inefficiency in assembly unit division is solved, and the intelligent assembly process and the improvement of manufacturing efficiency is achieved.
Patent Information
- Application Number
- CN202411042006.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-31
- Publication Date
- 2024-11-19
AI Technical Summary
During the assembly unit division process, the parts lack cognitive ability, resulting in low efficiency and low intelligence, and the designer's interactive intentions cannot be effectively transmitted, resulting in the separation of the product design and manufacturing process, which seriously restricts the improvement of manufacturing efficiency.
Using the assembly unit division method based on interactive intention, the belief-wish-intention cognitive behavior model of multi-level geometric entities is established to enhance the cognitive ability of parts, so that the parts can independently realize the assembly unit process and reduce human-computer interaction. The specific steps include associating B-IFP during the part modeling stage, obtaining the direct and indirect relationships between parts, building an assembly network, and using community algorithms to divide.
The independent assembly unit division of parts has been realized, the intelligence of the product design process has been improved, the barriers in various links have been reduced, the integration of digital assembly has been promoted, and manufacturing efficiency has been improved.
Smart Images

Figure CN118981884A_ABST
Abstract
Description
Technical Field
[0001] The invention belongs to the field of computer assistance, and in particular relates to an assembly unit division method based on interaction intention. Background Art
[0002] Assembly unit division is an important technology in digital assembly. This technology can subdivide complex assemblies into several sub-assemblies according to the structure and function of the assembly. By dividing complex assemblies into sub-assemblies with simpler structures, the complexity and difficulty of certain problems in the design process can be reduced, and efficiency can be improved. However, in the process, designers need to perform manual operations continuously, with too much manual intervention. In addition, the designer's interactive intentions in the part modeling stage (information expressing how parts fit together) cannot be passed to subsequent stages, resulting in a split between the upstream and downstream of product design and manufacturing, which seriously restricts the improvement of product manufacturing efficiency.
[0003] In view of the above problems, the concept of interactive feature pair (IFP) is proposed in the prior art (Framework for the integration of assembly modeling and simulation based on assembly feature pair. (Zhang J., Xu, Z., Li, Y., et al. The International Journal of Advanced Manufacturing Technology, 2015, 78 (5 / 8): 765-780.) and the literature Automatic assembly simulation of product in virtual environment based on interaction feature pair. (Zhang, J., Wang, P., Li, Y., et al. Journal of Intelligent Manufacturing, 2018, 29 (6): 1235-1256.) to describe and capture the interaction intention in the designer's mind and give the parts the ability to autonomously recognize their matching parts. Giving the parts cognitive ability is consistent with the research on cognitive behavior in cognitive science. However, how to model the cognitive behavior of parts in the process of assembly unit division has not been widely studied, which also makes the assembly unit division process unable to be fully realized. Summary of the invention
[0004] In view of the problems of lack of cognitive ability of parts, low efficiency and intelligence in the assembly unit division process, the present invention proposes an assembly unit division method based on interactive intention. The method establishes a belief-desire-intention cognitive behavior model of multi-level geometric entities based on interactive feature pairs to enhance the cognitive ability of parts, so that parts can autonomously realize the assembly unit process and reduce heavy human-computer interaction operations.
[0005] The present invention is achieved by at least one of the following technical solutions.
[0006] An assembly unit division method based on interaction intention includes the following steps:
[0007] Step 1: In the part modeling stage, the B-IFP is associated in the part model, and the assembly operation based on intelligent interaction is implemented according to the associated B-IFP to obtain the assembled assembly;
[0008] Step 2: In the assembly information modeling stage, the direct relationship between the assembly parts is obtained, including the direct adjacency relationship and direct constraint relationship of the parts;
[0009] Step 3: Get the indirect relationship of each part in the assembly
[0010] Step 4: In the assembly information modeling stage, obtain the array relationship between assembly parts
[0011] Step 5: Use parts as nodes and the relationships between parts as the edges of each node to construct an assembly network, assemble the assembly network based on the belief-desire-intention model, and divide the assembly network in combination with the community algorithm.
[0012] Furthermore, assembly properties include direct assembly relationships and indirect assembly relationships between parts in the assembly, wherein direct assembly relationships include direct adjacency assembly relationships and direct constraint assembly relationships, and indirect assembly relationships include indirect adjacency assembly relationships, indirect constraint assembly relationships, and array assembly relationships.
[0013] Furthermore, the assembly network is composed of nodes representing parts and edges representing adjacency relationships and constraint relationships between parts.
[0014] Furthermore, based on the belief-desire-intention model, the assembly network information is obtained, the assembly network belief is established, and through the community partitioning algorithm, the aggregation degree of the assembly network and the desire of the relative positions of all nodes are recognized, and the acquisition of the attributes is completed according to the desire.
[0015] Furthermore, the network segmentation process is based on the belief-desire-intention model to recognize the assembly network and combines it with the community algorithm to divide the assembly network.
[0016] Furthermore, the direct relationship is a relationship between instantiated parts that have interactive feature pair matching, including a direct adjacency relationship and a direct constraint relationship. The assembly steps of the direct assembly relationship specifically include:
[0017] S2.1. Load the assembly into the assembly environment, P{p1,p2,…,p n}, n is the total number of parts, p n is the nth part, and P is the set of assembly parts;
[0018] S2.2, create an n×n adjacency matrix M1 and a constraint matrix M2 with all values being 0;
[0019] S2.3, take i=1, i∈n;
[0020] S2.4, for the i-th part p i , get part p i The basic interaction feature pair set Where m1 is part p i The total number of basic interaction feature pairs, is the m1th interaction feature pair;
[0021] S2.4. Create the i-th part p i The empty set of adjacent parts
[0022] S2.5, take j = 1, j is the interactive feature pair B-IFP j In the B.S. i The serial number in
[0023] S2.6. Obtaining interactive feature pair set BS i The B-IFP of the jth interactive feature pair in j and its associated parts p k ;
[0024] S2.7. Obtaining B-IFP j The attribute of the record in , if the attribute has a constraint value v j is 0, then the value v in row i and column k of the adjacency matrix M1 is 1(i,k) and the value v of row k and column i 1(k,i) Change to 1, change the value v of row i and column k of constraint matrix M2 2(i,k) and the value v of row k and column i 2(k,i) Modify to v 2(i,k) +1;
[0025] S2.8, the part p k Join AP i middle;
[0026] S2.9, j=j+1, determine whether j is less than m1, if so, go to step S2.6, otherwise go to step S2.8;
[0027] S2.10, i=i+1, determine whether i is less than or equal to n, if so, go to step S2.4, otherwise end, and complete the acquisition of the direct assembly relationship of all parts.
[0028] Furthermore, the indirect assembly relationship is a relationship between parts that do not have instantiation, including an indirect adjacency assembly relationship, an indirect constraint assembly relationship, and an array assembly relationship.
[0029] Furthermore, the steps of obtaining the indirect adjacency assembly relationship and the indirect constraint assembly relationship specifically include:
[0030] S3.1. Determine the set of parts P{p1,p2,…,p n}, n is the total number of parts;
[0031] S3.2, take i=1, i∈n;
[0032] S3.3. Create the i-th part p i The empty interacted set IPS, the to-be-interacted set IPQ and the uninteracted set PIPS;
[0033] S3.4, p i Add to the set to be interacted IPQ, and remove p from the set of parts P i All the other parts are added to the uninteracted set PIPS;
[0034] S3.5, Is IPQ empty? If so, exit directly, otherwise go to step 3.6;
[0035] S3.6, take j = 1, j is the interactive feature pair B-IFP j In the B.S. i The serial number in
[0036] S3.7, the jth part p j Remove IPQ and add p j Join IPS;
[0037] S3.8. Get p j The adjacency matrix set AP j , where the adjacency matrix set AP j The total number of parts in is q1;
[0038] S3.9, take k1 = 1, k1 is the part In AP j The serial number in
[0039] S3.10, k1th part IPQ added, PIPS removed
[0040] S3.11. Get p i and The set of matching B-IFP pairs B-IFPs i {B-IFPs1, B-IFPs2, …, B-IFPs m}, where m is the total number of B-IFP pairs in the set, B-IFPs m For B-IFPs i The mth B-IFP pair in ;
[0041] S3.12, take l = 1, l is B-IFPs l In the B-IFP pair set B-IFPs i The serial number in B-IFPs l For B-IFPs i The lth B-IFP pair in ;
[0042] S3.13. Obtaining B-IFPs l The constraint relationship Cn l , if p i and If it is a plane fit, go to step S3.14, otherwise go to step S3.15;
[0043] S3.14. Obtaining B-IFPs l If the constraint value is 0, the value of row i and column k1 of the adjacency matrix M1 is and the value of row k1 and column i Change to 1, change the value of row i and column k1 of constraint matrix M2 and the value of row k1 and column i Modified to Go to step S3.16;
[0044] S3.15. Obtaining B-IFPs l The associated regions S1 and S2, if S1 and S2 overlap, modify the matrix by changing the value of row i and column k1 of the adjacency matrix M1. and the value of row k1 and column i Change to 1, change the value of row i and column k1 of constraint matrix M2 and the value of row k1 and column i Modified to
[0045] S3.16, l = l + 1, determine whether l is less than m, m is p i and If the total number of matching B-IFP pairs is equal to , go to step S3.13, otherwise go to step S3.17;
[0046] S3.17, k=k+1, determine whether k is less than q1, if so, go to S3.10, otherwise go to step S3.18;
[0047] S3.18, j=j+1, determine whether j is less than n, if so, go to S3.7, otherwise go to step S3.18;
[0048] S3.19, i=i+1, determine whether i is less than n, if so, go to S3.3, otherwise end.
[0049] Furthermore, the assembly steps of the array assembly relationship include:
[0050] S4.1. Load the assembly into the assembly environment, P{p1,p2,…,p n}, n is the total number of parts;
[0051] S4.2. Take i=1, i∈n;
[0052] S4.3, for part p i , get part p i The basic interaction feature pair set Where m2 is part p i The total number of basic interaction feature pairs;
[0053] S4.4, take j = 1, j is the interactive feature pair B-IFP j In the B.S. i The serial number in
[0054] S4.5. Construct part p i Information modeling process beliefs, extracting B-IFP j The recorded information includes array information, matching part set information, and construction of part p i Basic attribute information;
[0055] S4.6, whether the parts have an array relationship, if so, record the part p i and array relationships with matching parts;
[0056] S4.6, j=j+1, determine whether j is less than m2, if so, go to step S4.5, otherwise go to step 4.7;
[0057] S4.7, i=i+1, determine whether i is less than m2, if so, go to step S4.3, otherwise end.
[0058] Furthermore, the assembly unit division comprises the following steps:
[0059] S5.1, input adjacency matrix M1 and constraint relationship matrix M2;
[0060] S5.2, calculate the current modularity Q1 according to the assembly connection network;
[0061] S5.3. Get all the part nodes of the assembly network, the node set V{v1, v2, ...v n}, n1 is the total number of part nodes, v n1 is the n1th part node;
[0062] S5.4, let i=1;
[0063] S5.5. Calculate the i-th part node v i The shortest path to all other nodes;
[0064] S5.6, i=i+1, determine whether i is less than n, if so, go to step S5.5, otherwise go to step S5.7;
[0065] S5.7. Calculate the boundary value of each edge in the network based on the obtained adjacency assembly relationship, constraint assembly relationship and shortest path, and record the edge set E{e1, e2, ...e n2}, n2 is the total number of edges in the network, e n2 is the n2th part node;
[0066] S5.8, let j1 = 1, j1 is the edge e in the network j1 The sequence number of the edge set in the network;
[0067] S5.9. Remove edge e from the network j ;
[0068] S5.10, j1=j1+1, whether i is less than n, if so, go to step 5.9, otherwise go to step S5.10;
[0069] S5.11, calculate the current modularity Q2, whether Q2 is greater than Q1, if so, go to step S5.3, otherwise go to step S5.12;
[0070] S5.12. Restore adds the edges in edge set E back to the assembly network and exit.
[0071] Compared with the prior art, the present invention can achieve at least the following beneficial effects:
[0072] The assembly unit partitioning method based on interactive intent proposed in the present invention first loads the associated B-IFP assembly into the assembly environment; then completes the direct adjacency relationship recognition and direct constraint relationship recognition at the part level and assembly level, and outputs the direct relationship matrix and direct constraint matrix; on this basis, constructs the initial part connection network, conducts indirect relationship recognition, finally determines the indirect relationship of all parts, completes the direct and indirect relationship recognition of parts and assemblies, and constructs a complete part connection network; finally, based on the constructed part connection network, selects a suitable assembly unit partitioning algorithm for assembly unit partitioning. This method enables the assembly modeling stage to fully utilize the design intent captured in the part modeling stage, improves the intelligence of the product design process, and at the same time fully utilizes the information of each link, reduces the barriers between each link, and promotes the integration process of digital assembly. BRIEF DESCRIPTION OF THE DRAWINGS
[0073] Figure 1 It is an overall flow chart of the assembly unit partitioning method based on interactive intent of the present invention;
[0074] Figure 2 It is the direct relationship cognitive flow chart of the present invention;
[0075] Figure 3 It is the indirect relationship recognition flow chart of the present invention;
[0076] Figure 4 It is the array relationship recognition flow chart of the present invention;
[0077] Figure 5 is an assembly unit division flow chart of the present invention;
[0078] Figure 6 It is a schematic diagram of the assembly of the reducer of the first embodiment;
[0079] Among them: 1-reducer case cover, 2-high-speed shaft end cover, 3-high-speed shaft cover, 4-6209 bearing, 5-6207 bearing, 6-low-speed shaft end cover, 7-reducer case, 8-m12 bolt, 9-high-speed shaft cover, 10-m8 bolt 11-low-speed shaft end cover, 12-low-speed shaft, 13-gear, 14-m12 nut. DETAILED DESCRIPTION
[0080] The following description combines specific illustrations to explain the technical solution so as to fully understand the present invention. However, the present invention can be implemented in many other ways different from those described herein, and similar generalized embodiments made by ordinary technicians in this field without creative work are all within the scope of protection of the present invention.
[0081] See also Figure 1The present invention provides an assembly unit division method based on interactive intention, including constructing an assembly unit division framework based on a combination of interactive feature pairs and a belief-desire-intention cognitive behavior model, wherein the assembly unit division framework includes constructing a cognitive behavior model based on belief-desire-intention; obtaining the attributes between the parts in the assembly, i.e., information modeling, wherein the assembly attributes include direct assembly relationships and indirect assembly relationships between the parts in the assembly, wherein the direct assembly relationships include direct adjacency assembly relationships and direct constraint assembly relationships, and the indirect assembly relationships include indirect adjacency assembly relationships, indirect constraint assembly relationships, and array assembly relationships; the above-mentioned attribute cognition is based on the belief-desire-intention model, constructs beliefs for the assembly, generates desires for all possible attributes of the cognitive assembly, and completes the cognition of the above-mentioned attributes according to the desires (i.e., the acquisition of information by the intelligent agent in the belief-desire-intention model); network node aggregation degree cognition; and finally, the established network is segmented by a community algorithm, and the corresponding assembly units are obtained after segmentation.
[0082] The assembly unit division method based on interaction intention provided in this embodiment specifically includes the following steps:
[0083] Step 1: In the part modeling stage, associate B-IFP in the part model to explicitly represent the interaction intention captured and transmitted by the interaction feature pair. Load the part into the assembly environment, extract the information in the interaction feature pair, and form beliefs including beliefs about itself and the environment (the agent's understanding of itself and the environment in the belief-desire-intention model), and implement assembly operations based on intelligent interaction according to the associated B-IFP to obtain the completed assembly;
[0084] Step 2: In the assembly information modeling stage, assemble the direct relationships between the parts of the assembly, including the assembly of direct adjacency relationships and direct constraint relationships between the parts.
[0085] In one embodiment of the present invention, see Figure 2 , the specific steps of assembling the direct relationship of parts are as follows:
[0086] Step 2.1, load the assembly into the assembly environment, P{p1,p2,…,p n}, p n is the nth part, and P is the set of assembly parts;
[0087] Step 2.2, create an n×n adjacency matrix M1 and a constraint matrix M2 with all values set to 0;
[0088] Step 2.3, take i=1, i is part p i The serial number in P;
[0089] Step 2.4: For part p i, get part p i The basic interaction characteristic pair set BS i {B-IFP1, Where m1 is part p i The total number of basic interaction feature pairs, is the m1th interaction feature pair;
[0090] Step 2.4, create p i The empty set of adjacent parts
[0091] Step 2.5: Take j = 1, where j is the interactive feature pair B-IFP j In the B.S. i The serial number in
[0092] Step 2.6: Obtain the interactive feature pair set BS i The B-IFP of the jth interactive feature pair in j and its associated parts p k ;
[0093] Step 2.7. Obtain B-IFP j The attribute of the record in , if the attribute has a constraint value v j is 0, then the value v in row i and column k of the adjacency matrix M1 is 1(i,k) and the value v of row k and column i 1(k,i) Change to 1, change the value v of row i and column k of constraint matrix M2 2(i,k) and the value v of row k and column i 2(k,i) Modify to v 2(i,k) +1;
[0094] S2.8, the part p k Join AP i In, AP i For part p j The set of adjacent parts of ;
[0095] S2.9, j=j+1, is j less than m1? If yes, go to step S2.6, otherwise go to step S2.8;
[0096] S2.10, i=i+1, is i less than or equal to n? If yes, go to step S2.4, otherwise, end and complete the assembly of all directly related parts.
[0097] Step 3: After completing the assembly of direct assembly relationships, establish an assembly connection network with parts as network nodes and adjacency relationships as edges of network nodes, and then perform indirect assembly of each part in the assembly.
[0098] In one embodiment of the present invention, see Figure 3, this step specifically includes:
[0099] S3.1. Determine the set of parts P{p1,p2,…,p n}, n is the total number of parts;
[0100] S3.2, take i=1, i is part p i The serial number in P;
[0101] S3.3. Create p i The empty interacted set IPS, the to-be-interacted set IPQ and the uninteracted set PIPS;
[0102] S3.4, p i Add to the set to be interacted IPQ, and remove p from the set of parts P i All the other parts are added to the uninteracted set PIPS;
[0103] S3.5, Is IPQ empty? If so, exit directly, otherwise go to step 3.6;
[0104] S3.6, take j = 1, j is the interactive feature pair B-IFP j In the B.S. i The serial number in
[0105] S3.7, the jth part p j Remove IPQ and add p j Join IPS;
[0106] S3.8. Get p j The adjacency matrix set AP j , where the adjacency matrix set AP j The total number of parts in is q1;
[0107] S3.9, take k = 1, k1 is the part In AP j The serial number in
[0108] S3.10, k1th part IPQ added, PIPS removed
[0109] S3.11. Get p i and The set of matching B-IFP pairs B-IFPs i {B-IFPs1, B-IFPs2, …, B-IFPs m}, where m is the total number of B-IFP pairs in the set, B-IFPs m For B-IFPs i The mth B-IFP pair in ;
[0110] S3.12, take l = 1, l is B-IFPs l In the B-IFP pair set B-IFPs i The serial number in B-IFPs l For B-IFPs i The lth B-IFP pair in ;
[0111] S3.13. Obtaining B-IFPs l The constraint relationship Cn l , if p i and If it is a plane fit, go to step S3.14, otherwise go to step S3.15;
[0112] S3.14. Obtaining B-IFPs l If the constraint value is 0, the value of row i and column k1 of the adjacency matrix M1 is and the value of row k1 and column i Change to 1, change the value of row i and column k1 of constraint matrix M2 and the value of row k1 and column i Modified to Go to step S3.16;
[0113] S3.15. Obtaining B-IFPs l The associated regions S1 and S2, if S1 and S2 overlap, modify the matrix by changing the value of row i and column k1 of the adjacency matrix M1. and the value of row k1 and column i Change to 1, change the value of row i and column k1 of constraint matrix M2 and the value of row k1 and column i Modified to
[0114] S3.16, l = l + 1, is l less than m, and m is p i and If the total number of matching B-IFP pairs is greater than , go to step S3.13, otherwise go to step S3.17;
[0115] S3.17, k=k+1, is k less than q1? If so, go to S3.10; otherwise, go to step S3.18;
[0116] S3.18, j=j+1, is j less than n? If so, go to S3.7, otherwise go to step S3.18;
[0117] S3.19, i=i+1, is i less than n? If so, go to S3.3, otherwise end.
[0118] Step 4: In the assembly information modeling stage, the array assembly relationship between the parts of the assembly is assembled.
[0119] In one embodiment of the present invention, see Figure 4 , this step specifically includes:
[0120] S4.1. Load the assembly into the assembly environment, P{p1,p2,…,p n}, n is the total number of parts;
[0121] S4.2, take i=1, i is part p i The serial number in P;
[0122] S4.3, for part p i , get part p i The basic interaction feature pair set Where m2 is part p i The total number of basic interaction feature pairs;
[0123] S4.4, take j = 1, j is the interactive feature pair B-IFP j In the B.S. i The serial number in
[0124] S4.5. Construct part p i Information Modeling Process Beliefs. Extraction of B-IFP j The recorded information includes array information, matching part set information, and construction of part p i Basic attribute information;
[0125] S4.6, whether the parts have an array relationship, if so, record the part p i and array relationships with matching parts;
[0126] S4.6, j=j+1, whether j is less than m2, if so, go to step S4.5, otherwise go to step 4.7;
[0127] S4.7, i=i+1, is i less than m2? If so, go to step S4.3, otherwise end.
[0128] Step 5: Use parts as nodes and the relationships between parts as the edges of each node to construct an assembly network. Based on the belief-desire-intention model, the assembly network is recognized and divided in combination with the community algorithm.
[0129] In one embodiment of the present invention, please refer to Figure 5 , this step specifically includes:
[0130] S5.1, input adjacency matrix M1 and constraint relationship matrix M2;
[0131] S5.2, calculate the current modularity Q1 according to the assembly connection network;
[0132] S5.3. Get all the part nodes of the assembly network, the node set V{v1, v2, ...v n}, n1 is the total number of part nodes, is the n1th part node;
[0133] S5.4, let i=1;
[0134] S5.5. Calculate the i-th part node v i The shortest path to all other nodes;
[0135] S5.6, i=i+1, is i less than n? If so, go to step S5.5, otherwise go to step S5.7;
[0136] S5.7. Calculate the boundary value of each edge in the network based on the obtained adjacency assembly relationship, constraint assembly relationship and shortest path, and record the edge set with the maximum boundary value. n2 is the total number of edges in the network, is the n2th part node;
[0137] S5.8, let j1 = 1, j1 is the edge e in the network j1 The sequence number of the edge set in the network;
[0138] S5.9. Remove edge e from the network j ;
[0139] S5.10, j1=j1+1, whether i is less than n, if so, go to step 5.9, otherwise go to step S5.10;
[0140] S5.11, calculate the current modularity Q2, whether Q2 is greater than Q1, if so, go to step S5.3, otherwise go to step S5.12;
[0141] S5.12. Restore adds the edges in edge set E back to the assembly network and exit.
[0142] To facilitate understanding, a detailed description is given below using a specific example.
[0143] In one embodiment of the present invention, Figure 6 The gear reducer model is implemented as follows:
[0144] 1. In the part modeling stage, associate B-IFP in the part model to explicitly express the interaction intent captured and transmitted by the interactive feature pair, and load the part into the assembly environment;
[0145] 2. After completing the B-IFP association, first obtain the direct relationship of assembly information modeling. The specific steps are as follows:
[0146] 1) Load the assembly into the assembly environment, P{p1,p2,…,p 49};
[0147] 2) Create a 49×49 adjacency matrix M1 and a constraint matrix M2 with all values set to 0;
[0148] 3) Get the interactive notification set BS of all parts i , for part p1 = box, obtain the basic interaction feature pair set BS1 {B-IFP1, B-IFP2, …, B-IFP 82};
[0149] 4) Create an empty adjacency part set for p1
[0150] 5) Obtain all B-IFPs in the interactive feature pair set BS1 of p1 j The matching object p k , for B-IFP1, its associated part is p3 = box cover;
[0151] 6) Get the attribute of the record in B-IFP1. If the constraint value v1 in the attribute is 0, modify the value v at (1, 3) of the matrix M1. 13 To 1, modify the value v at (1, 3) of M2 13 =v 13 +1;
[0152] 7) Place the part p k Add to AP1;
[0153] 8) Repeat steps 5) and 6) until all B-IFPs are traversed;
[0154] 9) Repeat steps 3) to 8) until the direct relationship of all parts is known;
[0155] 3. After completing the assembly of direct relationships, use the parts as network nodes and the adjacency relationships as the edges of the network nodes to establish an assembly connection network, and then you can perform indirect relationship assembly. The specific steps are as follows:
[0156] 1) Input the adjacency matrix M1 and constraint matrix M2 that record direct relationships;
[0157] 2) Search for all possible interaction objects of all parts. For part p1 = box, p1’s empty interaction set IPS1, to-be-interacted set IPQ1, and uninteracted set PIPS1;
[0158] 3) Add p1 to IPQ1, and pull all the parts in the part set P except p1 into PIPS1;
[0159] 4) Is IPQ1 empty? If so, exit directly, otherwise go to step 5);
[0160] 5) Remove the parts in IPQ1, and IPQ1 = {box};
[0161] 6) Move p1=box out of IPQ1 and add p1 to IPS;
[0162] 7) Obtain the adjacency matrix set AP1 of p1, where AP1 = {reducer case cover 1, six m12 nuts 14, low-speed shaft 12, 6207 bearing 5, 6209 bearing 4};
[0163] 8) Take out the parts in AP1 one by one, add them to IPQ, and remove the parts from PIPS. First, p2 = reducer case cover 1, remove it from IPQ1, and add p2 to PIPS1;
[0164] 9) Get the matching B-IFP pair set B-IFPs1 {B-IFP1, B-IFP2, …, B-IFP7} of p1 and p2, and traverse B-IFP1 to get B-IFP l Record constraint relationship Cn l , Cn l If it is a plane fit, go to step 10), otherwise go to step 11);
[0165] 10) Obtain B-IFP l If the constraint value is 0, modify the value v at (1, 2) and (2, 1) of the matrix M1 1(1,2) =v 1(2,1) To 1, modify the value v at (1, 2) and (2, 1) of M2 2(1,2) =v 2(2,1) =v 2(1,2) +1, go to step 11);
[0166] 11) Obtain B-IFPs l If S1 and S2 overlap, modify the values v at (1, 2) and (2, 1) of the matrix M1. 1(1,2) =v 1(2,1) To 1, modify the value v at (1, 2) and (2, 1) of M2 2(1,2) =v 2(2,1) =v 2(1,2) +1;
[0167] 12) Repeat steps 9) to 11) until the constraint relationships of all B-IFP pairs are analyzed;
[0168] 13) Repeat steps 2) to 12) until all indirect constraints between parts are assembled;
[0169] 4. Recognize the relationship between parts arrays, assemble and record the array relationships between parts. The specific steps are as follows:
[0170] 1) Load the assembly into the assembly environment, P{p1,p2,…,p 49};
[0171] 2) Obtain the interactive feature pair set BS of all parts i For part p1 = box, its basic interaction feature pair set BS1 {B-IFP1, B-IFP2, …, B-IFP 82};
[0172] 3) Obtain the interactive feature pair set BS i The properties of all basic interaction feature pairs in , for BS1, obtain the information recorded therein, including array information, matching part set and other information, and construct the belief of part p1;
[0173] 4) Determine whether p1 is an array part based on the array information, and if so, record the array relationship between part p1 and the parts in the matching part set;
[0174] 5) Repeat steps 2) to 4) to complete the acquisition of the part array relationship;
[0175] Finally, the array parts set shown in Table 1 is obtained.
[0176] Table 1 Array Parts List
[0177] Carrier parts Pattern parts Pattern parts Pattern parts Pattern parts Pattern parts Pattern parts Box 7 M12 bolt 8 M12 bolt 8 M12 bolt 8 M12 bolt 8 M12 bolt 8 M12 bolt 8 Box cover 1 m12 nut 14 m12 nut 14 m12 nut 14 m12 nut 14 m12 nut 14 m12 nut 14 Low speed shaft end cover 6 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 Low speed shaft cover 11 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 High speed shaft end cover 2 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 High-speed shaft cover (3, 9) M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10 M8 bolt 10
[0178] 5. After completing the direct relationship recognition and indirect relationship assembly, the specific steps are as follows based on the information of the assembly process and the established assembly connection network:
[0179] 1) Input assembly network, adjacency matrix M1 and constraint matrix M2;
[0180] 2) According to the assembly network, calculate the current modularity Q, where modularity Q = 0;
[0181] 3) Calculate the shortest path between all parts. For part p1 = box, obtain all part nodes that have a connection relationship with p1, calculate the path length from p1 to these nodes, and repeat step 3) until the shortest path between all parts is obtained;
[0182] 4) Calculate the boundary values between all nodes based on the obtained shortest path length, combined with the obtained adjacency relationship and constraint relationship;
[0183] 5) Obtain the edge set with the maximum boundary value. Here, the edge set obtained is {(1,3)}, that is, the edge between part node 1 and part node 3;
[0184] 6) Remove all edges in the edge set with the maximum boundary value, here remove (1,3);
[0185] 7) Calculate the current modularity. If the current modularity is less than the previous modularity, exit and restore the network structure before removing the edge set. Otherwise, execute step 8);
[0186] 8) Repeat steps 2) to 7) until all assembly units are completely divided, and finally obtain the division steps and division results shown in Table 2.
[0187] Table 2 Assembly unit division process
[0188]
[0189]
[0190] The method provided in this embodiment enables the present invention to enhance the assembly recognition ability of parts by establishing an assembly unit division method based on interactive feature pairs, reduce the heavy human-computer interaction operations in the assembly process, and improve the intelligence level of the assembly unit division process.
[0191] Obviously, the above embodiments of the present invention are merely examples for clearly illustrating the present invention, and are not intended to limit the embodiments of the present invention. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the embodiments here. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the protection scope of the claims of the present invention.
Claims
1. An assembly unit division method based on interaction intention, characterized in that: The following steps are involved: Step 1: In the part modeling stage, the B-IFP is associated in the part model, and the assembly operation based on intelligent interaction is implemented according to the associated B-IFP to obtain the assembled assembly; Step 2: In the assembly information modeling stage, the direct relationship between the assembly parts is obtained, including the direct adjacency relationship and direct constraint relationship of the parts; Step 3: Get the indirect relationship of each part in the assembly Step 4: In the assembly information modeling stage, obtain the array relationship between assembly parts Step 5: Use parts as nodes and the relationships between parts as the edges of each node to construct an assembly network, assemble the assembly network based on the belief-desire-intention model, and divide the assembly network in combination with the community algorithm.
2. The assembly unit division method based on interaction intention according to claim 1, characterized in that: Assembly properties include direct assembly relationships and indirect assembly relationships between parts in the assembly. Direct assembly relationships include direct adjacency assembly relationships and direct constraint assembly relationships, and indirect assembly relationships include indirect adjacency assembly relationships, indirect constraint assembly relationships, and array assembly relationships.
3. The assembly unit division method based on interaction intention according to claim 1, characterized in that: The assembly network is composed of nodes representing parts and edges representing adjacency relationships and constraint relationships of the parts.
4. The assembly unit division method based on interaction intention according to claim 2, characterized in that: Based on the belief-desire-intention model, the assembly network information is obtained, the assembly network belief is established, and through the community partitioning algorithm, the aggregation degree of the assembly network and the desire of the relative positions of all nodes are recognized, and the acquisition of the attributes is completed according to the desire.
5. The assembly unit division method based on interaction intention according to claim 1, characterized in that: The network segmentation process is based on the belief-desire-intention model to recognize the assembly network and combines the community algorithm to divide the assembly network.
6. The assembly unit division method based on interaction intention according to claim 2, characterized in that: The direct relationship is a relationship between instantiated parts with matching interactive feature pairs, including direct adjacency relationships and direct constraint relationships. The assembly steps of the direct assembly relationship specifically include: S2.
1. Load the assembly into the assembly environment, P{p1,p2,…,p n }, n is the total number of parts, p n is the nth part, and P is the set of assembly parts; S2.2, create an n×n adjacency matrix M1 and a constraint matrix M2 with all values being 0; S2.3, take i=1, i∈n; S2.4, for the i-th part p i , get part p i The basic interaction feature pair set Where m1 is part p i The total number of basic interaction characteristic pairs, is the m1th interaction feature pair; S2.
4. Create the i-th part p i The empty set of adjacent parts S2.5, take j = 1, j is the interactive feature pair B-IFP j In the B.S. i The serial number in S2.
6. Obtaining interactive feature pair set BS i The B-IFP of the jth interactive feature pair in j and its associated parts p k ; S2.
7. Obtaining B-IFP j The attribute of the record in , if the attribute has a constraint value v j is 0, then the value v in row i and column k of the adjacency matrix M1 is 1(i,k) and the value v in row k and column i 1(k,i) Change to 1, change the value v of row i and column k of constraint matrix M2 2(i,k) and the value v in row k and column i 2(k,i) Modify to v 2(i,k) +1; S2.8, the part p k Join AP i middle; S2.9, j=j+1, determine whether j is less than m1, if so, go to step S2.6, otherwise go to step S2.8; S2.10, i=i+1, determine whether i is less than or equal to n, if so, go to step S2.4, otherwise end, and complete the acquisition of the direct assembly relationship of all parts.
7. The assembly unit division method based on interaction intention according to claim 2, characterized in that: The indirect assembly relationship is a relationship between parts that do not have instantiations, including an indirect adjacency assembly relationship, an indirect constraint assembly relationship, and an array assembly relationship.
8. The assembly unit division method based on interaction intention according to claim 7, characterized in that: The steps for obtaining indirect adjacency assembly relations and indirect constraint assembly relations specifically include: S3.
1. Determine the set of parts P{p1,p2,…,p n }, n is the total number of parts; S3.2, take i=1, i∈n; S3.
3. Create the i-th part p i The empty interacted set IPS, the to-be-interacted set IPQ and the uninteracted set PIPS; S3.4, p i Add to the set to be interacted IPQ, and remove p from the set of parts P i All the other parts are added to the uninteracted set PIPS; S3.5, Is IPQ empty? If so, exit directly, otherwise go to step 3.6; S3.6, take j = 1, j is the interactive feature pair B-IFP j In the B.S. i The serial number in S3.7, the jth part p j Remove IPQ and add p j Join IPS; S3.
8. Get p j The adjacency matrix set AP j , where the adjacency matrix set AP j The total number of parts in is q1; S3.9, take k1 = 1, k1 is the part p k1 In AP j The serial number in S3.10, k1th part p k1 Add IPQ, remove PIPS k1 ; S3.
11. Get p i and p k1 The set of matching B-IFP pairs B-IFPs i {B-IFPs1, B-IFPs2, …, B-IFPs m }, where m is the total number of B-IFP pairs in the set, B-IFPs m For B-IFPs i The mth B-IFP pair in ; S3.12, take l = 1, l is B-IFPs l In the B-IFP pair set B-IFPs i The serial number in B-IFPs l For B-IFPs i The lth B-IFP pair in ; S3.
13. Obtaining B-IFPs l The constraint relationship Cn l , if p i and p k1 If it is a plane fit, go to step S3.14, otherwise go to step S3.15; S3.
14. Obtaining B-IFPs l If the constraint value is 0, the value v in row i and column k1 of the adjacency matrix M1 is 1(i,k1) and the value v in row i of k1 1(k1,i) Change to 1, change the value v in row i and column k1 of constraint matrix M2 2(i,k1) and the value v in row i of k1 2(k1,i) Modify to v 2(i,k1) +1, go to step S3.16; S3.
15. Obtaining B-IFPs l The associated regions S1 and S2, if S1 and S2 overlap, modify the matrix by changing the value v in the i row and k1 column of the adjacency matrix M1 1(i,k1) and the value v in row i of k1 1(k1,i) Change to 1, change the value v in row i and column k1 of constraint matrix M2 2(i,k1) and the value v in row i of k1 2(k1,i) Modify to v 2(i,k1) +1; S3.16, l = l + 1, determine whether l is less than m, m is p i and p k1 If the total number of matching B-IFP pairs is equal to , go to step S3.13, otherwise go to step S3.17; S3.17, k=k+1, determine whether k is less than q1, if so, go to S3.10, otherwise go to step S3.18; S3.18, j=j+1, determine whether j is less than n, if so, go to S3.7, otherwise go to step S3.18; S3.19, i=i+1, determine whether i is less than n, if so, go to S3.3, otherwise end.
9. The assembly unit division method based on interaction intention according to claim 2, characterized in that: The assembly steps of the array assembly relationship include: S4.
1. Load the assembly into the assembly environment, P{p1,p2,…,p n }, n is the total number of parts; S4.
2. Take i=1, i∈n; S4.3, for part p i , get part p i The basic interaction characteristic pair set BS i {B-IFP1,B-IFP2,…,B-IFP m1 }, where m2 is part p i The total number of basic interaction feature pairs; S4.4, take j = 1, j is the interactive feature pair B-IFP j In the B.S. i The serial number in S4.
5. Construct part p i Information modeling process beliefs, extracting B-IFP j The recorded information includes array information, matching part set information, and construction of part p i Basic attribute information; S4.6, whether the parts have an array relationship, if so, record the part p i and array relationships with matching parts; S4.6, j=j+1, determine whether j is less than m2, if so, go to step S4.5, otherwise go to step 4.7; S4.7, i=i+1, determine whether i is less than m2, if so, go to step S4.3, otherwise end.
10. The assembly unit division method based on interaction intention according to claim 4, characterized in that: The assembly unit division comprises the following steps: S5.1, input adjacency matrix M1 and constraint relationship matrix M2; S5.2, calculate the current modularity Q1 according to the assembly connection network; S5.
3. Get all the part nodes of the assembly network, the node set V{v1, v2, ...v n }, n1 is the total number of part nodes, v n1 is the n1th part node; S5.4, let i=1; S5.
5. Calculate the i-th part node v i The shortest path to all other nodes; S5.6, i=i+1, determine whether i is less than n, if so, go to step S5.5, otherwise go to step S5.7; S5.
7. Calculate the boundary value of each edge in the network based on the obtained adjacency assembly relationship, constraint assembly relationship and shortest path, and record the edge set E{e1, e2, ...e n2 }, n2 is the total number of edges in the network, e n2 is the n2th part node; S5.8, let j1 = 1, j1 is the edge e in the network j1 The sequence number of the edge set in the network; S5.
9. Remove edge e from the network j ; S5.10, j1=j1+1, whether i is less than n, if so, go to step 5.9, otherwise go to step S5.10; S5.11, calculate the current modularity Q2, whether Q2 is greater than Q1, if so, go to step S5.3, otherwise go to step S5.12; S5.
12. Restore adds the edges in edge set E back to the assembly network and exit.
