Piping network formation method using internal connection information, and 3D piping path tracking method

WO2025063370A1PCT designated stage expired Publication Date: 2025-03-27REALTIMETECH CO LTD +1
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
PCT/KR2023/017234
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-09-19
Filing Date
2023-11-01
Publication Date
2025-03-27

Smart Images

  • Figure KR2023017234_27032025_PF_FP_ABST
    Figure KR2023017234_27032025_PF_FP_ABST
Patent Text Reader

Abstract

The present invention relates to forming and tracking a piping network. A virtual node or a virtual link is generated in equipment or accessories having no internal connection information in a piping network, and the piping network is connected in a repetitive structure of a link-node-link-node without disconnection. In addition, connection information is provided to all nodes, thereby enabling accurate and diverse functional piping tracking.
Need to check novelty before this filing date? Find Prior Art

Description

Method for forming a piping network using internal connection information and method for tracing a 3D piping path

[0001] The present invention relates to a network analysis technique applied to a piping system including equipment, and more particularly, to a method for forming a piping network and a 3D piping path tracking method in network analysis applied to a piping system including equipment.

[0002] In chemical and semiconductor factories, various hazardous chemicals travel through pipes. Leaks or ruptures in these pipes threaten the safety of the plant and, in severe cases, can lead to environmental problems. In semiconductor factories, in particular, the production process is extremely complex, and even minor process differences can significantly impact quality.

[0003] Additionally, energy efficiency is critical in large-scale facilities, and efficiently managing the flow of fluids through pipes can minimize energy use and reduce operating costs.

[0004] To address this, efforts are underway to create a digital twin, a digital replica of the actual piping system, to monitor the system's status in real time, and, if necessary, to conduct simulations to monitor the system's status in real time and find optimal operating methods.

[0005] However, in the existing piping field, the information used in the digital twin may include 1) physical characteristics such as the length, diameter, material, shape, and wall thickness of the pipe through design drawings, 3D modeling tools, and field inspections, 2) information such as which equipment the pipe is connected to and how the pipes are connected to each other, 3) information such as the type, pressure, temperature, and flow rate of the fluid moving through the pipe, 4) information such as the current status of the pipe, previous problems that occurred, and maintenance work performed, 5) real-time data obtained from sensors installed in the pipe, and using the information collected in this way, the complex connection structure of the piping network is effectively expressed and analyzed by generally using a graph data structure, where valves, pumps, etc. are expressed as nodes in the graph, and connections are expressed as links.

[0006] However, as shown in Fig. 1, the equipment represented in the existing network has a plurality of connection points (120), and although pipes (110) connected to each connection point (120) are illustrated, the internal structure of the equipment (100) is unknown, so the connection information between the connection points (120), that is, the connection information between the pipes (110), is unknown. In this case, when tracing for pipe analysis, the equipment connected to the pipe cannot be passed, so the pipe in the next stage cannot be identified, and the tracing is interrupted. In other words, the pipe connected from the starting location, pipe A (130), to the destination location, pipe B (140), cannot be extracted.

[0007] Additionally, when multiple components in Fig. 2a are located in close proximity, depending on the preferences of the actual designer, the node data may appear continuously without separate link data, as in Fig. 2b, or may consist solely of link data without node data, as in Fig. 2c. In such cases, network connection information may be disconnected, causing pipe tracing to be interrupted.

[0008] In this way, in order to perform various analyses and simulations, such as real-time tracing of fluid flow in pipes using digital twins in the piping field, additional data representations are required to secure network connectivity for equipment or component data that lack internal connection information, and a method is needed to accurately identify connection information between equipment and components or pipes.

[0009] The technical task of the present invention to solve the above-described problem is to provide a method for forming a pipe network and a 3D pipe path tracking method for generating network connection information for equipment or component data without internal connection information, tracing connections between pipes and equipment or components using the generated network connection information, and performing various analyses therethrough to enable rapid analysis and response to unexpected problems that may occur during a process or problems that may occur after installation of additional equipment or pipes.

[0010] In order to achieve the above object, in one aspect, the present invention relates to a method for forming a piping network, comprising the steps of creating at least one of a virtual node and a virtual link for equipment and accessories in a piping network including connection points, nodes and links, and the step of creating seamless piping connection information based on the created virtual node and virtual link.

[0011] In one embodiment, the piping connection information may include connection paths or connection relationships between equipment and accessories within the piping network.

[0012] In one embodiment, the connection point may represent a contact point with any equipment, piping or accessories connected to the equipment.

[0013] In one embodiment, the virtual node created in the equipment or accessory is characterized in that it is represented by at least one node inside the equipment or accessory.

[0014] In one embodiment, the virtual links created in the equipment or accessory are characterized in that they are all connected to at least one virtual node created inside the equipment.

[0015] In one embodiment, the virtual node, the virtual link and the connection point created in the equipment or accessory are characterized in that the connection between the equipment, pipe or accessory connected to the equipment or accessory is expressed without interruption.

[0016] In one embodiment, the virtual node is created between disconnected links, characterized in that the virtual link is created between disconnected nodes.

[0017] In one embodiment, the pipe connection information may include at least one of material property information and pipe information on the pipe path.

[0018] In another aspect, a method for 3D pipe path tracking is provided, comprising: a step of determining a pipe path tracking start node and an end node in a pipe network by a processor for pipe path tracking; a step of setting a top priority object in a visit target list as a current visit node by the processor for pipe path tracking; and a step of generating a pipe path tracking result based on a history of the current visit node by the processor for pipe path tracking.

[0019] In one embodiment, the step of setting the highest priority object of the visited list as the currently visited node may further include the step of adding a node and a cost to the visited list.

[0020] In one embodiment, the step of setting the highest priority object of the visited list as the current visited node may further include the step of searching for an adjacent node of the current visited node.

[0021] In one embodiment, the step of searching for an adjacent node of the currently visited node may further include a step of checking whether the adjacent node exists and a step of checking whether a node in the visited target list exists.

[0022] In one embodiment, if the current visited node has no adjacent nodes, the method may further include a step of removing the current visited node from the history of the current visited node.

[0023] In one embodiment, the step of setting the top priority object of the visited target list as the current visited node may further include the step of comparing the link property type of the adjacent node of the current visited node with the search condition.

[0024] In one embodiment, the step of setting the highest priority object of the visited list as the current visited node may further include the step of removing the highest priority object set as the current visited node from the visited list, and at the same time changing the node at the bottom to the top.

[0025] In one embodiment, the step of setting the highest priority object of the visit target list as the current visit node may further include the step of checking whether the current visit node matches the end node.

[0026] In one embodiment, the step of setting the highest priority object of the visited target list as the current visited node may further include the step of checking a search stop condition for the current visited node.

[0027] In one embodiment, the search stop condition comprises setting the valve or equipment to the nth encountered from the starting point of a particular device, where n is an integer.

[0028] In one embodiment, the piping network comprises connection points, nodes and links, and equipment and accessories within the piping network are characterized by comprising at least one of a virtual node and a virtual link.

[0029] In one embodiment, the virtual node created in the equipment or accessory is characterized in that it is represented by at least one node inside the equipment or accessory.

[0030] In one embodiment, the virtual links created in the equipment or accessory are characterized in that they are all connected to at least one virtual node created inside the equipment.

[0031] In another aspect, a method for forming a pipeline network using model information includes a step of extracting information on a center point and a collision point of a model of elements constituting the pipeline network, and a step of connecting models of the elements using the information on the center point and the collision point.

[0032] In one embodiment, the step of connecting models of the components may include the step of calculating a distance between a center point of a specific model and a center point of a model adjacent to the specific model, and if each of the collision points of the specific model and the adjacent model is within a predetermined range of the calculated distance, the step of determining that the specific model and the adjacent model are connected and converting the collision points of the specific model and the adjacent model into connection points.

[0033] In one embodiment, the predetermined range is defined as + / - n % of the distance between the center point of the specific model produced and the center point of a model adjacent to the specific model, where n is a real number.

[0034] In one embodiment, the step of extracting information on the center point and collision point of a model of elements constituting the pipe network further includes a step of extracting identification information of a model of elements constituting the pipe network, wherein the identification information may include at least one of a type, a size, and a transported material.

[0035] According to the method for forming a pipe network and the method for tracing a 3D pipe path according to embodiments of the present invention, it is possible to quickly identify the location of a pipe where a problem has occurred and plan maintenance or repair accordingly.

[0036] In addition, according to the method for forming a pipe network and the method for tracing a 3D pipe path according to embodiments of the present invention, when a problem occurs in a pipe system, it is possible to identify potential problems that may threaten the safety of workers or harm the environment in advance and prepare countermeasures.

[0037] In addition, according to the method for forming a pipe network and the method for tracing a 3D pipe path according to embodiments of the present invention, a digital twin is created based on pipe tracking information, thereby enabling accurate simulation of the process of an actual system, thereby enabling system optimization.

[0038] In addition, according to the method for forming a pipe network and the method for tracing a 3D pipe path according to embodiments of the present invention, it is possible to identify possible problems in advance at the design stage of a new facility and to select the volume of pipes or equipment.

[0039] Figure 1 is a conceptual diagram illustrating a method of representing specific equipment connected to multiple pipes in a conventional piping design drawing.

[0040] Figures 2a to 2c are conceptual diagrams illustrating a method of representing closely located components and their connections in a conventional piping design drawing.

[0041] FIG. 3 is a conceptual diagram illustrating a device representation method and a connection method including a virtual node and a virtual link inside the device according to one embodiment of the present invention.

[0042] FIG. 4 is a conceptual diagram illustrating generating connection information for pipes connected via equipment according to one embodiment of the present invention.

[0043] FIGS. 5A and 5B are conceptual diagrams illustrating a method of representing closely located components using virtual links or virtual nodes, according to one embodiment of the present invention.

[0044] FIGS. 6A and 6B are flowcharts illustrating a method for searching a pipe path by limiting the properties of a pipe when searching a 3D path in a pipe network in which internal connection information is generated, according to one embodiment of the present invention.

[0045] Figure 7 shows an example of a piping network configuration composed of nodes and links.

[0046] FIGS. 8A to 8F are conceptual diagrams showing a list of visited targets and status changes of a currently visited node according to a flowchart of a method for searching a pipe path by limiting the properties of the pipe of FIGS. 6A and 6B, which is an embodiment of the present invention.

[0047] FIG. 9a and FIG. 9b are conceptual diagrams showing (a) the result of path search that does not consider the properties of pipes in a pipe network in which internal connection information is generated, and (b) the result of path search that considers the properties of pipes in a pipe network in which internal connection information is generated, according to one embodiment of the present invention.

[0048] FIGS. 10A and 10B are flowcharts of a method for searching a 3D pipe path according to specific conditions in a pipe network in which internal connection information is generated, according to one embodiment of the present invention.

[0049] FIG. 11 is a drawing exemplarily showing the search results of a 3D pipe path when a search stop condition is used in a pipe network in which internal connection information is generated according to one embodiment of the present invention.

[0050] FIG. 12 is a diagram showing the connection of a model-based piping network in a piping network in which internal connection information is generated according to one embodiment of the present invention.

[0051] FIG. 13 is a drawing showing model-based connections of pipes, flanges, and valves in a piping network in which internal connection information is generated, according to one embodiment of the present invention.

[0052] FIG. 14 is a diagram showing connection information at a connection point in a piping network where internal connection information is generated according to one embodiment of the present invention.

[0053] Hereinafter, preferred embodiments of the present invention will be described with reference to the attached drawings. However, some components irrelevant to the gist of the invention will be omitted or compressed. However, the omitted components do not necessarily mean that they are unnecessary for the present invention, and those skilled in the art can combine and use them.

[0054] FIG. 3 is a conceptual diagram illustrating a device representation method and a connection method including a virtual node and a virtual link inside the device according to one embodiment of the present invention.

[0055] As illustrated in FIG. 3, the equipment (300) of the present invention includes, in addition to connection points (320) representing contact points with pipes (110, 130, 140), valves or other piping accessories (not shown) connected to the equipment (100) represented in the general design drawing of FIG. 1, virtual nodes (330) and virtual links (340), and all connection points (320) are connected to the virtual nodes (330) via the virtual links (340). Accordingly, all pipes (310), valves or other piping accessories connected to the equipment (300) can all be interconnected via the virtual nodes (330), virtual links (340) and connection points (320) represented in the equipment (300).

[0056] Through this, it is shown that the pipe (310) connected to the equipment (300) can be networked by being connected to all pipes (310) or accessories connected to the equipment (300) via one virtual node (330) and multiple virtual links (340) inside the equipment.

[0057] FIG. 4 is a conceptual diagram illustrating generating connection information for pipes connected via equipment according to one embodiment of the present invention.

[0058] FIG. 4 is a conceptual diagram for explaining the creation of a pipe connection path (AB) connecting pipe A (450) to pipe B (460), and a pipe connection path (CD) connecting pipe C (470) to pipe D (480). By configuring in this way, the connection relationship in the order of pipe A (450) - equipment (400) - pipe B (460) and the connection relationship in the order of pipe C (470) - equipment (400) - pipe D (480) can be secured, and also, the material property information and pipe information flowing in pipe A (450) - equipment (400) - pipe B (460) and pipe C (470) - equipment (400) - pipe D (480) can be confirmed.

[0059] By utilizing the seamless pipes, connections between equipment and accessories constructed in this way, material property information along the pipe route, and pipe information, it is possible to track and search, in particular, pipes that satisfy the conditions through which a specific material passes.

[0060] FIGS. 5A and 5B are conceptual diagrams illustrating a method of representing closely located components using virtual links or virtual nodes, according to one embodiment of the present invention.

[0061] In Fig. 5a, in the representation of connecting existing adjacent components shown in Fig. 2a, when only node A (510), node B (520), and node C (530) data are expressed and disconnected, a virtual link (500) connecting all of node A (510), node B (520), and node C (530) is created and added. Through this, node A (51), node B (520), and node C (530), which are disconnected, can be connected to each other through the virtual link (500).

[0062] In Fig. 5b, in the representation of connecting existing adjacent components shown in Fig. 2a, when only Link A (560), Link B (570), and Link C (580) data are expressed and disconnected, a virtual node (550) is created and added between Link A (560) and Link B (570), Link B (570), and Link C (580). Through this, the disconnected Link A (560), Link B (570), and Link C (580) can be connected to each other through the virtual node (550).

[0063] In conclusion, network data according to one embodiment of the present invention is connected in a node-link-node-link order with nodes and links being repeatedly connected without any disconnection.

[0064] FIGS. 6A and 6B are flowcharts illustrating a method for searching a pipe path by limiting the properties of a pipe when searching a 3D path in a pipe network in which internal connection information is generated, according to one embodiment of the present invention.

[0065] The flowcharts of FIGS. 6a and 6b show a method of searching for a pipeline path by limiting the properties of a pipeline in a pipeline network constructed by connecting nodes and links in a node-link-node-link order without interruption, using the same concept as FIGS. 3, 4, 5a and 5b.

[0066] First, all nodes and costs in the visit target list are cleared (S601). Next, the closest node from the location selected by the user as the starting point is determined as the search start node, and the closest node from the location selected by the user as the ending point is determined as the search end node (S602).

[0067] The above search start node and cost are added to the list of visited targets (S603). Here, the cost can be expressed as the distance between the search start location and the search start node.

[0068] The top object in the above-mentioned visit target list is extracted and set as the current visit node, while simultaneously removing the top object from the visit target list (S604). Here, the top object is the node at the top of the visit target list and represents the node to be visited currently. Removing the top object from the visit target list is to prevent it from being revisited during subsequent searches.

[0069] In step 605, it is checked whether the node set as the current visited node matches the end node determined in step 602, and if the current visited node matches the end node, the result is displayed (step S613) and the program is terminated.

[0070] If the node set as the current visited node in step 605 does not match the end node determined in step 602, then it is checked whether there are any adjacent nodes connected to the current visited node (S606). If there are adjacent nodes, the adjacent nodes and their respective costs are added to the list of visited nodes (S607). Here, the cost may include the distance (e.g., link length) between the current visited node and the adjacent nodes.

[0071] After checking the link attribute type of each adjacent node added in step S607, each link attribute type and search condition are sequentially compared to check whether they match (S608). Here, examples of link attribute types and search conditions may include, but are not limited to, the type of substance passing through the pipe (hydrogen, oxygen, water, sewage, liquid nitrogen, etc.) or the type of material constituting the pipe (aluminum, plastic, iron, etc.).

[0072] In step S608, nodes matching the search condition are left in the visit target list (S609), and the process returns to step S604.

[0073] Meanwhile, in step S606, if the currently visited node has no adjacent nodes, it is checked whether the visited target list is empty (S610). If the visited target list is not empty, the process returns to step S604. If the visited target list is empty, the results up to that point are displayed (S613) and the program ends.

[0074] In addition, in step S608, if the link attribute type of the adjacent node in the visited target list does not match the search condition, the adjacent node and cost are removed from the visited target list (S611), and then it is checked whether the visited target list is empty (S612). If the visited target list is not empty, the process returns to step S604, and if the visited target list is empty, the result is displayed (S613) and the program is terminated.

[0075] When the connectivity of the pipe network is secured through FIGS. 3, 4, 5a, and 5b, and the pipe path is searched by limiting the properties of the pipes as in the method of FIGS. 6a and 6b, the path composed of only pipes passing through it can be accurately traced. For example, by distinguishing the characteristics by the type of substance passing through the pipe (hydrogen, oxygen, water, sewage, liquid nitrogen, etc.) or the type of material constituting the pipe (aluminum, plastic, iron, etc.), only the pipes passing through it and their paths can be accurately traced.

[0076] Through this, the pipe path tracking method according to one embodiment of the present invention achieves significant improvements in tracking speed and path search accuracy compared to the existing pipe path search function.

[0077] According to an embodiment of the present invention of FIGS. 6A and 6B, a procedure for searching a pipe path by limiting the properties of a pipe when searching a 3D path in a pipe network in which internal connection information is generated is implemented through a pipe path search system, and the pipe path search system may be configured with a processor for performing a procedure for searching a pipe path, a memory for storing a list of visited targets, adjacent nodes, and currently visited nodes, and a display unit for showing the search results.

[0078] Figure 7 shows an example of a piping network configuration composed of nodes and links.

[0079] Figure 7 shows a start location (S1) and an end location (E1) selected by a user, and it can be seen that the piping network includes nodes 1 to 10 and links 1 to 9 and is seamlessly connected. The closest node to the start location (S1) selected by the user is node 2, and the closest node to the end location (E1) selected by the user is node 10.

[0080] FIGS. 8A to 8F are conceptual diagrams showing a list of visited targets and status changes of a currently visited node according to a flowchart of a method for searching a pipe path by limiting the properties of the pipe of FIGS. 6A and 6B, which is an embodiment of the present invention.

[0081] Figure 8a shows the process of extracting node 2 as the current visited node in the network of Figure 7. Here, it can be seen that node 2, which is the closest node at the location (S1) selected by the user in Figure 7, is set as the current visited node regardless of the link property type, and an example is shown in which the link property types of node 1 and node 3, which are adjacent nodes of the current visited node 2, match the search condition.

[0082] Meanwhile, as in step S604 of Fig. 6a, when the highest priority object is extracted and removed, an operation is additionally performed in which the lower node is repositioned to the upper node.

[0083] Figure 8b shows the process of extracting node 3 as the currently visited node in Figure 7. Here, node 1 is extracted as the currently visited node, but since node 1 has no adjacent nodes (node ​​2, which is an adjacent node of node 1, is excluded from the adjacent nodes because it is a node that has already been visited in the process of Figure 8a), it is excluded from the currently visited nodes, and an example is shown where the link property type of node 4, which is an adjacent node of the currently visited node 3, matches the search condition.

[0084] Figure 8c shows the process of extracting node 4 as the current visited node in Figure 7. Here, an example is shown where the link property types of nodes 5 and 6, which are adjacent nodes of the current visited node 4, match the search condition.

[0085] Figure 8d shows the process of extracting node 5 as the currently visited node in Figure 7. Here, node 6 is extracted as the currently visited node, but since node 6 has no adjacent nodes (node ​​4, which is an adjacent node of node 6, is excluded from the adjacent nodes because it is a node that has already been visited in the process of Figure 8c), it is excluded from the currently visited nodes, and an example is shown where the link property types of nodes 7 and 8, which are adjacent nodes of the currently visited node 5, match the search conditions.

[0086] Figure 8e illustrates the process of extracting node 7 as the currently visited node in Figure 7. Here, an example is shown where the link property types of nodes 9 and 10, which are adjacent nodes of the currently visited node 7, match the search condition.

[0087] Fig. 8f shows the process in which node 10 is extracted as the current visited node in Fig. 7, the result is displayed, and the program is terminated. Here, node 9 is extracted as the current visited node, but since node 9 has no adjacent node (node ​​7, which is an adjacent node of node 9, is excluded from the adjacent nodes because it is a node that has already been visited in the process of Fig. 8e), it is excluded from the current visited node, and since the current visited node 10 matches the end node (node ​​10 is the end node in Figs. 6a and 6b), as in step S605 of Fig. 6a, the result is displayed and the program is terminated.

[0088] The final result in Fig. 8f shows nodes 2, 3, 4, 5, 7, and 10 of Fig. 7, which show the connection path between the start point (S1) and the end point (E1) selected by the user while matching the search conditions.

[0089] FIG. 9a and FIG. 9b are conceptual diagrams showing the results of path search that does not consider the properties of pipes in a pipe network in which internal connection information is generated (FIG. 9a) and the results of path search that considers the properties of pipes in a pipe network in which internal connection information is generated (FIG. 9b) according to one embodiment of the present invention.

[0090] The explored path 1 shown in Fig. 9a and the explored path 2 shown in Fig. 9b show completely different paths, and it was found that the pipe path according to the properties of the pipe actually matches the explored path 2 shown in Fig. 9b.

[0091] Such a difference is possible through the construction of a network in which the connection information of the pipes constructed by the present invention is continuously and repeatedly connected in the order of node-link-node-link.

[0092] FIGS. 10A and 10B are flowcharts showing a method for stopping a search when searching a 3D pipe path in a pipe network in which internal connection information has been generated, according to an embodiment of the present invention.

[0093] The flowcharts of FIGS. 10a and 10b are flowcharts including a method for stopping the search when searching for a pipeline path in a network constructed by repeatedly connecting nodes and links in the order of node-link-node-link, using virtual nodes and virtual links in the same manner as described in FIGS. 3, 4, 5a and 5b, and generating internal connection information.

[0094] First, all contents in the visit target list are emptied (S1001). Next, the closest node from the location selected by the user as the starting point is determined as the search start node, and the closest node from the location selected by the user as the ending point is determined as the search end node (S1002).

[0095] The above search start node and cost are added to the list of visited targets (S1003). Here, the cost can be the distance between the search start location and the search start node.

[0096] The top object in the above-mentioned visit list is extracted and set as the current visit node, while simultaneously removing the top object from the visit list (S1004). Here, the top object is the node at the top of the visit list and represents the node to be visited currently. Removing the top object from the visit list is to prevent it from being revisited during subsequent searches.

[0097] In step 1005, it is checked whether the node set as the current visited node matches the end node determined in step 1002, and if the current visited node matches the end node, the result is displayed (step S1014) and the program is terminated.

[0098] In step 1005, if the node set as the current visited node does not match the end node determined in step 1002, it is checked whether there is an adjacent node connected to the current visited node (S1006).

[0099] In step S1006, if there is an adjacent node connected to the current visited node, a stopping condition for the current visited node is checked (S1007), and if the stopping condition is met, the process returns to step S1004 where the highest priority object in the visited target list is extracted and set as the current visited node, and if the current visited node does not meet the stopping condition, the adjacent nodes and their respective costs are added to the visited target list (S1008). Here, the cost may include the distance (e.g., link length) between the current visited node and the adjacent node.

[0100] After checking the link attribute type of each adjacent node added in step S1008, each link attribute type is sequentially compared with the search condition to check whether they match (S1009). Here, examples of link attribute types include, but are not limited to, the type of substance passing through the pipe (hydrogen, oxygen, water, sewage, liquid nitrogen, etc.) or the type of material constituting the pipe (aluminum, plastic, iron, etc.).

[0101] Next, nodes matching the search condition are left in the visit target list (S1010), and the process returns to step S1004.

[0102] Meanwhile, in step S1006, if the currently visited node has no adjacent nodes, it is checked whether the visited target list is empty (S1011). If the visited target list is not empty, the process returns to step S1004. If the visited target list is empty, the results up to that point are displayed (S1014) and the program terminates.

[0103] In addition, in step S1009, if the link attribute type of the adjacent node in the visited target list does not match the search condition, the adjacent node and cost are removed from the visited target list (S1012), and then it is checked whether the visited target list is empty (S1013). If the visited target list is not empty, the process returns to step S1004, and if the visited target list is empty, the result is displayed (S1014) and the program is terminated.

[0104] The flowcharts of FIGS. 10a and 10b illustrate an algorithm for stopping tracing when a specific condition is satisfied during pipe tracing. When attempting to continue the search from the current node to the next node connected, it is checked whether the current node satisfies the condition, and if so, the search is stopped and the search is continued from another node.

[0105] Here, the condition can be set to, for example, the first valve or equipment encountered at the starting point of a specific device, or the second valve or equipment encountered.

[0106] Additionally, it is also possible to stop the search after counting the number of stop condition checks and proceeding to step n (where n is a natural number).

[0107] FIG. 11 is a drawing exemplarily showing the search results of a 3D pipe path when a search stop condition is used in a pipe network in which internal connection information is generated according to an embodiment of the present invention.

[0108] As shown in Fig. 11, this is an example of tracking a valve, which is a pipe accessory, by utilizing the search stop function according to specific conditions during 3D path search, and by searching from the pipe connected to the equipment to the first valve encountered (step 1), the pipe and valve connected to the equipment can be found.

[0109] In Fig. 11, the valves encountered first and the valves encountered next in the path of the pipes (1101) connected and tracked based on the equipment (1100) are shown.

[0110] For example, if the first-stage stopping condition is to stop at the first valve encountered in the path of the pipes (1101) connected and tracked based on the equipment (1100), valves 1 to 9 (1110 to 1118) are valves searched according to the first-stage stopping condition, and furthermore, in the second-stage stopping condition that stops at the valve encountered after the first encountered valve, valves 10 to 12 (1119 to 1121) are valves searched.

[0111] FIG. 12 is a diagram showing the connection of a model-based piping network in a piping network in which internal connection information is generated according to one embodiment of the present invention.

[0112] The piping network illustrated in Fig. 12 is characterized in that internal connection information is created using virtual nodes and virtual links in the same manner as described in Figs. 3, 4, 5a and 5b, and nodes and links are connected in a node-link-node-link order without interruption.

[0113] As illustrated in FIG. 12, the piping network (1200) shows the connection status of components such as A to L.

[0114] In Fig. 12, A, C, E, F, J, and L represent a straight pipe model, B represents a T-shaped pipe model, D and H represent a valve model, G and I represent a flange model, and K represents a curved pipe model.

[0115] As shown in Fig. 12, the connection between each model is expressed as a connection point. For example, connection point 1 (1203) is indicated between the center point 1 (1201) of the straight pipe model A and the center point 2 (1202) of the T-shaped pipe model B, and connection point 3 (1208) is indicated between the center point 3 (1206) of the straight pipe model C and the center point 4 (1207) of the valve model D.

[0116] Block model 1 (1210) shows the arrangement of center points and connection points in a connection consisting of a straight pipe model (F) - a flange model (G) - a valve model (H) - a flange model (I) - a pipe model (J).

[0117] A method for determining a connection between models includes calculating a distance between a center point of a specific model and a center point of a model adjacent to the specific model, and if a collision point (not shown) of the specific model and a collision point (not shown) of the adjacent model are each within a predetermined range of the calculated distance, the specific model and the adjacent model are determined to be connected, and the collision points of the two models are converted into a single connection point. Here, the predetermined range is set to + / - n % of the distance between the calculated center point of the specific model and the center point of the model adjacent to the specific model, where n is a real number.

[0118] FIG. 13 is a drawing showing model-based connections of pipes, flanges, and valves in a piping network in which internal connection information is generated, according to one embodiment of the present invention.

[0119] As illustrated in FIG. 13, connection point 1 (1301) represents a connection between pipe model F and flange model G, connection point 2 (1302) represents a connection between flange model G and valve model H, connection point 3 (1303) represents a connection between valve model H and flange model I, and connection point 4 (1104) represents a connection between flange model I and pipe model J.

[0120] Meanwhile, center point 1 (1310) represents the center point of flange model G, center point 2 (1311) represents the center point of valve model H, and center point 3 (1113) represents the center point of flange model I.

[0121] FIG. 14 is a diagram showing connection information at a connection point in a piping network where internal connection information is generated according to one embodiment of the present invention.

[0122] As illustrated in FIG. 14, connection point 1 (1401) located between models A and B has information identifying the components of model A and model B, and connection point 2 (1402) located between models D and model E has information identifying the components of model D and model E. In this way, connection points 1 to 3 (1401, 1402, 1403) are provided with information identifying adjacent components (e.g., type, site, transport material, etc.), and by using the connection information between components obtained through this, a piping network can be formed and piping tracking can also be performed.

Claims

1. A step of creating at least one of a virtual node and a virtual link for equipment and accessories within a piping network including connection points, nodes and links; and A method for forming a piping network, comprising the step of generating seamless piping connection information based on the virtual nodes and virtual links generated in the above equipment and accessories.

2. In paragraph 1, The above pipe connection information is A method for forming a piping network, comprising a connection path or connection relationship between equipment and accessories within the piping network.

3. In paragraph 1, A method for forming a piping network, wherein the above connection points represent contact points with all equipment, pipes or accessories connected to the above equipment.

4. In paragraph 1, A method for forming a piping network, characterized in that a virtual node created in the above equipment or accessory is expressed as at least one node inside the above equipment or accessory.

5. In paragraphs 1 to 4, A method for forming a piping network, characterized in that all virtual links created in the equipment or accessories are connected to at least one virtual node created inside the equipment.

6. In paragraphs 1 to 5, By the virtual node, the virtual link and the connection point created in the above equipment or accessory, A method for forming a piping network, characterized in that the connection between equipment, pipes or accessories connected to the above equipment or accessories is expressed without interruption.

7. In paragraph 1, A method for forming a pipeline network, wherein the virtual node is created between disconnected links, and the virtual link is created between disconnected nodes.

8. In paragraph 1, The above pipe connection information is A method for forming a piping network, comprising at least one of material property information and piping information on a piping path within the piping network.

9. A step of determining a pipe tracing start node and an end node in a pipe network by a processor for tracing a pipe path; A step of setting the highest priority object in the visit target list as the current visit node by a processor for tracing the pipeline path; and A 3D pipe path tracking method, comprising a step of generating a pipe tracking result based on the history of the currently visited node by a processor for pipe path tracking.

10. In paragraph 9, The step of setting the highest priority object in the above visit target list as the current visit node is A 3D pipeline path tracing method further comprising the step of adding nodes and costs to the above visit target list.

11. In paragraph 9, The step of setting the highest priority object in the above visit target list as the current visit node is A 3D pipe path tracing method further comprising the step of searching for adjacent nodes of the currently visited node.

12. In paragraph 11, The step of searching for the adjacent nodes of the currently visited node is A 3D pipe path tracking method further comprising a step of checking whether the adjacent node exists and a step of checking whether a node in the visit target list exists.

13. In paragraph 12, A 3D pipe path tracking method, further comprising the step of removing the current visited node from the history of the current visited node if there is no adjacent node to the current visited node.

14. In paragraph 9, The step of setting the highest priority object in the above visit target list as the current visit node is A 3D pipeline path tracking method further comprising a step of comparing a link property type of an adjacent node of the currently visited node with a search condition.

15. In paragraph 9, The step of setting the highest priority object in the above visit target list as the current visit node is A 3D pipe path tracking method further comprising the step of removing the highest priority object set as the currently visited node from the visited target list, and at the same time changing the node at the bottom to the top.

16. In paragraph 9, The step of setting the highest priority object in the above visit target list as the current visit node is A 3D pipe path tracking method, further comprising a step of checking whether the current visited node matches the end node.

17. In paragraph 9, The step of setting the highest priority object in the above visit target list as the current visit node is A 3D pipe path tracking method further comprising a step of checking a search stop condition for the currently visited node.

18. In paragraph 17, A 3D pipe path tracking method, wherein the above search stop condition includes setting the valve or equipment that is encountered n times from the starting point of a specific device, where n is an integer.

19. In paragraph 9, The above piping network includes connection points, nodes and links, A 3D pipeline path tracing method, characterized in that the equipment and accessories within the pipeline network include at least one of a virtual node and a virtual link.

20. In paragraph 19, The virtual node created in the above equipment or accessory A 3D pipe path tracking method, characterized in that the pipe path is expressed as at least one node inside the equipment or accessory.

21. In paragraphs 19 and 20, A 3D pipe path tracking method, characterized in that the virtual links created in the equipment or accessories are all connected to at least one virtual node created inside the equipment.

22. A method for forming a pipe network, A step of extracting information on the center point and collision point of the model of elements constituting the above piping network; and A method for forming a piping network using model information, comprising a step of connecting models of components using information of the above center point and collision point.

23. In paragraph 22, The step of connecting the models of the above components to each other is A step of calculating the distance between the center point of a specific model and the center point of a model adjacent to the specific model; and A method for forming a pipeline network using model information, comprising a step of determining that the specific model and the adjacent model are connected when each of the collision points of the specific model and the adjacent model is within a certain range of the calculated distance, and converting the collision points of the specific model and the adjacent model into connection points.

24. In paragraph 23, The above schedule range is A method for forming a piping network using model information, wherein the distance between the center point of the specific model produced above and the center point of a model adjacent to the specific model is determined by + / - n %, where n is a real number.

25. In paragraph 22, The step of extracting information on the center point and collision point of the model of the elements that constitute the above pipe network is as follows. A method for forming a pipeline network using model information, further comprising a step of extracting identification information contained in a model of elements constituting the pipeline network, wherein the identification information includes at least one of type, size, and transport material.

26. In paragraph 22, The above piping network includes connection points, nodes and links, A method for forming a pipeline network using model information, characterized in that the equipment and accessories within the pipeline network include at least one of a virtual node and a virtual link.

27. In paragraph 26, The virtual node created in the above equipment or accessory A method for forming a piping network using model information, characterized in that the model information is expressed as at least one node inside the above equipment or accessory.

28. In paragraphs 26 and 27, A method for forming a piping network using model information, characterized in that the virtual links created in the equipment or accessories are all connected to at least one virtual node created inside the equipment.

Citation Information

Patent Citations

  • Method and device for optimizing mixed crude oil conveying system between combination stations based on viscosity prediction

    CN116263845A

  • Block extracting method and block altering method for duct

    JP1996292971A

  • System and method for CAD design of collision-free piping routes

    JP2011526389A

  • Joint development system and joint development method of virtual machine piping

    JP2018525738A

  • Silicone-free cosmetic composition for hair improvement

    KR1020230003765A