Stamping simulation data updating method and system based on directed weight graph and medium

Abstract

The invention belongs to the technical field of stamping machining, and discloses a stamping simulation data updating method and system based on a directed weight graph and a medium, and the method comprises the steps: obtaining design parameters of a simulation part, and generating stamping simulation data based on the design parameters of the simulation part; performing object extraction on the stamping simulation data to obtain a plurality of objects and a reference relationship between any two objects; constructing a directed weight graph based on the plurality of objects and the reference relationship between any two objects; obtaining a modification record of the design parameters of the simulation part, and extracting a modification object from the modification record of the design parameters of the simulation part; based on a preset search algorithm, querying nodes having a dependency relationship with the modification object from the directed weight graph to obtain associated nodes; updating the associated nodes to obtain an updated directed weight graph; and updating the stamping simulation data based on the updated directed weight map. The method has relatively high updating efficiency, stability and reliability.

Description

Technical Field

[0001] The present invention belongs to the technical field of stamping processing, and in particular relates to a stamping simulation data updating method, system and medium based on a directed weighted graph. Background Art

[0002] Stamping simulation software is a software tool that uses computer numerical calculation technology to simulate the stamping process. Through stamping simulation software, engineers can predict the stress and deformation of metal materials during the stamping process, and then optimize the design of the stamping process to ensure product quality. When using stamping simulation software, you will first import the parts designed in the CAD software, then design the stamping process for processing the parts, and then calculate the simulation results through the solver. By comparing the simulation results with the parts designed in CAD, you can check the rationality of the processing technology design. If there are problems in the simulation results, such as wrinkles and cracks on the processed parts, you need to go back and continue to modify the processing technology until the simulation results meet the requirements, so the most common operation in stamping simulation software is to modify the processing technology.

[0003] Modifying stamping process mainly includes modifying multi-process processing flow, mold design of each process, process route design, etc. After modifying a process design, it is often necessary to update all other related designs to ensure the consistency of the processing process. For example, after modifying the mold of the previous process, the shape of the part processed by the previous process will change. Then the mold of the subsequent process must be updated according to the new part shape, otherwise it will cause the final processed part to be inconsistent with the part designed in CAD.

[0004] The data update process of parts is extremely complicated, because different data objects modified by users will result in different associated data objects being updated. After updating the first batch of affected data, the second batch of data affected by the first batch of data must be updated, and so on until all affected data are updated.

[0005] Existing stamping simulation software does not handle data updates well. Developers often rely on their experience to determine the data that may be affected in various situations in the program and then update them. This method relies heavily on the software developers' understanding and judgment of the update logic. Judgment based on experience is very unreliable, and the implemented code logic is also very complex and not conducive to expansion and maintenance. As the functions of stamping simulation software become more and more abundant, the number of possible data modifications will increase, the complexity of the corresponding data update logic will grow rapidly, and the probability of software bugs will increase significantly.

[0006] Therefore, the existing updating methods have at least the defects of low stability, low updating efficiency and poor reliability. Summary of the invention

[0007] The purpose of the present invention is to provide a stamping simulation data updating method, system and medium based on a directed weighted graph, so as to solve the problems of low stability, low updating efficiency and poor reliability in the existing updating methods.

[0008] In order to achieve the above object, the present invention adopts the following technical solutions: In a first aspect, the present invention provides a method for updating stamping simulation data based on a directed weight graph, the method comprising: Acquire design parameters of the simulation part, and generate stamping simulation data based on the design parameters of the simulation part; Extract objects from stamping simulation data to obtain reference relationships between several objects and any two objects; Based on a number of objects and a reference relationship between any two objects, a directed weighted graph is constructed, wherein the directed weighted graph includes a number of nodes, and each graph node corresponds to an object; Acquire a modification record of the design parameters of the simulation part, and extract a modification object from the modification record of the design parameters of the simulation part; Based on a preset search algorithm, a node having a dependency relationship with the modified object is searched from the directed weight graph to obtain at least one associated node; updating at least one associated node to obtain an updated directed weight graph; The stamping simulation data is updated based on the updated directed weight graph.

[0009] Preferably, a directed weight graph is constructed based on a number of objects and a reference relationship between any two objects, including: Several nodes are constructed with several objects, and the edges of several nodes and the directions and weights of the edges are constructed with the reference relationship between any two objects; the existence of an edge between any two nodes is used to represent the dependency relationship between the two nodes; constructing an edge constraint based on the direction of the edge, wherein the edge constraint is used to limit the formation of a circular dependency between at least two nodes having a dependency relationship; A directed weighted graph is constructed based on a number of nodes, edges of the nodes, directions and weights of the edges, and edge constraints.

[0010] Preferably, constructing edge constraints based on the direction of the edge includes: Extract at least two nodes with a dependency relationship to form a node chain; Based on the direction of the edge of the node chain, the first node and the last node of the node chain are identified, and based on the first node and the last node, the main chain of the node chain is determined; Based on the main chain of the node chain, determine whether there is a branch chain in the node chain; if there is a branch chain, establish edge constraints.

[0011] Preferably, the edge constraint is: determine whether the direction of the edge between the first two nodes of the branch is consistent with the direction of the edge of the main chain. If so, retain the edge between the first two nodes of the branch; if not, remove the edge between the first two nodes of the branch; wherein one of the first two nodes of the branch is located on the main chain.

[0012] Preferably, the object is a process geometry model or a process part coordinate.

[0013] Preferably, the preset search algorithm is a breadth-first traversal algorithm of the graph.

[0014] Preferably, obtaining design parameters of the simulated part and generating stamping simulation data based on the design parameters of the simulated part include: A model diagram of the simulation part is produced based on a preset drawing tool, wherein the preset drawing tool exports model parameters of the model diagram of the simulation part to obtain design parameters of the simulation part; The design parameters of the simulated parts are input into a preset simulation tool to generate stamping simulation data, which is a tree structure.

[0015] In a second aspect, the present invention provides a stamping simulation data updating system based on a directed weight graph, the system is used to implement the above-mentioned stamping simulation data updating method based on a directed weight graph, and the system comprises: A data acquisition module, used to acquire design parameters of the simulated parts and generate stamping simulation data based on the design parameters of the simulated parts; An object extraction module is used to extract objects from stamping simulation data and obtain reference relationships between several objects and any two objects; A graph construction module, used to construct a directed weighted graph based on a number of objects and a reference relationship between any two objects, wherein the directed weighted graph includes a number of nodes, and each graph point corresponds to an object; A parameter modification module is used to obtain a modification record of the design parameters of the simulation part and extract a modification object from the modification record of the design parameters of the simulation part; A node query module, used to query nodes having a dependency relationship with the modified object from a directed weighted graph based on a preset search algorithm, and obtain at least one associated node; A graph updating module, used to update at least one associated node to obtain an updated directed weighted graph; The data updating module is used to update the stamping simulation data based on the updated directed weight graph.

[0016] In a third aspect, the present invention provides an electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned stamping simulation data updating method based on a directed weight graph when executing the computer program.

[0017] In a fourth aspect, the present invention provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the above-mentioned stamping simulation data updating method based on a directed weight graph.

[0018] Beneficial effects: 1. The present invention uses the objects in the stamping simulation data and the reference relationship between the objects to construct a directed weighted graph; when the data in the stamping simulation software changes, the directed weighted graph can be used to quickly and effectively query all the affected objects, and the developer's experience is no longer required to judge the objects that may be affected in various situations, which has a higher update efficiency; 2. The present invention uses a search algorithm to find the affected associated nodes, and then iteratively updates the affected data objects, which can effectively avoid erroneous updates, repeated updates, and ignored updates, and has high stability and reliability. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The accompanying drawings are used to provide a further understanding of the embodiments of the present invention and constitute a part of the specification. Together with the following specific implementations, they are used to explain the embodiments of the present invention, but do not constitute a limitation on the embodiments of the present invention. In the accompanying drawings: Figure 1 It is a flowchart of a stamping simulation data updating method based on a directed weight graph provided by an embodiment of the present invention; Figure 2 It is a schematic diagram of the data structure of stamping simulation data provided by one embodiment of the present invention; Figure 3 is a schematic diagram of a node chain provided by an embodiment of the present invention; Figure 4 It is a schematic diagram of a function of adding and editing drawbeads in a stamping simulation drawing process provided by an embodiment of the present invention; Figure 5 It is a schematic diagram of the data structure and reference relationship of the engineering project file in the stamping simulation software provided by one embodiment of the present invention; Figure 6 A directed weighted graph constructed according to the data structure and reference relationship of the engineering project file provided by an embodiment of the present invention; Figure 7 It is a design drawing of process part coordinates provided by one embodiment of the present invention; Figure 8is a schematic diagram of the coordinate system and application relationship of four processes provided in one embodiment of the present invention; Fig. 9 A directed weighted graph created according to the coordinate systems of four processes and the reference relationship of the coordinate systems provided by an embodiment of the present invention; Fig.10 It is a block diagram of a stamping simulation data updating system based on a directed weight graph provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0020] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the present invention will be briefly introduced below in combination with the drawings and the description of the embodiments or the prior art. Obviously, the following description of the structure of the drawings is only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. It should be noted that the description of these embodiments is used to help understand the present invention, but does not constitute a limitation of the present invention.

[0021] Embodiment 1 Figure 1 FIG. 1 is a flowchart of a method for updating stamping simulation data based on a directed weight graph provided by an embodiment of the present invention. Figure 1 As shown, this embodiment provides a stamping simulation data updating method based on a directed weight graph, the method comprising: Step S10: acquiring design parameters of the simulation part, and generating stamping simulation data based on the design parameters of the simulation part; In this embodiment, obtaining the design parameters of the simulated part and generating stamping simulation data based on the design parameters of the simulated part include: Step S101: creating a model diagram of a simulation part based on a preset drawing tool, wherein the preset drawing tool exports model parameters of the model diagram of the simulation part to obtain design parameters of the simulation part; Step S102: inputting the design parameters of the simulated part into a preset simulation tool to generate stamping simulation data, wherein the stamping simulation data is a tree structure.

[0022] Among them, the drawing tool of this embodiment is Computer Aided Design (CAD) software, and the simulation tool adopts stamping simulation software; first, in the CAD software, a model diagram of the simulated part (hereinafter referred to as the part model) is constructed, and then the CAD software exports the model diagram of the simulated part, and the exported model diagram of the simulated part is imported into the simulation tool, and then the stamping process of processing this part model is designed, and then the simulation result is calculated by the solver, and the rationality of the processing process design is checked by comparing the simulation result with the part model designed in CAD. If there is a problem in the simulation result, such as wrinkling, cracking, etc. of the processed part, it is necessary to return to continue to modify the processing technology until the simulation result meets the requirements.

[0023] In this embodiment, stamping simulation software often uses a tree structure to manage data in engineering projects. The nodes in the tree represent individual data objects, and there are reference relationships between these objects. Figure 2 As shown in the figure, for example, if mesh 1 is generated by geometry 1 and tool 1 is generated by mesh 1, then the reference to geometry 1 is recorded in the mesh 1 object, and the reference to mesh 1 is recorded in the tool 1 object. Moreover, this reference relationship between objects also implies a dependency relationship. For example, if mesh 1 references geometry 1, then mesh 1 depends on geometry 1, and if tool 1 references mesh 1, then tool 1 depends on mesh 1.

[0024] Step S20: extract objects from the stamping simulation data to obtain the reference relationship between several objects and any two objects; this embodiment obtains the engineering project file in the engineering project library of the stamping simulation software, analyzes the engineering project file, and can extract the reference relationship between several objects and any two objects.

[0025] Step S30: Based on the reference relationship between several objects and any two objects, a directed weight graph is constructed, wherein the directed weight graph includes several nodes, each graph point corresponds to an object, and when there is a reference relationship between two objects, this indicates that the nodes corresponding to the two objects have a connection, i.e., there is an edge.

[0026] Therefore, specifically, based on a number of objects and the reference relationship between any two objects, a directed weight graph is constructed, including: Step S301: constructing a number of nodes with a number of objects, and constructing the edges of the nodes and the directions and weights of the edges with the reference relationship between any two objects; the existence of an edge between any two nodes is used to indicate that there is a dependency relationship between the two nodes; Step S302: constructing an edge constraint based on the direction of the edge, wherein the edge constraint is used to limit the formation of a circular dependency between at least two nodes having a dependency relationship; Step S303: construct a directed weighted graph based on a number of nodes, edges of the nodes, directions and weights of the edges, and edge constraints.

[0027] In this embodiment, in order to facilitate the subsequent query and update of the directed weight graph and prevent repeated updates of each node in the directed weight graph, this embodiment constructs edge constraints to limit the formation of circular dependencies between at least two nodes with a dependency relationship to prevent infinite loops.

[0028] Specifically, edge constraints are constructed based on the direction of the edge, including: Step a10: extract at least two nodes with a dependency relationship to form a node chain; Step a20: based on the direction of the edge of the node chain, identify the first node and the last node of the node chain, and determine the main chain of the node chain based on the first node and the last node; Step a30: Based on the main chain of the node chain, determine whether there is a branch chain in the node chain; if there is a branch chain, establish an edge constraint.

[0029] Among them, the edge constraint is: determine whether the direction of the edge between the first two nodes of the branch is consistent with the direction of the edge of the main chain. If so, retain the edge between the first two nodes of the branch; if not, remove the edge between the first two nodes of the branch; wherein one of the first two nodes of the branch is located on the main chain.

[0030] by Figure 3 For example, node a, node b, node c, node d, node f and node e, these six nodes have a dependency relationship. These nodes are extracted to form a node chain. The edge between two nodes has a direction. The node in the longest direction is used as the main chain. At this time, the main chain is node b→node a→node c→node e. At this time, the branch chains are node a→node d→node b, node c→node d→node b, node f→node c.

[0031] In the branch chain, the direction of the edge from node d to node b is opposite to that of the main chain, forming a circular dependency. This will cause an infinite loop in the subsequent update steps during the query process. Therefore, this edge needs to be deleted to disconnect the two nodes.

[0032] Step S40: Obtain the modification record of the design parameters of the simulation part, and extract the modification object from the modification record of the design parameters of the simulation part. The object in this embodiment is the process geometry model or the process part coordinates. The process geometry model can be modified, and the process part coordinates can also be modified. After the modification, a modification log (i.e., modification record) is generated, and the modified content is extracted from the modification record to find the object.

[0033] Step S50: Based on the preset search algorithm, query the nodes that have a dependency relationship with the modified object from the directed weighted graph to obtain at least one associated node; since the object and the node are one-to-one corresponding, when an object is modified, the corresponding node can be queried from the directed weighted graph, and then the node that has a dependency relationship with the node can be queried in the directed weighted graph to obtain the associated node; wherein, the preset search algorithm is the breadth-first traversal algorithm of the graph, and the breadth-first traversal algorithm of the graph is an algorithm used for traversal or search of the graph. It starts from the starting vertex and expands outward layer by layer, first visiting all adjacent vertices of the starting vertex, and then visiting the unvisited adjacent vertices of these adjacent vertices in turn, until all reachable vertices are visited. The breadth-first traversal algorithm of the graph is relatively simple to implement and easy to understand.

[0034] Step S60: updating at least one associated node to obtain an updated directed weighted graph.

[0035] Step S70: updating the stamping simulation data based on the updated directed weight graph.

[0036] In this embodiment, the object is a process geometry model as an example, and the functions of adding and editing drawbeads in the stamping simulation drawing process are used as a demonstration. Figure 4 As shown, mesh 1, mesh 2, mesh 3, curve 1, curve 2 and curve 3 are all designed in CAD software and imported into stamping simulation software. The blank holder is a tool in the drawing process. Figure 4 In the figure, the binder surface 1 is generated by offsetting the mesh 1 in the Z direction, the binder surface 2 is generated by offsetting the mesh 2 in the Z direction, and the binder surface 3 is generated by offsetting the mesh 3 in the Z direction. In the drawing process, draw ribs are usually added to the tool to prevent the blank from wrinkling during processing. Figure 4 The draw bead 1 in the figure is generated by projecting the curve 1 onto the binder surface 1 along the z direction, the draw bead 2 is generated by projecting the curve 2 onto the binder surface 2 along the z direction, and the draw bead 3 is generated by projecting the curve 3 onto the binder surface 3 along the z direction.

[0037] The data structure and reference relationship of the engineering project files in the stamping simulation software, such as Figure 5 As shown, in Figure 5 Drawbead 1 object references curve 1 and binder surface 1, drawbead 2 references curve 2 and binder surface 2, and drawbead 3 references curve 3 and binder surface 3. Binder surface 1 references mesh 1, binder surface 2 references mesh 2, and binder surface 3 references mesh 3.

[0038] According to the data structure and reference relationship of the project files, the directed weight graph is constructed as follows: Figure 6 As shown. Figure 6In the example, if a reference to drawbead 1 needs to be added to mesh 1, mesh 1 will have a dependency on drawbead 1. By querying the directed weighted graph that manages dependencies, it can be found that mesh 1 depends on drawbead 1, drawbead 1 depends on blanking surface 1, and blanking surface 1 depends on mesh 1. Therefore, mesh 1 is not allowed to add a reference to drawbead 1.

[0039] If the part design is modified in the CAD software, the mesh 2 needs to be changed. The mesh 2 is re-imported in the stamping simulation software. At this time, the shape of the mesh 2 changes. By querying the directed weight graph that manages the dependency, the binder surface 2 that depends on the mesh 2 will be notified to update its shape. The binder surface 2 will use the latest mesh 2 to offset in the Z direction to obtain the new shape of the binder surface 2. When the update of the binder surface 2 is completed, the query shows that the drawbead 2 depends on the binder surface 2, so the curve 2 will be reprojected to the binder surface 2 to update the shape of the drawbead 2; when the shape of the drawbead 2 is updated, the query shows that there is no object that depends on the drawbead 2, and the update is completed.

[0040] In this embodiment, there is a special case. If curve 3 is deleted, the dependency of drawbead 3 on curve 3 will be obtained by querying the directed weight graph that manages the dependency. Therefore, when curve 3 is deleted, the reference of drawbead 3 to curve 3 will be deleted, and the directed weight graph will be updated to remove the dependency of drawbead 3 on curve 3. This will avoid the reference and dependency of drawbead 3 on a non-existent object.

[0041] In the prior art, when an object changes, developers usually rely on experience to decide which objects need to be updated. For example, in this case, when Mesh 2 changes, developers usually find all the pressing surfaces that may use Mesh 2, and then traverse these pressing surfaces to find that Pressing Surface 2 does use Mesh 2 before updating. After updating the pressing surface, it is likely that the update of Draw Bead 2 will be ignored, resulting in a mismatch between the shape of the draw bead and the shape of the pressing surface, thereby causing simulation accuracy errors. When an object is deleted, it is difficult to accurately find all affected objects based on experience. If all references to the deleted object are not disconnected, it will cause uncertain errors in subsequent programs, greatly reducing the stability of the program.

[0042] In addition, existing technologies usually execute different update logics for modifications to different objects. For example, when modifying curves and meshes, each usually maintains a set of update methods. When the types of modified objects increase, the update logic becomes particularly complex, which is not conducive to program maintenance and expansion. However, using an update method based on a directed weight graph, developers will implement their own update methods for each type of object. When the dependent upstream data changes, the affected objects are found through the directed weight graph and the update logic of the objects is executed. Then, the affected objects downstream are found and updated. This fixed update process is a method with wide applicability, simplicity, stability and high efficiency.

[0043] In this embodiment, the object is a process part coordinate as an example. Figure 7 As shown in the figure, when designing vehicle parts in CAD software, all parts are usually designed according to the world coordinate system to facilitate the assembly of parts into a whole. After the parts are imported into the stamping simulation software, a new part coordinate system needs to be created. The Z direction of the part coordinate system is usually close to the average normal direction of the machining surface.

[0044] Based on the part coordinate system, multiple process coordinate systems will be created. The Z-axis direction of each process coordinate system is consistent with the stamping direction. The process coordinate system has two properties. One is to set the synchronous coordinate system property. The XYZ axis direction of the process coordinate system will be consistent with the XYZ axis direction of the synchronous coordinate system. You can also set the relative coordinate system property. The direction of the process coordinate system will be based on the relative coordinate system and then rotated around the XYZ axis by a certain angle.

[0045] This embodiment creates four process coordinate systems, such as Figure 8 As shown, the reference relationship can be summarized as: 1. The relative coordinate system of coordinate system 1 is set to the part coordinate system, so coordinate system 1 references the part coordinate system; 2. The relative coordinate system of coordinate system 2 is set to coordinate system 1, so coordinate system 2 references coordinate system 1; 3. The relative coordinate system of coordinate system 3 is set to coordinate system 2, so coordinate system 3 references coordinate system 2; 4. The synchronous coordinate system and relative coordinate system of coordinate system 4 are set to the part coordinate system, so coordinate system 4 references the part coordinate system.

[0046] Based on the coordinate systems of the four processes and the reference relationship of the coordinate systems, a directed weight graph is created as follows Fig. 9 As shown, according to Figure 8The reference relationship of the objects in the coordinate system is created in the directed weighted graph. Coordinate system 3 depends on coordinate system 2, coordinate system 2 depends on coordinate system 1, and coordinate system 1 depends on the part coordinate system, and the weights are all 1. It is worth noting that coordinate system 4 depends on the part coordinate system and the weight is 2 (the weight of 2 means that the part coordinate system has a dependency relationship with the two coordinate systems), because the synchronous coordinate system and relative coordinate system properties of coordinate system 4 are both set to the part coordinate system.

[0047] Based on the existing dependency relationship, coordinate system 2 is not allowed to set the synchronous coordinate system or relative coordinate system to coordinate system 3, otherwise a circular dependency will be formed. Similarly, the synchronous coordinate system and relative coordinate system of coordinate system 1 cannot be set to coordinate system 2 or coordinate system 3.

[0048] When the direction of the part coordinate system changes, by querying the directed weight graph, it is found that coordinate system 1 and coordinate system 4 depend on the part coordinate system, so coordinate system 1 is flipped relative to the part coordinate system to update the direction of coordinate system 1; while coordinate system 4 and the part coordinate system are kept synchronized, and the latest direction of the part coordinate system can be directly used when updating coordinate system 4.

[0049] After coordinate system 1 and coordinate system 4 are updated, query the directed weight graph to obtain that coordinate system 2 depends on coordinate system 1, and let coordinate system 2 rotate again on the basis of coordinate system 1 to update coordinate system 2; after the update is completed, query again to obtain that coordinate system 3 depends on coordinate system 2, and let coordinate system 3 rotate again on the basis of coordinate system 2 to update coordinate system 3; finally, query that there is no object dependent on coordinate system 3, and the update is completed.

[0050] In the case of such a situation, when a coordinate system changes, the existing technology usually traverses all coordinate systems to query if there is a coordinate system whose synchronization attribute or relative attribute is set to the changed coordinate system before updating. This query method is not efficient. Through the directed weighted graph, it is not necessary to traverse all coordinate systems, and all objects that depend on the changed object can be directly found.

[0051] Moreover, when modifying the reference relationship between coordinate systems, the existing technology can easily inadvertently generate circular dependencies, especially some complex circular dependencies, which are not easy to find even for experienced developers. Once a circular dependency occurs, coordinate system A rotates relative to coordinate system B, and coordinate system B rotates relative to coordinate system A. In this case, coordinate systems A and B cannot be updated. Using a directed weight graph can not only clarify the update path of the object, but also avoid some incorrect dependency states.

[0052] Therefore, when the data in the stamping simulation software changes, the present invention uses a directed weighted graph to quickly and effectively query all affected data objects, and no longer relies on the developer's experience to judge the data objects that may be affected in various changes; and, using a breadth-first traversal algorithm to iteratively update the affected data objects will avoid erroneous updates, repeated updates, and ignored updates; secondly, when data is deleted, the referenced objects will be accurately obtained and useless reference relationships will be deleted, preventing program bugs caused by erroneous reference relationships; the present invention has high update efficiency, stability, and reliability.

[0053] Embodiment 2 Fig.10 FIG. 1 is a block diagram of a stamping simulation data updating system based on a directed weight graph provided by an embodiment of the present invention. Fig.10 As shown, this embodiment provides a stamping simulation data updating system based on a directed weight graph, the system is used to implement the stamping simulation data updating method based on a directed weight graph of embodiment 1, and the system includes: A data acquisition module, used to acquire design parameters of the simulated parts and generate stamping simulation data based on the design parameters of the simulated parts; An object extraction module is used to extract objects from stamping simulation data and obtain reference relationships between several objects and any two objects; A graph construction module, used to construct a directed weighted graph based on a number of objects and a reference relationship between any two objects, wherein the directed weighted graph includes a number of nodes, and each graph point corresponds to an object; A parameter modification module is used to obtain a modification record of the design parameters of the simulation part and extract a modification object from the modification record of the design parameters of the simulation part; A node query module, used to query nodes having a dependency relationship with the modified object from a directed weighted graph based on a preset search algorithm, and obtain at least one associated node; A graph updating module, used to update at least one associated node to obtain an updated directed weighted graph; The data updating module is used to update the stamping simulation data based on the updated directed weight graph.

[0054] This embodiment provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, the stamping simulation data updating method based on the directed weight graph of the first embodiment is implemented.

[0055] This embodiment provides a computer-readable storage medium on which a computer program is stored. When the program is executed by a processor, the method for updating stamping simulation data based on a directed weight graph of the first embodiment is implemented.

[0056] When the data in the stamping simulation software changes, the present invention uses a directed weighted graph to quickly and effectively query all affected data objects, and no longer relies on the experience of developers to judge the data objects that may be affected in various situations of change; and, the affected data objects are iteratively updated using a breadth-first traversal algorithm, which can avoid erroneous updates, repeated updates, and ignored updates; secondly, when data is deleted, the referenced objects can be accurately obtained and useless reference relationships can be deleted, preventing program bugs caused by erroneous reference relationships; the present invention has high update efficiency, stability and reliability.

[0057] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

[0058] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0059] The above are only embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included within the scope of the claims of the present application.

Claims

1. A stamping simulation data updating method based on a directed weight graph, characterized in that: The method comprises: Acquire design parameters of the simulation part, and generate stamping simulation data based on the design parameters of the simulation part; Extract objects from stamping simulation data to obtain reference relationships between several objects and any two objects; Based on a number of objects and a reference relationship between any two objects, a directed weighted graph is constructed, wherein the directed weighted graph includes a number of nodes, and each graph node corresponds to an object; Acquire a modification record of the design parameters of the simulation part, and extract a modification object from the modification record of the design parameters of the simulation part; Based on a preset search algorithm, a node having a dependency relationship with the modified object is searched from the directed weight graph to obtain at least one associated node; updating at least one associated node to obtain an updated directed weight graph; The stamping simulation data is updated based on the updated directed weight graph.

2. The stamping simulation data updating method based on directed weight graph according to claim 1 is characterized in that: Based on several objects and the reference relationship between any two objects, a directed weighted graph is constructed, including: Several nodes are constructed with several objects, and the edges of several nodes and the directions and weights of the edges are constructed with the reference relationship between any two objects; the existence of an edge between any two nodes is used to represent the dependency relationship between the two nodes; constructing an edge constraint based on the direction of the edge, wherein the edge constraint is used to limit the formation of a circular dependency between at least two nodes having a dependency relationship; A directed weighted graph is constructed based on a number of nodes, edges of the nodes, directions and weights of the edges, and edge constraints.

3. The stamping simulation data updating method based on directed weight graph according to claim 2 is characterized in that: Construct edge constraints based on the direction of the edge, including: Extract at least two nodes with a dependency relationship to form a node chain; Based on the direction of the edge of the node chain, the first node and the last node of the node chain are identified, and based on the first node and the last node, the main chain of the node chain is determined; Based on the main chain of the node chain, determine whether there is a branch chain in the node chain; if there is a branch chain, establish edge constraints.

4. The stamping simulation data updating method based on directed weight graph according to claim 3 is characterized in that: The edge constraint is: determine whether the direction of the edge between the first two nodes of the branch is consistent with the direction of the edge of the main chain. If so, retain the edge between the first two nodes of the branch; if not, remove the edge between the first two nodes of the branch; wherein one of the first two nodes of the branch is located on the main chain.

5. The stamping simulation data updating method based on directed weight graph according to any one of claims 1 to 4, characterized in that: The object is a process geometry model or a process part coordinate.

6. The stamping simulation data updating method based on a directed weight graph according to any one of claims 1 to 4, characterized in that: The preset search algorithm is a breadth-first traversal algorithm of the graph.

7. The stamping simulation data updating method based on a directed weight graph according to any one of claims 1 to 4, characterized in that: Obtain the design parameters of the simulated parts and generate stamping simulation data based on the design parameters of the simulated parts, including: A model diagram of the simulation part is produced based on a preset drawing tool, wherein the preset drawing tool exports model parameters of the model diagram of the simulation part to obtain design parameters of the simulation part; The design parameters of the simulated parts are input into a preset simulation tool to generate stamping simulation data, which is a tree structure.

8. A stamping simulation data updating system based on a directed weight graph, the system being used to implement the stamping simulation data updating method based on a directed weight graph as claimed in any one of claims 1 to 7, characterized in that: The system comprises: A data acquisition module, used to acquire design parameters of the simulated parts and generate stamping simulation data based on the design parameters of the simulated parts; An object extraction module is used to extract objects from stamping simulation data and obtain reference relationships between several objects and any two objects; A graph construction module, used to construct a directed weighted graph based on a number of objects and a reference relationship between any two objects, wherein the directed weighted graph includes a number of nodes, and each graph point corresponds to an object; A parameter modification module is used to obtain a modification record of the design parameters of the simulation part and extract a modification object from the modification record of the design parameters of the simulation part; A node query module, used to query nodes having a dependency relationship with the modified object from a directed weighted graph based on a preset search algorithm, and obtain at least one associated node; A graph updating module, used to update at least one associated node to obtain an updated directed weighted graph; The data updating module is used to update the stamping simulation data based on the updated directed weight graph.

9. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the computer program, the stamping simulation data updating method based on the directed weight graph described in any one of claims 1 to 7 is implemented.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the stamping simulation data updating method based on a directed weight graph described in any one of claims 1 to 7 is implemented.

Images