JP2014035761A - Support system and support method of electric instrumentation designing - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a support system and a support method for electric instrumentation designing capable of handling a cable which is stored in a tray from a half way thereof without requiring pre-setting of branching points of the tray.SOLUTION: A tray laid in a plant is represented with a center line of the tray; the center line of the tray is defined by using three-dimensional coordinates of the vertex; and a start point and an end point of a cable to be laid are defined using the three-dimensional coordinates. When a terminal point which is the vertex of the center line of one tray is positioned adjacent to a part of the center line of the other tray, the center line of the other tray is divided and the tray center line including the divided center line is defined as a candidate of path. The terminal point adjacent to the terminal point of the candidate path is given with identical node number. After obtaining plural paths which run from the candidate path to the start point or end point, in the plural candidate paths a position on the shortest path is defined as a receiving point. A path between a receiving point at the start point side on the candidate path and a receiving point at the end point side on the candidate path is determined by using the node numbers.

Description

  The present invention relates to an electrical instrumentation design support apparatus and support method for supporting electrical instrumentation design in various plants such as thermal power plants, and in particular, electrical instrumentation design support for supporting installation of instrumentation equipment such as cable trays and cables. The present invention relates to an apparatus and a support method.

  When constructing various plants such as thermal power plants (hereinafter simply referred to as plants), it is necessary to estimate the electrical instrumentation used in these plants. In estimating the electrical instrumentation of a specific plant, it is necessary to determine the location of the cable tray that stores the cables (hereinafter simply referred to as the tray) and accurately estimate the route of each cable from the start point to the end point in a short time. There is.

  Among these, the arrangement of trays (including cross-sectional dimensions) is determined depending on the positional relationship with the floor, pillars, other structures, etc. (hereinafter simply referred to as structures) in the plant and the cable route. On the other hand, the route of each cable from the start point to the end point depends on the location of the tray. For this reason, either the arrangement or the route is not completely determined first.

  Moreover, in the estimation of the electrical instrumentation of the plant, it is necessary to consider the lower limit in order to keep the upper limit of the space factor of the cable accommodated in the tray and to reduce the cost of materials and construction. For example, a large tray is used so that the space factor does not exceed the upper limit. On the other hand, a small tray is used or the tray is removed so that the space factor does not fall below the lower limit. When removing the tray, change the cable path or place it in the conduit.

  It should be noted that most cables are accommodated from the middle of the tray.

  Based on these characteristics, it is required to accurately estimate the amount of trays, conduits, and cables that are designed to be low cost.

  Japanese Patent Application Laid-Open No. H10-228561 describes a method for easily collecting quantities by automatically searching for a cable route with respect to a tray arranged in advance.

  Patent Document 2 describes a method of automatically extracting the intersection of trays.

JP 2007-52495 A JP-A-10-269269

  However, in order to accurately estimate the amount of cable, it is necessary to further solve the following problems. First, there are the following problems in order to accurately estimate the amount of cable.

  Since the conventional method does not correspond to the route of the cable accommodated from the middle of the tray, the cable route cannot be obtained with sufficient accuracy.

  In order for the computer to automatically search for the cable, it is necessary to set in advance the branch point of the tray. However, setting the branch point takes time and effort.

  In the intersection extraction method described in Patent Document 2, since the intersection is determined when it is completely touching, it is not possible to consider a route that crosses between adjacent but not touching trays.

  In view of the above, an object of the present invention is to provide an electrical instrumentation design support apparatus and a support method that correspond to a cable accommodated from the middle of a tray and that do not require prior setting of a branching point of the tray.

In order to solve the above problems, the present invention is an apparatus for supporting electrical instrumentation design for arranging trays and cables in a plant,
A unique cable number is set for the cable laid between the start point and end point, the cable list database that associates the start point and end point for each cable number, and the tray laid in the plant is represented by the tray center line. A tray placement database in which the number is set and the three-dimensional coordinates of the vertex of the tray center line are set for each tray number, and a joint point placement database in which the three-dimensional coordinates of the start point and end point are set,
For a plurality of tray center lines, when the end point that is the vertex of one tray center line and a part of the other tray center line are in an approaching state, the other tray center line is divided, and the tray center including the divided ones Tray placement analysis means for positioning the line as a route candidate line and assigning the same node number to the end points in the approaching state with respect to the end points of the route candidate lines;
A path from the candidate line to the start point or the end point is obtained for each path candidate line, and the accommodation point acquisition means for defining the candidate path as the shortest path and the position on the candidate route line as the accommodation point,
Cable route search means is provided for determining a route between a starting point-side accommodation point on the route candidate line and an end point-side accommodation point on the route candidate line using a node number.

In order to solve the above problems, the present invention is a method for supporting electrical instrumentation design for arranging trays and cables in a plant,
Tray laid in the plant is represented by a tray center line, each tray center line is defined by the three-dimensional coordinates of its apex, the start point and the end point when laying the cable are defined by three-dimensional coordinates,
A tray including a plurality of the tray center lines that are divided by dividing the other tray center line when an end point that is a vertex of one tray center line and a part of the other tray center line are in an approaching state. Position the center line as a route candidate line, and give the same node number to the end points that are in an approaching state with respect to the end points of the route candidate line,
The route from the route candidate line to the start point or the end point is obtained for each route candidate line, the route candidate line that is the shortest route among them and the position on the route candidate line are determined as accommodation points,
A path between a starting point-side accommodation point on the route candidate line and an end point-side accommodation point on the route candidate line is defined using a node number.

  According to the present invention, it corresponds to the cable accommodated from the middle of the tray, and it is not necessary to set in advance the branching point of the tray.

  Furthermore, according to the Example of this invention, there can exist the following effects.

  In the system in which the computer automatically searches for the cable path, the tray arrangement analyzing unit automatically extracts the branching point of the arranged tray, so that the operator does not need to set the branching point. Thereby, after carrying out tray arrangement design, it is possible to quickly carry out an automatic search for cable paths.

  In addition, since the accommodation point acquisition means automatically searches for the accommodation point where the cable is accommodated in the middle of the tray, it is possible to obtain an accurate cable path and an accurate amount of cable and conduit based on the cable path.

  Furthermore, since the results of the cable path and the space factor can be obtained in a short time, the space factor can be fed back to the tray size, and the tray layout can be accurately designed and the amount of the tray can be estimated.

The block diagram which shows the hardware constitutions of an electrical instrumentation design support apparatus. The figure which showed the electrical instrumentation design support example in three-dimensional space. The figure which described the database structure and various calculation functions collectively. The figure which shows the memory content of cable list database DB1. The figure which represented the tray T of a three-dimensional shape with the straight line. The figure which shows the memory content of tray arrangement | positioning database DB2. The figure which shows the memory content of tray arrangement | positioning database DB2. The figure which shows the memory content of the joint point arrangement | positioning database DB3. The figure which shows the memory content of tray standard dimension list database DB4. The figure which shows the memory content of analysis condition database DB8. The figure which shows the memory content of route candidate line database DB5. The figure which shows the memory content of the accommodation point list database DB6. The figure which shows the memory content of cable route search result database DB7. The figure which shows the state which has arrange | positioned the tray and the start / end in three-dimensional space. The figure which shows the electrical instrumentation construction design support menu of a menu screen. The figure which showed the path | route candidate line in the case of the three-dimensional structure of FIG. The figure which shows the basic flow of a present Example. The flowchart which shows the detailed process step of tray arrangement | positioning analysis processing. The figure which shows the database structure of the initial state of the processing flow of FIG. The figure which shows the database structure in the middle of the processing flow of FIG. The figure which shows the database structure of the completion | finish state of the processing flow of FIG. The figure showing the initial state of a route candidate line. The figure which shows the processing condition of tray T1 and T3. The figure which shows the processing condition of tray T1 and T5. The figure which shows typically the node provision state by the processing flow of FIG. The figure which shows the processing flow which provides a node number. The figure which shows the database structure of the completion state of the processing flow of FIG. The figure for demonstrating the idea of accommodation point acquisition. The figure which shows the example of a space factor display screen.

  Embodiments of the present invention will be described below with reference to the drawings.

  FIG. 1 shows a hardware configuration of an electrical instrumentation design support apparatus according to the present embodiment. The electrical instrumentation design support apparatus 1 includes a bus 13, an arithmetic processing device 12, a main storage device 14, an image processing unit 15, a monitor 16 as a screen display unit, an input / output device 17, a data recording unit 18, a keyboard 11, and a mouse 19. It is comprised by the well-known computer system containing. The arithmetic processing device 12, the image processing unit 15, the input / output device 17, and the data recording unit 18 are connected to each other via a bus 13 so that they can communicate with each other.

  Among them, the arithmetic processing unit 12 reads out the electrical instrumentation design support program and the electrical instrumentation design drawing data recorded in the data recording unit 18 and stores them together with the input data sent from the input / output unit 17 in the main storage unit 14. . The arithmetic processing unit 12 executes an electrical instrumentation design support program and sends a graphic to be displayed on the monitor 16 to the image processing unit 15. Further, the data to be stored is sent to the data recording unit 18 via the input / output device 17.

  The image processing unit 15 receives the image data sent from the arithmetic processing unit 12 and outputs a graphic to the monitor 16. The input / output device 17 is connected to the arithmetic processing device 12, the data recording unit 18, the keyboard 11, and the mouse 19 through the bus 13. The input / output device 17 is an interface for the arithmetic processing device 12 to access the data recording unit 18, the keyboard 11, and the mouse 19.

  Hereinafter, an example of the concept of electrical instrumentation design support of the present invention will be described taking the electrical instrumentation design example of FIG. 2 as an example. FIG. 2 shows a three-dimensional space at appropriate locations in the plant. This space is represented by XYZ coordinates with the O point as a reference position.

  In the space of FIG. 2, five trays T are arranged as an example among an unspecified number of trays T arranged in the plant. The fifth tray T5 extending in the height direction (Z), the first and second trays T1 and T2 extending in the depth direction (Y) and having different height positions, and the front direction (X) The third and fourth trays T3 and T4 that are stretched and have different height positions correspond to this.

  However, it is assumed that the first tray T1 and the third tray T3 have the same height position, and the third tray T3 starts to extend in the forward direction from the position where they approach each other. Further, it is assumed that the fourth tray T4 starts to extend in the forward direction from a position close to the fifth tray T5. In other words, the trays are only close, not connected.

  In the exemplary tray arrangement shown in FIG. 2, in this example, a route for laying the cable C101 from the start point PS to the end point PE is determined. In this example, one start point PS and one end point PE are displayed, but in general, a plurality of cables are arranged between a plurality of start points PS and a plurality of end points PE.

  The cable laying between the start point PS and the end point PE is basically a straight line arrangement, and the point where the traveling direction is changed is hereinafter referred to as a joining point P. The joint point includes the start point PS and the end point PE.

  FIG. 2 shows the tray T and the connection point P. Of these, the dotted line indicates the conduit path, and the solid line indicates the in-tray path. The in-tray path is the path of the connection point PS02-tray T4-tray T5-tray T1-the connection point PE02, and the conduit path is the start point PS-the connection point PS01-the connection point PS02 and the connection point PE02-the connection point. This is a route of PE01-end point PE.

  In addition, especially the connection point P of the part which moves to a tray from a conduit tube to the tray among the connection points P may be called an accommodation point. In FIG. 2, the accommodation points are PS02 and PE02.

  The shortest route of the cable C101 finally determined by the route search in the example of FIG. 2 starts from the starting point PS and follows the conduit route (starting point PS−joining point PS01−joining point PS02), and the joining point PS02 (accommodating) Is stored in the middle of the fourth tray T4 at the point PS02), passes through the tray T in the order of the fifth tray T5 and the first tray T1, and passes through the tray T1 in the middle of the first tray T1 (accommodating point PE02). This is a route that leaves the first tray T1 and reaches the end point PE through the conduit path (joining point PE02−joining point PE01−end point PE).

  The conduit path is the shortest path when the midway bending is limited to a right angle. This is because the conduit is generally along a wall, floor, ceiling, or the like.

  In the present invention, the tray T that automatically searches for the route in the tray, and optimizes the arrangement and dimensions based on the amount of cable when the connection point P between the start point and the end point is connected via the tray T, and the route in the tray. And the quantity of the conduit based on the conduit path that passes outside the tray T.

  In addition, the amount of cables and conduits based on the path in the tray connecting the receiving points on the start point side and the end point side (P steps S02 and PE02) and the conduit path passing outside the tray T on the start point side and the end point side are determined. Find accurately in a short time.

  Further, the width of the tray T for optimizing the space factor obtained from the cross-sectional area of the tray T with respect to the total cross-sectional area of the cable passing through each tray T is presented based on the path in the tray.

  Hereinafter, the embodiment of the present invention will be described by taking the case of electrical instrumentation design support in the three-dimensional space of FIG. In this case, a database constructed in the data recording unit 18 of FIG. 1 and various functions executed in the arithmetic processing unit 12 will be described. FIG. 3 is a diagram collectively describing the database configuration and various calculation functions.

  In FIG. 3, the database configuration will be described first. The data recording unit 18 includes a cable list database DB1, a tray arrangement database DB2, an attachment point arrangement database DB3, a tray standard dimension list database DB4, an analysis condition database DB8, a route candidate line database DB5, an accommodation point list database DB6, and a cable route search result. It consists of database DB7.

  Among them, the cable list database DB1 includes a cable number column 100, a start point side connection point number (start point number) column 101, an end point side connection point number (end point number) column 102, and a cable outer diameter column 103, as shown in FIG. It is configured in association. Here, each cable C to be laid in the plant is identified by a unique cable number, and the connection points on the start and end sides (that is, the start point PS and the end point PE) for each cable C are determined. Specify with a point number. Here, the number of the joining point is only defined and does not include information on the position of the joining point. As a result, in general, for each one of a plurality of cables C arranged between a plurality of start points and a plurality of end points, positions of both ends to which the cables C are connected and numbers unique to the cables are defined. It will be.

  For example, referring to the installation example of FIG. 2, the cable C101 is defined as a unique cable number C101 in the cable number column 100 of FIG. 4, and when the cable is arranged from the start point PS to the end point PE, the start point number column 101 has a start point. A number 1001 meaning PS is defined, and a number 1002 meaning end point PE is defined in the end point number column 102.

  By the way, one end of the cable wiring is a field panel connected to field devices such as an operation terminal and a measuring instrument, for example, and the other end is a power distribution panel for gathering them and sending them to a higher-level device. Therefore, it can be said that the information stored in the start point number column 101 and the end point number column 102 of FIG. Or it can be said that the terminal of the field panel or the switchboard is further specified.

  In general, since a plurality of signal cables are taken out from the on-site panel and the distribution board, the connection points of the start point PS and the end point PE may be shared by the plurality of cables. In the example of FIG. 4, the connection point with the connection point number = 1001 is the connection point on the end point side of the cable number C103 as well as the connection point on the start point side of the cable numbers C101 and C102. The cable list database DB1 has information on the outer diameter (mm) for each cable C.

  FIG. 5 shows a three-dimensional tray represented by a straight line and is displayed as a broken line passing through the center of the bottom surface of the tray T. This broken line is called a tray center line in this embodiment. In FIG. 5, the tray center line T101 is the tray T1, the tray center line T102 is the tray T2, the tray center line T103 is the tray T3, the tray center line T104 is the tray T4, and the tray center line T105 is the tray T5. This is represented by a straight line.

In this way, by representing a three-dimensional tray with a straight line including a polygonal line, the positions of the end points (start point and end point) and the curved point (the point where the tray has changed direction) of the tray are expressed in X, Y, and Z coordinates. Can be represented. For example, if the tray center line T103 with the tray number 3 (tray T3) in FIG. 5 has the ● points shown as the end points (start and end points), the respective ● points are X, Y, It can be expressed in Z coordinates. Further, for example, when the tray center line T105 with the tray number 5 (tray T5) in FIG. 5 has the points marked with ● as the end points (start point and end point) and ▲ as the curve point, the respective end points (Start point and end point) ● and music point ▲ can be expressed by X, Y, Z coordinates.
In the following description, the end points (start point and end point) and the curved point of the tray are sometimes collectively referred to as the apex. As described above, the tray center line representing the tray arrangement can be defined by a line segment defining the vertices on the three-dimensional coordinates or a plurality of line segments defining the vertices.

  FIG. 6 is a diagram showing the storage contents of the tray arrangement database DB2, in which the tray represented by the tray center line is configured to be stored in association with the tray number column 104, the vertex column 105, and the coordinate column 106. ing. In this example, the tray number is 3 (tray T3), and the coordinates of the points ● indicating the start point (0) and end point (1) of the tray center line T103 are (8100, 100, 10500) and (200, 100), respectively. 10500). From this numerical value, it can be seen that the tray T3 has the same height and extends in the X direction. The tray T3 is represented by a line segment connecting these two points with a straight line.

  As shown in FIG. 7, the tray center line of the tray arrangement database DB2 further has information on the dimensions of the trays such as a tray width column 107 and a tray height column 108. Based on this dimension information, the tray can be displayed in a three-dimensional shape on the monitor 16 screen after the arrangement position of the tray center line is determined.

  FIG. 8 is a diagram showing the stored contents of the engagement point arrangement database DB3. Here, the arrangement positions of the joining points PS and PE at the start point and the end point are represented by three-dimensional coordinates of X, Y, and Z coordinates. In FIG. 8, an engagement point number column 110 and an X, Y, Z coordinate column 109 are stored in association with each other. Here, each of the coupling points is identified by a coupling point number having no overlap, and the arrangement position is represented by X, Y, and Z coordinates.

  FIG. 9 is a diagram showing the contents stored in the tray standard dimension list database DB4. The tray standard dimension list database DB4 includes a catalog name column 111 for identifying a standard and a tray width column 112. There are usually multiple tray widths from small to large for one catalog name.

  FIG. 10 is a diagram showing the contents stored in the analysis condition database DB8. This includes information on the tray approaching specified distance, the space factor lower limit, the space rate upper limit, and the tray catalog name. The meaning of these analysis conditions will be described later.

  The contents stored in the cable list database DB1, the tray arrangement database DB2, the connection point arrangement database DB3, the tray standard dimension list database DB4, and the analysis condition database DB8 described above are the information input to the input means 11 and 19 by the operator. It is configured to be recorded or updated in the data recording unit 18 via the output device 17.

  While the above database (DB1, DB2, DB3, DB4, DB8) in the recording means 18 is set in advance in the preparation stage of electrical instrumentation design, other databases (DB5, DB6, DB7) Can be said to be a database of data that is sequentially generated as the electrical instrumentation design calculation proceeds in the arithmetic processing unit 12.

  These other databases (DB5, DB6, DB7) will be described in detail each time the calculation in the arithmetic processing unit 12 is described, but only an overview of the database structure will be described as follows.

  FIG. 11 is a diagram showing the stored contents of the route candidate line database DB5. Here, the route candidate lines are all tray routes that are candidates for the in-tray route. As shown in FIG. 11, the route candidate line database DB5 includes a route candidate number column 113, a vertex column 114, a coordinate column 115 (X coordinate, Y coordinate, Z coordinate), a node number column 116, and a tray number column 104. Are associated with each other.

  FIG. 12 is a diagram showing the stored contents of the accommodation point list database DB6. As shown in FIG. 12, the accommodation point list database DB 6 is configured by associating an engagement point number column 110, a route candidate number column 113, a node number column 119, and a accommodation point to node length column 120. Two sets of the node number column 119 and the accommodation point to node length column 120 are prepared. One set is for organizing information between the accommodation point and one end point (node), and the other set is for organizing information between the accommodation point and the other end point (node).

  FIG. 13 is a diagram showing the contents stored in the cable route search result database DB7. The cable route search result database DB7 is configured by associating a cable number column 100, a route candidate number column 113, a route candidate line length column 121, and an accommodation point to node length column 122.

  In FIG. 3, the data recording unit 18 stores an executable program handled by the arithmetic processing unit 12. The arithmetic processing unit 12 sequentially reads out these executable programs from the data recording unit 18 and executes them. In the arithmetic processing unit 12 of FIG. 3, a program executed here is described as a means.

  As shown in FIG. 3, the means executed by the arithmetic processing unit 12 are the three-dimensional shape arrangement adjusting means F0, the tray arrangement analyzing means F1, the accommodation point obtaining means F2, the cable route searching means F3, the space factor evaluating means F4, They are cable / conduit amount calculation means F5 and tray amount calculation means F6.

  In the description of the embodiment of the present invention, among these executable programs, the three-dimensional shape arrangement adjusting means F0 is used in the preparatory stage of the electrical instrumentation design, and other executable programs are used in the electric meter in the arithmetic processing unit 12. It is positioned for use in the device design calculation stage.

  When the arithmetic processing unit 12 receives an instruction to start execution from the input means 11 and 19 via the input / output device 17, the arithmetic processing unit 12 takes these information and programs into the main storage unit 14, and performs various calculations in the preparation stage and the design calculation stage. The information is stored in the data recording unit 18 based on the result. Further, it is displayed on the display means 16 via the input / output device 17.

  In the design calculation stage, the route candidate line database DB5, the accommodation point list database DB6, and the cable route search result database DB7 respectively input the execution results by the tray arrangement analysis unit F1, the accommodation point acquisition unit F2, and the cable route search unit F3. The data is recorded or updated in the data recording unit 18 via the output device 17.

  As described above with reference to FIG. 3, the database DB of the data recording unit 18 holds various initial data and data generated in the calculation process, and various functions are executed in the arithmetic processing unit 12.

  In the present invention, the cable arrangement result of FIG. 2 is obtained by various processes executed by the arithmetic processing unit 12. The cable arrangement state of FIG. 2 shows the state after the cable route search processing according to the present invention.

  In the initial state for obtaining this route as the final route, the arrangement positions of buildings such as building columns and floors and other equipment are considered in the CAD three-dimensional space representing the plant. The operator inputs using the mouse 19 and the keyboard 11 shown in FIG. 1, displays the result on the monitor 16, and determines the position of the tray T in consideration of the layout of the pillars and floors of the building and interference with other equipment. decide.

  FIG. 14 shows a state in which only the tray T (T1, T2, T3, T4, T5) and the 3D shape model of the start point and end point joining points PS and PE are arranged as decision information in the CAD three-dimensional space. Yes. FIG. 14 shows this state as a screen display in a bird's-eye view.

  First, here, processing until the arrangement state of FIG. 14 is determined will be described. In the description of the embodiment of the present invention, the process at this stage is positioned as the process at the preparation stage, and is executed by the three-dimensional shape arrangement adjusting means F0 in FIG.

  In the process of the preparation stage, the tray is not displayed as a 3D shape model (so-called symbol display) from the beginning, but is arranged as the tray center line described in FIG. Thereby, it is possible to simplify the operation of arranging the tray T by the operator and to increase the efficiency of the subsequent analysis processing. Note that the arrangement of the trays along the tray center line means that the start point and the end point of each tray are defined on three-dimensional coordinates.

  The three-dimensional shape arrangement adjusting means F0 in the calculating means 12 in FIG. 3 displays the tray center line on the display means (monitor) 16 so that the operator can change the position, shape, and additional information.

  Each time the arrangement of the tray center line is changed or determined by the operator, the three-dimensional shape arrangement adjusting means F0 changes the shape of the tray T to the 3D shape model of the tray T as shown in FIG. Are automatically drawn on the monitor 16.

  Further, each time the tray T is arranged by the operator, the three-dimensional shape arrangement adjusting unit F0 assigns a unique tray number that can identify each 3D shape model without duplication to the 3D shape model of the tray T. Thereby, each of the five trays T (T1, T2, T3, T4, T5) in FIG. 14 is assigned a unique tray number that can identify them, and in this case, the unique tray number is (1, 2, 3, 4, 5).

  In a series of processes in the three-dimensional shape arrangement adjusting unit F0, the tray arrangement database DB2 of FIG. 6 is formed. In addition, in the process of adding the tray cross-sectional dimension to the tray center line, the dimension information of the tray width 107 and the tray height 108 in FIG. 7 is referred to. In this manner, the three-dimensional arrangement state of FIG. 14 is drawn from the linear arrangement state of the tray center line of FIG.

  On the other hand, with respect to the arrangement positions of the starting point joining point PS and the ending point joining point PE in FIG. 14, the operator inputs using the mouse 19 and keyboard 11 in FIG. 1 and displays the result on the monitor 16. Also, determine the floor layout and interference with other equipment.

  Each time the operator determines the arrangement positions of the start point and end point joining points PS and PE, the three-dimensional shape placement adjusting means F0 assigns a unique joining point number that can identify each 3D shape model without duplication. To 3D shape model of PE. Thereby, each of the two joining points PS and PE in FIG. 14 is given a unique joining point number that can identify them. In this case, the unique contact point number is (S1: 1001, E1: 1002).

  The joining point arrangement database DB3 in FIG. 8 is information on the joining points PS and PE determined in this way, and is configured by associating the joining point number column 110 with its coordinate column 109.

  In addition, each time the mating points PS and PE are arranged by the operator, the three-dimensional shape arrangement adjusting unit F0 selects the mating point number from the mating point numbers registered in the cable list DB1 and is selected. The joining point number is assigned to the 3D shape model of the joining points PS and PE. Thereby, the cable number arrange | positioned between specific joining points PS and PE is specified.

  Through the preparation process so far, the tray in the three-dimensional shape of FIG. 14 is drawn, the start point and end point positions are displayed, and the cable numbers arranged between the start point and end point are determined.

  In the completion state of such a preparation stage, the cable list database DB1, the tray arrangement database DB2, and the connection point arrangement database DB3 are prepared and completed by operator input.

  Among these, the cable list database DB1 in FIG. 4 is configured by pairing the cable number column 100, the start point side connection point number column 101, and the end point side connection point number column 102. Here, the cables to be laid in the plant are identified by non-overlapping cable numbers, and one starting point side connecting point number and one end point connecting point are designated by the connecting point number for each cable. . As in the example of FIG. 4, the connection point with the connection point number 1001 may also serve as the connection point of at least two cables with the cable numbers C101 and C102.

  The tray arrangement database DB2 is configured so that the operator can take into account the arrangement of the pillars and floors of the building and interference with other devices, as shown in FIGS. 6 and 7, in advance, the tray number column 104, the vertex column 105, and the coordinate column. 106, a tray width column 107, and a tray height column 108 are paired.

  The joint point arrangement database DB3 is configured by the operator as a pair of the joint point number column 110 and the coordinate column 109 in advance as shown in FIG. 8 while considering the positional relationship with the pillars, floors, and other devices of the building. doing.

  In the first stage of the design calculation stage, the tray arrangement analyzing means F1 searches for the tray route candidates.

  In the program processing by the tray arrangement analyzing means F1, first, an electrical instrumentation work design support menu M001 is displayed on a menu screen as shown in FIG. A route search execution menu M002 is displayed in the support menu M001.

  The operator selects the route search execution menu M002 in a state where the three-dimensional screen configuration of FIG. 14 is constructed and displayed on the monitor and the tray arrangement database DB2 is configured.

  In response to the route search execution instruction, the tray arrangement analyzing unit F1 extracts the route candidate lines based on the tray arrangement database DB2 of FIG. The extraction procedure will be described below, but the extracted route candidate line information is stored in the recording means 18.

  FIG. 16 illustrates route candidate lines in the case of the three-dimensional configuration of FIG. Here, the tray display concept of FIG. 16 is very similar to the tray centerline display concept of FIG. However, in the tray center line display of FIG. 5, the start point and the end point of the tray are displayed in a straight line with broken lines, whereas the route candidate line in FIG. 16 is a line segment or a broken line obtained by dividing the tray center line in some places. In FIG. 16, ● is an end point of the route candidate line.

  Here, for example, the center line T105 in FIG. 5 representing the tray T5 is divided into three route candidate lines (T1051, T1052, T1053), and the center line T101 in FIG. 5 representing the tray T1 is two route candidates. The center line T102 in FIG. 5 that is divided into lines (T1011 and T1012) and represents the tray T2 is divided into two route candidate lines (T1021 and T1022). Note that the center lines representing the tray T3 and the tray T4 are not divided and are used as route candidate lines (T1031, T1041) as they are. It is assumed that the route candidate numbers shown are uniquely set for each route candidate line.

  In this way, the notion of a standard in which a center line is divided or becomes a route candidate line without being divided is determined by whether or not another approaching center line exists or does not exist in a part of the route of the center line. It has been.

  For example, in FIG. 5, the center line T101 representing the tray T1 is close to the center line T105 representing the tray T5 and the center line T103 representing the tray T3. And since this approaching location is substantially the same position, the center line T101 is divided into two route candidate lines (T1011, T1012) with this approaching point as a boundary.

  For example, in FIG. 5, the center line T105 representing the tray T5 is closer to the center line T101 representing the tray T1, the center line T102 representing the tray T2, the center line T103 representing the tray T3, and the center line T104 representing the tray T4. There is a place to do. In this case, since some of the approach points are substantially the same position, the center line T105 is divided into three route candidate lines (T1051, T1052, T1053) with the approach point at a distant position as a boundary.

  In this way, when there is a place where the tray centerlines are approaching within the specified approach distance, whether or not to divide by determining the approaching point at the intersection when projected from the three directions of the X, Y, and Z axes Will be determined. Here, the tray approaching prescribed distance (= 2000 mm) stored in the analysis condition database DB8 shown in FIG. 10 is referred to as a criterion for judging the approach of the tray. The reason why the projection method is used is that two approaching route candidate lines are not necessarily in contact with each other.

  Thus, the five center lines in FIG. 5 are divided into, for example, nine route candidate lines in FIG. The route candidate lines include a divided center line and a non-divided center line. These are arranged as route candidate lines in the route candidate line database DB5.

  The configuration of the route candidate line database DB5 in FIG. 11 is as described above. For example, for the route candidate line with the route candidate number “1”, the position of one end (vertex 0) is set to the XYZ coordinate column 115 and the node. It is defined in the number column 116 and the correspondence with the tray number column 104 is left. Further, the position of the other end (vertex 1) is defined in the XYZ coordinate column 115 and the node number column 116 for the route candidate line having the route candidate number of 1, and the correspondence relationship with the tray number column 104 is left.

  A node is set for the position of the vertex (both ends of the line segment) of the route candidate line. The node is basically set uniquely, but the same node is set for the apexes (both ends of the line segment) of the route candidate line having the approach relationship described above.

  In this way, after completion of the division process, the tray arrangement analyzing means F1 does not recognize the end points located within the close prescribed distance from each other regardless of the end point of the tray from the beginning or the end point formed by the division process. Assign the same node number.

  One route candidate line has two end points, and a node number is assigned to each end point. These are called node number_0 and node number_1 in this embodiment. However, either end point of the route candidate line may be the node number_0. In the case of FIG. 11, the route candidate line with the route candidate number 6 has several bending points, and thus is defined for each of a plurality of vertices.

  A process for searching for a route in consideration of a possible branch will be described using the above data and calculation means. FIG. 17 shows a basic flow of the present embodiment, and a series of processing will be described with reference to FIG.

  In this flow, first, when the system is in a standby state (step S001), execution of the tray arrangement analysis unit F1 is started in response to the operator clicking the route search execution menu M002. The tray arrangement analysis means F1 determines whether or not there is data in the tray arrangement database DB2 (tray arrangement confirmation step S002). If it is determined that there is data, the process proceeds to tray arrangement analysis processing (step S003). Detailed processing steps of the tray arrangement analysis processing (step S003) will be described later with reference to the flowchart of FIG.

  After completion of the tray arrangement analysis process (step S003), the tray arrangement analysis unit F1 determines whether there is data in the cable list database DB1 and the connection point arrangement database DB3 (step S004). The process proceeds to the accommodation point acquisition unit F2 (step S005). The above is the processing by the tray arrangement analyzing unit F1.

  In the second stage of the design calculation stage, the positions of the accommodation points PS02 and PE02 in FIG. 2 are determined by the accommodation point acquisition means F2.

  The accommodation point acquisition unit F2 extracts the closest route candidate line and the accommodation point P on the route candidate line for each connection point P, and updates the information in the accommodation point database DB6. Detailed processing of the accommodation point acquisition unit F2 will be described later.

  In the third stage of the design calculation stage, the route search in the tray is performed by the cable route search means F3.

  The cable route searching means F3 determines the route in the tray for the route candidate line based on a solution of a general shortest route calculation method such as the Dijkstra method. Detailed processing of the cable route search means F3 will be described later, but the general idea is as follows.

  The node numbers corresponding to the start point PS and the end point PE of the contact point P have two candidates, node number_0 and node number_1, respectively, as shown in the accommodation point database DB6 of FIG. Therefore, there are four possible combinations of the start point and the end point in one cable.

  The shortest route search by the Dijkstra method is performed four times for one cable, and the combination of the node numbers of the start point and the end point and the length of the route that are the shortest are extracted from the results.

  The stored contents of the cable route search result database DB7 shown in FIG. 13 show examples of the in-tray routes obtained as a result.

  In the route candidate line having accommodation points on the start point side and the end point side, the length from the accommodation point to the node is output instead of the route candidate line length. In the intermediate route, the route candidate line length is output because the route passes from end to end of the route candidate line.

  By the above method, the length of the cable accommodated in the middle of the tray can be obtained quickly and accurately.

  In the fourth stage of the design calculation stage, the space factor evaluation means F4 evaluates the cable space factor in the tray. The execution of the space factor evaluation means F4 is performed in step S007. .

  According to the method described above, it is possible to perform a route search in consideration of a possible branch without an operator giving branch information. For example, in FIG. 2, it is also possible to search for a route from the tray T5 with the tray number = 5 to the tray T1 with the tray number = 1.

  Next, the processing of each unit, which will be described in detail later, in the flow of FIG. 17 will be specifically described.

  First, the detailed process of step S003 will be described with respect to the process of the tray arrangement analyzing unit F1. Here, the route center line shown in FIG. 5 is divided at the approaching points to generate the route candidate line in FIG. 16, and node numbers are given to both ends of the route candidate line to create the route candidate line database in FIG. Configure DB5.

  Processing for generating a route candidate line will be described with reference to FIGS. 5, 6, 18, 19 to 21, and the like.

  First, FIG. 5 shows the tray arrangement as a center line, and this information is configured and stored in the tray arrangement database DB2 in association with each other as a tray number column 104, a vertex column 105, and a coordinate column 106.

  In this processing, first, a route candidate line having the same shape information as the tray center line is generated with the route candidate number = tray number for all tray center lines. An unprocessed flag is assigned to all route candidate lines.

  What is executed here is that a path candidate number field is added to the database of FIG. That is, the route candidate number column 113 is assigned to the database of FIG. 6 configured by associating the tray number column 104, the vertex column 105, and the coordinate column 106, and the same value as the tray number is assigned to the value of the route candidate number. Is. The database thus obtained is shown in FIG. In this case, the route candidate number = tray number is temporarily set. The route candidate numbers (= tray numbers) are arranged in ascending order of numbers. The database in FIG. 19 is set as the initial state of the processing flow in FIG.

  In the flowchart of FIG. 18 showing the detailed processing steps of the tray arrangement analysis processing, it is confirmed in the first step S201 that there is an unprocessed route candidate line. Since all are initially unprocessed, the process proceeds to step S202, where one unprocessed route candidate line is extracted and defined as A. Needless to say, since a line is handled here, information whose route candidate number (= tray number) in the database of FIG. 19 is “1” is handled as one route candidate line.

  As a result, information whose route candidate number (= tray number) is “1” is extracted as an unprocessed route candidate line A at first. In step S203, it is confirmed whether there are any unprocessed route candidate lines other than A. In this case, since there are others, the process proceeds to step S204, where one unprocessed route candidate line is extracted and defined as B. B is, for example, information whose route candidate number (= tray number) is “2”.

  In step S205, when the route candidate line A is set as one of the comparisons, the route candidate line B is set as the other of the comparisons, and an approaching portion between them is confirmed. If there are locations that are close to each other within a specified distance, then in step S206, it is determined whether there is an end point within the specified distance from the approached location.

  If there is no end point, in step S207, the route candidate line having no end point is divided at the approaching portion, and a new route candidate number is assigned (updated). When there is an end point, the route candidate line A is processed in step S208.

  The above processing checks the relationship with all the other route candidate lines when the route candidate line A with the route candidate number “1” is used as a reference. When a series of comparisons with respect to the route candidate line A is completed, the route candidate line with the route candidate number “2” is set as a new reference route candidate line A, and all other routes other than the route candidate number “1” Check the relationship with the candidate line. This comparison is performed for all combinations.

  FIG. 22 is a diagram showing the initial state of the route candidate line. Here, when the first route candidate line A is the route candidate line T101 with the route candidate number = 1, the route candidate number = 3 and the route candidate. The route candidate line (T103 and T105) of number = 5 is approaching.

  First, FIG. 23 shows processing of the tray T1 and the tray T3 when the route candidate line T103 with the route candidate number = 3 is extracted. Here, the process is mainly based on the route candidate number = 1, and since the route candidate number = 1 and the route candidate number = 3 are close to each other, the route candidate number = 1 is set as the route candidate at the approach point (intersection of projection). The number is divided into number = 1 and route candidate number = 6 (new number). The route candidate number = 1 is not divided because there is an end point within the specified range from the approaching point. In FIG. 23, one of the divided routes is designated as a route candidate line T1011 with route candidate number = 1, and a new route candidate number = 6 is assigned to the other divided route as route candidate line T1012.

  When the route candidate line T105 with the route candidate number = 5 is extracted, the end point of the route candidate line T101 with the route candidate number = 1 is not within the specified distance from the approaching location, so the route candidate line T101 with the route candidate number = 1 is approached. The route is divided at a place, and a new route candidate number = 6 is assigned to one of the divided portions (step S207).

  On the other hand, route candidate number = 5 is extracted as an approaching partner of route candidate number = 1 and route candidate number = 6 derived therefrom (step S203, step S204), but route candidate number = 1 and route candidate number = 6. The route candidate lines T1011 and T1012 are (accidentally) already divided by the above-mentioned determination that the route candidate number = 3 is within the specified distance, and thus are not further divided.

  Since the route candidate line T105 with the route candidate number = 5 does not have an end point within the specified distance from the approaching location, the route candidate line T105 is divided at the approaching location and given a new route candidate number = 7 (step S207).

  FIG. 24 shows the processing status of the tray T1 and the tray T5 when the route candidate line T105 with the route candidate number = 5 is extracted. Here, the processing is mainly based on the route candidate number = 1, and since the route candidate number = 1 and the route candidate number = 5 are close to each other, the route candidate number = 5 is divided at the approaching point, and the route candidate number = 5 and route candidate number = 7. The route candidate number = 1 is not divided because there is an end point within the specified range from the approaching point.

  Since there is no remaining route candidate line approaching with the route candidate number = 1, the process mainly using the route candidate number = 1 is completed. When a series of comparison processing of route candidate number = 1 is completed, the processing flag of route candidate number = 1 is set to 1.

  20 and 21 show the database configuration obtained as a result of the above processing. FIG. 20 shows a database configuration formed after the processing of the trays T1 and T5. Information on the route candidate line of the route candidate number = 6 newly derived by dividing from FIG. 19 is added. FIG. 21 shows a database configuration formed after processing of all trays T, and information on route candidate lines after route candidate number = 6 is added.

  The processing of the route candidate line T110 with the route candidate number = 1 and the route candidate number = 6 derived therefrom is completed, and the unprocessed flag of these route candidate lines T110 is changed to the processed flag (step S208).

  Thereafter, unprocessed route candidate lines T110 are sequentially extracted (step S201), and the determination of approach and division is repeated.

  When the process of FIG. 18 is repeated, the route candidate lines are close to each other at the end points. FIG. 21 shows the database structure of the result, and FIG. 16 shows the arrangement relationship of the route candidate lines indicating the result.

  Note that the division location and the route candidate numbers in FIGS. 21 and 16 change depending on which of the route candidate lines is extracted in order and which of the divided route candidate lines is given a new route candidate number. This does not affect the subsequent processing and judgment results.

  Subsequently, the process proceeds to a process of assigning a node number. This presupposed state is represented by the arrangement relationship of FIG. 16, and the data structure representing this is the database of FIG. This process will be described with reference to FIGS. 26, 27, and 25. FIG. FIG. 26 shows a processing flow for assigning node numbers. In FIG. 26, first, in step S301, it is confirmed whether there is an end point without a node number. Since node numbers are not set for all in the initial state, the process proceeds to step S302, and one end point to which no node number has been assigned is extracted.

  In the processing of step S302, not the line but the end point is handled, so each of the vertex columns 105 in FIG. 21 is handled. That is, if processing is performed in the order from the top in FIG. 21, the coordinate position (−100, 12000, 11000) of the vertex 0 of the route candidate number 1 is first extracted, and this is set as A.

  Next, in step S303, it is determined whether another end point exists within a specified distance. When it exists, it moves to step S304, and when it does not exist, it moves to step S305. The above case (the coordinate position of the vertex 0 of the route candidate number 1) corresponds to the right side of the route candidate line T1011 in FIG. 16, and there is no other end point within the specified distance. Is granted.

  FIG. 27 is a diagram showing a database configuration in the end state of the processing flow of FIG. 26. Compared with FIG. 21, a node number 123 is newly added. In the above case (the coordinate position of the vertex 0 of the route candidate number 1), for example, the node number is set to “1” because it is the first process in the series of processes in FIG. Thereafter, when a new node number is assigned, a sequential number following “1” is assigned.

  In the process of the first column in FIG. 21, the process returns from step S305 to step S301, and the coordinate position (−100, 100, 11000) of the vertex 1 of the next route candidate number 1 in the second column in FIG. The same determination is made as A. In this case, it is determined in step S303 that there is another end point within the specified distance.

  In step S304, all other end points existing within a specified distance from point A are extracted and positioned in group B. In this case, the other end points positioned in the B group are a part of T1051 (vertex 0 of the path candidate number 7 in FIG. 21) and a part of T1012 (the path in FIG. 21), as is clear from the arrangement configuration in FIG. Vertex 0 of candidate number 6) and four points of a part of T1031 (vertex 1 of route candidate number 3 in FIG. 21).

  In step S306, it is confirmed whether there is an end point to which a node number has already been assigned in group B. In this case, since it does not exist, the process proceeds to step S309, and new node numbers are assigned to the groups A and B. In this case, “2”, which is a serial number following “1”, is given to the five end points including A.

  In the process in the third column in FIG. 21, the coordinate position (−100, 12000, 7000) of vertex 0 of route candidate number 2 is extracted, and the same determination is made with this as A. In this case, processing is performed along the same route as the processing in the first column, and only this point is given the node number “3”.

  In the process in the fourth column in FIG. 21, the coordinate position (−100, 0, 7000) of vertex 1 of route candidate number 2 is extracted, and this is set as A to make the same determination. In this case, processing is performed in the same route as the processing in the second column, and as is clear from the arrangement configuration in FIG. 16, a part of T1052 (vertex 0 of route candidate number 9 in FIG. 21) other than point A, T1022 The node number “4” is given to four points of a part (vertex 0 of route candidate number 8 in FIG. 21) and a part of T1053 (vertex 1 of route candidate number 5 in FIG. 21).

  In the process of the sixth column in FIG. 21 (vertex 1 of candidate route number 3 in FIG. 21), the node number “2” has already been assigned to this point itself. Therefore, the node number “2” is assigned to the other end points close to this point. In this case, the determination in step S306 proceeds to step S307 because there is a node number. In step S307, one end point with a node number is extracted and set as C, and in step S308, the node number is assigned to all extracted end points including the first extracted end point. In short, the node number “2” is assigned to all extracted.

  In short, in the process of FIG. 26, if there is no end point approaching within the specified distance from the first extracted end point, a new node number is assigned to the first extracted end point (step S305).

  If there is no end point to which the node number is assigned, a new node number is assigned to all end points extracted under conditions within the specified distance, including the end point extracted first (step S309).

  If there is an end point to which a node number has already been assigned among the extracted end points, the node number is assigned to all the extracted end points including the first extracted end point (step S308).

  If the process is repeated based on the above thought and node numbers are assigned to all the end points, the process of FIG. 26 ends.

  27 and 25 show a state in which the processing in FIG. 26 has been completed. In the figure, a range N surrounded by a circle is a group of end points to which the same node number is assigned, and is hereinafter referred to as a node.

  Note that the node numbers in FIGS. 27 and 25 change depending on which end point is extracted in order, but this does not affect the final result.

  Next, specific processing of the accommodation point acquisition unit F2 will be described. Here, details of step S005 in the flowchart of FIG. 17 will be described. In step S005, the accommodation point and the conduit path are determined.

  The accommodation point acquisition unit F2 extracts the closest route candidate line and the accommodation points on the route candidate line for each connection point P. This concept will be described with reference to FIG. In FIG. 28, only the route candidate line and the start point PS are displayed for easy understanding.

  Specifically, for each of the connection points, for each route candidate line, when a perpendicular line can be dropped from the route candidate line to the connection point, the perpendicular line is lowered. If it cannot be lowered, the end point of the route candidate line is used as a temporary accommodation point, the distance from the connection point to the temporary accommodation point is compared, and the temporary accommodation point with the shortest distance is extracted from the temporary accommodation points of all the route candidate lines. This is the accommodation point.

  As an example, the joint point PS and the route candidate line T1041 are examined. Since the route candidate line T1041 extends in the X direction, the Y direction and the Z direction can be considered as the legs of the perpendicular line. In this case, the condition under which the perpendicular line can be lowered is that the X coordinate position of the joining point PS is included in the X coordinate which is the extending direction of the route candidate line T1041. In this case, from the point T1041X of the route candidate line T1041 having the same X coordinate position, the perpendicular lines L411. Lowering L412 reaches the engagement point PS. This straight line arrangement is the shortest route LL1041 between the joining point PS and the route candidate line T1041. Here, a point T1041X on the route candidate line T1041 having the same X coordinate position is set as a temporary accommodation point.

  Similarly, the joint point PS and the route candidate line T1031 are examined. Since the route candidate line T1031 extends in the X direction, the perpendicular can be in the Y direction and the Z direction. In this case, the condition under which the perpendicular line can be lowered is that the X coordinate position of the joining point PS is included in the X coordinate which is the extending direction of the route candidate line T1031. In this case, since the X coordinate position is not included, the end point with the closest X coordinate position is set as the temporary accommodation point T3X. The temporary accommodation point at this time is the position of the node 5 in FIG. 27 and the coordinate position (8100, 100, 10500) of the vertex 0 of the route candidate number 3. From the temporary accommodation point T3X, perpendicular lines L311. Lowering the L312 and L412 will reach the engagement point PS. This linear arrangement is the shortest path LL31031 between the joining point PS and the route candidate line T1031.

  The straight line arrangement distance between the two points is obtained by successively dropping the perpendicular line for the joining point PS and the other route candidate lines. However, in the case of the route candidate line T1011 extending in the Y direction, etc., the determination that the vertical line can be taken is made by setting the Y coordinate position of the joining point PS to the Y coordinate that is the extending direction of the route candidate line T1011. Is to include. In the case of the route candidate line T1051 that extends in the Z direction, the determination that the vertical line can be taken down includes the Z coordinate position of the joining point PS in the Z coordinate that is the extension direction of the route candidate line T1051. It is.

  As described above, the shortest route LL at the straight line distance between the joining point PS and another route candidate line is calculated. In addition, the shortest path among the shortest paths LL is selected as the final shortest path. The temporary accommodation point in the route candidate line of the selected route is set as the accommodation point.

  Based on the same idea, the connection point PE (end point) and other route candidate lines are also examined, and the accommodation point on the end point side is determined. A similar process is performed for the cable numbers in FIG. 4 to determine the cable numbers and accommodation points on the start and end sides of all cable numbers.

  In the above description, the conduit path is obtained, and the shortest path between the start point and the end point is determined. In general, however, there are structures such as walls in the vicinity of the start point and end point, and in cases where a route may be determined using the structure, a route search is performed by setting a part of the structure as a temporary start point and end point. Can be implemented.

  The accommodation point acquisition means F2 constitutes the accommodation point list database DB6 shown in FIG. 12 from the coordinates of the connection points, the accommodation points and the route candidate lines determined in this way.

  As the contents of the accommodation point list database DB6 of FIG. 12, the route candidate number 113 and the conduit length 118 of the route candidate line extracted by the above method are stored for each joining point 110.

  Here, the conduit length is the length of the conduit route that is drawn from the coupling point to the accommodation point with the bending limited to a right angle.

  Further, for both ends of the extracted route candidate line, the node number 119 and the accommodation point to the node length 120 are set as the node number_0, the node number_1, the accommodation point to the node length_0, and the accommodation point to the node length_1, respectively. Ask.

  In the accommodation point list database DB6 of FIG. 12, description will be made with reference to examples of 1001 and 1002 described in the column of the engagement point number 110. Reference numerals 1001 and 1002 denote the starting point side connecting point number and the end point connecting point number of the cable number C101 in FIG. 4, and represent the connecting points PS02 and PE02 (accommodating points) in FIG.

  “4” and “6” of the route candidate number 113 in FIG. 12 mean joining points on the route candidate lines T1041 and T1012 in FIG.

  The conduit length 118 in FIG. 12 means the length of the conduit path determined by the shortest path search from the joining point numbers 1001 and 1002 to the start point PS and the end point PE, and is 7000.4000 respectively.

  The node number 119 and the accommodation point to the node length 120 describe the length to both ends (nodes) on this route candidate line. For the route candidate line T1041 in FIG. 25, the distance from the accommodation point to one end (node 6) is 9000, and the distance from the accommodation point to the other end (node 10) is 11900. Similarly, for the route candidate line T1012, the distance from the accommodation point to one end (node 2) is 7000, and the distance from the accommodation point to the other end (node 11) is 2000.

  The method for obtaining the conduit path has been described above.

  Next, the cable route searching means F3 in FIG. 3 searches for the cable route. This process corresponds to step S006 in FIG. In this processing, the tray path is obtained. This processing may be performed by determining the cable order that minimizes the distance between the two accommodation points for one cable number determined in the processing of the conduit path.

  In this process, for example, for a route candidate line determined to have a start-side accommodation point, another route candidate line having the same node as the node at the end point is extracted, and the end-side accommodation point is included in the other route candidate line. Check if there is any information. If not, another route candidate line having the same node as the other end point node is extracted, and it is confirmed whether the other route candidate line has information on the end point accommodation point. The shortest route of the route candidate route confirmed via the node is set as the in-tray route.

  The shortest starting point and end-to-end route determined in this way is PS-PS01-PS02-T4-T5-T1-PE02-PE01-PE shown in FIG. 16, the route candidate line T1041 (route candidate number 4) -T1053 (route candidate number 5) -T1052 (route candidate number 9) -T1012 (route candidate number 6).

  The cable route search means F3 in FIG. 3 organizes the results in FIG. 13 and creates a cable route search database DB7. The cable route search database DB7 of FIG. 13 includes a cable number column 100, a route candidate number column 113, a route candidate line length column 121, and an accommodation point to node length column 122.

  In this database DB7, the shortest tray path of the cable C101 is defined by being divided into four. The portion of the route candidate line T1041 (route candidate number 4) is 9000 described in the field of accommodation point to node length 122, and the portion of T1053 (route candidate number 5) is described in the column of route candidate line 121. 10000, the portion of T1052 (route candidate number 9) is 6900 described in the column of the route candidate line 121, and the portion of T1012 (route candidate number 6) is described in the column of accommodation point to node length 122. 7000.

  According to the method described above, it is possible to automatically search for the conduit path and the in-tray path for the cable accommodated in the middle of the tray without the operator providing information on the accommodation point.

  After performing the above processing for all cables, the space factor evaluation of each part of the tray is performed.

  The space factor evaluation means F4 in FIG. 3 displays a space factor display screen G001 as shown in FIG. In this screen, the tray number 104 of each tray, the space factor 140, the space factor evaluation 141, the current tray width 107, and the recommended tray width value 142 are displayed in the space factor evaluation result display field G003.

  Among these, the tray number 104 is described in the storage contents of the tray arrangement database DB2 shown in FIG. 6 and the route candidate line database DB5 shown in FIG. 11 among various databases. Further, the tray number 104 is stored in association with the route candidate number 113 in the initial setting of the tray arrangement analysis processing described in the processing of FIGS. For example, tray number 1 is redefined as route candidate numbers 1 and 6.

  From the route candidate number column 113, the stored contents of the route candidate line database DB5 of FIG. 11, the stored contents of the accommodation point list database DB6 of FIG. 12, and the stored contents of the cable route search result database DB7 of FIG. Reference and extraction can be performed in association with each other.

  In addition, the stored contents of the cable list database DB1 of FIG. 4 can be referred to and extracted by the subtraction method using the cable number column 100 of FIG. 13 as key information. In addition, the stored contents of the joint point arrangement database DB3 in FIG. 8 can be referred to and extracted by the subtraction method using the joint point number column 110 in FIG. 12 as key information. Through reference between these various databases, for example, information on all cables arranged in the tray of tray number 1 is collected.

Of these, the space factor 140 is stored in the cable outer diameter stored in the cable list database DB1 in FIG. 4, the in-tray route arranged in the cable route search result database DB7 in FIG. 13, and the tray arrangement database DB2 in FIG. Based on the tray width and tray height, the calculation is performed for each tray using equation (1).
[Equation 1]
Space factor (%) = Sum of cross sections of cables to be accommodated / (tray width x tray height) x 100 (%) (1)
In the space factor evaluation 140, the storage contents (space factor upper limit 40%, space factor lower limit 10%) of the analysis condition database DB8 in FIG. 10 are referred to and appropriately simplified and displayed as over, under, OK, etc.

  The current tray width 107 is displayed based on the tray width and tray height stored in the tray arrangement database DB2 of FIG.

  The recommended tray width 142 is determined when the occupancy rate evaluation means F4 determines whether the occupancy rate is less than the lower limit of the occupancy rate or exceeds the upper limit of the occupancy rate. The tray width that falls within the space factor lower limit or less or lower than the space factor upper limit is displayed with reference to the storage contents of the tray standard dimension list database DB4 of FIG.

  In the space factor display screen G001, the operator selects one or a plurality of trays in which the space factor is not appropriate in the space factor evaluation result display field G003 of the space factor display screen G001, in the column 143 of the “selection” column. Can be selected by clicking with the mouse.

  Subsequently, in response to the operator clicking the “update selected tray width” button G004, the space factor evaluation unit F4 updates the tray width shown in FIG. .

  Subsequently, the space factor evaluation means F4 recalculates the space factor using the new tray width value and the equation (1), extracts the tray width recommended value 142 again, and displays the displayed space factor. The rate 140 and the recommended tray width value 142 are updated.

  Note that G002 on the monitor screen displays the lower limit of the space factor or the upper limit of the space factor shown in FIG.

  Lastly, we will explain the concept of totals.

First, in response to the operator clicking the physical quantity totaling menu M003 in the electrical instrumentation work design support menu on the menu screen of FIG. 15, the cable / conduit amount calculation means F5 determines the length of each cable. Is obtained using equation (2).
[Equation 2]
Cable length = path length in tray + conduit length on start side + conduit length on end side (2)
Here, the length of the in-tray route is a numerical value obtained by adding up the route candidate line length 121 (10000 and 6900) and the accommodation point to node length 122 (9000 and 7000) for the cable number c101 in FIG.

  The conduit length on the start point side is, for example, the conduit length 113 (7000) of the route candidate number 4 and the connection point number 1001 in FIG. 12, and the conduit length on the end point side is the route candidate number 6 and the connection point number 1002 The conduit length is 113 (4000). The length of the cable of the formula (2) is determined by adding these.

  Subsequently, the cable / conduit amount calculating means F5 stores a list in which the calculated cable lengths are totaled for each cable outer diameter shown in FIG. To display.

  Subsequently, the tray quantity calculation means F6 saves a list in which the tray length is summed for each tray width based on the tray arrangement database DB2 (FIGS. 6 and 7) in the data recording unit 18 and also displays the display means. 16 is displayed. The tray length is a value obtained by calculating the distance between the vertices of the tray center line from the X, Y, and Z coordinates and adding them up.

1: Electrical instrumentation design support device 11: Keyboard 12: Arithmetic processing device 13: Bus 14: Main storage device 15: Image processing unit 16: Monitor as screen display unit 17: Input / output device 18: Data recording unit 19: Mouse DB1: Cable list database DB2: Tray arrangement database DB3: Joint point arrangement database DB4: Tray standard dimension list database DB5: Route candidate line database DB6: Accommodating point list database DB7: Cable route search result database DB8: Analysis condition database F0: Tertiary Original shape arrangement adjustment means F1: Tray arrangement analysis means F2: Accommodating point acquisition means F3: Cable route search means F4: Space factor evaluation means F5: Cable / conduit amount calculation means F6: Tray quantity calculation means

Claims (7)

A device that supports electrical instrumentation design for placing trays and cables in a plant,
A cable list database in which a unique cable number is set for the cable to be laid between the start point and the end point, the start point and the end point are associated with each cable number, and a tray to be laid in the plant is represented by a tray centerline. A tray arrangement database in which a unique tray number is set and a three-dimensional coordinate of the vertex of the tray center line is set for each tray number; a joint point arrangement database in which the three-dimensional coordinates of the start point and the end point are set;
A tray including a plurality of the tray center lines that are divided by dividing the other tray center line when an end point that is a vertex of one tray center line and a part of the other tray center line are in an approaching state. Tray placement analysis means for positioning a center line as a route candidate line and assigning the same node number to the end points in the approaching state with respect to the end points of the route candidate lines;
An accommodation point acquisition unit that obtains a route from the route candidate line to the start point or the end point for each of the route candidate lines, and sets the route candidate line that is the shortest route in the route candidate line and a position on the route candidate line as an accommodation point; ,
An electrical instrumentation design support apparatus, comprising: a cable route search unit that determines a route between a starting point accommodation point on the route candidate line and an end point accommodation point on the route candidate line using the node number. The electrical instrumentation design support device according to claim 1,
An electrometer that generates a path candidate line database in which a path candidate number and the node number defined at the apex of the tray center line are added to the contents of the tray arrangement database as a processing result of the tray arrangement analyzing unit. Design support equipment. The electrical instrumentation design support apparatus according to claim 1 or 2,
As a processing result of the accommodation point acquisition unit, for the route candidate line of the determined shortest path, a accommodation point list database including a distance from the accommodation point to the end point and a distance from the accommodation point to the start point or the end point is generated. Electrical instrumentation design support device characterized by The electrical instrumentation design support apparatus according to any one of claims 1 to 3,
An electrical instrumentation that generates a cable route search database including a distance between a starting point side accommodation point on the route candidate line and an end point side accommodation point on the route candidate line as a processing result of the cable route search means Design support device. The electrical instrumentation design support device according to any one of claims 1 to 4,
Cable / conduit quantity that calculates the length of the cable as the sum of the length of the cable in the tray path, the length of the start point, and the length of the end point when all cables are laid between all the start points and end points An electrical instrumentation design support apparatus comprising a calculation means. The electrical instrumentation design support device according to any one of claims 1 to 5,
An electrical instrumentation design support device comprising a monitor means, displaying a cable space factor for each tray number and an evaluation result thereof, and presenting a recommended value of the tray width. A method for supporting electrical instrumentation design for placing trays and cables in a plant,
Tray laid in the plant is represented by a tray center line, each tray center line is defined by the three-dimensional coordinates of its apex, and the start and end points when laying the cable are defined by three-dimensional coordinates,
A tray including a plurality of the tray center lines that are divided by dividing the other tray center line when an end point that is a vertex of one tray center line and a part of the other tray center line are in an approaching state. Position the center line as a route candidate line, and assign the same node number to the end points that are in an approaching state with respect to the end points of the route candidate lines,
A route from the route candidate line to the start point or the end point is obtained for each route candidate line, the route candidate line that is the shortest route among them and a position on the route candidate line are determined as accommodation points,
An electrical instrumentation design support method, wherein a route between a starting point side accommodation point on the route candidate line and an end point accommodation point on the route candidate line is determined using the node number.

Images