Construction plan making device, construction plan making method, and construction plan making program

Abstract

To improve the accuracy of a construction plan for piping work, while reducing the time required for making the construction plan.SOLUTION: A construction plan making device 10 comprises: an acquisition unit 101 that acquires piping work information including a piping work drawing that is a drawing of piping work and piping specifications that are specifications of piping; a processing unit 102 that constructs a digraph on the basis of the piping work drawing and piping specifications; a plan making unit 103 that makes a construction plan corresponding to the piping work by conducting a search in the digraph on the basis of a mathematical algorithm; an evaluation unit 104 that calculates an evaluation value of the construction plan; and an output unit 105 that outputs one or more construction plans and evaluation values of the construction plans obtained through a search process.SELECTED DRAWING: Figure 2

Description

[Technical Field]

[0001] The disclosed technology relates to a construction planning device, a construction planning method, and a construction planning program. [Background technology]

[0002] Planning a construction project requires a high level of expertise and experience, as it is necessary to create a feasible plan that takes into account the combination of machinery, labor, and materials, and that has a high utilization rate.

[0003] Currently, in the field of building construction, construction planning methods using heuristics such as genetic algorithms are being attempted (see, for example, Non-Patent Document 1). These algorithms input information such as drawings and specifications as explanatory variables, and select a solution with a good evaluation value from among solutions that satisfy constraint conditions.

[0004] In recent years, there have also been cases where the layout of water pipes has been optimized using reinforcement learning (see, for example, Non-Patent Document 2).

[0005] Furthermore, Non-Patent Document 3 discloses a guide for drafting a pipework construction plan as an administrative document. [Prior art documents] [Non-patent literature]

[0006] [Non-Patent Document 1] Construction scheduling using Genetic Algorithm based on Building Information Model, https: / / dl.acm.org / doi / abs / 10.1016 / j.eswa.2014.05.047 [Non-patent document 2] Automatic Design Method of Building Pipeline Layout Based on Deep Reinforcement Learning. https: / / arxiv.org / abs / 2305.10760 [Non-patent document 3] Otsu City Enterprise Bureau Construction Plan Preparation Guide (Draft) (Plumbing Work Edition) (Revised April 2019), https: / / www.city.otsu.lg.jp / soshiki / 080 / 2822 / g / koji / 23531.html Summary of the Invention [Problem to be solved by the invention]

[0007] However, in the case of pipe construction, including water pipe installation, there is no standardized construction planning process, so plans are currently drawn up manually, taking into account the geographical and environmental conditions of each site, and this requires a lot of man-hours. Furthermore, because construction sites are constantly changing due to factors such as the skill level of workers and weather conditions, knowledge from previous projects cannot be fully applied to the next project, and construction management requires flexible review of construction plans. As such, drawing up construction plans requires a huge amount of time and effort, making it more efficient.

[0008] The technology described in Non-Patent Document 1 above has the ability to derive solutions relatively efficiently to complex problems that require a large amount of calculation and cannot be solved by mathematical algorithms with theoretical guarantees, but there are no examples of similar technology being applied to the field of pipework.Pipework differs from building construction in that the layout of pipes, the complexity of connections, and geographical conditions are different, so algorithms used in building construction cannot be applied directly to pipework.

[0009] Furthermore, in the technology described in Non-Patent Document 2, the current situation is that the formulation of construction plans is left to manual planning. Furthermore, Non-Patent Document 3 describes work procedures, safety management, etc., but does not describe guidelines for formulating construction procedures.

[0010] The disclosed technology has been developed in consideration of the above points, and aims to provide a construction planning device that can improve the accuracy of construction plans while shortening the time required to plan construction plans for pipe work. [Means for solving the problem]

[0011] In order to achieve the above-mentioned object, a construction planning device according to one embodiment of the present disclosure includes an acquisition unit that acquires pipe work information including pipe work drawings, which are drawings of pipe work, and pipe specifications, which are pipe specifications, and a processing unit that constructs a directed graph based on the pipe work drawings and the pipe specifications included in the pipe work information.

[0012] In one aspect of the present disclosure, a construction planning method is provided in which a construction planning device acquires pipe work information including pipe work drawings, which are drawings of pipe work, and pipe specifications, which are pipe specifications, and constructs a directed graph based on the pipe work drawings and the pipe specifications included in the pipe work information.

[0013] A construction planning program according to one aspect of the present disclosure causes a computer to function as each unit included in the construction planning device. [Effects of the Invention]

[0014] The disclosed technology has the effect of reducing the time required to formulate a construction plan for pipework while improving the accuracy of the construction plan. [Brief explanation of the drawings]

[0015] [Figure 1] 1 is a block diagram illustrating an example of a hardware configuration of a construction plan planning device according to an embodiment. [Figure 2] 1 is a block diagram illustrating an example of a functional configuration of a construction plan planning device according to an embodiment. [Figure 3] 10 is a flowchart showing an example of a processing flow by a construction plan planning program according to the embodiment. [Figure 4]FIG. 1 is a diagram showing an example of a pipework drawing. [Figure 5] FIG. 2 is a diagram showing an example of the specifications and number of construction machines and the specifications and number of transport vehicles. [Figure 6] (A) is a diagram showing an example of working efficiency, and (B) is a diagram showing an example of pipe specifications. [Figure 7] FIG. 10 is a diagram showing an example of a directed graph constructed from pipe construction drawings and pipe specifications. [Figure 8] FIG. 1 is a diagram illustrating a mathematical algorithm having a depth-first search function or a breadth-first search function. [Figure 9] FIG. 10 is a diagram illustrating a mathematical algorithm having a search function. DETAILED DESCRIPTION OF THE INVENTION

[0016] An example of an embodiment of the disclosed technology will be described below with reference to the drawings. Note that in each drawing, the same or equivalent components and parts are given the same reference numerals. Also, the dimensional proportions in the drawings are exaggerated for the convenience of explanation and may differ from the actual proportions.

[0017] First, with reference to FIG. 1, the hardware configuration of a construction plan planning device 10 according to this embodiment will be described.

[0018] FIG. 1 is a block diagram showing an example of the hardware configuration of a construction plan planning device 10 according to this embodiment.

[0019] 2, the construction plan planning device 10 includes a CPU (Central Processing Unit) 11, a ROM (Read Only Memory) 12, a RAM (Random Access Memory) 13, a storage 14, an input unit 15, a display unit 16, and a communication interface (I / F) 17. Each component is connected to each other via a bus 18 so as to be able to communicate with each other.

[0020] The CPU 11 is a central processing unit that executes various programs and controls each part. That is, the CPU 11 reads a program from the ROM 12 or the storage 14 and executes the program using the RAM 13 as a work area. The CPU 11 controls each of the above components and performs various arithmetic processing in accordance with the program stored in the ROM 12 or the storage 14. In this embodiment, the ROM 12 or the storage 14 stores a construction plan planning program for executing the construction plan planning process.

[0021] The ROM 12 stores various programs and various data. The RAM 13 temporarily stores programs or data as a working area. The storage 14 is configured with an HDD (Hard Disk Drive) or SSD (Solid State Drive) and stores various programs including the operating system and various data.

[0022] The input unit 15 includes a pointing device such as a mouse and a keyboard, and is used to input various information to the device itself.

[0023] The display unit 16 is, for example, a liquid crystal display, and displays various information. The display unit 16 may also function as the input unit 15 by adopting a touch panel system.

[0024] The communication interface 17 is an interface for the device itself to communicate with other external devices. For this communication, a wired communication standard such as Ethernet (registered trademark) or FDDI (Fiber Distributed Data Interface) or a wireless communication standard such as 4G, 5G, or Wi-Fi (registered trademark) is used.

[0025] The construction plan planning device 10 according to this embodiment is implemented by a general-purpose computer such as a server computer or a personal computer (PC).

[0026] Next, the functional configuration of the construction plan planning device 10 will be described with reference to FIG.

[0027] FIG. 2 is a block diagram showing an example of the functional configuration of the construction plan planning device 10 according to this embodiment.

[0028] 2, the construction plan planning device 10 has, as its functional components, an acquisition unit 101, a processing unit 102, a planning unit 103, an evaluation unit 104, and an output unit 105. Each functional component is realized by the CPU 11 reading out a construction plan planning program stored in the ROM 12 or the storage 14, expanding it in the RAM 13, and executing it.

[0029] The acquisition unit 101 acquires pipework information, including pipework drawings and pipe specifications. A "pipe" here refers to a relatively long object with a relatively hard or elastic exterior, a hollow interior, and at least one open end. Examples of pipes include water pipes, gas pipes, and underground pipes. A pipework drawing is a diagram of the pipework, and pipe specifications are the specifications of the pipe. Note that "specifications" refer to various elements such as the dimensions and weight of an object, as well as various elements of the object's performance. The pipework information may further include, for example, the specifications and number of construction machines, the specifications and number of transport vehicles, the work rate, and construction conditions. Note that "work rate" is a numerical representation of the labor (manpower) required to perform a certain task.

[0030] The processing unit 102 constructs a directed graph based on the pipe work drawings and pipe specifications included in the pipe work information acquired by the acquisition unit 101. Specifically, the processing unit 102 constructs a directed graph in which manholes are represented as nodes and pipes are represented as edges based on the pipe work drawings and pipe specifications, and the direction of the edges is set based on the buried depth of the pipes. The processing unit 102 also sets the construction time required for each edge and node using the specifications and number of construction machines, the specifications and number of transport vehicles, and the work rate.

[0031] The planning unit 103 creates a construction plan for the pipework by searching the directed graph constructed by the processing unit 102 based on a mathematical algorithm. Specifically, the planning unit 103 sets construction conditions as constraints on the constructed directed graph, and applies a mathematical algorithm to search for nodes and edges, thereby determining a method for allocating at least one of construction machinery and transport vehicles to each node and edge of the directed graph. Here, the search for nodes and edges may be a full search or a partial search. In the case of a partial search, the search may be terminated midway and the best solution at the time of termination may be adopted.

[0032] Furthermore, for example, if the mathematical algorithm has a search function, the planning unit 103 may use the search function of the mathematical algorithm to plan a construction plan while searching to improve the current evaluation value by using the evaluation value of a past construction plan. The evaluation value is calculated by the evaluation unit 104, which will be described later.

[0033] In addition, if the mathematical algorithm has a depth-first search function or a breadth-first search function, the planning unit 103 may use the depth-first search function or breadth-first search function of the mathematical algorithm to perform a search while utilizing the depth or width characteristics of the graph structure, thereby planning a construction plan.

[0034] Furthermore, when a search result that violates the constraints of the construction conditions is obtained during a search using a mathematical algorithm, the planning unit 103 may perform processing to prevent the obtained search result from being selected in subsequent searches. The "processing" here may, for example, involve deleting the search result (so-called pruning) or attaching a flag to the search result to prohibit selection.

[0035] The evaluation unit 104 calculates an evaluation value of the construction plan formulated by the planning unit 103. The "evaluation value" here includes, for example, the total number of construction days of the construction plan, the waiting time of construction machinery or transport vehicles, etc.

[0036] The output unit 105 outputs one or more construction plans and the evaluation values ​​of the construction plans obtained in the search process to, for example, the display unit 16. The number of construction plans to be output may be one or more. Alternatively, only the construction plans may be output. The output destination may be the storage 14 instead of the display unit 16.

[0037] Next, the operation of the construction plan planning device 10 according to this embodiment will be described with reference to FIG.

[0038] 3 is a flowchart showing an example of the processing flow of the construction plan planning program according to this embodiment. The processing by the construction plan planning program is realized by the CPU 11 of the construction plan planning device 10 writing the construction plan planning program stored in the ROM 12 or the storage 14 into the RAM 13 and executing it.

[0039] In step S101 of FIG. 3, the CPU 11 acquires pipe construction drawings, pipe specifications, the specifications and number of construction machines, the specifications and number of transport vehicles, the work rate, and construction conditions.

[0040] Here, the following conditions are given as constraints for the construction conditions. For example, if there are multiple parallel pipes, the buried depth of each pipe must be obtained and the deeper pipe must be laid first. If this constraint does not exist and two pipes are separated or adjacent, combinations of which pipe to lay first will arise. If there are only two pipes, it is sufficient to select from the two options the method that shortens the total number of construction days, but in reality there are multiple pipes, so the number of combinations becomes enormous. By using this constraint, the order in which adjacent pipes will be laid is uniquely determined, thereby reducing the number of combinations.

[0041] As another example, an excavator is capable of performing all of the construction processes in pipework - excavation, laying, backfilling, and soil disposal - but there are also conditions that restrict the processes it is responsible for. For example, when two excavators work together to lay a single pipe, there are combinations of processes that the excavators are responsible for. One excavator may be responsible for all processes, or two excavators may be responsible for each process alternately. As these combinations occur for each pipe construction project, the number of combinations becomes enormous. Therefore, by restricting the roles, such as one excavator being responsible for excavation and laying, and another being responsible for backfilling and soil disposal, the number of combinations can be reduced.

[0042] Another example is a constraint that construction machines must not be placed next to each other. For example, because excavators can extend their arms, if two excavators are placed next to each other, the arms may collide, increasing the risk of an accident. Therefore, a minimum distance that construction machines must be kept apart is set to ensure safe construction work. In terms of construction planning, being able to restrict the relative positions of construction machines limits the number of construction sites that can be worked on, which ultimately reduces the number of combinations.

[0043] Figure 4 is a diagram showing an example of a pipe construction drawing. In Figure 4, A indicates a storm sewer pipe, and B indicates a sewer pipe. The black arrows indicate the direction of storm water flow, and the white arrows indicate the direction of sewage flow. The black circles on storm sewer pipe A and sewer pipe B indicate manholes, and the lines indicate water pipes (multiple pipes are represented by a single line).

[0044] According to the pipe construction drawing shown in Figure 4, the storm water pipe A and sewer pipe B must extend from the public road on the left to the private road on the right, and the pipe construction must be carried out so that the storm water pipe A and sewer pipe B run parallel to each other.

[0045] In Figure 4, storm water pipe A in the upper left and sewer pipe B extending from the lower left to the right are independent of each other, and their construction progress does not affect each other. Storm water pipe A branches off at branch point P and extends upward and to the right while following the slope. Similarly, sewer pipe B branches off at branch point P and extends upward and to the right while following the slope. On the other hand, when viewed from the direction of water flow, the two water pipes (storm water pipe A and sewer pipe B) are designed to merge at branch point P to form one pipe that ultimately flows into the public road.

[0046] FIG. 5 is a diagram showing an example of the specifications and number of construction machines and the specifications and number of transport vehicles.

[0047] In the example of Figure 5, a backhoe 0.8m is shown, and a compactor is shown as an example of a construction machine (construction machine), and a dump truck is shown as an example of a transport vehicle. 3 There are four excavators with a capacity of 10 tons, and two roller compactors. There are also three dump trucks with a capacity of 10 tons for transporting various materials. How to allocate these construction machines and transport vehicles to each pipe construction site is the problem to be solved using a mathematical algorithm.

[0048] Fig. 6(A) is a diagram showing an example of a yield, and Fig. 6(B) is a diagram showing an example of pipe specifications.

[0049] The work rate shown in Figure 6(A) is calculated from the pipe construction drawings, pipe specifications, construction machinery specifications, and transport vehicle specifications. The pipe specifications shown in Figure 6(B) are the specifications of the sewer pipe and storm sewer pipe for pipe installation (top table) and the specifications of the sewer pipe and storm sewer pipe for manhole installation (bottom table).

[0050] Next, in step S102 of FIG. 3, the CPU 11 constructs a directed graph in which manholes are represented as nodes and individual pipes are represented as edges, based on the pipework drawings and pipe specifications acquired in step S101.

[0051] FIG. 7 is a diagram showing an example of a directed graph constructed from pipe construction drawings and pipe specifications.

[0052] As shown in Figure 7, storm water pipe A and sewer pipe B are independent, so a manhole (black circle) is selected as the starting point R for each of them. In the example in Figure 7, the upper left node for storm water pipe A and the lower left node with degree 1 for sewer pipe B correspond to the manhole as the starting point R. An edge is created for each pipe along each water pipe. The start and end points of the edge may be manholes or pipe joints.

[0053] After creating the directed graph, the required construction time is set for each edge (pipe) and node (manhole) using the specifications of the transport vehicle, the specifications of the construction machinery, and the work rate. For example, the required construction time for installing sewer pipe B, which is 0.5 m in diameter and 4 m long, is set to be 1.0 h for excavation, 2.11 h for laying, 0.7 h for backfilling, and 0.6 h for soil disposal.

[0054] Next, in step S103 of Fig. 3, the CPU 11 uses a mathematical algorithm to determine, in time series, how to allocate construction machinery and transport vehicles to each node and edge of the directed graph constructed in step S102. Here, a judgment is made based on the constraint conditions described in step S101 of Fig. 3, so that allocation methods that violate the constraints are not output. As an example, if there is a distance constraint between construction machines, allocation methods that result in construction machines being placed in the same location at the same time are excluded.

[0055] FIG. 8 is a diagram illustrating a mathematical algorithm having a depth-first search function or a breadth-first search function.

[0056] As shown in Figure 8, a start node S is prepared and connected to the start point of the manhole with an edge of zero weight (zero cost). Similarly, a goal node G is prepared and connected to the end point of the manhole with an edge of zero weight (zero cost). In this case, the problem is solved by tracing all paths from the start node S to the goal node G.

[0057] One example of a mathematical algorithm is a method of searching for nodes and edges using a depth-first search or a breadth-first search. When a depth-first search is used, a plan is likely to be generated in which a specific pipe (for example, a storm water pipe A or a sewer pipe B) is constructed from its start point to its end point in one go, and this construction is repeated for each pipe. On the other hand, when a breadth-first search is used, a plan is likely to be generated in which multiple pipes are constructed simultaneously in parallel, gradually approaching the end point. In other words, a construction plan may be created by using the depth-first search function or breadth-first search function of a mathematical algorithm to perform a search while utilizing the depth or width characteristics of the graph structure.

[0058] Fig. 9 is a diagram illustrating a mathematical algorithm having a search function. In Fig. 9, a rectangular area W represents a pipe searched by the mathematical algorithm.

[0059] As shown in Figure 9, when using a mathematical algorithm such as a Monte Carlo tree search or randomized algorithm, the pipe construction order is set to a predetermined policy and a search is performed. The construction plan that satisfies the constraints after a predetermined number of searches or execution time is the output target. For example, when using a Monte Carlo tree search, the search is gradually advanced so that an option that improves the evaluation function is more likely to be selected from multiple options. In other words, a construction plan may be created while searching to improve the current evaluation value using the evaluation values ​​of past construction plans.

[0060] If a solution (search result) that violates the constraints is generated during the search, it is desirable to perform pruning so that the option is not selected thereafter. For example, as illustrated in the explanation of step S101 in Figure 3, under the constraint condition that pipes to be laid are to be buried in deeper positions first, if an option to bury shallower pipes first is selected, it is determined to be a violation of the constraint and pruning is performed. In this way, one or more construction plans generated by the mathematical algorithm are output.

[0061] Next, in step S104 of FIG. 3, the CPU 11 calculates evaluation values ​​such as the total number of construction days, construction machine standby time, and transport vehicle standby time for one or more construction plans obtained in step S103. Here, the total number of construction days can be calculated based on the number of days required to complete construction of all pipes and manholes, as shown in FIG. 9 above. The construction machine standby time can be calculated by adding up the total time that the construction machine is in standby mode during an eight-hour day, assuming that the working hours per day are eight hours. Similarly, the transport vehicle standby time can be calculated by adding up the total time that the transport vehicle is in standby mode during an eight-hour day, assuming that the working hours per day are eight hours.

[0062] Next, in step S105 of FIG. 3, the CPU 11 outputs one or more construction plans obtained in step S103 and the evaluation values ​​of the construction plans calculated in step S104, and ends a series of processes according to this construction plan formulation program.

[0063] If only one construction plan is output in step S105, the construction manager makes a final decision on whether to adopt the output construction plan, referring to the evaluation value of the output construction plan, etc. On the other hand, if multiple construction plans are output, the construction manager compares the evaluation values ​​of each of the multiple construction plans and selects the construction plan to actually use while also looking at additional information not included in the experimental conditions for formulating the construction plan, such as the progress of construction other than pipe work and weather information. At this time, it should be noted that the construction plan with the best evaluation value is not necessarily selected.

[0064] As described above, according to this embodiment, at a site where manual construction planning requires a large number of man-hours, the time required for planning can be significantly reduced by using an automated approach.

[0065] Furthermore, by using directed graph representation and mathematical algorithms, construction plans with good evaluation values ​​can be created in a shorter time than manual planning, and the review of construction plans becomes easier, thereby reducing the amount of work required for construction planning.

[0066] In the above embodiment, the construction plan development process executed by the CPU 11 after reading the construction plan development program may be executed by various processors other than the CPU 11. Examples of such processors include dedicated electrical circuits, such as programmable logic devices (PLDs) (such as field-programmable gate arrays (FPGAs)) whose circuit configuration can be changed after fabrication, and application-specific integrated circuits (ASICs) that are processors with circuit configurations specifically designed to execute specific processes. The construction plan development process may be executed by one of these various processors, or by a combination of two or more processors of the same or different types (e.g., multiple FPGAs, or a combination of a CPU and an FPGA). The hardware structure of these various processors is, more specifically, an electrical circuit that combines circuit elements such as semiconductor devices. The same applies to the construction plan development program executed by the CPU 21.

[0067] In the above embodiment, the construction planning program is described as being stored (also referred to as "installed") in advance in the ROM 12 or the storage 14, but the present invention is not limited to this. The construction planning program may be provided in a form stored in a non-transitory storage medium such as a CD-ROM (Compact Disk Read Only Memory), a DVD-ROM (Digital Versatile Disk Read Only Memory), or a USB (Universal Serial Bus) memory. The construction planning program may also be downloaded from an external device via a network.

[0068] All publications, patent applications, and technical standards mentioned in this specification are herein incorporated by reference to the same extent as if each individual publication, patent application, or technical standard was specifically and individually indicated to be incorporated by reference.

[0069] The following additional notes are provided regarding the above-described embodiments.

[0070] (Additional note 1) Memory and at least one processor coupled to said memory; Including, The processor: Obtaining pipework information including pipework drawings, which are drawings of the pipework, and pipe specifications, which are specifications of the pipes; constructing a directed graph based on the pipe work drawings and pipe specifications included in the pipe work information; Construction planning device.

[0071] (Additional note 2) A non-transitory storage medium storing a program executable by a computer to execute a construction planning process, The construction plan planning process includes: Obtaining pipework information including pipework drawings, which are drawings of the pipework, and pipe specifications, which are specifications of the pipes; constructing a directed graph based on the pipe work drawings and pipe specifications included in the pipe work information; Non-transitory storage medium. [Explanation of symbols]

[0072] 10 Construction planning device 11 CPU 12 ROM 13 RAM 14. Storage 15 Input section 16 Display section 17 Communication I / F 18 Bus 101 Acquisition Department 102 Processing Department 103 Planning Department 104 Evaluation Department 105 Output section

Claims

1. an acquisition unit that acquires pipework information including pipework drawings, which are drawings of pipework, and pipe specifications, which are specifications of pipes; a processing unit that constructs a directed graph based on the pipe work drawings and the pipe specifications included in the pipe work information; A construction planning device equipped with the above.

2. The pipework information further includes construction conditions, a planning unit that sets the construction conditions as constraints for the directed graph and creates a construction plan corresponding to the pipe work by searching the directed graph based on a mathematical algorithm; An evaluation unit that calculates an evaluation value of the construction plan; an output unit that outputs one or more construction plans obtained in the search process of the search and evaluation values ​​of the construction plans; Further equipped with, The construction planning device according to claim 1 .

3. The pipework information further includes the specifications and number of construction machines, the specifications and number of transport vehicles, and work rate; The processing unit, based on the pipe construction drawings and the pipe specifications, represents manholes as nodes and pipes as edges, constructs the directed graph in which the direction of the edges is set based on the buried depth of the pipes, and sets the specifications and number of the construction machines, the specifications and number of the transport vehicles, and the required construction time based on the work rate for each edge and node of the directed graph, the planning unit applies the mathematical algorithm to the directed graph constructed by the processing unit, and searches for nodes and edges to determine an allocation method for at least one of the construction machines and the transport vehicles; The construction planning device according to claim 2.

4. the mathematical algorithm has a search function; The planning unit uses the search function to plan the construction plan while searching to improve the current evaluation value by utilizing the evaluation value of a past construction plan. The construction planning device according to claim 2.

5. the mathematical algorithm has a depth-first search function or a breadth-first search function; The planning unit uses the depth-first search function or the breadth-first search function to perform a search while utilizing the depth or breadth characteristics of the graph structure, thereby planning the construction plan. The construction planning device according to claim 2.

6. When a search result that violates the constraints of the construction conditions is obtained during the search using the mathematical algorithm, the planning unit processes the search result so that the search result is not selected in subsequent searches. The construction planning device according to claim 2.

7. The construction planning device Obtaining pipework information including pipework drawings, which are drawings of the pipework, and pipe specifications, which are specifications of the pipes; constructing a directed graph based on the pipe work drawings and the pipe specifications included in the pipe work information; Construction planning methods.

8. Computer, A construction planning program for causing each unit included in the construction planning device according to any one of claims 1 to 6 to function as such.

Images