CN110570105B - Automatic planning method for route in BOP (blow-off valve) scheme of assembly process - Google Patents

Automatic planning method for route in BOP (blow-off valve) scheme of assembly process Download PDF

Info

Publication number
CN110570105B
CN110570105B CN201910787202.8A CN201910787202A CN110570105B CN 110570105 B CN110570105 B CN 110570105B CN 201910787202 A CN201910787202 A CN 201910787202A CN 110570105 B CN110570105 B CN 110570105B
Authority
CN
China
Prior art keywords
assembly
parts
bop
component
planned
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CN201910787202.8A
Other languages
Chinese (zh)
Other versions
CN110570105A (en
Inventor
吴波
卢佩航
丁刚强
卢杰
徐劲力
秦启斌
徐海军
韦明凤
韦乐侠
粟鸿光
廖熙淘
王钦
胡云锋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Wuhan University of Technology WUT
Guangxi Automobile Group Co Ltd
Original Assignee
Wuhan University of Technology WUT
Guangxi Automobile Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Wuhan University of Technology WUT, Guangxi Automobile Group Co Ltd filed Critical Wuhan University of Technology WUT
Priority to CN201910787202.8A priority Critical patent/CN110570105B/en
Publication of CN110570105A publication Critical patent/CN110570105A/en
Application granted granted Critical
Publication of CN110570105B publication Critical patent/CN110570105B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316—Sequencing of tasks or work
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/04—Manufacturing
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Health & Medical Sciences (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Manufacturing & Machinery (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • General Factory Administration (AREA)

Abstract

The invention relates to an automatic planning method of a route in a BOP (bill of process, process bill) scheme, which is used for establishing a BOP case source library; extracting information of each part in an assembly body to be planned, and establishing a connection relation matrix among the parts according to whether a connection relation exists among the parts; when the similarity matching value of the assembly body to be planned and the local case is judged to be higher than a set threshold value, combining parts in the local case with the similarity matching value of the assembly body to be planned being higher than the set threshold value into a zero component; acquiring an attribute matrix and a connection relation matrix of the part and/or the component, and determining a basic component of the assembly body to be planned according to the attribute matrix of the part and/or the component; and determining the hierarchical assembly sequence of the parts and/or the components according to the distance between each part and/or component and the base part, and planning a route in the BOP scheme of the assembly to be planned. The route planning time of the same or similar BOP scheme is reduced, and the saving, the retrieval and the reuse of the BOP scheme are realized.

Description

Automatic planning method for route in BOP (blow-off valve) scheme of assembly process
Technical Field
The invention relates to the field of assembly process planning, in particular to an automatic planning method for a route in a BOP (blow-off valve) scheme of an assembly process.
Background
In modern manufacturing industry, 20-70% of the whole manufacturing workload of electromechanical products is spent on assembly and debugging thereof, the assembly time accounts for 20-50% of the whole manufacturing time of the products, and the cost thereof also accounts for more than 40% of the whole manufacturing cost. Therefore, the reasonable and effective assembly process planning can effectively improve the production quality of products and shorten the manufacturing period, and has important significance for enterprises to improve the production benefit and the time competitiveness.
The assembly process planning mainly comprises assembly sequence planning and assembly task planning, wherein the assembly sequence planning refers to the situation that under the condition that the assembly sequence of the parts is feasible, various factors including assembly operability, stability and the like are comprehensively considered, and the production cost and the time cost of the assembly sequence are guaranteed to be the lowest. And the assembly task planning is to appoint an assembly procedure, reasonably allocate assembly resources and generate an assembly process BOP scheme according to the characteristics of the product parts.
The existing assembly process planning is usually planned by an assembly process designer according to own process experience and assembly process specifications, so that the problems of poor process design consistency, long design period, difficult inheritance of process design experience, low efficiency and the like are caused.
Disclosure of Invention
The invention provides an automatic planning method for a route in an assembly process BOP scheme, aiming at the technical problems in the prior art.
The technical scheme for solving the technical problems is as follows: a method for automatic routing in a BOP project of an assembly process, the method comprising:
step 1, establishing a BOP case source library, wherein the BOP case source library comprises local cases;
step 2, extracting information of each part in the assembly body to be planned, and establishing a connection relation matrix among the parts according to whether a connection relation exists among the parts;
step 3, when the similarity matching value of the assembly body to be planned and the local case is judged to be higher than a set threshold value, combining the parts in the local case with the similarity matching value of the assembly body to be planned being higher than the set threshold value into a zero assembly;
step 4, acquiring an attribute matrix and a connection relation matrix of the part and/or the component, and determining a basic component of the assembly body to be planned according to the attribute matrix of the part and/or the component;
and 5, determining a hierarchical assembly sequence of the parts and/or the components according to the distances between the parts and/or the components and the base part, and planning a route in the BOP scheme of the assembly to be planned.
A non-transitory computer readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the steps of the method for automatic planning of a route in a BOP solution of an assembly process as described above.
The invention has the beneficial effects that: the method comprises the steps of establishing a BOP case source library, carrying out similarity matching on an assembly to be planned and a case source of the BOP case source library, planning a route of the assembly to be planned by using the case source when the similarity value is higher than a set threshold value, reducing route planning time of the same or similar BOP scheme, realizing storage, retrieval and reuse of the BOP scheme, realizing automatic planning of the route in the assembly process BOP scheme, effectively improving production quality of products, shortening manufacturing period and having important significance on improving production benefits and market competitiveness of enterprises.
On the basis of the technical scheme, the invention can be further improved as follows.
Further, the information of each part in the assembly body to be planned, which is extracted in the step 2, includes the name of each part;
establishing a connection relation matrix between the parts according to whether the connection relation exists between the parts comprises the following steps:
and when the weight value of the assembly relationship between any two parts is not 0, defining the connection relationship value between the two parts to be 1, and when the weight value of the assembly relationship between any two parts is 0, defining the connection relationship value between the two parts to be 0, and establishing a connection relationship matrix between the parts according to the connection relationship value between the parts.
The BOP case source library in step 1 further comprises an integral case formed by the combination of the local cases;
and 3, the process of matching the similarity comprises the step of judging the similarity matching value according to the names of the parts and the connection relation matrix among the parts and the whole case and the local case respectively.
The step 3 comprises the following steps:
step 301, judging whether the similarity matching value of the assembly body to be planned and any one of the overall cases is higher than a set threshold value, if so, calling a route in the BOP scheme of the overall case, and then manually modifying and adjusting according to the names of the parts and the connection relation matrix among the parts to obtain the route in the BOP scheme of the assembly body to be planned, and then ending the route planning process, otherwise, executing step 302;
step 302, judging whether the similarity matching value of the assembly body to be planned and any one of the local cases is higher than the set threshold value, if so, calling a route in the BOP scheme of the local case, and executing the step 303, otherwise, executing the step 4;
step 303, merging the parts in the local cases with the similarity matching value with the assembly to be planned being higher than the set threshold value into the component.
In the step 3, after the parts in the local cases with the similarity matching value higher than the set threshold value with the assembly body to be planned are combined into the component, the parts are updated to the component to determine a connection relation matrix of the parts and/or the component;
the attribute matrix of the part and/or the component comprises the name of the part or the component, the mass M of the part or the component, the volume V of the part or the component and the assembly connection number S of the part or the component;
the assembling and connecting number S of the parts or the components is as follows:
Figure BDA0002178450390000041
Sidenotes the number of assembly connections of the parts or components i, n denotes the total number of parts and components of the assembly to be planned, RijRepresenting the connection relationship between the part or component i and the part or component j.
The selecting process of the base part in the step 4 comprises the following steps:
normalizing the attribute matrix to enable the values of the mass M, the volume V and the assembly connection number S of the part or the component to be between 0 and 1;
selecting the base part as follows:
BPi＝{ω1Mi+ω2Vi+ω3Si,1≤i≤n}max。
BPithe part or component i with the maximum weight is the basic part of the assembly to be planned, Mi、ViAnd SiRespectively representing the mass, volume and number of assembly connections, omega, of the part or component i1、ω2And ω3Weights, ω, representing the mass, volume and number of assembly connections, respectively, of the part or component i1+ω2+ω3＝1。
The step 5 comprises the following steps:
step 501, determining a hierarchical assembly sequence of the parts and/or the components by using a FLOYD algorithm and an assembly rule base rule;
step 502, determining parts or components assembled in each process according to the hierarchical assembly sequence of the parts and/or the components and the assembly rule base;
step 503, extracting the part or the part name assembled in each process, and adding the process resource in the BOP case source to the process through a process resource retrieval algorithm;
step 504, inserting the route in the BOP scheme of the local case called in the step 302, and automatically planning the route in the BOP scheme of the assembly process to be planned.
In the step 501, the FLOYD algorithm calculates the shortest distance from each node to the base part by taking each component as a node and the base part as the first layer of the assembly level.
After planning the route in the BOP scheme of the assembly to be planned in step 5, the method further includes:
and 6, adding the BOP scheme of the assembly to be planned obtained in the step 5 into the established BOP case source library.
The method has the advantages that the established BOP case source library comprises the local cases and the whole cases, similarity matching is respectively carried out on the local cases and the whole cases according to the names of the parts and the connection relation matrix among the parts, the utilization rate of the BOP scheme in the BOP case source library is improved, and the route planning time of the wholly or locally identical or similar BOP scheme is further reduced.
According to the BOP scheme of the assembly to be planned, actual results are checked, the BOP scheme can be added into the BOP case source library according to needs, and the completeness and richness of the BOP case source library are further improved in the specific use process.
Drawings
FIG. 1 is a flow chart of a method for automatically planning a route in a BOP scheme of an assembly process according to the present invention;
fig. 2 is a flowchart of an embodiment of a method for automatically planning a route in a BOP scheme of an assembly process according to the present invention.
Detailed Description
The principles and features of this invention are described below in conjunction with the following drawings, which are set forth by way of illustration only and are not intended to limit the scope of the invention.
Fig. 1 is a flowchart of a method for automatically planning a route in a BOP scheme of an assembly process according to the present invention, and as shown in fig. 1, the method includes:
step 1, establishing a BOP case source library, wherein the BOP case source library comprises local cases.
And 2, extracting information of each part in the assembly body to be planned, and establishing a connection relation matrix among the parts according to whether a connection relation exists among the parts.
And 3, when the similarity matching value of the assembly body to be planned and the local case is judged to be higher than the set threshold value, combining the parts in the local case with the similarity matching value of the assembly body to be planned and the local case with the similarity matching value higher than the set threshold value into a zero assembly.
And 4, acquiring an attribute matrix and a connection relation matrix of the part and/or the component, and determining a basic component of the assembly body to be planned according to the attribute matrix of the part and/or the component.
And 5, determining the hierarchical assembly sequence of the parts and/or the components according to the distance between each part and/or component and the base part, and planning a route in the BOP scheme of the assembly to be planned.
The automatic planning method for the route in the BOP scheme of the assembly process provided by the invention comprises the steps of establishing the BOP case source library, matching the similarity of an assembly to be planned and a case source of the BOP case source library, planning the route of the assembly to be planned by using the case source when the similarity is higher than a set threshold value, reducing the route planning time of the same or similar BOP scheme, realizing the storage, retrieval and reuse of the BOP scheme, realizing the automatic planning of the route in the BOP scheme of the assembly process, effectively improving the production quality of a product, shortening the manufacturing period and having important significance for improving the production benefit and market competitiveness of enterprises.
Example 1
Embodiment 1 provided by the present invention is an embodiment of a method for automatically planning a route in a BOP scheme of an assembly process provided by the present invention, and as shown in fig. 2, is a flowchart of an embodiment of a method for automatically planning a route in a BOP scheme of an assembly process provided by the present invention, and as can be seen from fig. 2, the embodiment of the method includes:
step 1, establishing a BOP case source library, wherein the BOP case source library comprises local cases.
Further, the BOP case source library also includes global cases formed by the combination of local cases.
And 2, extracting information of each part in the assembly body to be planned, and establishing a connection relation matrix among the parts according to whether a connection relation exists among the parts.
The automatic planning method for the route in the BOP scheme of the assembly process can be carried out in UG (Unigraphics, interactive CAD/CAM system) secondary development, the model of the assembly body to be planned is opened in UGNX11.0 in the step 2, and the information of each part in the assembly body to be planned, including the name of each part, is extracted through the UG secondary development. Establishing a connection relation matrix among the parts according to whether the connection relation exists among the parts comprises the following steps:
and when the weight of the assembly relationship between any two parts is not 0, defining the connection relationship value between the two parts to be 1, and when the weight of the assembly relationship between any two parts is 0, defining the connection relationship value between the two parts to be 0, and establishing a connection relationship matrix between the parts according to the connection relationship value between the parts.
Determining whether the parts have a connection relation according to the weight of the assembly relation among the parts, determining that the parts have the connection relation when the weight of the assembly relation is not 0, and determining that the parts have no connection relation when the weight of the assembly relation is 0.
And 3, when the similarity matching value of the assembly body to be planned and the local case is judged to be higher than the set threshold value, combining the parts in the local case with the similarity matching value of the assembly body to be planned and the local case with the similarity matching value higher than the set threshold value into a zero assembly.
The BOP case source library in step 1 further includes an overall case formed by combining the local cases, so the process of matching the similarity in step 3 includes a process of matching the overall case and a process of matching the local case.
Specifically, the process of matching the similarity can be performed according to the names of the parts and the connection relation matrix between the parts, and since the names of the parts may have individual differences and the like, a threshold of a matching value is set, and when the similarity matching value is higher than the threshold, the BOP scheme of the whole case or the local case can be used.
Step 3 may include:
step 301, judging whether the similarity matching value of the assembly to be planned and any one of the overall cases is higher than a set threshold, if so, calling a route in the BOP scheme of the overall case, then manually modifying and adjusting the route according to the names of the parts and the connection relation matrix among the parts to obtain the route in the BOP scheme of the assembly to be planned, and then ending the route planning process in the BOP scheme of the assembly to be planned, otherwise, executing step 302.
Step 302, judging whether the similarity matching value of the assembly body to be planned and any local case is higher than a set threshold value, if so, calling a route in the BOP scheme of the local case, and executing step 303, otherwise, executing step 4.
And step 303, combining the parts in the local cases with the similarity matching value of the assembly to be planned higher than the set threshold value into a zero component.
And 4, acquiring an attribute matrix and a connection relation matrix of the part and/or the component, and determining a basic component of the assembly body to be planned according to the attribute matrix of the part and/or the component.
And 3, combining the parts in the local case with the similarity matching value of the assembly body to be planned higher than the set threshold value into a component, and updating the parts into a component determination part and/or a connection relation matrix of the component.
The attribute matrix of the part and/or the component comprises the name of the part or the component, the mass M of the part or the component, the volume V of the part or the component and the assembly connection number S of the part or the component. The assembling connection number of the parts or the components can be obtained through the connection relation:
Figure BDA0002178450390000081
Sidenotes the number of assembly connections of the parts or components i, n denotes the total number of parts and components of the assembly to be planned, RijRepresenting the connection relationship between the part or component i and the part or component j.
Further, the base member has the following characteristics: (1) the base part is usually the largest mass and volume component of an assembly or assembly unit. (2) The base element should be connected as many as possible to other components of the assembly or assembly unit, i.e. the greater the number of assembly connections, the more chance it will become the base element. (3) There is one and only one base member in the fitting body. Based on the above features, in an embodiment of the method for automatically planning a route in a BOP scheme of an assembly process, the selecting process of the base part in step 4 includes: the attribute matrix is normalized, so that the numerical values of the mass, the volume and the assembly connection number of all parts or components are between 0 and 1, the normalization processing can avoid the error of the result caused by the unit magnitude difference of the three parts or components, and then the basic component is selected by the following formula:
BPi＝{ω1Mi+ω2Vi+ω3Si,1≤i≤n}max。
wherein, BPiThe part or component i with the maximum weight is the basic part of the assembly to be planned, Mi、ViAnd SiRespectively representing the mass, volume and number of assembly connections, omega, of the part or component i1、ω2And ω3Weight of mass, volume and number of assembly connections of the part or component i, respectively, and ω1+ω2+ω3＝1。
And 5, determining the hierarchical assembly sequence of the parts and/or the components according to the distance between each part and/or component and the base part, and planning a route in the BOP scheme of the assembly to be planned.
Specifically, step 5 includes:
step 501, determining a hierarchical assembly order of parts and/or components by using a FLOYD (Floyed) algorithm and an assembly rule base rule.
Specifically, the FLOYD algorithm calculates the shortest distance from each node to the base part with each component as a node. The basic part is the first layer of the assembly level, the components with the node distance from the basic part node being 1 are the second layer, and so on.
The rules of the assembly rule base include: (1) taking a basic part of the assembly body as a reference, and assembling the other components and parts with the basic part according to rules; (2) assembling in sequence according to a hierarchical order; (3) within the same level, symmetrical parts are assembled simultaneously; (4) in the same level, the assembly direction is from the center to two sides; (5) in the same level, the components are assembled from heavy to light, from bottom to top and from inside to outside according to the mass of the components; (6) parts that are too heavy or too light are preferably assembled.
And 502, determining the parts or parts assembled on each process according to the hierarchical assembly sequence of the parts and/or the parts and components and the assembly rule base.
Specifically, parts or components with the same mass and volume are divided into the same process.
And 503, extracting the names of the parts or parts assembled in each procedure, and adding the process resources in the BOP case source into the procedure through a process resource retrieval algorithm.
And step 504, inserting the route in the BOP scheme of the local case called in the step 302, and automatically planning the route in the BOP scheme of the assembly process to be planned.
Preferably, in an embodiment of the method for automatically planning a route in a BOP scheme of an assembly process provided by the present invention, after planning a route in a BOP scheme of a to-be-planned assembly in step 5, the method may further include:
and 6, adding the BOP scheme of the assembly to be planned obtained in the step 5 into the established BOP case source library.
And (3) if the BOP scheme of the assembly to be planned, which is planned in the steps 1-5, is actually checked to meet the actual result, the BOP scheme can be added into the BOP case source library according to the requirement.
Example 2
The embodiment 2 provided by the invention is a specific application embodiment of the automatic planning method for the route in the BOP scheme of the assembly process, the automatic planning of the route in the BOP scheme of the assembly process is carried out by taking an independent suspension model behind a certain vehicle as an example, and the specific process comprises the following steps:
and extracting the names of all parts in the assembly body to be planned and a connection relation matrix among the parts through UG secondary development.
Carrying out overall case similarity matching and local case similarity matching on the assembly information to be planned and the cases in the BOP case source; wherein, the threshold value of the similarity of the whole case and the local case is 95 percent. For the present case, the BOP case source does not match the overall case with a threshold greater than 95%, and two local cases appear, which include local case one: lower arm and connecting rod and local case two: brake angle unit assembly.
And re-extracting the updated part and/or component attribute matrix and connection matrix by UG secondary development.
Defining the base member of the assembly. And (3) carrying out value taking on the weight by using an analytic hierarchy process: omega1＝0.2、ω2＝0.2、ω30.6; and the assembly base part of the rear independent suspension is an auxiliary frame assembly.
The assembly order of the component levels is determined using the FLOYD algorithm and the assembly rule base rules.
And formulating a simplified model assembly process BOP route according to the component level assembly sequence and the process resource retrieval algorithm, summarizing the simplified model assembly process BOP route with the called local case process BOP route, and automatically planning the total assembly process BOP route.
The assembly level result and the process BOP route of the rear independent suspension can be automatically derived through a 'part level result' and a 'process BOP document' in an assembly BOP automatic planning system terminal, and the automatic planning of the assembly process BOP route is realized.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims (9)

1. A method for automatic routing in a BOP project of an assembly process, the method comprising:
step 1, establishing a BOP case source library, wherein the BOP case source library comprises local cases;
step 2, extracting information of each part in the assembly body to be planned, and establishing a connection relation matrix among the parts according to whether a connection relation exists among the parts;
step 3, when the similarity matching value of the assembly body to be planned and the local case is judged to be higher than a set threshold value, combining the parts in the local case with the similarity matching value of the assembly body to be planned being higher than the set threshold value into a zero assembly;
step 4, acquiring an attribute matrix and a connection relation matrix of the part and/or the component, and determining a basic component of the assembly body to be planned according to the attribute matrix of the part and/or the component;
step 5, determining a hierarchical assembly sequence of the parts and/or the components according to the distance between each part and/or the component and the base part, and planning a route in the BOP scheme of the assembly to be planned;
the attribute matrix of the part and/or the component comprises the name of the part or the component, the mass M of the part or the component, the volume V of the part or the component and the assembly connection number S of the part or the component;
the assembling and connecting number S of the parts or the components is as follows:
Figure FDA0002597134470000011
Sidenotes the number of assembly connections of the parts or components i, n denotes the total number of parts and components of the assembly to be planned, RijRepresenting the connection relation between the part or component i and the part or component j;
the selecting process of the base part in the step 4 comprises the following steps:
normalizing the attribute matrix to enable the values of the mass M, the volume V and the assembly connection number S of the part or the component to be between 0 and 1;
selecting the base part as follows:
BPi＝{ω1Mi+ω2Vi+ω3Si,1≤i≤n}max；
BPithe part or component i with the maximum weight is the basic part of the assembly to be planned, Mi、ViAnd SiRespectively representing the mass, volume and number of assembly connections, omega, of the part or component i1、ω2And ω3Weights, ω, representing the mass, volume and number of assembly connections, respectively, of the part or component i1+ω2+ω3＝1。
2. The method according to claim 1, wherein the information extracted in step 2 for each part in the assembly to be planned comprises a name of each part;
establishing a connection relation matrix between the parts according to whether the connection relation exists between the parts comprises the following steps:
when the weight value of the assembly relationship between any two parts is not 0, defining the connection relationship value between the two parts to be 1, and when the weight value of the assembly relationship between any two parts is 0, defining the connection relationship value between the two parts to be 0, and establishing a connection relationship matrix between the parts according to the connection relationship value between the parts.
3. The method of claim 1, wherein the BOP case source library in step 1 further comprises global cases formed by the combination of local cases;
and 3, the process of matching the similarity comprises the step of judging the similarity matching value according to the names of the parts and the connection relation matrix among the parts and the whole case and the local case respectively.
4. The method of claim 3, wherein step 3 comprises:
step 301, judging whether the similarity matching value of the assembly body to be planned and any one of the overall cases is higher than a set threshold value, if so, calling a route in the BOP scheme of the overall case, and then carrying out manual modification and adjustment according to the names of the parts and the connection relation matrix among the parts to obtain the route in the BOP scheme of the assembly body to be planned, and then ending the route planning process, otherwise, executing step 302;
step 302, judging whether the similarity matching value of the assembly body to be planned and any one of the local cases is higher than the set threshold value, if so, calling a route in the BOP scheme of the local case, and executing step 303, otherwise, executing step 4;
step 303, merging the parts in the local cases with the similarity matching value with the assembly to be planned being higher than the set threshold value into the component.
5. The method as claimed in claim 1, wherein, in the step 3, after the parts in the local cases with the similarity matching value higher than the set threshold value with the assembly to be planned are merged into the component, the parts are updated into the component to determine the connection relationship matrix of the parts and/or the component.
6. The method of claim 4, wherein the step 5 comprises:
step 501, determining a hierarchical assembly sequence of the parts and/or the components by using a FLOYD algorithm and an assembly rule base rule;
step 502, determining parts or components assembled in each process according to the hierarchical assembly sequence of the parts and/or the components and the assembly rule base;
step 503, extracting the names of the parts or components assembled in each process, and adding the process resources in the BOP case source into the process through a process resource retrieval algorithm;
step 504, inserting the route in the BOP scheme of the local case called in the step 302, and automatically planning the route in the BOP scheme of the assembly process to be planned.
7. The method according to claim 6, wherein the FLOYD algorithm in step 501 is to calculate the shortest distance from each node to the base part with each part as a node and the base part as the first layer of the assembly level.
8. The method of claim 1, wherein planning the path in the BOP scheme for the assembly to be planned in step 5 further comprises:
and 6, adding the BOP scheme of the assembly to be planned obtained in the step 5 into the established BOP case source library.
9. A non-transitory computer readable storage medium having stored thereon a computer program, wherein the computer program when executed by a processor implements the steps of the method for automatic planning of a route in a BOP project of an assembly process according to any of claims 1 to 8.
CN201910787202.8A 2019-08-25 2019-08-25 Automatic planning method for route in BOP (blow-off valve) scheme of assembly process Expired - Fee Related CN110570105B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910787202.8A CN110570105B (en) 2019-08-25 2019-08-25 Automatic planning method for route in BOP (blow-off valve) scheme of assembly process

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910787202.8A CN110570105B (en) 2019-08-25 2019-08-25 Automatic planning method for route in BOP (blow-off valve) scheme of assembly process

Publications (2)

Publication Number Publication Date
CN110570105A CN110570105A (en) 2019-12-13
CN110570105B true CN110570105B (en) 2020-11-10

Family

ID=68776077

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910787202.8A Expired - Fee Related CN110570105B (en) 2019-08-25 2019-08-25 Automatic planning method for route in BOP (blow-off valve) scheme of assembly process

Country Status (1)

Country Link
CN (1) CN110570105B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101645102A (en) * 2009-09-11 2010-02-10 北京交通大学 Computer subsidiary product assembling sequence generation method
US20140324904A1 (en) * 2011-11-29 2014-10-30 Hitachi, Ltd. Similar design structure search device and similar design structure search method
CN104504471A (en) * 2014-12-22 2015-04-08 华北电力大学 Assembly sequence planning method and assembly sequence planning system
CN108021946A (en) * 2017-12-07 2018-05-11 重庆理工大学 A kind of agricultural machines parts similarity assessment method based on system coding
CN108491628A (en) * 2018-03-22 2018-09-04 西北工业大学 The three-dimensional CAD assembling model of product design requirement drive clusters and search method
CN108628965A (en) * 2018-04-20 2018-10-09 西北工业大学 Assemblies retrieval and indexing method based on space connecting framework descriptor

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101645102A (en) * 2009-09-11 2010-02-10 北京交通大学 Computer subsidiary product assembling sequence generation method
US20140324904A1 (en) * 2011-11-29 2014-10-30 Hitachi, Ltd. Similar design structure search device and similar design structure search method
CN104504471A (en) * 2014-12-22 2015-04-08 华北电力大学 Assembly sequence planning method and assembly sequence planning system
CN108021946A (en) * 2017-12-07 2018-05-11 重庆理工大学 A kind of agricultural machines parts similarity assessment method based on system coding
CN108491628A (en) * 2018-03-22 2018-09-04 西北工业大学 The three-dimensional CAD assembling model of product design requirement drive clusters and search method
CN108628965A (en) * 2018-04-20 2018-10-09 西北工业大学 Assemblies retrieval and indexing method based on space connecting framework descriptor

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
基于实例推理的装配顺序规划研究;栾浩 等;《航空制造技术》;20131231(第20期);第59-62页 *
基于模块序列及工艺相似性的装配流程规划;韩海荣，刘伟;《制造业自动化》;20150731;第37卷(第7期);第64-66页 *

Also Published As

Publication number Publication date
CN110570105A (en) 2019-12-13

Similar Documents

Publication Publication Date Title
US7496573B2 (en) Systems and methods for modeling processing procedures
CN109583746B (en) Method and device for setting routing rule of flow and readable storage medium
CN113536081B (en) Data center data management method and system based on artificial intelligence
EP2983117A1 (en) Event processing method in stream processing system and stream processing system
WO2022198754A1 (en) Method for optimizing large-scale cloud service process
CN111275358A (en) Dispatch matching method, device, equipment and storage medium
CN110826911B (en) Big data-based decision method, equipment and medium
CN111159420B (en) Entity optimization method based on attribute calculation and knowledge template
CN108255852B (en) SQL execution method and device
CN110570105B (en) Automatic planning method for route in BOP (blow-off valve) scheme of assembly process
CN113032258B (en) Electronic map testing method and device, electronic equipment and storage medium
CN110955712A (en) Development API processing method and device based on multiple data sources
CN111950579A (en) Training method and training device for classification model
CN111897864B (en) Expert database data extraction method and system based on Internet AI outbound
JP6758252B2 (en) Histogram generation method, histogram generator and histogram generation program
CN115544033B (en) Method, device, equipment and medium for updating check repeat vector library and checking repeat data
TWI643077B (en) Method and adjustment device for adaptively adjusting database structure
CN115934753A (en) Job scheduling configuration information generation method and device
CN110008242A (en) One kind being based on Spark streaming program generator and program data processing method
US9021418B2 (en) Systems and/or methods for creation of metamodels
CN111881146B (en) Method, computing device and medium for charging a fee
CN111984714B (en) Information generation method based on intelligent online communication and big data and cloud service platform
US9483332B2 (en) Event processing method in stream processing system and stream processing system
CN114185869A (en) Data model auditing method based on data standard
CN114253550A (en) Optimization strategy generation method and operator construction method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20201110