JP2009230698A - Device and program for creating connection path - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To obtain a device and a program for creating a connection path capable of exactly creating the connection path. <P>SOLUTION: A segment passing through a starting point position is generated by a CPU 22, the segment is swept over until it contacts an obstacle to form a rectangle area, when an end point position does not exist in the rectangle area, a new segment is generated on the perimeter of the rectangle area, a first evaluation value is calculated by a first evaluation formula considered as the one for determining the next search location for the segment, a second evaluation value is calculated by a second evaluation formula considered as the one for determining superiority or inferiority of the connection path for the connection path from the starting point position to an object segment considered as an object for calculation of the first evaluation, specification information capable of specifying the segment considered as a connection source of the object segment of the connection path whose evaluation value is the highest one is stored in a hard disk 28, meanwhile, a rectangle area is formed again by the segment whose first evaluation value is the highest one, and when the end point position exists in the rectangle area, track-back is performed so as to go via the segment to be specified by the specification information to obtain the connection path. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to a connection route creation device and a connection route creation program. More specifically, the present invention relates to a connection route creation device and connection route creation for creating connection routes such as pipes and ducts between various devices such as bathtubs and air conditioners in buildings. Regarding the program.

  Conventionally, in collective housing, it is customary to prepare about 10 kinds of floor plans for one building. However, in recent years, it has become common to arrange a wide variety of floor plans to meet the diverse needs of customers, particularly in large-scale properties. Along with such a flow, the floor plan, which conventionally had only been considered about 10 types, has to be examined with orders of orders of 100 types and 200 types, increasing the design work.

  In the design work for apartment buildings, design designers in charge of determining the shape and finish specifications of buildings and facility designers in charge of water and sewage and air conditioning design work together.

  Both of these tasks are related to each other, for example, when the design designer changes the position of the bathroom, the equipment designer examines the piping up to the pipe space for flowing the bathroom drainage to the lower floor. ing. Here, if the distance from the bathroom to the pipe space is too long to get the proper gradient for flowing water, the location of the bathroom will have to be reviewed. For this reason, it is necessary for design designers and equipment designers to work closely together, but in reality, mutual exchange is performed in a batch process after a certain period of time, so rework may occur. In the worst case, a check omission occurs, and a defect occurs in a later process.

  In other words, conventionally, a building drawing entered by a design designer using a CAD (Computer Aided Design) system for design design is handed over to the equipment designer as electronic data, and the slope of the drainage pipe can be taken while laying out the ducts and piping there I studied where the ceiling had to be lowered in order to pass through the duct, and filled in the drawings.

  It is ideal for equipment designers who have specialized knowledge of duct and piping design to work together with design design to improve the efficiency of floor plan design, but it is actually difficult for equipment designers to take such time . For this reason, when the design designer considers the floor plan, it is preferable that the design designer himself designs the duct and piping to some extent, and the equipment designer performs a final check.

  Equipment contractors have a mechanism that enables the same checks to be performed more efficiently by creating 3D CAD data from 2D CAD data entered by the design designer and entering ducts and piping into it. In some cases, however, the conversion work from the two-dimensional CAD data to the three-dimensional CAD data occurs, which is a time-consuming work.

  On the other hand, as the 3D CAD system for architecture becomes widespread, it is considered that there is no need to convert 2D CAD data to 3D CAD data as described above. The work of designing pipes and pipes requires specialized knowledge and is still a time-consuming work, and it is difficult for a design designer to replace it.

  On the other hand, Non-Patent Document 1 improves the Heyns line segment expansion method as a VLSI (Very Large Scale Integrated Circuit) or printed circuit board wiring route search method to generate a line segment passing through the start point. The wiring area is searched by sweeping (expanding) the minute part until it hits an obstacle, and if there is no end point in the searched rectangular area, a line segment is generated on the outer periphery of this rectangle and a similar area search is performed. A technique is disclosed in which this search is repeated and the wiring route is obtained by reverse tracking when the end point is reached.

By applying this technique as a method for creating a connection route such as a duct or a pipe instead of a wiring route, the connection route can be easily created.
Naoto Kojima, Masao Sato, Ikuo Otsuki, “Improvement and Evaluation of Line Expansion Method”, Research Report “Design Automation”, July 11, 1989, No. 048-6

  However, in the technique disclosed in Non-Patent Document 1, the evaluation value (cost) used when performing the reverse tracking is an evaluation formula that is determined in advance as determining the next search location when performing the search. Therefore, there is a problem that an accurate connection path cannot always be created.

  That is, the evaluation formula G employed in the non-patent document 1 is expressed by the following formula (1).

G = aB + bD + cZ (1)
In equation (1), B represents the presence / absence of a bend (with bend: 1, no bend: 0), and D is a target line segment for which an evaluation value is calculated and a line that is a connection source of the target line segment. Z represents the distance from the minute, and Z represents the Manhattan distance from the target line segment to the end point position.

  Further, a, b, and c in the equation (1) are weighting values for the corresponding parameters. Increasing the value of a increases the tendency to obtain a route with few bends, and increasing the value of b finds a short route. While the tendency becomes stronger, c gives priority to the search in the direction approaching the end point.

  Here, the coefficient a and the coefficient b relate to the length and bending of the connection path, and are weight values related to the nature of the connection path itself, whereas the coefficient c is a weight value for determining a search place. , The nature is different. Therefore, in this line segment expansion method, as a result of calculating the evaluation value in a state where different physical quantities are mixed, an accurate connection path cannot always be created.

  The present invention has been made to solve the above problems, and an object of the present invention is to provide a connection route creation device and a connection route creation program that can create a connection route more accurately.

  In order to achieve the above object, the connection route creation device according to claim 1 is characterized in that start point position information indicating a start point position of the connection route between devices for which a connection route is to be created in a building, and an end point position of the connection route. And storage means in which obstacle position information indicating the position of an obstacle with respect to the connection route is stored in advance, and when creating the connection route, the start point position information and the end point position are stored from the storage means. Information and the obstacle position information are read out, a line segment passing through the start point position indicated by the start point position information is generated, and the line segment is perpendicular to the obstacle indicated by the obstacle position information. When the end point position indicated by the end point position information does not exist in the formed rectangular region, a new rectangular region is created on the outer periphery of the rectangular region. A line segment is generated, and for each line segment generated, a first evaluation value is calculated using a first evaluation formula that is predetermined to determine the next search location, and the first evaluation value is the most evaluated. The rectangular region is formed again using a line segment having a high value, and when the end point position exists in the formed rectangular region, the line segment that has been swept before forming the rectangular region Deriving means for deriving a final connection path by a line segment expansion method for backtracking from the end point position to the start point position, and a predetermined process using result information indicating the deriving result by the deriving means Each of the connection paths from the start point position to the target line segment for calculation of the first evaluation value, when calculating the first evaluation value. Connection path superiority or inferiority A second evaluation value is calculated using a second evaluation formula that is determined in advance, and is determined as a connection source of the target line segment in the connection route that has the highest evaluation value. The storage unit stores specific information that can identify the line segment as an optimal connection source line segment, and when the reverse tracking is performed, the specific information is read from the storage unit, The reverse tracking is performed so as to pass through the line segment specified by the specific information.

  According to the connection route creation device according to claim 1, start point position information indicating a start point position of the connection route between devices for which a connection route is to be created in a building, end point position information indicating an end point position of the connection route, The obstacle position information indicating the position of the obstacle with respect to the connection path is stored in advance by the storage means. The storage means includes a RAM (Random Access Memory), an EEPROM (Electrically Erasable and Programmable Read Only Memory), a semiconductor storage element such as a flash EEPROM (Flash EEPROM), a smart media (SmartMedia (registered trademark)), a flexible A portable recording medium such as a disk, a fixed recording medium such as a hard disk, or an external storage device provided in a server computer connected to a network is included.

  In the present invention, when the connection route is created by the derivation unit, the start point position information, the end point position information, and the obstacle position information are read from the storage unit and indicated by the start point position information. Generating a line segment that passes through the starting point position and sweeping the line segment in the vertical direction until the line segment hits the obstacle indicated by the obstacle position information, and forming the rectangular area in the formed rectangular area When the end point position indicated by the end point position information does not exist, a new line segment is generated on the outer periphery of the rectangular area, and a predetermined search position is determined for determining the next search location for each generated line segment. The first evaluation value is calculated by the evaluation formula 1, and the rectangular area is formed again using the line segment having the highest evaluation value. When the end point position exists, the final connection path is derived by the line segment expansion method that backtracks the line segment that has been swept up to the formation of the rectangular area from the end point position to the start point position. The

  In the present invention, the processing execution means executes a predetermined process using the result information indicating the derivation result by the derivation means. The predetermined process includes a storage process for the result information storage means and a display process for the result information display means. Here, the display by the display means includes visible display by a display device, permanent visible display by an image forming device, and audible display by a sound generator.

  Here, in the present invention, when the first evaluation value is calculated by the derivation unit, each connection path from the start point position to the target line segment that is the calculation target of the first evaluation value. , The second evaluation value is calculated by a second evaluation formula determined in advance to determine the superiority or inferiority of the connection route, and the target line in the connection route in which the second evaluation value becomes the highest evaluation value. Specific information that can identify the line segment as the connection line segment that is the optimal connection source line segment is stored in the storage unit, while the reverse tracking is performed, the identification Information is read from the storage means, and backtracking is performed so as to pass through the line segment specified by the specific information.

  That is, in the present invention, when searching from the start point position to the end point position, the line segment is generated using the line segment expansion method disclosed in Non-Patent Document 1 described above. When performing the reverse tracking, the line obtained as the optimal connection source line segment based on the second evaluation formula previously determined as determining the superiority or inferiority of the connection path when performing the above search This is different from the line segment expansion method disclosed in Non-Patent Document 1 in that reverse tracking is performed so as to pass through the minutes.

  In this way, according to the connection path creation device of claim 1, a rectangular region is formed by generating a line segment passing through the starting point position and sweeping the line segment in the vertical direction until it hits an obstacle. In the case where the end point position does not exist in the formed rectangular area, a new line segment is generated on the outer periphery of the rectangular area, and a predetermined next search location is determined for each generated line segment. The first evaluation value is calculated by the first evaluation formula, and the superiority or inferiority of the connection route is determined for each connection route from the starting point position to the target line segment that is the calculation target of the first evaluation value. The second evaluation value is calculated by a predetermined second evaluation formula as follows, and the calculated second evaluation value is the connection source of the target line segment in the connection route having the highest evaluation value. The line segment is the optimal connection source line While storing the specific information that can identify the line segment as a storage means, the formation of the rectangular region is performed again using the line segment for which the calculated first evaluation value is the highest value, When the end point position exists in the formed rectangular area, the specific information is read from the storage unit, and is traced back from the end point position to the start point position via a line segment specified by the specific information. Thus, since the final connection route is derived, the connection route can be created more accurately as compared with the case where the present invention is not applied.

  In the present invention, as in the invention described in claim 2, the first evaluation formula indicates whether or not there is a bend between the target line segment and a line segment that is a connection source of the target line segment, and the target At least one of the distance between the line segment and the line segment that is the connection source of the target line segment, the area of the falling ceiling generated in the building by providing the target line segment, and the type of room in which the connection path is provided An arithmetic expression for adding a value corresponding to a Manhattan distance from the target line segment to the end point position to a cumulative value of a line segment extending from the start point position to the target line segment. The evaluation formula may be an arithmetic formula for calculating the cumulative value. This makes it possible to create an accurate connection path according to the applied parameter.

  In particular, the invention according to claim 2 further includes accepting means for accepting weighting values for parameters used in the first evaluation formula and the second evaluation formula, as in the invention according to claim 3, The deriving unit may calculate the first evaluation value and the second evaluation value as values obtained by weighting the corresponding parameters by the weighting values received by the receiving unit. Thereby, as a result of obtaining the evaluation value according to the application, the connection path can be created more accurately. In addition, the acceptance by the accepting means includes acceptance from an input device such as a keyboard, a touch panel, a tablet, a digitizer, and a mouse, as well as acceptance from an external device via a communication line such as the Internet or a local area network. included.

  Further, according to the present invention, as in the invention described in claim 4, the storage means further stores in advance penetration availability information indicating whether or not the obstacle can penetrate the connection path, The derivation means excludes obstacles that can be penetrated through the connection path by the penetration permission information from obstacles that limit the range of sweeping the line segment when forming the rectangular region. Also good. Thereby, a connection path can be created more accurately.

  Further, according to the present invention, as in the invention described in claim 5, when the derivation unit creates a connection route between a plurality of sets of devices, the connection route created so far is applied as the obstacle. It is good. Thereby, the connection path | route between several sets of apparatuses can be created.

  Further, according to the present invention, as in the invention described in claim 6, the storage means further stores in advance minimum turning radius information indicating a minimum value of a bending radius of a member constituting the connection path, and the starting position The end point position may be a position separated from the corresponding device by a distance corresponding to the minimum turning radius indicated by the minimum turning radius information. Thereby, a connection path can be created more accurately.

  Further, according to the present invention, as in the invention described in claim 7, the storage means further stores in advance minimum allowable distance information indicating a minimum allowable distance between the connection path and the obstacle, and the derivation means. However, the connection route may be derived so as to be separated from the obstacle by a distance indicated by the minimum allowable distance information. Thereby, a connection path can be created more accurately.

  On the other hand, in order to achieve the above object, when creating a connection route in a building, the connection route creation program according to claim 8 indicates a starting point position of the connection route between devices for which the connection route is to be created. Starting point position information, end point position information indicating the end point position of the connection path, and obstacle position information indicating the position of the obstacle with respect to the connection path from the storage means stored in advance, the start point position information, the end point position information, and A reading step of reading out the obstacle position information, and generating a line segment that passes through the start point position indicated by the start point position information, and the vertical direction of the line segment until the line segment hits the obstacle indicated by the obstacle position information Forming a rectangular area by sweeping to a rectangular area, and a final area indicated by the end point position information in the rectangular area formed by the forming step. When the position does not exist, a new line segment is generated on the outer periphery of the rectangular area, and the first evaluation formula that is predetermined to determine the next search location for each of the generated line segments is And a second predetermined value that determines the superiority or inferiority of the connection route for each connection route from the starting point position to the target line segment for which the first evaluation value is calculated. The calculation step of calculating the second evaluation value by the evaluation formula, and the connection source of the target line segment in the connection route where the second evaluation value calculated by the calculation step has the highest evaluation value A storage step of storing in the storage means specific information that can identify the line segment as an optimal connection source line segment, and the first evaluation value calculated by the calculation step has the highest evaluation. The re-forming step for re-forming the rectangular region using the line segment, and the end point position in the rectangular region formed by the forming step. A derivation step of deriving a final connection path by reading back from the storage means and backtracking from the end point position to the start point position so as to pass through the line segment specified by the specific information, and the derivation step And a process execution step of executing a predetermined process using the result information indicating the derivation result of the above.

  Therefore, according to the connection route creation program described in claim 8, the computer can be operated in the same manner as in the invention described in claim 1. Therefore, the present invention is applied as in the invention described in claim 1. Compared with the case where it does not, a connection path can be created more accurately.

  According to the present invention, a line segment passing through the start point position is generated, and the line segment is swept in the vertical direction until it hits an obstacle, thereby forming a rectangular area, and the end point position exists in the formed rectangular area If not, a new line segment is generated on the outer periphery of the rectangular area, and the first evaluation value is determined by a first evaluation formula that is predetermined to determine the next search location for each generated line segment. , And for each of the connection routes from the start point position to the target line segment for which the first evaluation value is to be calculated, a second evaluation formula that is determined in advance as determining the superiority or inferiority of the connection route The second evaluation value is calculated, and the line segment that is the connection source of the target line segment in the connection route in which the calculated second evaluation value has the highest evaluation value is the optimal connection source line segment. That can identify the line segment While the information is stored in the storage means, the rectangular area is formed again using the line segment whose calculated first evaluation value has the highest evaluation value, and the end point position exists in the formed rectangular area In this case, the final connection path is derived by reading the specific information from the storage unit and backtracking from the end point position to the start point position so as to pass through the line segment specified by the specific information. Therefore, the effect that the connection path can be created more accurately is obtained as compared with the case where the present invention is not applied.

  The best mode for carrying out the present invention will be described below in detail with reference to the drawings. Here, a case where the present invention is applied to a connection path creation device that creates connection paths for pipes and ducts will be described.

[First Embodiment]
First, with reference to FIG. 1 and FIG. 2, the configuration of a connection path creation device 10 to which the present invention is applied will be described.

  As shown in FIG. 1, a connection path creation device 10 according to the present embodiment includes a control unit 12 that controls the overall operation of the device, a keyboard 14 and a mouse that are used to input various information from the user. 16 and a display 18 for displaying processing results by this apparatus, various menu screens, messages, and the like. That is, the connection path creation device 10 according to the present embodiment is configured by a general-purpose personal computer.

  Next, with reference to FIG. 2, the principal part structure of the electric system of the connection path | route creation apparatus 10 which concerns on this Embodiment is demonstrated.

  As shown in the figure, the connection path creation device 10 includes a CPU (central processing unit) 22 that controls the operation of the connection path creation device 10 as a whole, a RAM 24 that is used as a work area when the CPU 22 executes various programs, and the like. A ROM 26 in which various control programs and various parameters are stored in advance, a hard disk 28 as a storage means used for storing various types of information, the keyboard 14, mouse 16, and display 18 described above are connected to the outside. And an external interface 30 that controls transmission and reception of various types of information to and from the apparatus. These units are connected to each other by a system bus BUS. A printer 50 (not shown in FIG. 1) is connected to the external interface 30.

  Therefore, the CPU 22 accesses the RAM 24, ROM 26 and hard disk 28, acquires various information via the keyboard 14 and mouse 16, displays various information on the display 18, and prints various information using the printer 50 via the external interface 30. Can be performed respectively.

  FIG. 3 schematically shows main storage contents of the hard disk 28 provided in the connection path creation device 10. As shown in the figure, the hard disk 28 is provided with a database area DB for storing various databases and a program area PG for storing programs for performing various processes.

  Further, the database area DB includes an inter-device connection information database DB1, a piping / duct specification information database DB2, a building CAD information database DB3, a line segment information database DB4, and a line segment link that are used when a connection route creation program to be described later is executed. An information database DB5 is included.

  The inter-device connection information database DB1 is a database of information indicating preconditions regarding connection paths between devices connected by piping or ducts in a target building. As shown in FIG. 4 as an example, the inter-device connection information database DB1 according to the present embodiment includes information on a route number, usage ID (Identification), nominal diameter, start point coordinates, start point vector, end point coordinates, and end point vector. Is configured as a database for each connection path.

  The route number is a number assigned individually for each connection route in order to identify the corresponding connection route. As described above, in the connection route creation device 10 according to the present embodiment, numerical information is applied as information for identifying each connection route. It goes without saying that any information can be applied as long as the information can individually identify the connection path, such as a form in which the character information and the numerical information are applied individually or in combination.

  Further, the usage ID is information individually assigned to each usage to be applied in the connection route creating apparatus 10 in order to specify the usage of the corresponding connection route. As shown in FIG. 4, in the connection route creation device 10 according to the present embodiment, numerical information is applied as the application ID, but not limited thereto, the character information and numerical information are independently used. It goes without saying that any information can be applied as long as it is information that can individually specify the use of the connection route, such as a form applied in combination.

  Moreover, the said nominal diameter is information which shows the nominal diameter of the member (In this Embodiment, piping or a duct) which comprises a corresponding connection path | route.

  On the other hand, the start point coordinates are information indicating the position of the start point of the corresponding connection route, as shown in FIG. 9A as an example, and as shown in FIG. 4, the connection route according to the present embodiment. In the creation device 10, the three-dimensional coordinates with the origin (0, 0, 0) as the origin (0, 0, 0) are applied to the target building, but it goes without saying that the present invention is not limited to this. . The start point vector is information indicating the laying direction of the connection route at the start point of the corresponding connection route, as shown in FIG. 9A as an example. As shown in FIG. 4, in the connection route creation device 10 according to the present embodiment, the start point vector is set in the X coordinate direction in the three-dimensional coordinate system (in the present embodiment, the front view of the target building). Positive and negative directions with respect to the width direction), positive and negative directions with respect to the Y coordinate direction (in this embodiment, the front-rear direction of the front view of the target building), and Z coordinate direction (this embodiment) In FIG. 2, the vertical direction of the target building) is represented by a combination of positive and negative directions. For example, the start point vector of the connection route given “100” as the route number shown in FIG. 4 is (0, 1, 0), and the connection route is in the X coordinate direction or the Z coordinate direction at the start point position. It is shown that it is not laid down toward the positive direction of the Y coordinate direction (in this embodiment, the depth direction of the building).

  Similarly, the end point coordinates are information indicating the position of the end point of the corresponding connection route, as shown in FIG. 9A as an example, and as shown in FIG. 4, the connection according to the present embodiment. In the route creation device 10, the three-dimensional coordinates with the origin point coordinates as the origin are applied, but it goes without saying that the present invention is not limited to this. The end point vector is information indicating the laying direction of the connection route at the end point of the corresponding connection route, as shown in FIG. 9A as an example. As shown in FIG. 4, in the connection route creation device 10 according to the present embodiment, the end point vector is also in the positive and negative directions with respect to the X coordinate direction and the Y coordinate direction in the three-dimensional coordinate system. A positive direction, a negative direction, and a combination of a positive direction and a negative direction with respect to the Z coordinate direction are represented. For example, the end point vector of the connection route given “101” as the route number shown in FIG. 4 is (1, 0, 0), and the connection route is in the Y coordinate direction or Z coordinate direction at the end point position. It is shown that it is not laid in the direction, but is laid in the positive direction of the X coordinate direction (in the present embodiment, the right direction in the front view of the building).

  On the other hand, the above-mentioned piping / duct specification information database DB2 is a database of information indicating the specifications of pipes and ducts, which are members constituting the connection route, which are the application targets in the connection route creation device 10 according to the present embodiment. It is. As shown in FIG. 5 as an example, the piping / duct specification information database DB2 according to the present embodiment is a database for each information of application ID, application name, nominal diameter, outer diameter, gradient, and minimum turning radius. It is configured as a.

  The use ID and the nominal diameter are the same information as the information of the same name in the inter-device connection information database DB1, and the use name is information indicating the name of the corresponding use. The outer diameter is information indicating the outer diameter of a pipe or duct applied in the corresponding application, and the gradient is information indicating the gradient of the pipe or duct applied in the corresponding application. As shown in FIG. 9B as an example, the minimum turning radius is information indicating the minimum value of the bending radius of the pipe or duct applied in the corresponding application.

  On the other hand, the building CAD information database DB3 is a database of 3D CAD information of a target building constructed using a 3D CAD system. As shown in FIG. 6 as an example, the building CAD information database DB3 according to the present embodiment includes information on a member ID, a member name, details, reference point coordinates, a vector, the number of vertices, and a vertex coordinate list. It is configured as a database for each member constituting the building.

  The member ID is information individually assigned to each member to be applied in the connection route creation device 10 in order to specify a member constituting the target building. As shown in FIG. 6, in the connection route creation device 10 according to the present embodiment, numerical information is applied as the member ID. However, the present invention is not limited to this, and the character information and numerical information are used alone or in combination. It goes without saying that any information can be applied as long as it is information that can individually identify each member, such as a form to be applied.

  Moreover, the said member name is information which shows the name of a corresponding member, and the said detail is information which shows the structure of a corresponding member. In the building CAD information database DB3 illustrated in FIG. 6, for example, it is indicated that the member assigned “10001” as the member ID is a partition wall having a wooden shaft structure.

  The reference point coordinates are information indicating the position of a predetermined reference point of the corresponding member, the vector is information indicating the reference direction of the corresponding member, and the number of vertices is the corresponding member. The vertex coordinate list is information indicating the position of each vertex of the corresponding member. In the connection route creation device 10 according to the present embodiment, each information of the reference point coordinates and the vertex coordinate list also applies three-dimensional coordinates with the origin position coordinates as the origin, It goes without saying that it is not limited.

  On the other hand, the line segment information database DB4 is a database of information related to line segments constituting connection paths generated by execution of a connection path creation program described later. As shown in FIG. 7 as an example, the line segment information database DB4 according to the present embodiment includes a line segment ID, a line segment name, a first line segment cost, a second line segment cost, an optimum link source line segment name, and a start end. Each information of the coordinates and the end coordinates is configured as a database for each line segment.

  The line segment ID is information individually assigned to each line segment in order to specify the corresponding line segment. As shown in FIG. 7, in the connection route creation device 10 according to the present embodiment, numerical information is applied as the line segment ID. However, the present invention is not limited to this, and the character information and numerical information are independently used. Needless to say, any information can be applied as long as it is information that can individually identify each of the line segments, such as a form applied in combination.

  In addition, the line segment name is information indicating the name of the corresponding line segment, and the connection path creation device 10 according to the present embodiment applies alphabets or the like as shown in FIG. It goes without saying that any information can be applied as long as the information can identify the corresponding line segment.

  Moreover, the said 1st line segment cost and the said 2nd line segment cost are information which shows the evaluation value of a corresponding line segment.

  In the connection route creation device 10 according to the present embodiment, the following equation (2) is applied as an evaluation equation for calculating the first line segment cost E, and the second line segment cost E ′. The following formula (3) is applied as an evaluation formula for calculating.

E = Σ (aB + bD) (2)
E ′ = E + cZ (3)
In equation (2), B is the presence or absence of a bend between the target line segment for which the evaluation value is calculated and the line segment that is the connection source of the target line segment (with bend: 1, without bend: 0). D represents the distance between the target line segment for which the evaluation value is calculated and the line segment that is the connection source of the target line segment. In addition, a and b in equation (2) are weighting values for the corresponding parameters. Increasing the value of a increases the tendency to obtain a route with few bends, and increasing the value of b increases the tendency to obtain a short route. Become.

  In the connection route creation apparatus 10 according to the present embodiment, the above B is derived as follows.

  First, a line segment vector is calculated from the start and end coordinates of two target line segments. The coordinates of the start end P1s of one line segment are (X1s, Y1s, Z1s), the coordinates of the end point P1e are (X1e, Y1e, Z1e), and the coordinates of the start end P2s of the other line segment are (X2s, Y2s, Z2s), If the coordinates of the end P2e are (X2e, Y2e, Z2e), the vector of each line segment is as follows.

One line segment vector = (X1e-X1s, Y1e-Y1s, Z1e-Z1s)
Vector of the other line segment = (X2e−X2s, Y2e−Y2s, Z2e−Z2s)
Next, the value B is calculated according to the following conditional expression. In the following expression, “·” represents an inner product, and ε represents a predetermined threshold value less than 1.

B = 0; 1- | in the case of one line segment vector / the other line segment vector | <ε B = 1; other than the above In other words, in the connection path creation device 10 according to the present embodiment, one line segment If the absolute value of the inner product of the vector of the vector and the vector of the other line segment is close to “1”, B is set as “0” if it is not bent, and otherwise B is set as “1”.

  On the other hand, in the connection route creation apparatus 10 according to the present embodiment, the above D is derived as follows.

  First, the midpoint of the line segment is calculated from the start end position and the end position of each of the two target line segments. Similarly to the above, the coordinates of the start end P1s of one line segment are (X1s, Y1s, Z1s), the coordinates of the end point P1e are (X1e, Y1e, Z1e), and the coordinates of the start end P2s of the other line segment are (X2s, Y2s). , Z2s) and the coordinates of the end P2e are (X2e, Y2e, Z2e), the midpoint of each line segment is as follows.

Midpoint of one line segment = ((X1e + X1s) / 2, (Y1e + Y1s) / 2, (Z1e + Z1s) / 2)
Midpoint of the other line segment = ((X2e + X2s) / 2, (Y2e + Y2s) / 2, (Z2e + Z2s) / 2)
Next, assuming that the coordinates of the midpoint of one line segment are (X1c, Y1c, Z1c) and the coordinates of the midpoint of the other line segment are (X2c, Y2c, Z2c), the value of D is calculated by the following equation: To do.

On the other hand, in the expression (3), Z represents the Manhattan distance from the target line segment to the end point position, while c is a weighting value for the Manhattan distance, and gives priority to the search in the direction approaching the end point.

  In the connection path creation device 10 according to the present embodiment, the above Z is derived as follows.

  First, the midpoint of a line segment is calculated from the start and end coordinates of the target line segment in the same manner as D described above.

  Next, Z is calculated by the following equation, where the midpoint coordinates of the line segment are (X2c, Y2c, Z2c) and the end point coordinates are (Xt, Yt, Zt).

Z = | X2c-Xt | + | Y2c-Yt | + | Z2c-Zt |
The optimum link source line segment name is information indicating the name of the optimum line segment to be connected to the end point on the start point side of the corresponding line segment. Furthermore, the start coordinate is information indicating the position of the start point side end point of the corresponding line segment, and the end coordinate is information indicating the position of the end point side end point of the corresponding line segment. In the connection path creation device 10 according to the present embodiment, the start end coordinates and the end coordinates also apply the three-dimensional coordinates with the origin position coordinates as the origin. However, the present invention is not limited to this. Needless to say.

  On the other hand, the line segment link information database DB5 is a database of information relating to the connection state between a line segment constituting a connection path generated by execution of a connection path creation program described later and an adjacent line segment. . As shown in FIG. 8 as an example, the line segment link information database DB5 according to the present embodiment stores link ID, link source line segment name, link destination line segment name, and link cost information for each adjacent line segment. It is configured as a database.

  The link ID is information individually assigned to the adjacent line segment in order to specify the adjacent line segment. In addition, as shown in FIG. 8, in the connection route creation device 10 according to the present embodiment, numerical information is applied as the link ID. However, the present invention is not limited to this, and the character information and numerical information are independently used. It goes without saying that any information can be applied as long as it is information that can individually identify the adjacent line segments, such as a form applied in combination.

  The link source line segment name is information indicating the name of the line segment located on the start point side of the corresponding adjacent line segment, and the link destination line segment name is the corresponding adjacent line segment name. It is information indicating the name of the line segment located on the end point side, and the link cost is information indicating the evaluation value of the corresponding adjacent line segment.

  In the connection route creation device 10 according to the present embodiment, the following equation (4) is applied as an evaluation equation for calculating the link cost e.

e = aB + bD (4)
Next, with reference to FIG. 10, the operation of the connection path creation device 10 according to the present embodiment will be described. FIG. 10 is a flowchart showing the flow of processing of a connection route creation program executed by the CPU 22 when a user inputs an instruction to create a connection route by operating the keyboard 14 and mouse 16. Are stored in advance in the program area PG of the hard disk 28.

  First, in step 100 of the figure, input of each value of the coefficients a, b, and c (weighting values) is accepted. In the connection route creation program according to the present embodiment, the input screen, which is determined in advance as input of the coefficients a, b, and c, is displayed on the display 18 to accept the input of each value. On the other hand, it is performed by accepting values input via the keyboard 14 and the mouse 16, but the present invention is not limited to this. For example, other inputs such as an input by voice and an input by communication from an external device are used. Needless to say, it is possible to accept a value input according to the form.

  In the next step 102, all information relating to the building for which the connection route is to be created is read from the inter-device connection information database DB1, the piping / duct specification information database DB2, and the building CAD information database DB3. In the next step 104, The piping / duct layout processing routine / program is executed using the read information.

  The piping / duct layout processing routine / program will be described below with reference to FIG. FIG. 11 is a flowchart showing the processing flow of the piping / duct layout processing routine / program. The program is also stored in the program area PG of the hard disk 28 in advance.

  In step 200 of the figure, from the information read out in the process of step 102, the start point coordinates, end point coordinates, start point vector corresponding to any one connection path (hereinafter referred to as “processing target connection path”), Information on the end point vector, outer diameter, gradient, and minimum turning radius is extracted. The information on the outer diameter, the gradient, and the minimum turning radius are the outer diameter, the gradient, and the minimum turning radius corresponding to the use ID and the nominal diameter of the processing target connection path in the information read from the inter-device connection information database DB1. Can be obtained by extracting from the information read from the piping / duct specification information database DB2.

  In the next step 202, as shown in FIG. 9A as an example, the start point is a point separated from the position of the start point coordinate obtained by the process of step 200 in the start point vector direction by the distance of the minimum turning radius, A line segment connecting the start point and the position of the start point coordinate is virtually generated as a start line segment, and a line segment ID and a line segment name (here, “start line segment”) are created for the generated start line segment Then, calculation of each value of the first line segment cost E and the second line segment cost E ′ by the above formulas (2) and (3), and derivation of the start end coordinates and the end coordinates are performed. Here, 0 (zero) is applied as the values of B and D applied in the above equation (2), and 0 is used as the first line segment cost E, and Manhattan distance as the second line segment cost E ′. A value obtained by multiplying Z by a weighting value indicated by a coefficient c is calculated. Also, here, the start point coordinates of the processing target connection path are applied as the start end coordinates, and the coordinates indicating the position of the start point are applied as the end coordinates.

  Similarly, in step 202, a point that is separated from the position of the end point coordinate obtained by the process of step 200 in the direction of the end point vector by the distance of the minimum rotation radius is set as the end point, and the end point is connected to the position of the end point coordinate. A line segment is virtually generated as an end line segment, and for the generated end line segment, creation of a line segment ID and a line segment name (here, “end line segment”), and derivation of the start and end coordinates are performed. Do. Here, the coordinates indicating the position of the end point are applied as the start end coordinates, and the end point coordinates of the processing target connection path are applied as the end coordinates.

  In the next step 204, each piece of information related to the start line segment and the end line segment obtained by the process in step 202 is registered in the line segment information database DB4.

  In the next step 206, as shown in FIG. 12A as an example, a line segment extending from the start point to the start point vector direction until it hits an obstacle is virtually generated. Creation of IDs and line segment names, and derivation of start and end coordinates are performed. Here, the position of the obstacle can be specified as the position of each member indicated by the vertex coordinate list read from the building CAD information database DB3 by the processing of step 102. Also, here, coordinates indicating the position of the start point are applied as the start end coordinates.

  By the way, in the connection route creation device 10 according to the present exemplary embodiment, as shown in FIG. 9B as an example, a setback is performed between a pipe or duct and an obstacle by a predetermined minimum allowable distance. It is supposed to be. For this reason, the minimum allowable distance information indicating the minimum allowable distance is stored in advance in a predetermined area of the hard disk 28. In step 206, the minimum allowable distance information is read from the hard disk 28, and the start point vector is determined from the start point. A distance obtained by adding a half of the outer diameter of the corresponding pipe or duct to the minimum allowable distance indicated by the minimum allowable distance information, and extending the line segment extended until it hits the obstacle in the direction (hereinafter, It is called “setback distance”). Therefore, the coordinates indicating the set back position are applied to the end coordinates derived in this step 206.

  It should be noted that the present invention is not limited to this configuration, and instead of the minimum allowable distance information, information indicating the distance to be set back may be prepared in advance, and the distance indicated by the information may be set back.

  In the next step 208, the line segment ID, line segment name, start end coordinate, and end coordinate information obtained by the process in step 206 are registered in the line segment information database DB4.

  In the next step 210, creation of a link ID of a line segment group constituted by the line segment generated by the processing of step 206 and the line segment connected to the start end of the line segment (the line segment that is the connection source). The calculation of the link cost e by the above equation (4), and the above equation (2) of each value of the first line segment cost E and the second line segment cost E ′ for the line segment generated by the processing of step 206 above. And the calculation by (3) Formula is performed.

  In the next step 212, the link ID and link cost e obtained by the processing in step 210, and the link source line segment name and link destination line segment name are registered in the line segment link information database DB5. Here, the start line segment is applied as the link source line segment name, and the line segment name obtained by the process of step 206 is applied as the link destination line segment name.

  In step 212, the first segment cost E and the second segment cost E ′ obtained by the process in step 210 are used as information corresponding to the segment registered by the process in step 208, as a segment information database. Register in DB4.

  In the next step 214, as shown in FIG. 12B as an example, the line segment generated by the process in step 206 is assumed to be an obstacle in the vertical direction of the line segment until it hits an end line segment. In the next step 216, it is determined whether or not the line segment hit in the process of step 214 is an obstacle. If the determination is negative, the process proceeds to step 236 described later. If it is determined, the process proceeds to step 218.

  In step 218, as shown in FIG. 12C as an example, the line segment virtually extended by the process in step 214 is set back by the set back distance until the set line segment hits an obstacle. A rectangular region is virtually formed by sweeping (developing) the line segment in the vertical direction.

  In the next step 220, as shown in FIG. 12C as an example, a line segment is virtually generated on each side (outer periphery) of the rectangular area virtually formed by the processing in step 218. For the line segment (hereinafter referred to as “occurrence line segment”), creation of the line segment ID and line segment name, and the above equation (2) for each value of the first line segment cost E and the second line segment cost E ′ And the calculation by (3) Formula and derivation | leading-out of a start end coordinate and a terminal coordinate are performed.

  In the next step 222, the line segment ID, the line segment name, the first line segment cost E, the second line segment cost E ′, the start end coordinate, and the end point coordinate information obtained by the process of step 220 above. Is registered in the line segment information database DB4.

  In the next step 224, for the adjacent line segment in the generated line segment, the link ID is created and the value of the link cost e is calculated by the above equation (4). In the next step 226, the adjacent line segment is adjacent. For each line segment, the link ID and link cost e obtained by the processing in step 224, and the link source line segment name and link destination line segment name are registered in the line segment link information database DB5. The link source line segment name registered here is the line segment name indicating the line segment on the start point side of the corresponding adjacent line segment, and the link destination line segment name is the line segment on the end point side of the corresponding adjacent line segment. Is the line segment name.

  In the next step 228, in the information registered in the line segment link information database DB5 by the process of step 226, a line segment having a plurality of link destination line segment names, that is, a line segment connected to the end on the start point side is displayed. For a plurality of line segments (hereinafter referred to as “branched line segments”), the first line segment costs E indicated by the link source line segment names corresponding to the line segments are used as the line segment information database. The line segment name that has been read from DB4 and has the lowest first line segment cost E is registered in the line segment information database DB4 as the optimal link source line segment name corresponding to the branched line segment.

  On the other hand, in the information registered in the line segment link information database DB5 by the process of step 226, a line segment having only one link destination line segment name, that is, a line segment connected to the end on the start point side is displayed. For only one line segment (hereinafter referred to as “no branch line”), the link source line name corresponding to the line segment is used as the optimal link source line name corresponding to the non-branch line segment. Register in the information database DB4.

  For example, in the line segment link information database DB5 shown in FIG. 8, the information newly registered in the line segment link information database DB5 by the process of step 226 is “102”, “103”, “104”, In the case of the information to which “105” is assigned, since there are a plurality of (“2” in this case) “O” as the link destination line segment names, the line segment M indicated by the link source line segment names corresponding thereto and The first line segment cost E of the line segment N is read from the line segment information database DB4. Among these, the line segment name N on the side where the first line segment cost E is lower is the line segment name O. It will be registered as the optimal link source line segment name.

  In this case, since there is only one “M” and “N” as the link destination line segment name, the line segment name L indicated by the link source line segment name corresponding thereto is the line segment name. It is registered in the optimum link source line segment name of each line segment of M and line segment name N.

  In the next step 230, it is determined whether or not the end point exists on any line segment of the generated line segment. If the determination is affirmative, the process proceeds to step 240 described later, If YES, the process proceeds to step 232, where the second line segment cost E ′ corresponding to the generated line segment is read from the line segment information database DB4, and the line segment having the lowest second line segment cost E ′ is extracted. After that, in the next step 234, as shown in FIG. 12C as an example, the extracted line segment is an obstacle with respect to the direction in which the rectangular area is not formed up to that point, or the end line. After virtually extending until it hits the minute, the process returns to step 216.

  By repeating the above steps 216 to 234, as shown in FIGS. 12D to 12E as an example, the formation of the rectangular area and the generation of line segments on the outer periphery of the rectangular area are repeatedly performed. When the end point or the end line segment exists on the generated line segment, the repetitive processing is ended.

  In step 236, the line segment ID and the line segment name are created for the line segment extended in the process of step 214 or step 234 and hitting the end line segment (hereinafter referred to as “end point connection line segment”); Calculation of each value of the line segment cost E and the second line segment cost E ′ by the above formulas (2) and (3) and derivation of the start end coordinates and the end coordinates are performed, and these pieces of information are stored in the line segment information database. Register in DB4.

  In the next step 238, for the line connected to the end point connection line segment and the start point side end of the end point connection line segment, creation of a link ID and calculation of the value of the link cost e by the above equation (4) The link ID and link cost e, and the link source line segment name and link destination line segment name are registered in the line segment link information database DB5. The link source line segment name registered here is the line segment name indicating the line segment connected to the end of the end point connection line segment, and the link destination line segment name is the line segment indicating the end point connection line segment. Name.

  In the next step 240, the optimum link source line segment name corresponding to the end line segment is registered in the line segment information database DB4. Note that the optimum link source line segment name registered here is a line segment name corresponding to the end point connection line segment when the step 240 is executed through the step 236 and the step 238, and the step 230. When the process directly moves from step 240 to step 240, the line segment name corresponds to the line segment determined to have the end point in step 230.

  In the next step 242, with respect to the line segment link information database DB5, for the line segment connected to the end line segment and the start point side of the end line segment, the link ID is created and the link cost e value (4 The link ID and link cost e obtained by this processing, and the link source line segment name and link destination line segment name are registered in the line segment link information database DB5. The link source line name registered here is the line name indicating the line segment connected to the start point side of the end line segment, and the link destination line name is the line name indicating the end line segment. is there.

  As a result of the above processing, connection route candidates from the start point coordinates to the end point coordinates are obtained as shown by a thick line in FIG.

  Therefore, in the next step 244, information on the end line segment is read from the line segment information database DB4, and in the next step 246, the line segment corresponding to the optimum link source line segment name in the read information is finally connected. The path is stored in a predetermined area of the hard disk 28. In the next step 248, it is determined whether or not the optimum link source line segment name in the read information matches the line segment name corresponding to the start line segment. If the determination is affirmative, the process proceeds to step 252 described later. If the determination is negative, the process proceeds to step 250, and the line that is the optimum link source line segment name in the read information is the line name. After the information regarding the minutes is read from the line segment information database DB4, the process proceeds to step 246.

  By repeating the processing from step 246 to step 250, the rectangular area is formed by using the optimum link source line segment name stored when searching for the connection route from the start point position to the end point position. When the line segment swept (developed) is traced back from the end point position to the start point position, a line segment constituting the final connection path is derived, and information indicating the line segment is stored on the hard disk 28 in a predetermined manner. It is memorized in the area.

  In step 252, information indicating the line segment constituting the final connection path stored by the above processing is read from the hard disk 28, and is indicated by the read information as shown in FIG. 12H as an example. Information indicating the state in which each line segment is connected (hereinafter referred to as “connection route information”) is created and stored in a predetermined area of the hard disk 28, and then the piping / duct layout processing routine / program is terminated.

  When the piping / duct layout processing routine / program ends, the process proceeds to step 106 of the connection route creation program, and the gradient extracted by the processing of step 200 of the piping / duct layout processing routine / program is a value other than 0 (zero). It is determined whether or not it is necessary to provide a gradient in the connection path to be processed. If the determination is affirmative, the process proceeds to step 108, and the piping / duct layout processing routine / program is executed. The connection route information stored by the processing of step 252 is read from the hard disk 28, the connection route information is updated so as to have the above gradient with respect to the connection route indicated by the connection route information, and then the process proceeds to step 110. . If the determination at step 106 is negative, the process proceeds to step 110 without executing the process at step 108.

  In step 110, it is determined whether or not the processing in steps 104 to 108 has been completed for all the information read out in the processing in step 102. If the determination is negative, the processing returns to step 104. When this determination is made, this connection route creation program is terminated.

  When repeatedly executing the processing of step 104 to step 110, the connection route that has not been processed until then is processed, and the connection route indicated by the connection route information stored so far is also faulty. Think of it as a thing.

  As described above in detail, in the present embodiment, a line segment that passes through the start point position is generated, and a rectangular area is formed by sweeping the line segment in the vertical direction until it hits an obstacle. When the end point position does not exist in the rectangular area, a new line segment is generated on the outer periphery of the rectangular area, and a first search is made in advance, which determines the next search location for each generated line segment. The first evaluation value (here, the second line segment cost E ′) is calculated by an evaluation formula (here, formula (3)), and the first evaluation value is calculated from the starting point position. For each connection route leading to the line segment, the second evaluation value (here, the first line) is determined by a second evaluation equation (here, equation (2)) that is determined in advance as determining the superiority or inferiority of the connection route. The second evaluation value calculated by calculating the minute cost E) Specific information that identifies the line segment that is the connection source of the target line segment in the connection route that has the highest evaluation value as the optimal connection source line segment (here, the optimal link source) The information indicating the line segment name) is stored in the storage means (here, the hard disk 28), while the rectangular area is formed using the line segment whose calculated first evaluation value is the highest evaluation value. When the end point position exists in the formed rectangular area, the specific information is read from the storage unit, and the end point position is reached from the start point position via the line segment specified by the specific information. Since the final connection route is derived by tracing back to the end, the connection route can be created more accurately as compared with the case where the present invention is not applied.

  Further, in the present embodiment, the first evaluation formula is determined by whether or not there is a bend between the target line segment and the line segment that is the connection source of the target line segment, and the target line segment and the target line segment. The value obtained based on the distance between the line segments as the connection source, the accumulated value by the line segment from the start point position to the target line segment, and the value corresponding to the Manhattan distance from the target line segment to the end point position Since the second evaluation expression is an arithmetic expression for calculating the cumulative value, an accurate connection path according to these parameters can be created.

  In particular, in the present embodiment, weight values for parameters used in the first evaluation formula and the second evaluation formula are received, and the first evaluation value and the second evaluation value are received as weight values. Since the corresponding parameter is calculated as a weighted value, the evaluation value corresponding to the application can be obtained, and as a result, the connection route can be created more accurately.

  Moreover, in this Embodiment, since the connection path | route created until then is applied as the said obstruction, the connection path | route between several sets of apparatuses can be created.

  In the present embodiment, the storage means stores in advance minimum turning radius information indicating the minimum value of the bending radius of the members constituting the connection path, and the start position and the end position correspond to each other. Since the position is separated from the device by a distance corresponding to the minimum turning radius indicated by the minimum turning radius information, the connection path can be created more accurately.

  Furthermore, in the present embodiment, the storage means stores in advance minimum allowable distance information indicating the minimum allowable distance between the connection path and the obstacle, and indicates the minimum allowable distance information from the obstacle. Since the connection path is derived so as to be separated by more than a predetermined distance, the connection path can be created more accurately.

[Second Embodiment]
In the second embodiment, a description will be given of a form example in the case of having an obstacle that can penetrate the connection path.

  The configuration of the connection path creation device 10 according to the second embodiment is the same as that according to the first embodiment (see FIGS. 1 to 3). Omitted.

  In the connection route creation apparatus 10 according to the second embodiment, the inter-device connection information database DB1, the piping / duct specification information database DB2, the building CAD according to the first embodiment are stored in the database area DB of the hard disk 28. In addition to the information database DB3, line segment information database DB4, and line segment link information database DB5, a building member specification information database DB6 is included.

  The building member specification information database DB6 is a database of information indicating whether or not the connection route can be penetrated for each member to be applied in the connection route creation device 10. As shown in FIG. 13 as an example, the building member specification information database DB6 according to the present embodiment is a database for each member constituting the building to be processed with each information of the member name, details, and wall penetration permission flag. It is configured as

  In addition, the said member name and the details are the same information as the information of the same name in building CAD information database DB3, and the said wall penetration permission flag shows whether a connection path | route is permitted to penetrate a corresponding member. Information. As shown in the figure, in the connection route creation device 10 according to the present embodiment, as the wall penetration permission flag, information indicating '◯' is used when allowing penetration, and when penetration is not permitted. Needless to say, the information indicating “x” is used, but not limited thereto.

  In the connection route creation device 10 according to the second exemplary embodiment, it is determined whether or not obstacles such as partition walls and outer walls provided in a building to be processed can penetrate the connection route. The “member name” and “detail” corresponding to the object can be grasped by reading from the building CAD information database DB3 and referring to the wall penetration permission flag of the building member specification information database DB6 corresponding to these pieces of information. For example, when the building CAD information database DB3 is as shown in FIG. 6 and the building member specification information database DB6 is as shown in FIG. 13, the obstacle given “10001” as the member ID is the member name. Is “partition wall”, the details are “wood shaft”, and the wall penetration permission flag corresponding to these pieces of information is information indicating “◯”, and therefore, as schematically shown in FIG. In addition, it can be understood that the obstacle can penetrate the connection path.

  Next, the operation of the connection path creation device 10 according to the second exemplary embodiment will be described.

  Also in the connection path creation device 10 according to the second exemplary embodiment, when the user inputs a creation instruction for creating a connection path by operating the keyboard 14 and the mouse 16, the CPU 22 performs the above first embodiment. A program substantially similar to the connection route creation program and the piping / duct layout processing routine program (see FIGS. 10 to 11) according to the embodiment is executed. In the following, differences between the program shown in FIGS. 10 to 11 and the program executed by the connection route creation apparatus 10 according to the second embodiment will be described with reference to FIG.

  In the connection route creation device 10 according to the second exemplary embodiment, as described above, whether or not an obstacle applied in the piping / duct layout processing routine / program can penetrate the connection route is It specifies by referring CAD information database DB3 and building member specification information database DB6.

  When the line segment is swept (deployed), the obstacle that can penetrate the connection path is swept to the opposite side across the obstacle without stopping the sweep even if it hits the obstacle. To do. For example, in FIG. 15A, when an obstacle provided in the central portion in the search area can penetrate the connection path, as shown in FIG. When sweeping the line segment of the segment name M, the sweep across the obstacle is performed.

  On the other hand, when the obstacle cannot penetrate the connection path, as shown in FIGS. 15C to 15E as an example, the piping / duct layout according to the first embodiment is used. Performs the same processing as the processing routine program.

  Further, in the connection route creation device 10 according to the second exemplary embodiment, the following equation (5) is applied as an evaluation equation for calculating the first line segment cost E, and the second line segment cost E The following expression (6) is applied as an evaluation expression for calculating ', and the following expression (7) is applied as an evaluation expression for calculating the link cost e.

E = Σ (aB + bD + W) (5)
E ′ = E + cZ (6)
e = aB + bD + W (7)
In the above formulas (5) and (7), W is an increase in cost for penetrating the obstacle, and other parameters are the formulas (2) to (4) according to the first embodiment. It is the same. In the connection route creation device 10 according to the second exemplary embodiment, the user inputs the increment W via the keyboard 14, the mouse 16, and the like. Needless to say, this can be read and applied.

  As a result, the line segment that passes through the obstacle is higher in cost than the line segment that does not pass through the obstacle. As a result, a route search that avoids the penetration of the obstacle as much as possible can be performed.

  As described above in detail, in the second embodiment, the same effect as that of the first embodiment can be obtained, and an obstacle is connected to the connection path by the storage means (here, the hard disk 28). The penetrability information (in this case, the wall penetration permission flag) indicating whether or not it can be penetrated is stored in advance, and the obstacle indicated by the penetrability information that the connection path can be penetrated is stored. Since it excludes from the obstacle which restricts the range which sweeps the line segment at the time of forming the rectangular area, a connection path can be created more accurately.

  In the second embodiment, the case where the obstacle can pass through the connection path unconditionally when the obstacle can penetrate the connection path has been described. However, the present invention is not limited to this, and is only an example. As shown in FIG. 16, when a non-penetrating member that cannot pass through a connection path such as a wooden shaft is used inside an obstacle, the form is made to penetrate so as to avoid the non-penetrating member. It can also be. In this case, information indicating the position of the non-penetrating member is stored in advance in the hard disk 28 or the like, and a position where the connection path can be penetrated is specified using the information. In this case, the connection path can be created more accurately as compared to the second embodiment.

[Third Embodiment]
In the third embodiment, when a down ceiling is required when a pipe or duct is provided by a connection path created by the connection path creation device 10, the area of the falling ceiling is taken into account in calculating the cost. A form example will be described.

  The configuration of the connection path creation device 10 according to the third embodiment is the same as that according to the first and second embodiments (see FIGS. 1 to 3). Description of is omitted.

  In the connection route creating apparatus 10 according to the third embodiment, the inter-device connection information database DB1, the piping / duct specification information database DB2, the building CAD according to the second embodiment are stored in the database area DB of the hard disk 28. In addition to the information database DB3, line segment information database DB4, line segment link information database DB5, and building member specification information database DB6, a room information database DB7 and a room weight information database DB8 are included.

  The room information database DB7 is a database of information about rooms provided in a building to be processed. As shown in FIG. 17 as an example, the room information database DB7 according to the present embodiment stores information on a room ID, a room type, a minimum ceiling height, the number of vertices, and a vertex coordinate list in a building to be processed. It is configured as a database for each room provided.

  The room ID is information individually assigned to the room in order to specify the room provided in the building to be processed. As shown in FIG. 17, in the connection route creation device 10 according to the present embodiment, numerical information is applied as the room ID. However, the present invention is not limited to this, and the character information and numerical information are used alone or in combination. It goes without saying that any information can be applied as long as it is information that can individually identify each room, such as a form to be applied.

  The room type is information indicating the type of living room or hallway of the corresponding room, and the minimum ceiling height is information indicating the minimum ceiling height allowed for the corresponding room. The number of vertices is information indicating the number of vertices of the corresponding room, and the vertex coordinate list is information indicating the positions of the vertices of the corresponding room. In the connection path creation device 10 according to the present embodiment, the vertex coordinate list also uses three-dimensional coordinates with the origin position coordinates as the origin, but it is needless to say that the present invention is not limited to this. .

  On the other hand, the room weight information database DB8 has a first line segment cost E and a second line segment cost E to be described later for each room type to be applied in the connection route creation apparatus 10 according to the third embodiment. 'And information on the falling ceiling used for calculating the link cost e are stored in a database. As shown in FIG. 18 as an example, the room weight information database DB8 according to the present embodiment is configured as a database of room type information, falling ceiling weight information, and special cost information for each room type. ing.

  The room type is the same information as the information of the same name in the room information database DB7, and the falling ceiling weight is information indicating a weighting value in the case of the falling ceiling applied to the room of the corresponding room type. Further, the special cost is information indicating a value to be added to the cost when a specific pipe or duct is provided for the corresponding room type.

  Next, the operation of the connection path creation device 10 according to the third exemplary embodiment will be described.

  Also in the connection route creation device 10 according to the third exemplary embodiment, when the user inputs a creation instruction for creating a connection route by operating the keyboard 14 and the mouse 16, the CPU 22 performs the above first embodiment. A program substantially similar to the connection route creation program and the piping / duct layout processing routine program (see FIGS. 10 to 11) according to the embodiment is executed. In the following, differences between the program shown in FIGS. 10 to 11 and the program executed by the connection path creation device 10 according to the third embodiment will be described.

  In the connection path creation device 10 according to the third exemplary embodiment, the following equation (8) is applied as an evaluation equation for calculating the first line segment cost E, and the second line segment cost E ′ is The following formula (9) is applied as an evaluation formula for calculating, and the following formula (10) is applied as an evaluation formula for calculating the link cost e.

E = Σ (aB + bD + W + dA + T) (8)
E ′ = E + cZ (9)
e = aB + bD + W + dA + T (10)
In the above equations (8) and (10), A is information indicating the area of the falling ceiling generated by providing the members constituting the connection path, d is a weighting value for the area of the falling ceiling, and T Is the special cost, and other parameters are the same as those in the equations (5) to (7) according to the second embodiment. Note that in the connection path creation device 10 according to the third exemplary embodiment, the coefficient d is input by the user via the keyboard 14, the mouse 16, and the like. Needless to say, this can be read and applied.

  That is, in the connection route creation device 10 according to the third exemplary embodiment, if there is a shortage of space between the building slab and the ceiling of the building to be processed by providing piping or ducts, A falling ceiling is provided, and the area of the falling ceiling is added as a cost.

  Specifically, it is obtained by subtracting the ceiling height (the largest Z coordinate among the Z coordinates of the ceiling) from the height of the lower end of the frame slab (the smallest Z coordinate among the Z coordinates of the housing slab). If the value is less than the value obtained by adding twice the minimum allowable distance to the outer diameter of the corresponding pipe or duct, a falling ceiling is provided.

  Here, the area of the descending ceiling is calculated by multiplying the length of the line segment by the width of the descending ceiling. At this time, the length of the line segment is calculated by the following equation, where the coordinate of the start point Ps of the line segment is (Xs, Ys, Zs) and the coordinate of the end point Pe is (Xe, Ye, Ze).

In addition, the width of the falling ceiling is set to a value such as twice the distance from the wall to the line segment along the wall, and twice the outer diameter in other cases. Note that the height of the falling ceiling is (Y coordinate of line segment-1/2 of the outer diameter of the corresponding pipe or duct-the above-mentioned minimum allowable distance).

  Further, in the connection route creation device 10 according to the third exemplary embodiment, for example, the living room increases the weighting value compared to the toilet or the corridor, depending on the type of the room that has become the falling ceiling. The weight value d is changed.

  That is, referring to the room information database DB7, the room type is specified from the room ID of the room that has become the falling ceiling, and the falling ceiling weight corresponding to the specified room type is read from the room weight information database DB8. Is applied as the weighting value d.

  Further, in the connection path creation device 10 according to the third exemplary embodiment, when the falling ceiling is lower than a predetermined height, the cost related to the falling ceiling is set to infinity.

  That is, the calculated height of the falling ceiling is compared with the minimum ceiling height of the corresponding room type registered in the room information database DB7, and if the calculated height of the falling ceiling is lower, the falling ceiling The cost regarding is infinite.

  Further, in the connection path creation device 10 according to the third exemplary embodiment, when the falling ceiling does not follow the wall and crosses the center of the room, the cost related to the falling ceiling is compared with the case where the falling ceiling follows the wall. Make it bigger.

  That is, first, a line segment vector is calculated in the same manner as the calculation procedure B described above indicating the presence or absence of bending. Next, the inner product of the calculated vector and the wall vector is taken, and the distance between the line segment and the wall is calculated for an absolute value close to '1' (a wall parallel or substantially parallel to the line segment) To do.

  Here, when calculating the said distance, first, the equation of a line segment is calculated | required as follows. If the coordinates of the start point Ps of the line segment are (Xs, Ys, Zs) and the coordinates of the end point Pe are (Xe, Ye, Ze), the equation of the line segment (straight line) on the XY plane is As given.

ax + by + c = 0
However, a = Ys−Ye, b = Xe−Xs, c = (Xs × Ye) − (Xe × Ys)
On the other hand, the distance from each vertex of the wall to the straight line is calculated by the following equation where the vertex coordinates are (Vx, Vy, Vz).

Of the distances calculated here, the distance to the nearest vertex is taken as the distance to the wall.

  Of the distances calculated in this way, if the distance to the nearest wall is greater than a predetermined distance, for example, three times the outer diameter of the corresponding pipe or duct, the pipe or duct will pass through the center of the room. Assuming that it passes, add an appropriate constant value to the cost to increase the cost compared to other cases, or add the outer diameter of, for example, a pipe or duct to the cost.

  On the other hand, in the connection path creation device 10 according to the third embodiment, when a specific pipe such as a pipe for draining sewage passes through a specific room such as a living room, it does not pass. Increase costs.

  That is, referring to the room information database DB7, the room type is specified from the room ID of the room that has become the falling ceiling, the special cost T corresponding to the specified room type is read from the room weight information database DB8, and the special cost T To be added.

  As described above in detail, in the third embodiment, the same effects as in the second embodiment can be obtained, and the evaluation value to be calculated includes the cost related to the area of the falling ceiling and the piping. Alternatively, since a cost (special cost) according to the type of room in which the duct is provided is taken into account, the connection path can be created more accurately.

  That is, in this third embodiment, when the space between the housing slab and the ceiling is insufficient, the falling ceiling is set in the insufficient portion, and the area of the falling ceiling is reflected in the evaluation value. It is possible to meet the demands of reducing the falling ceiling as much as possible.

  Also, since the weighting value for the area of the falling ceiling is changed according to the type of the room that has become the falling ceiling, for example, an important living room such as a living room wants to secure a high ceiling, but otherwise the ceiling may be lowered It is possible to respond to the request.

  Further, since the cost is infinite when the falling ceiling is lower than a predetermined height, it is possible to meet the requirement for the minimum ceiling height.

  Also, if the falling ceiling does not follow the wall and crosses the center of the room, the cost is higher than in other cases, so the falling ceiling was in the corner of the room rather than being provided in the center of the room It is possible to meet the demand of better.

  Furthermore, when a specific pipe such as a pipe that drains sewage passes through a specific room such as a living room, the cost is higher than in other cases. Can respond to requests such as not wanting to affect important living rooms such as living rooms.

  As mentioned above, although this invention was demonstrated using embodiment, the technical scope of this invention is not limited to the range as described in the said embodiment. Various changes or improvements can be added to the above-described embodiment without departing from the gist of the present invention, and embodiments to which such changes or improvements are added are also included in the technical scope of the present invention.

  The above embodiments do not limit the invention according to the claims (claims), and all the combinations of features described in the embodiments are essential for the solution means of the invention. Is not limited. The above embodiments include inventions at various stages, and various inventions can be extracted by appropriately combining a plurality of disclosed constituent elements. Even if some constituent requirements are deleted from all the constituent requirements shown in the above-described embodiment, as long as an effect is obtained, a configuration from which these several constituent requirements are deleted can be extracted as an invention.

  For example, in each of the above-described embodiments, the case has been described where the line segment to be traced when performing reverse tracking is only the line segment that has been swept when forming the rectangular region, but the present invention is not limited to this. For example, as shown in FIG. 19 as an example, information indicating an area in which a connection route can be arranged when searching from the start point position toward the end point position (hereinafter referred to as “route arrangement possible area information”). Is registered in the hard disk 28, and when performing the reverse tracking, referring to the route arrangement possible region information, as shown in FIG. 20 as an example, the region surrounded by the line segment is recognized and the connection route is determined. By creating, it is possible to obtain a connection route that does not exist on a line segment in an oblique direction or the like. In this case, since the connection path can be made shorter, the connection path can be created more accurately.

  Also, in each of the above embodiments, when searching from the start point position toward the end point position, the optimal link source line segment names of all line segments are registered, and the case of performing reverse tracking based on this is described. However, the present invention is not limited to this. For example, when searching from the start point position toward the end point position, the optimal link source line segment name is only used for the part where the line segment branches when performing reverse tracking. When the reverse tracking is performed, tracking is performed with reference to the corresponding optimum link source line segment name only when the line segment branches, and when the line segment does not branch, the line segment link information database DB5 It can also be set as the form which tracks with reference to a link former line segment name.

  In addition, for example, when searching from the start point position toward the end point position, the optimum link source line segment name is not registered, and when performing reverse tracking, the line segment information database DB4 is used when the line segment branches. If the line segment with the lower value is applied with reference to the corresponding first line segment cost E and the line segment does not branch, tracking is performed with reference to the link source line segment name in the line segment link information database DB5. It can also be set as the form to perform.

  In these cases, the same effects as those of the above embodiments can be obtained.

  In addition, not all of the parameters applied in each evaluation formula according to each of the above embodiments are essential, and one or a plurality of combinations of the applied parameters may be applied. Also in this case, substantially the same effects as those of the above embodiments can be obtained.

  In each of the above embodiments, the case where the cost is applied as the first evaluation value and the second evaluation value of the present invention has been described. However, the present invention is not limited to this, and the connection path is configured. Is a physical quantity that indicates the height of evaluation as a line segment, the first evaluation value is a physical quantity that determines the next search location, and the second evaluation value is a physical quantity that determines the superiority or inferiority of the connection path, Any physical quantity can be applied.

  In addition, the configuration (see FIGS. 1 to 3) of the connection route creation device 10 described in the above embodiments is merely an example, and it is needless to say that the configuration can be appropriately changed without departing from the gist of the present invention. .

  For example, in each of the above embodiments, the case where the present invention is realized by a single personal computer has been described. However, the personal computer is connected to the Internet as a server device, and the input screen is provided in the client device of the access source. By adopting a configuration for displaying on a display device, a system via the Internet can also be configured.

  In each of the above embodiments, the case where the process of storing the information indicating the derived connection path in the hard disk 28 is applied as the process performed by the process execution unit of the present invention. However, the present invention is not limited to this. For example, it is possible to adopt a form in which a process of displaying information indicating the derived connection route by the display unit is applied. Here, the display by the display means includes visible display by a display device, permanent visible display by an image forming apparatus, and audible display by a sound generator. Also in this case, the same effects as those of the above embodiments can be obtained.

  Further, the flow of processing of various programs shown in the above embodiments (see FIGS. 10 to 11) is also an example, and unnecessary steps can be deleted or newly added without departing from the gist of the present invention. It goes without saying that various steps can be added and the processing order can be changed.

  Also, the various arithmetic expressions shown in the above embodiments are examples, and it goes without saying that they can be changed as appropriate without departing from the gist of the present invention.

  Furthermore, the configurations of the various databases shown in the above embodiments (see FIGS. 4 to 8, 13, 13, and 18) are examples, and can be appropriately changed without departing from the gist of the present invention. Needless to say.

It is a perspective view which shows the external appearance of the connection path | route production apparatus which concerns on embodiment. It is a block diagram which shows the principal part structure of the electric system of the connection path | route production apparatus which concerns on embodiment. It is a schematic diagram which shows the main memory content of the hard disk with which the connection path | route production apparatus which concerns on embodiment was equipped. It is a schematic diagram which shows the structure of the apparatus connection information database which concerns on embodiment. It is a schematic diagram which shows the structure of the piping and duct specification information database which concerns on embodiment. It is a schematic diagram which shows the structure of the building CAD information database which concerns on embodiment. It is a schematic diagram which shows the structure of the line segment information database which concerns on embodiment. It is a schematic diagram which shows the structure of the line segment link information database which concerns on embodiment. It is a schematic plan view which shows the specific example of the start point coordinate which concerns on embodiment, a start point vector, a start point, a start line segment, an end point coordinate, an end point vector, an end point, an end line segment, the minimum rotation radius, and the minimum allowable distance. It is a flowchart which shows the flow of a process of the connection route creation program which concerns on embodiment. It is a flowchart which shows the flow of a process of the piping and duct layout process routine program which concern on embodiment. It is a schematic plan view with which it uses for description of the flow of a process of the connection route creation program which concerns on 1st Embodiment. It is a schematic diagram which shows the structure of the building member specification information database which concerns on 2nd Embodiment. It is a schematic plan view with which it uses for description of the building member specification information database which concerns on 2nd Embodiment. It is a schematic plan view with which it uses for description of an effect | action of the connection path | route production apparatus which concerns on 2nd Embodiment. It is a schematic plan view with which it uses for description of the modification of 2nd Embodiment. It is a schematic diagram which shows the structure of the room information database which concerns on 3rd Embodiment. It is a schematic diagram which shows the structure of the room weight information database which concerns on 3rd Embodiment. It is a schematic diagram which shows the structure of the path | route arrangement | positioning area | region information with which it uses for description of the modification of embodiment. It is a schematic plan view with which it uses for description of the modification of embodiment.

Explanation of symbols

10 Connection path creation device 14 Keyboard (reception means)
16 Mouse (reception means)
18 display 22 CPU (derivation means, processing execution means)
28 Hard disk (storage means)

Claims (8)

Start point position information indicating the start point position of the connection path between devices for which a connection path is to be created in the building, end point position information indicating the end point position of the connection path, and an obstacle indicating the position of the obstacle with respect to the connection path Storage means for storing location information in advance;
When creating the connection path, the start point position information, the end point position information, and the obstacle position information are read from the storage unit, and a line segment passing through the start point position indicated by the start point position information is generated. When a rectangular area is formed by sweeping a minute in the vertical direction of the line segment until it hits the obstacle indicated by the obstacle position information, and the end point position indicated by the end point position information does not exist in the formed rectangular area A new line segment is generated on the outer periphery of the rectangular area, and a first evaluation value is calculated for each of the generated line segments using a first evaluation formula that is predetermined to determine the next search location. The rectangular area is formed again using the line segment having the highest evaluation value for the first evaluation value, and when the end point position exists in the formed rectangular area, And deriving means for deriving a final connection path by line expansion method for tracing back the segment is swept when forming the serial rectangular area from the end position up to the start position,
Processing execution means for executing a predetermined process using result information indicating a derivation result by the derivation means;
With
When calculating the first evaluation value, the derivation means determines the superiority or inferiority of the connection route for each connection route from the start point position to the target line segment that is the calculation target of the first evaluation value. The second evaluation value is calculated by a second evaluation formula determined in advance, and the second evaluation value is the connection source of the target line segment in the connection route having the highest evaluation value. The storage unit stores specific information that can identify the line segment as an optimal connection source line segment, and reads the specific information from the storage unit when performing the reverse tracking, A connection path creation device characterized by performing reverse tracing so as to pass through a line segment specified by specific information. The first evaluation formula is the presence or absence of a bend between the target line segment and the line segment that is the connection source of the target line segment, and between the target line segment and the line segment that is the connection source of the target line segment. A value obtained based on at least one of a distance, an area of a falling ceiling generated in the building by providing the target line segment, and a type of room in which the connection path is provided reaches from the start point position to the target line segment. It is an arithmetic expression for adding a value corresponding to the Manhattan distance from the target line segment to the end point position to the accumulated value by the line segment,
The connection path creation device according to claim 1, wherein the second evaluation formula is an arithmetic formula for calculating the cumulative value. A receiving means for receiving weight values for parameters used in the first evaluation formula and the second evaluation formula;
The connection route creation device according to claim 2, wherein the derivation unit calculates the first evaluation value and the second evaluation value as values obtained by weighting corresponding parameters by the weighting values received by the receiving unit. . The storage means further stores in advance penetrability information indicating whether or not the obstacle can penetrate the connection path,
The derivation means excludes an obstacle, which indicates that the connection path can be penetrated by the penetration availability information, from an obstacle that limits a range of sweeping the line segment when forming the rectangular region. The connection path creation device according to any one of claims 1 to 3. The connection route creation device according to any one of claims 1 to 4, wherein the derivation unit applies a connection route created so far as the obstacle when creating a connection route between a plurality of sets of devices. . The storage means further stores in advance minimum turning radius information indicating a minimum value of a bending radius of a member constituting the connection path,
The start point position and the end point position are positions that are separated from the corresponding device by a distance corresponding to the minimum rotation radius indicated by the minimum rotation radius information. Connection path creation device. The storage means further stores in advance minimum allowable distance information indicating a minimum allowable distance between the connection path and the obstacle,
The connection route creation device according to any one of claims 1 to 6, wherein the deriving unit derives the connection route so as to be separated from the obstacle by a distance indicated by the minimum allowable distance information. When creating a connection route in a building, start point position information indicating the start point position of the connection route between devices for which the connection route is to be created, end point position information indicating the end point position of the connection route, and the connection route A step of reading out the start point position information, the end point position information, and the obstacle position information from storage means in which obstacle position information indicating the position of the obstacle is stored in advance;
Formation of forming a rectangular region by generating a line segment passing through the start point position indicated by the start point position information and sweeping the line segment in the vertical direction until the line segment hits the obstacle indicated by the obstacle position information Steps,
When the end point position indicated by the end point position information does not exist in the rectangular area formed by the forming step, a new line segment is generated on the outer periphery of the rectangular area. A first evaluation value is calculated using a first evaluation formula that is determined in advance to determine a search location, and each connection route from the start point position to a target line segment that is a calculation target of the first evaluation value is calculated. For each, a calculation step of calculating a second evaluation value by a second evaluation formula determined in advance as determining the superiority or inferiority of the connection path;
Assuming that the line segment that is the connection source of the target line segment in the connection route in which the second evaluation value calculated in the calculation step has the highest evaluation value is the optimal connection source line segment A storage step of storing specific information capable of specifying a minute in the storage means;
A re-forming step in which the formation of the rectangular region is performed again by the forming step using a line segment in which the first evaluation value calculated by the calculating step is the highest value;
When the end point position is present in the rectangular region formed by the forming step, the specific information is read from the storage unit, and the start point position from the end point position passes through the line segment specified by the specific information. A derivation step for deriving the final connection path by tracing back to
A process execution step of executing a predetermined process using result information indicating a derivation result of the derivation step;
A connection route creation program that causes a computer to execute.