KR102248977B1 - The automatic piping route generation method of plant engineering - Google Patents

Abstract

The present invention relates to a method for automatically generating three-dimensional pipes in plant engineering, and automatically generates three-dimensional pipes in plant engineering that can automatically generate pipes by forming structures such as tanks and reactors required for pipes, and structures such as pipe racks. As for the method,
In a method for automatically generating 3D pipes in plant engineering for 3D CAD work using a plot plan, P&ID, line list and template data of a device or structure stored in a server, (a) based on the information of the server plot plan Forming three-dimensional CAD basic data set to the coordinates; (b) importing a template of a device or structure from the data of the server, and generating a three-dimensional template of the device or structure according to the characteristics of the plant project; (c) arranging the 3D device or structure generated in step (b) according to the coordinate value of the corresponding area on the plot plan in the 3D CAD basic data in which the coordinates are set; (d) fetching the P&ID and line list data from a server, and matching the pipeline on the P&ID with the coordinates of the device or structure at the starting point and the destination point; (e) designating the coordinates of the starting point and the arrival point of an intermediate structure such as a pipe rack or a building through which the pipeline on the P&ID matched with the coordinates of the starting point and the arrival point of the device or structure passes through the middle; And (f) the coordinates of the starting point and the destination point of the device or structure matched with the pipeline on the P&ID, and a preferred section through which the pipeline on the P&ID passes in the middle, and a three-dimensional pipeline is automatically generated by a certain algorithm. It provides a method for automatically generating three-dimensional pipes of plant engineering, comprising: a step.

Description

The automatic piping route generation method of plant engineering}

The present invention relates to a method for automatically generating three-dimensional piping paths in plant engineering. Three-dimensional piping of plant engineering capable of automatically generating piping paths by forming structures such as tanks and reactors required for piping and structures such as pipe racks. It relates to the automatic generation method.

Plant Engineering is designed through 3D CAD modeling to satisfy the design conditions and design requirements given in all fields (process, piping, electricity, instrumentation, air conditioning, structure, civil engineering) for the construction of large-scale plants.

In the early stages of commercialization of 3D CAD tools, various classifications of modeling data were not made, so they were simple, but as the technology of the engineering industry gradually developed and the system design was detailed according to the development, it was used for systematic management of modeling data. Methods are being added. However, due to the structural problem of the basic 3D CAD tool, the unmanageable part occurred, and in addition, new products were developed to ensure the increased eye level of the business owner and the ease of use of the end-user using the 3D CAD tool. Basically, the modeling data is the basis for the generation of plant engineering deliverables within each 3D CAD tool.

However, in the conceptual design and estimating stages performed at the beginning of the plant project, there have been inaccuracies in estimates, such as drawing by hand by a design engineer or making an estimate by imitating a similar project to create data for volume calculation. As a result, there have been various problems, such as miscalculation of the total estimated cost of the project, resulting in a lot of losses due to the execution of the project.

Therefore, for the successful execution of the plant project, it is necessary to propose a plan to more accurately calculate the conceptual design and the estimated amount of the entire plant. To this end, the appropriateness of the device arrangement based on the basic data provided by the business owner. It is necessary to automatically calculate the quantity by drawing a schematic 3D design drawing based on the reviewed PLOT PLAN and P&ID (Piping and Istrument Diagram).

Unexamined Patent Publication No. 2002-0011677 (published on Feb. 9, 2002) Registered Patent Publication No. 10-1794282 (registered on October 31, 2017)

In order to solve the above problems, the present invention provides a method for automatically generating a three-dimensional piping path of plant engineering capable of automatically generating a three-dimensional pipeline based on a plot plan review and P&ID.

In order to achieve the above object, the present invention is a method for automatically generating a three-dimensional piping route of plant engineering for a three-dimensional CAD operation using a plot plan, a P&ID, a line list stored in a server, and a template data of a device or structure, (a) constructing a plot plan by modeling a device or structure and storing it in a server; (b) forming 3D CAD basic data in which coordinates are set based on information on the plot plan of the server; (c) importing a template of a device or structure from the data of the server and generating a template of a three-dimensional device or structure according to the characteristics of the plant project; (d) arranging the 3D device or structure generated in step (c) according to the coordinate value of the corresponding area on the plot plan on the 3D CAD basic data in which the coordinates are set; (e) retrieving the P&ID and line list data from a server and matching the pipeline on the P&ID with the coordinates of the device or structure at the starting point and the destination point; (f) designating the coordinates of the starting point and the arrival point of a preferred section such as a pipe rack or a building through which the pipeline on the P&ID matched with the coordinates of the starting point and the destination point of the device or structure passes through the middle; And (g) a three-dimensional pipeline is automatically generated by a certain algorithm along the coordinates of the starting point and the destination point of the device or structure matched with the pipeline on the P&ID and the preferred section through which the pipeline on the P&ID passes in the middle. It provides a method for automatically generating three-dimensional piping paths of plant engineering, comprising:

In the present invention, (h) the step of calculating the quantity of the pipeline generated by a certain algorithm; characterized in that it further includes.

In the step (g), in which a three-dimensional pipeline is generated according to a certain algorithm in the present invention, a square grid map is formed, and along the grid map, in a straight line and orthogonal direction of [X], [Y], [Z]. It is characterized in that it is generated according to the JPS (Jump Point Search) algorithm that only moves.

The JPS algorithm modified in the present invention, (g-1) searches in the directions of [+X], [+Y], [+Z], [-X], [-Y] and [-Z] at the starting point. Finding a first jump point while proceeding; (g-2) inputting a sequence number to the first jump point found in the search process, and writing and storing G, H, F, and P values for each sequence in an open list; (g-3) [+X], [+Y], [+Z], [-X], [-Y] sequentially from the jump point with the smallest F value among the first jump points found in the search process. Finding a second jump point while searching in the] and [-Z] directions; (g-4) inputting a sequence number to the second jump point found in the search process, and writing and storing G, H, F, and P values for each sequence in an open list; (g-5) [+X], [+Y], [+Z], [-X], [-Y] sequentially from the jump point with the smallest F value among the second jump points found in the search process. Finding a third jump point while searching in the] and [-Z] directions; (g-6) sequentially searching the process of finding the jump point from the jump point having the smallest F value until the arrival point is reached, and finding the nth jump point; (g-7) inputting a sequence number to the nth jump point found in the search process, and writing and storing G, H, F, and P values for each sequence in an open list; And (g-8) completing a path while following the P value designated for the smallest F value.

In the present invention, when bending occurs in progress from the k-1 th jump point to the k th jump point, a bending penalty is added to the G value of the k th jump point. However, the k is an integer of 2 to n.

In the present invention, when it is necessary to go through the preferred section, the starting point of the preferred section is regarded as an intermediate arrival point, and the jump point is searched in the same manner as above, and when the search for the intermediate destination point of the preferred section is completed, the preferred section It is characterized in that the intermediate arrival point of is an intermediate starting point and a jump point is searched up to the arrival point.

The present invention has the advantage of automatically generating a pipeline based on the plot plan and P&ID, and automatically calculating the quantity related to piping based on the generated pipeline, so that the estimated quantity with high accuracy can be calculated. There is this.

In addition, since the present invention creates a 3D CAD drawing in advance, there is an advantage in that it is possible to drastically reduce the time spent on designing a detailed design drawing based on the created drawing.

In addition, the JPS algorithm according to the present invention has the advantage that it is much faster than the ^{conventional A *} algorithm because it is not necessary to search all nodes to find the shortest distance, so that the pipeline generation speed is fast.

In addition, the JPS algorithm according to the present invention has the advantage of being able to create various types of piping paths since it is possible to set a preferred section that must be passed through.

1 is a diagram showing an example of a view control on U/I according to the present invention.
2 is a diagram showing the creation of a template of devices and structures on U/I according to the present invention.
3 shows a tower which is an example of an apparatus according to the invention.
4 shows a heat exchanger which is an example of an apparatus according to the invention.
5 shows a tank which is an example of a device according to the invention.
6 is a view showing a pipe rack which is an example of a structure according to the present invention.
7 is a view showing a building that is an example of a structure according to the present invention.
Fig. 8 is a view in which devices and structures are arranged on U/I according to the present invention.
9 is a plan view (a) of the arrangement of the device and structure of FIG. 8 and a plan view (b) of the arrangement of the device and structure in a state in which a pipeline is created.

Hereinafter, embodiments of the present invention in which the above object can be realized in detail will be described in detail with reference to the accompanying drawings. In describing the present embodiments, the same names and symbols are used for the same components, and additional descriptions thereof will be omitted.

1 is a diagram showing an example of view control on U/I according to the present invention, FIG. 2 is a diagram showing generation of a template of a device and structure on U/I according to the present invention, and FIG. 3 is FIG. 4 is a view showing a tower which is an example of an apparatus according to the present invention, and FIG. 4 is a view showing a heat exchanger which is an example of an apparatus according to the present invention, and FIG. 5 is a view showing a tank which is an example of an apparatus according to the present invention, and FIG. 6 is a view showing a pipe rack, which is an example of a structure according to the present invention, FIG. 7 is a view showing a building that is an example of a structure according to the present invention, and FIG. 8 is a device and structure on U/I according to the present invention. FIG. 9 is an arrangement plan view (a) of the device and structure of FIG. 8 and an arrangement plan view (b) of the device and structure in a state in which a pipeline is created.

The method for automatically generating 3D pipes in plant engineering according to the present invention uses a plot plan, P&ID, line list, and template data of a device or structure stored in a server. A method for automatically generating a three-dimensional pipe includes the steps of: (a) modeling a device or structure to construct a plot plan and store it in a server; (b) forming 3D CAD basic data in which coordinates are set based on information on the plot plan of the server; (c) importing a template of a device or structure from the data of the server and generating a template of a three-dimensional device or structure according to the characteristics of the plant project; (d) arranging the 3D device or structure generated in step (c) according to the coordinate value of the corresponding area on the plot plan on the 3D CAD basic data in which the coordinates are set; (e) retrieving the P&ID and line list data from a server and matching the pipeline on the P&ID with the coordinates of the device or structure at the starting point and the destination point; (f) designating the coordinates of the starting point and the arrival point of a preferred section such as a pipe rack or a building through which the pipeline on the P&ID matched with the coordinates of the starting point and the destination point of the device or structure passes through the middle; And (g) a three-dimensional pipeline is automatically generated by a certain algorithm along the coordinates of the starting point and the destination point of the device or structure matched with the pipeline on the P&ID and the preferred section through which the pipeline on the P&ID passes in the middle. Step; consists of. In addition, (h) the step of calculating the quantity of water for the generated pipeline may be further included.

First, (a) modeling a device or structure, constructing a plot plan, and storing it in the server. Prior to implementing the plant project, the employer transmits relevant data on the arrangement of the plant's equipment and structures. In addition, the business owner first prepares a plot plan and sends a schematic diagram of the device arrangement. Based on the data sent, it is reviewed whether the arrangement of devices and structures is appropriate. In many cases, devices and structures need to be kept at a certain distance in accordance with fire fighting regulations. The separation distance between these devices and structures is reviewed, and based on the reviewed data, a plot plan is constructed and stored in the server.

Next, (b) 3D CAD basic data in which coordinates are set based on the information of the plot plan of the server is formed. The server may be a storage medium connected through a network or a storage medium of a computer itself. The server stores the PLOT PLAN, P&ID (Piping & Instrument Diagram), and line list, which have been reviewed for proper arrangement of devices based on data provided by the plant project owner. The plot plan refers to a drawing showing the overall layout of the plant. The plot plan consists of a plant's tower, pump, reactor, drum, vessel, etc., as well as structures and control rooms for maintaining pipe racks and devices. This is a drawing of the same building as the control room. Drawings for plant engineering are created based on the plot plan, and pipelines through which fluid can move are connected between devices arranged on the plot plan. Since the plot plan is a layout drawing, the coordinates are determined. First, the coordinates for creating the drawing are set. 1 shows the view control screens (D, D') in which coordinates on the U/I screen are set. The user can set the coordinates in U/I and view the display screen within the set coordinates by reducing (D') or expanding (D) it.

Next, (c) the template of the device or structure is fetched from the server data, and a three-dimensional device or structure template is generated according to the characteristics of the plant project. As shown in Fig. 2, the coordinates and sizes of the template are input, and a three-dimensional device or structure template (T) is generated by matching each device and structure to the project of the plant.

Next, (d) the 3D device or structure generated in step (c) is arranged in the 3D CAD basic data for which the coordinates are set according to the coordinate values of the corresponding area on the plot plan. Devices or structures are arranged according to the coordinate values of the corresponding area in the 3D CAD basic data for which coordinates are set. 3 is a view in which a tower is disposed, FIG. 5 is a view in which a heat exchanger is disposed, FIG. 5 is a view in which a tank is disposed, and FIG. 6 is a pipe rack It is a ruled surface, and FIG. 7 is a view in which a building such as a control room is arranged. Each device and structure is connected or passed through a pipeline, so each device has a starting point and an end point of the pipeline.

Next, (e) P&ID and line list data is retrieved from the server, and each pipeline on the P&ID goes through the step of matching the coordinates of the device or structure at the starting point and the destination point. The P&ID is a drawing of a pipeline and an instrumentation line. In addition to the pipeline, equipment such as valves, flanges, and control valves are included between the pipelines. It retrieves the P&ID and line list data stored in the server and matches the coordinates of the device or structure of the starting point and the destination point of the pipeline. It is to match where the pipeline starts and where it goes, and to allow the pipeline to be automatically created.

Next, (f) the coordinates of the starting and ending points of intermediate structures such as pipe racks or buildings passing through the pipeline on the P&ID matched with the coordinates of the starting and ending points of the device or structure are designated. In general, when a pipeline is connected from one device to another, a pipe rack is mainly used. Therefore, a pipe rack can be selected as a preferred section. The coordinates of the starting and ending points of the pipe rack must be specified accordingly.

Next, (g) a pipeline is automatically generated according to an algorithm along the coordinates of the starting point and the destination point of the device or structure matched with the pipeline on the P&ID and the preferred section through which the pipeline on the P&ID passes in the middle. When the pipelines on the P&ID are matched, a three-dimensional pipeline is created according to a certain algorithm. The step of creating a three-dimensional pipeline is to form a square grid map and move along the grid map in a straight line and orthogonal direction of [X], [Y], [Z] only. A ^* algorithm is generated according to the modified JPS (Jump Point Search) algorithm.

The JPS algorithm is (g-1) while searching in the directions of [+X], [+Y], [+Z], [-X], [-Y] and [-Z] which are linear directions from the starting point. Finding a first jump point; (g-2) inputting a sequence number to the first jump point found in the search process of step (g-1), and writing and storing G, H, F, and P values for each sequence in an open list; (g-3) [+X], [+Y], [+Z] sequentially from the jump point with the smallest F value among the first jump points found in the search process in step (g-1). Finding a second jump point while searching in the directions of ], [-X], [-Y] and [-Z]; (g-4) inputting a sequence number to the second jump point found in the search process of step (g-3), and writing and storing G, H, F, and P values for each sequence in an open list; (g-5) [+X], [+Y], [+Z] sequentially from the jump point with the smallest F value among the second jump points found in the search process of step (g-2). Finding a third jump point while searching in the directions of ], [-X], [-Y] and [-Z]; (g-6) sequentially searching the process of finding the jump point from the jump point having the smallest F value until the arrival point is reached, and finding the nth jump point; (g-7) inputting a sequence number to the nth jump point found in the search process of step (g-6), and writing and storing G, H, F, and P values for each sequence in an open list; And (g-8) completing a path by following the P value specified in the smallest F value.

The JPS algorithm applied to the present invention will be described in detail.

In general, the A ^* algorithm refers to an algorithm that finds the shortest path from a given starting point to an ending point. Here, in order to represent the dots as a grid map, each grid (square) will be referred to as a node. In order to search for the optimal route from the starting point to the destination point, the evaluation function for each starting point and the arrival point should be defined. The evaluation function F is expressed as follows.

F = G + H

Here, G denotes the path weight required to move along the path from the starting node to the current node. H is the estimated path weight from the current node to the destination node. Since the modified A algorithm according to the present invention moves only in a straight line and a right angle direction, one square has one node value, and this value is expressed as 1. The variable P (Parent) not shown here means the parent node.

The JPS algorithm applied to the present invention also searches for a jump point and stores it in an open list, and when a new jump point is searched by re-searching at the searched jump point, the re-searched jump point is a closed list ( Closed List), by searching the jump points sequentially based on the jump point and searching for the smallest F value, the shortest path is found. When the destination node is found, the parent node (P) of the smallest F value is connected to each other. It is connected, and the parent node (P) of the smallest F value is connected to become the shortest path.

Rules for determining pruning rules and jump points according to the JPS algorithm according to the present invention are as follows.

[Pruning Rules]

For node "x" arriving from node "p", "n", which is a neighboring node of "x" corresponding to the following, is removed.

1. There is a path P_n = <p, y, n> or <p, n> shorter than the path P_x = <p, x, n>.

The meaning above means that nodes that do not have to go through "x" will not be considered in the path going through "x".

[Jump Point]

In order for the node "y" with [y = x + kd] to be the jump point of "x", k must be minimized and one of the following conditions must be satisfied.

1. y is an end node.

2. y has at least one forced neighbor. The forced neighbor refers to a node that is not pruned among neighboring nodes of node "x" and is not a natural neighbor. Natural neighbor refers to a node that is not pruned among neighboring nodes of node'x' when there is no obstacle.

[Bending condition]

In order to consider bending, certain conditions are as follows.

1. A certain cost penalty is applied to the bending section. That is, a certain penalty is applied to the G value of a node in a bending section, so that a node with relatively little bending is searched.

2. Nodes with the same coordinates as the end node are determined as jump points.

3. When an invalid node (ex. an obstacle or part that goes out of the grid) is searched, the previous node is recognized as a jump point.

Hereinafter, Embodiment 1 of automatically generating the shortest distance using the JPS algorithm will be described with reference to the drawings.

[Example 1]

Search is performed on the grid map of Example 1. The path from node "S" which is the starting node to node "E" which is the destination node must be completed.

[Example 2]

Example 2 is a state of searching in the [+Y] and [-X] directions at the "S" node. In both directions, it was determined as a jump point by encountering an invalid node, which is an obstacle during the main search.

[Example 3]

Figure 3 is a view showing the storage of the jump points of the "S" node in an open list (Open List). It has values for G, H, F, and Parent(P) of the corresponding nodes. If you calculate each value,

The G value of the "1" node moved three spaces and the value of one space was defined as 1, so it is 3, and the H value is 12 because it is the expected distance to the "E" node regardless of obstacles, so the F value is G + H It becomes 15, and the parent node becomes "S".

The G value of the "2" node is 5 because it has moved 5 spaces, and the H value is 10 because it is the remaining distance to the "E" node, so the F value is G + H, which is 15, and the parent node is "S". .

[Example 4]

Example 4 is a process of subtracting a node with a small F value from an open list. In Example 4, the F values of the two nodes are the same, and the first node "1" is removed to prepare for discovery.

[Example 5]

Fig. 5 shows a state where a jump point is found during a search in the [-X] direction in a node "1". Nodes marked "F" are forced neighbors. With this forced neighbor, we found the jump point in the [-X] direction.

[Example 6]

Example 6 shows that the node "3", which is the jump point found in the node "1", is stored in an open list. At this time, since the node "3" has bending at the node "1", 1 is added to the G value as a bending penalty. The node "1" is returned to the Closed List because the search for the jump point has been completed. Therefore, the value of the "1" node is not visible.

[Example 7]

Example 7 shows a state in which the node "2" with the smallest F value is removed from the open list to prepare for search.

[Example 8]

Example 8 shows a state in which a search is performed at node "2". I found a jump point because I had a neighbor forced from the [+Y] direction.

[Example 9]

9 is a view of storing node “5”, which is a jump point of node “2”, in an open list. Similarly, I added 1 to the value of G as a bending penalty.

[Example 10]

Exemplary FIG. 10 shows that the node "3", which came first from the open list, is taken out and prepared for search.

[Example 11]

Example 11 shows a state of searching in the directions [+Y], [-Y], and [-X] at the node "3".

[Example 12]

12 illustrates that node "6" becomes a forced neighbor, and nodes "7" and "8" become jump points because they meet an invalid node. Those nodes are saved in the open list.

[Example 13]

Fig. 13 shows that node "5" is taken out of the open list and prepared for search.

[Example 14]

Example 14 shows that the "5" node is searching in each direction.

[Example Figure 15]

Fig. 15 shows that nodes "9" and "11" become jump points because they meet a forced neighbor, and node "10" encounters an invalid node. Each node corresponding to the jump point is saved in the open list.

[Example 16]

Fig. 16 shows that the node "8" having the smallest F value is taken out to prepare for search. In the search in node "8", the jump points in node "8" are not saved in the open list because all nodes "5", "1", and "2" that have already performed the search come out as jump points.

[Example Figure 17]

FIG. 17 shows that the F value is the smallest, and the node "6" that came in first is taken out from the open list to prepare for search.

[Example Figure 18]

Example 18 shows a state in which a search is performed in each direction at node "6".

[Example Figure 19]

19 illustrates that nodes "12" and "11" become a jump point because they meet a forced neighbor, and a node "10" encounters an invalid node. The jump points are saved in the open list. The previously searched "10" node whose parent node (P) is "5" has an F value of 27, and the currently searched "10" node whose parent node (P) is "6" has an F value of 26. The value is smaller. Conversely, a node "11" whose parent node is "5" has a smaller F value than a node "11" whose parent node is "6".

[Example 20]

In example 20 It shows that when a duplicate node is entered in the open list, the node with a small F value is updated. As a result of searching for node "6", it can be seen that the parent node of node "10" has changed.

[Example Figure 21]

Example 21 shows a state in which node "11" is taken out of the open list and prepared for search.

[Example 22]

Exemplary Figure 22 shows a state of searching in each direction at the "11" node.

[Example 23]

In Example 23, since node "13" encountered node "E" during search, and node "14" reached the same node as the [X] coordinate of node "E", node "15" was an invalid node. It shows that it became a jump point because I met him. Those nodes are saved in the open list.

[Example 24]

Example 24 shows that node "14" is pulled out of the open list and prepared for discovery.

[Example 25]

Example 25 shows that a search is performed at node "14".

[Example 26]

Example 26 shows that the node "E" was searched as a jump point. In this case, the destination node has been detected, so Route search is stopped.

[Example Figure 27]

In Example 27, it is shown that the shortest path is formed because the arrival node is found. The path is completed by following the parent node from the destination node. The shortest path was completed along the paths "E"-"14"-"11"-"5"-"2"-"S".

[Example Figure 28]

The figure on the left of Fig. 28 is the shortest path completed to a path to which a jumping point determination criterion was added to reduce bending and a bending penalty was applied. The right side is a path searched by the JPS algorithm when a bending penalty is not given. As illustrated in FIG. 28, it can be seen that the number of bending times is reduced.

Hereinafter, a second embodiment of the JPS algorithm in which the preferred section must be passed will be described with reference to the drawings. Example 2 is for the case of passing through the preferred section. In general, when pipe routing, there is a space where pipes must always pass, such as a pipe rack. You must navigate through these spaces. In this embodiment, a description will be made on how to consider such a preferred space.

In Figure 29, Figure 35 shows that the JPS algorithm does not consider the preferred interval.

[Example Figure 29]

Figure 29 is a grid map (Gird Map) for explaining the failure to consider the preferred interval. The blue node is the departure node, the "E" node is the arrival node, and the node marked in red is a node that is a preferred section such as a pipe rack.

[Example 30]

Example 30 shows that the search is performed in the starting node. "1" and "2" node was jumping points (Jump Point) to discover neighbors forced (forced neighbour).

[Example Figure 31]

Example 31 shows that a search is performed in a node "1" having a small F value. Since node "3" has a forced neighbor, it became a jump point.

[Example 32]

Example 32 shows that a search is performed in a node "3" having a small F value. Node "4" became a jump point due to a forced neighbor.

[Example Figure 33]

Figure 33 shows that a search is performed at node "4". Node "5" becomes a jump point because it reaches the end node during further search from node "5". Even in this process, the "2" node that can reach the preferred section is not considered.

[Example Figure 34]

FIG. 34 shows that a search is performed at node "5". As shown in the figure, an end node became a jump point.

[Example Figure 35]

Example 35 shows that each parent node is connected to form the shortest distance, and the path is completed without passing through the preferred section.

To solve the above problems, one method is proposed.

A path through the departure node-the preferred section node, and the preferred section node-the arrival node is formed to go through the intermediate structure. In other words, it is a method to always pass as a stopover with the intermediate structure that must be passed as a preference region. The following is an example of the search process applying the method.

[Example 36]

36 illustrates a path through a preferred area.

The first figure in the upper left of Figure 36 is a grid map to perform a search. Similarly, the preference region is marked in red.

In the second figure on the upper right of Fig. 36, the arrival node ("E" node) is temporarily deactivated (it turns gray), and the node close to the departure node ("S" node) among the nodes in the preferred area is a new arrival node ( "E" node).

The third figure on the lower left of Fig. 36 is a search process to a new arrival node. Nodes "1" and "2" became jump points.

The path to the new arrival node is completed in the fourth figure in the lower right of Figure 36.

[Example Figure 37]

The first figure in the upper left of Figure 37 shows that the start node ("S" node) is deactivated and the node of the reached preferred area is made a new start node. Activate the destination node that was deactivated in the previous step. Now, a route search is performed with the new departure node and the existing arrival node.

The second figure in the upper right of Figure 37 is a path search process from a new departure node to an existing arrival node. Node "3" became a jump point because it met the End Node during the further search.

The third figure on the lower left of Figure 37 shows a state in which a search is performed at node "3". From node "3", we reached the end node

In the fourth figure on the lower right of Fig. 37, it is shown that a path passing through a preference region is obtained.

Hereinafter, Example 3 in which the JPS algorithm is applied in the Z-axis direction will be described.

Example 38 shows the application of the JPS algorithm to 3D. Applying the JPS algorithm to 3D proceeds by searching the X_Y plane, moving in the Z direction, and then searching the X_Y plane there. The figure below shows an example.

[Example Figure 38]

Example 38 shows a 3D grid map in which X_Y_Z is 5 X 5 X 3. The starting node is indicated in blue, and the following figure shows the search process.

[Example 39]

Example 39 shows a state in which a search is performed in the X_Y plane where Z=2 in which the starting node is located. It proceeds in the same manner as the search for the linear and orthogonal moves described above. In Figure 39, since X_Y_Z is 5 X 5 X 3, there is one grid in the Z direction between Z = 1 and Z = 2 and Z = 2 and Z = 3, but Z = 1 is 1 grid rather than Z = 2 Explain that is located below and Z=3 is located one grid above Z=2.

[Example 40]

Example 40 shows a state in which a search is performed in the corresponding X_Y plane by moving to a place where Z=3. When there is a node determined as a jump point in the X_Y plane with Z=3, the yellow node is returned as a jump point. Because it is to find the jump point of the starting node marked in blue, the yellow node is jumped. It will be returned in points.

[Example Figure 41]

Illustrative Figure 41 shows a state in which a search is performed in the corresponding X_Y plane by moving to a place where Z=1.

Fig. 8 shows that a tower, a tank, a heat exchanger and a pipe rack, which is a preferred section, are created. 9 shows a state in which pipes are automatically generated using the JPS algorithm described above. In Fig. 9(a), each device is expressed in the X_Y plane, and in Fig. 9(b), it starts from the tower 11, which is the starting node, passes through the pipe rack 44, which is the preferred section, and the heat exchanger ( 12) shows that the pipeline P is created.

In the case of using the JPS algorithm as described above, there is an advantage in that the speed is higher than ^{that of the conventional A * algorithm, since all nodes need only be searched without determining all nodes.}

As described above, the present invention is capable of various modifications, and has been described with reference to preferred embodiments of the present invention, but the present invention is not limited to these embodiments, and the technical field to which the present invention belongs in the claims and detailed description of the present invention. Techniques that can be modified and used by those of ordinary skill in the art will naturally be considered to be included in the technical scope of the present invention.

11: tower 12: heat exchanger
13: tank 14: pipe rack
D: U/I view control screen P: Pipeline
T: template

Claims (6)

In a method for automatically generating 3D piping paths of plant engineering for 3D CAD work using plot plans, P&IDs, line lists stored in a server, and template data of devices or structures,
(a) constructing a plot plan by modeling a device or structure and storing it in a server;
(b) forming 3D CAD basic data in which coordinates are set based on information on the plot plan of the server;
(c) importing a template of a device or structure from the data of the server and generating a template of a three-dimensional device or structure according to the characteristics of the plant project;
(d) arranging the 3D device or structure generated in step (c) according to the coordinate value of the corresponding area on the plot plan on the 3D CAD basic data in which the coordinates are set;
(e) retrieving the P&ID and line list data from a server and matching the pipeline on the P&ID with the coordinates of the device or structure at the starting point and the destination point;
(f) designating the coordinates of the starting point and the arrival point of a preferred section such as a pipe rack or a building through which the pipeline on the P&ID matched with the coordinates of the starting point and the destination point of the device or structure passes through the middle;
(g) A square grid map is formed along the coordinates of the starting point and the destination point of the device or structure matched with the pipeline on the P&ID and the preferred section that the pipeline on the P&ID passes through in the middle, and follows the grid map [X Automatically generating a three-dimensional pipeline according to a JPS (Jump Point Search) algorithm that moves only in straight and orthogonal directions of ], [Y], [Z]; And
(h) calculating the quantity of the pipeline generated by the JPS algorithm; includes,

The JPS algorithm,
(g-1) The first jump point while searching in the directions [+X], [+Y], [+Z], [-X], [-Y] and [-Z] from the starting point Finding Point); (g-2) inputting a sequence number to the first jump point found in the search process of step (g-1), and writing and storing G, H, F, and P values for each sequence in an open list; (g-3) [+X], [+Y], [+Z], [[+X], [+Y], [+Z], [ Finding a second jump point while searching in the directions -X], [-Y] and [-Z]; (g-4) inputting a sequence number to the second jump point found in the search process of step (g-2), and writing and storing G, H, F, and P values for each sequence in an open list; (g-5) [+X], [+Y], [+Z], [[+X], [+Y], [+Z], [ Finding a third jump point while searching in the directions -X], [-Y] and [-Z]; (g-6) sequentially searching the process of finding the jump point from the jump point having the smallest F value until the arrival point is reached, and finding the nth jump point; (g-7) inputting a sequence number to the nth jump point found in the search process of step (g-6), and writing and storing G, H, F, and P values for each sequence in an open list; And (g-8) completing a path while following the P value specified in the smallest F value,

When bending occurs in progress from the k-1 th jump point to the k th jump point among the first to n th jump points, a bending penalty is applied to the G value of the k th jump point. Is added (however, k is an integer of 2 to n),

When it is necessary to go through the preferred section, the starting point of the preferred section is regarded as an intermediate arrival point, and the jump point is searched in the same manner as above, and when the search for the intermediate destination point of the preferred section is completed, the middle of the preferred section The method of automatically generating a three-dimensional piping path of plant engineering, characterized in that the arrival point becomes an intermediate starting point and a jump point to the arrival point is searched. delete delete delete delete delete

Images