JP2005173789A - Wire packing calculation method, device for it, and program for it - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To efficiently and automatically find a packing inclusion circle satisfying a desired wire arrangement condition. <P>SOLUTION: A plurality of wire arrangement conditions are set (T1), a plurality of wires are initially arranged at random so as not to overlap mutually (T3) by repeating a predetermined number of trials, and in every initial arrangement, a packing inclusion circles for a plurality of wires is found while information about the packing inclusion circle and its position are computed (T5). Based on the information about the positions of a plurality of circles, it is determined whether the arrangement condition is satisfied or not (T6). Only when it is determined that the arrangement condition is satisfied, the information about the packing inclusion circle and the positions of a plurality of circles is displayed and outputted (T7). <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a calculation method, an apparatus, and a program for packing a plurality of wires constituting a wire harness or the like as compactly as possible and satisfying a desired arrangement condition. In particular, the present invention relates to a wire packing calculation method, an apparatus thereof, and a program thereof that can automatically obtain a desired wire arrangement example.

  A wire-like structure called a wire harness that is configured by bundling a plurality of wires such as electric wires and electrically connecting electronic devices, electronic components, and the like is arranged in a vehicle or indoor. In recent years, such wire harnesses are required to be as compact as possible without deteriorating electrical characteristics from the viewpoint of improving space efficiency. Accordingly, it is necessary to calculate a wire harness that is as compact as possible at the design stage, but no effective calculation method for this purpose has been proposed.

  In view of this, the applicants of the present patent application described in Patent Document 1 below using a computer to bundle and pack the circles corresponding to the cross-sectional shapes of a plurality of wire rods into as small circles as possible so as not to overlap each other. A calculation method for obtaining the diameter and position information of each wire was proposed. As a result, calculation of an inclusion circle (hereinafter referred to as a packing inclusion circle), which has been conventionally considered difficult to calculate, is bundled and packed in a circle as small as possible so as not to overlap each other. It became possible. The inclusion circle corresponds to the cross section of the wire harness in which a plurality of wires are bundled.

  By the way, in recent years, automobile members and parts with fewer failures have been demanded. For this reason, a bending durability test or the like has been performed in advance. For example, an endurance test or the like is performed on a wire harness arranged in an automobile. The shortest life part in a wire harness is a part that is repeatedly bent and deformed, such as a door opening / closing part of an automobile, and among these, the wire harness often has the shortest life when the thickest wire is placed inside the bend. .

  Therefore, as one of the stricter conditions, a wire harness is configured by arranging a wire material as thick as possible inside the bending, and a bending durability test or the like is performed under this condition. At this time, it is necessary to perform a bending durability test or the like by giving a more severe condition to the wire harness corresponding to the packing inclusion circle, that is, a condition that a wire rod as thick as possible is arranged inside the bending.

Note that prior art document information related to the invention of the present application includes the following.
Japanese Patent Application No. 2003-179718 A. Okabe, B. Boots, K.K. Sugihara and S. N. Choi (A. Okabe, B. Boots, K. Sugihara and SN Choi), “Spatial Tessellations-Concepts and Concepts and Appropriations and Applications of Voronoi Diagrams”. Edition, John Wiley and Sons, John Wiley and Sons, Chichester, 2000 D. S. Kim and K. "Dr. S. Kim and K. Sugihara," Voronoi Diagram of a Circle Set, From Voronoi Diagram of a Point Set, I. Vol. 18, Topology Computer Aided Geometric Design, 2001, pp. 18-28. 541-562 D. S. Kim and K. "Dr. S. Kim and K. Sugihara," Voronoi Diagram of a Circle Set, From Voronoi Diagram of a Point Set, II. Volume 18, Geometry. Computer Aided Geometric Design (2001), pp. 10-49. 563-585

  It is not difficult to simply place the thick wire inside the bend, but it is not easy to place the thickest wire, for example, among the plurality of wires inside the bend corresponding to the packing inclusion circle. . On the other hand, although the packing inclusion circle can be obtained by the calculation method of Patent Document 1, the packing inclusion circle is not determined by designating even the final arrangement of each wire in the inclusion circle. That is, an effective calculation method for automatically obtaining a packing inclusion circle that satisfies a desired wire arrangement condition has not been proposed yet.

  Therefore, in view of the present situation described above, the present invention can efficiently and automatically determine a packing inclusion circle that satisfies a desired wire arrangement condition by simply adding a simple process to the processing procedure of Patent Document 1. It is an object of the present invention to provide a packing calculation method, an apparatus thereof, and a program thereof.

  The wire packing calculation method according to claim 1, which has been made to solve the above-described problem, regards the cross-sectional shapes of a plurality of wires having different thicknesses constituting a wire harness as a plurality of circles having a diameter corresponding to each outer shape. A calculation method for packing the plurality of wires so that the plurality of circles are bundled into a circle as small as possible so as not to overlap each other and satisfy a desired arrangement condition, Repeated a number of times, a plurality of circles corresponding to the plurality of wire rods are initially arranged randomly so as not to overlap each other, and each time the random placement step is initially arranged, the plurality of wires correspond to the plurality of wire rods. Packing the plurality of wire inclusion circles when the plurality of circles to be bundled are packed in a circle as small as possible so as not to overlap each other. An inclusion circle calculation step for calculating the inclusion circle and information on the positions of the plurality of circles at this time, and information on the positions of the plurality of circles calculated in the inclusion circle calculation step. Based on the condition determination step for determining whether or not the arrangement condition is satisfied, and only when the arrangement determination condition is determined to be satisfied in the condition determination step, the packing inclusion circle and the plurality of circles An output step of outputting information on the position, and the inclusion circle calculation step regards the cross-sectional shape of the plurality of wire rods as a plurality of circles having a diameter corresponding to each outer shape, and does not overlap each other on a plane An inclusion circle assumption step that envisions an inclusion circle that includes the plurality of circles arranged in such a manner that it has the same center as the inclusion circle and is slightly smaller than or less than this inclusion circle Also, a target circle definition step for defining a target circle that one of the plurality of circles protrudes, and a circle that protrudes from the target circle as an insertion trial circle, the plurality of circles other than the insertion trial circle, A search step for searching for a position that can move as far as possible within the target circle without overlapping each other, and a space in the target circle that can be arranged by changing the placement of the plurality of circles based on a search result by the search step An insertion step of inserting an insertion trial circle, and when all of the insertion trial circles are inserted into the target circle, a new one having the insertion trial circle that is slightly smaller than the current one and having the insertion trial circle A first search control step of determining a target circle and returning to the search step, and repeatedly executing the target circle definition step, the search step, the insertion step, and the first search control step. Especially Accordingly, the inclusion circle is gradually reduced to obtain the packing inclusion circle, and information on the position of the packing inclusion circle and the positions of the plurality of circles is calculated.

  Moreover, the wire packing calculation method according to claim 2 made to solve the above-mentioned problem further includes a trial number setting step of setting the number of trials in the wire packing calculation method according to claim 1. And

  Moreover, the wire packing calculation method according to claim 3, which was made to solve the above problem, is the wire packing calculation method according to claim 1 or 2, wherein the plurality of wires have a plurality of types having different thicknesses. As the arrangement condition, the circle corresponding to the thickest wire is in contact with the inside of the packing inclusion circle, or the circle corresponding to the thickest wire and the inside of the packing inclusion circle A condition setting step of automatically setting the circle corresponding to the thickest wire so as to be close to the inside of the packing inclusion circle so that a circle corresponding to another wire does not enter between And

  Moreover, the wire packing calculation method according to claim 4, which has been made to solve the above-described problem, is the wire packing calculation method according to claim 1, wherein the plurality of wires have a plurality of types having different thicknesses. In response to an input signal indicating that the bending endurance test is included, the center position of the circle corresponding to the thickest wire is set in advance as the arrangement condition in advance of the center position of the packing inclusion circle. Conditions for automatic setting so that the circles corresponding to the thickest wire rods and the circles corresponding to other wire rods do not enter between the circle corresponding to the thickest wire rod and the inside of the packing inclusion circle so as to be closer to the specified bending inner side. A setting step.

  Moreover, the wire packing calculation method according to claim 5, which has been made to solve the above problem, is the wire packing calculation method according to claim 1, wherein, in the search step, the insertion step is performed. A circle Voronoi diagram is created with a circle group excluding one of the multiple trial circles and the plurality of circles, and the target circle, and the one circle in contact with both side circles forming each boundary side in the circle Voronoi diagram By checking with respect to the plurality of circles other than the insertion trial circle whether or not the center of the circle is on the boundary side, positions where these circles are movable within the target circle are determined. It is characterized by searching.

  Moreover, the wire packing calculation method of Claim 6 made | formed in order to solve the said subject is a wire packing calculation method as described in any one of Claims 1-5, The said target circle definition process, The said, When it is repeatedly executed together with the search step, the insertion step and the first search control step, and the insertion trial circle cannot be inserted, it is intermediate between the inclusion circle and the current target circle. A second search control step of returning to the search step after determining another new target circle having a size and having the insertion trial circle is further included.

  Moreover, the wire-packing apparatus of Claim 7 made | formed in order to solve the said subject respond | corresponded to each external shape with the cross-sectional shape of the several wire material from which thickness which comprises a wire harness differs, as shown in FIG. A calculation device for packing the plurality of wires so that the plurality of circles are regarded as a plurality of circles having a diameter and are bundled in a circle shape as small as possible so as not to overlap each other and satisfy a desired arrangement condition. In addition, the random placement means 3C that repeats the preset number of trials and randomly arranges the plurality of circles corresponding to the plurality of wire rods so as not to overlap each other, and the initial placement in the random placement step. Each of the plurality of circles when the plurality of circles corresponding to the plurality of wire rods are bundled and packed in a circle as small as possible so as not to overlap each other. The inclusion circle of the wire rod is obtained as a packing inclusion circle, and the inclusion circle calculation means 3D for calculating information regarding the position of the packing inclusion circle and the plurality of circles at this time, and the inclusion circle calculation means 3D Only when it is determined that the arrangement condition is satisfied by the condition determination unit 3E for determining whether or not the arrangement condition is satisfied based on the information on the positions of a plurality of circles, and the condition determination unit 3E. Output means 3F for outputting information about the packing inclusion circle and the positions of the plurality of circles, and the inclusion circle calculation means 3D has a plurality of cross-sectional shapes of the plurality of wire rods each having a diameter corresponding to each outer shape. An inclusion circle assumption means for assuming an inclusion circle including the plurality of circles arranged so as not to overlap each other on the plane, and the same as the inclusion circle A target circle defining means for defining a target circle that has a heart and is slightly smaller than the inclusion circle and at least one of the plurality of circles protrudes, and a circle protruding from the target circle is an insertion trial circle, The plurality of circles other than the insertion trial circle search for a position where the circles can move as far as possible within the target circle without overlapping each other, and the plurality of circles are arranged based on a search result by the search means An insertion means for inserting the insertion trial circle into the space in the target circle that can be changed, and when all of the insertion trial circles are inserted into the target circle, a little less than the present The first search control means, the target circle definition means, the search means, the insertion means, and the first return to the search means after determining the new target circle that is small and has the insertion trial circle Search system Position information for calculating the information regarding the position of the packing inclusion circle and the positions of the plurality of circles while obtaining the packing inclusion circle by gradually reducing the inclusion circle by repeatedly executing the processing by the control means And calculating means.

  Further, as shown in FIG. 1, the wire packing apparatus according to claim 8 made to solve the above-mentioned problem is a wire packing calculation apparatus according to claim 7, in which the trial number setting means 3B for setting the number of trials is provided. And the like.

  Further, as shown in FIG. 1, the wire packing device according to claim 9 made to solve the above problem is an input signal indicating a predetermined test content related to the wire harness in the wire packing calculation device according to claim 7. In response to this, it further includes condition setting means 3A for automatically setting the arrangement conditions of the plurality of wires suitable for the test contents.

  Moreover, the wire-packing program of Claim 10 made | formed in order to solve the said subject respond | corresponded to each cross-sectional shape of the several wire material from which thickness which comprises a wire harness differs, as shown in FIG. In order to pack the plurality of wires so that the plurality of circles are considered to be a plurality of circles having a diameter and are bundled in a circle shape as small as possible so as not to overlap each other and satisfy a desired arrangement condition. The random placement means 3C that repeats a predetermined number of trials and randomly arranges the plurality of circles corresponding to the plurality of wire rods so as not to overlap each other, each time the initial placement is performed in the random placement step, Before packing a plurality of circles corresponding to the plurality of wires in a circle as small as possible so as not to overlap each other The inclusion circle of the plurality of wires is obtained as a packing inclusion circle, and the inclusion circle calculation means 3D for calculating information regarding the packing inclusion circle and the positions of the plurality of circles at this time is calculated by the inclusion circle calculation means 3D. Based on the information regarding the positions of the plurality of circles, only when the condition determination unit 3E determines whether the arrangement condition is satisfied, and when the condition determination unit 3E determines that the arrangement condition is satisfied, It functions as an output means 3F that outputs information related to the positions of the packing inclusion circle and the plurality of circles. Further, in the inclusion circle calculation means 3D, the computer corresponds the cross-sectional shapes of the plurality of wire rods to the respective outer shapes. An inclusive circle including the plurality of circles arranged so as not to overlap each other on a plane Inclusion circle assumption means, target circle definition means for defining a target circle having the same center as the inclusion circle and being slightly smaller than the inclusion circle and protruding from at least one of the plurality of circles, and protruding from the target circle A search means for searching for a position where the plurality of circles other than the insertion trial circle can move as far as possible within the target circle without overlapping each other, and a search result by the search means Insertion means for inserting the insertion trial circle into the space in the target circle that can be obtained by rearranging the plurality of circles based on the case where all of the insertion trial circles are inserted into the target circle Includes a first search control unit, a target circle definition unit, a search unit, a previous search unit that returns to the search unit after determining a new target circle that is slightly smaller than the current and has the insertion trial circle. The inclusion circle and the first search control unit are repeatedly executed to gradually reduce the inclusion circle, obtain the packing inclusion circle, and the position of the packing inclusion circle and the plurality of circles. It is made to function as a positional information calculation means which calculates the information regarding the position of this.

  According to the inventions of claim 1, claim 7 and claim 10, it is repeated at the preset number of trials, and the plurality of circles corresponding to the plurality of wire rods are initially arranged at random so as not to overlap each other. Each time it is arranged, packing inclusion circles for a plurality of circles corresponding to a plurality of wire rods are obtained, and information about the packing inclusion circles and the positions of the plurality of circles at this time is calculated. Then, based on the information on the positions of the plurality of circles, it is determined whether or not the set arrangement condition is satisfied, and only when it is determined that the arrangement condition is satisfied, the packing inclusion circle and the plurality of circles Information about the position of is output. In particular, in the calculation of the packing inclusion circle, the target circle definition step (means), the search step (means), the insertion step (means), and the first search control step (means) are repeatedly executed, and a plurality of wire rods are calculated. The inclusion circle is gradually reduced, and the packing inclusion circle is efficiently obtained, and information regarding the position of the packing inclusion circle and the positions of the plurality of circles is also calculated.

  Moreover, according to invention of Claim 2 and Claim 8, the frequency | count of trial for calculating | requiring the packing inclusion circle which satisfy | fills desired wire arrangement | positioning conditions can be set.

  According to the invention described in claim 3, as the arrangement condition, the circle corresponding to the thickest wire is in contact with the inside of the packing inclusion circle, or the circle corresponding to the thickest wire and the inside of the packing inclusion circle Are set so that the circle corresponding to the thickest wire is close to the inside of the packing inclusion circle to the extent that the circle corresponding to the other wire does not enter between.

  According to the invention of claim 4, in response to the input signal indicating that it is a bending endurance test, the center position of the circle corresponding to the thickest wire is set as the arrangement condition from the center position of the packing inclusion circle. Is automatically set so that it is closer to the inside of the bend specified in advance, and so that the circle corresponding to the thickest wire rod and the circle corresponding to the other wire rod do not enter between the inside of the packing inclusion circle. The

  According to the fifth aspect of the invention, the search for the candidate position of the insertion trial circle can be greatly simplified by using the circle Voronoi diagram.

  According to the sixth aspect of the present invention, when it is impossible to insert the insertion trial circle, a target circle having an intermediate size between the inclusion circle and the current target circle is determined. Since the second search control step for returning to the search step is further included, the packing inclusion circle and the position information of the wire constituting this are acquired more efficiently.

  According to the ninth aspect of the invention, in response to an input signal indicating a predetermined test content related to the wire harness, the arrangement conditions of a plurality of wires suitable for the test content are automatically set.

  According to the invention of claim 1, claim 7 and claim 10, the target circle definition step (means), the search step (means), the insertion step (means) and the first search control step (means) are repeatedly executed. Thus, the inclusion circles for a plurality of wires are gradually reduced, and packing inclusion circles are efficiently obtained. Of these packing inclusion circles, only the packing inclusion circles that satisfy the desired wire arrangement condition are automatically selected. Extracted into Therefore, it is possible to efficiently and automatically determine a packing inclusion circle that satisfies a desired wire arrangement condition.

  Moreover, according to invention of Claim 2 and Claim 8, the frequency | count of trial for calculating | requiring the packing inclusion circle which satisfy | fills desired wire arrangement | positioning conditions can be set. Thereby, it becomes possible to obtain the packing inclusion circle in consideration of the number of variations of the wire arrangement conditions required by various tests, and the practicality is further improved.

  According to the invention described in claim 3, as the arrangement condition, the circle corresponding to the thickest wire is in contact with the inside of the packing inclusion circle, or the circle corresponding to the thickest wire and the inside of the packing inclusion circle Are set so that the circle corresponding to the thickest wire is close to the inside of the packing inclusion circle to the extent that the circle corresponding to the other wire does not enter between. Therefore, conditions necessary for a bending durability test and the like are automatically set, and packing inclusion circles that satisfy this condition are automatically calculated.

  According to the invention of claim 4, in response to the input signal indicating that it is a bending endurance test, the center position of the circle corresponding to the thickest wire is set as the arrangement condition from the center position of the packing inclusion circle. Is automatically set so that it is closer to the inside of the bend specified in advance, and so that the circle corresponding to the thickest wire rod and the circle corresponding to the other wire rod do not enter between the inside of the packing inclusion circle. The Therefore, just by instructing that it is a bending durability test, severe conditions necessary for this test are automatically set, and packing inclusion circles that satisfy this condition are automatically calculated.

  According to the fifth aspect of the invention, the search for the candidate position of the insertion trial circle can be greatly simplified by using the circle Voronoi diagram. Therefore, the packing inclusion circle and the position information of the wire constituting the circle can be acquired in a short time.

  According to the sixth aspect of the present invention, when it is impossible to insert the insertion trial circle, a target circle having an intermediate size between the inclusion circle and the current target circle is determined. Since the second search control step for returning to the search step is further included, the packing inclusion circle and the position information of the wire constituting the circle can be acquired more efficiently.

  According to the ninth aspect of the invention, in response to an input signal indicating a predetermined test content related to the wire harness, the arrangement conditions of a plurality of wires suitable for the test content are automatically set. Therefore, only by specifying the test contents, severe conditions necessary for this test are automatically set, and packing inclusion circles that satisfy this condition are automatically calculated.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. First, a hardware configuration for realizing the main wire packing calculation method will be described with reference to FIG. FIG. 2 is a block diagram showing an example of a hardware configuration for realizing the calculation method and apparatus of the present invention.

  As shown in FIG. 2, the hardware configuration is realized by a known personal computer or general-purpose computer. The computer includes an input device 1, an I / O (input / output interface circuit) 2, a CPU (Central Processing Unit) 3, a memory 4, an output device 5, and a read / write device 6. The input device 1, the memory 4, the output device 5, and the read / write device 6 are electrically connected to the CPU 3 via I / O 2 or the like.

  The input device 1 is, for example, a keyboard or a mouse device that is used to input input data in a process described later. The CPU 3 includes a control unit 31 for controlling the input device 1, the output device 5, and the like, and a calculation unit 32 that performs processing related to the calculation method described later according to a program stored in the memory 4.

  The memory 4 includes a program memory 41 for storing a program corresponding to each process related to the calculation method described later, and a calculation memory 42 to which work areas for various processes performed by the CPU 3 are allocated. The output device 5 is, for example, a monitor display or a printing device that outputs a result of processing performed by the CPU 3.

  The read / write device 6 includes a wire packing calculation program 7a according to the present invention stored in a recording medium 7 such as a CD or a DVD (for example, as shown in FIGS. 3, 6, 8, 9, and 10 described later). This is a device for reading a processing procedure program) and transferring it to the program memory 41. The read / write device 6 also has a function of writing the calculation result in the recording medium 7. The computer may include a communication interface such as a modem board or a LAN card (not shown).

  The CPU 3 installs the wire material packing calculation program 7 a read by the read / write device 6 in the program memory 41 of the memory 4. Then, after the power is turned on, the program 7a is started up, and this computer functions as a wire packing calculation device. The wire packing calculation program 7a can be installed in another personal computer or general-purpose computer having the above-described configuration, and after installation, the computer functions as a wire packing calculation device.

  The wire rod packing calculation program 7a stored in the recording medium 7 corresponds to claim 10. The wire packing calculation program 7a may be provided to this computer not only through the recording medium 7 such as a CD or DVD, but also through a communication line such as the Internet, a dedicated line, or a LAN.

  Next, a basic processing procedure according to an embodiment of the present invention will be described with reference to FIGS. FIG. 3 is a flowchart showing a basic processing procedure according to an embodiment of the calculation method of the present invention. FIG. 4A and FIG. 4B are diagrams showing an example of an initial arrangement diagram and an initial arrangement table. FIG. 5A to FIG. 5C are diagrams showing examples of final arrangement diagrams and final arrangement tables.

In this calculation method, the cross-sectional shapes of the plurality of wires constituting the wire harness are regarded as a plurality of circles having a diameter corresponding to each outer shape. Wire harness, for example, as shown in FIG. 4 (a), consists of a single thick line, two middle line representing a circle c _3, and 4 or more thin lines represented by circles c ₅ representing a circle c ₁ It shall consist of a plurality of wires.

In this calculation method, first, in step T <b> 1 of FIG. 3, arrangement conditions for a plurality of wires are set automatically or using the input device 1. As for the arrangement condition of the wire, for example, the center position of the thick line represented by the circle c ₁ is arranged closer to the inner side of the bending than the center position of the calculated packing inclusion circle so as to correspond to severe conditions in the bending durability test. To be set. In this case, the circle corresponding to the other wire between the inner thick lines and packing inclusive circle representing a circle c ₁ set not enter. In the process of this calculation method, a fixed coordinate is assigned to the center position of the packing inclusion circle, and the bending inner direction is also determined in advance with respect to this center position. However, the bending inner direction may be adopted if automatic calculation is possible.

  The arrangement condition of the wire is not limited to the above example, and may be set so that the thick line is arranged at the center of the packing inclusion circle in order to obtain the bending life under an average condition, In order to obtain the bending life under more severe conditions, both the thick line and the middle line may be set so as to be arranged closer to the bending inner side of the packing inclusion circle. In addition, the circle corresponding to the thickest wire contacts the inside of the packing inclusion circle, or the circle corresponding to the other wire does not enter between the circle corresponding to the thickest wire and the inside of the packing inclusion circle. The arrangement condition may be set so that the circle corresponding to the thickest wire is close to the inside of the packing inclusion circle. Note that in this case, a test may be performed assuming that the circle corresponding to the thickest wire is in contact with or close to the bent inner side. These arrangement conditions may be directly specified manually by the input device 1, but in response to the specification of the test content, for example, a bending durability test, by the input device 1, in response to this. It is preferable that the arrangement conditions as described above are automatically set. Such step T1 corresponds to an arrangement condition setting step and arrangement condition setting means in the claims.

  Next, in step T2, the number of trials is set automatically or using the input device 1. Here, the random initial arrangement in step T1 is performed for the set number of trials, and the packing inclusion circle and the final arrangement of each wire corresponding to each initial arrangement are calculated. That is, the variation of the final arrangement of the packing inclusion circle and each wire described later is calculated by the set number of trials. The number of trials may be set to an appropriate value, for example, 50 times automatically, but it is necessary for various tests by making it possible to set it flexibly using the input device 1. The packing inclusion circle can be obtained in consideration of the number of variations of the wire arrangement condition to be performed, and the practicality is further improved. Step T2 corresponds to the trial number setting step and trial number means in the claims.

Next, in step T3, random arrangement calculation of n circles c _i (i = 1, 2, 3,..., N) is performed. Supplementally, the arrangement of the n circles c _i is calculated so as not to overlap each other within a predetermined range (it is not necessarily required to touch). The random center position of each circle can be determined using a random number table or the like. Step T3 corresponds to the random placement step and the random placement means in the claims.

Next, in step T4, the calculated random arrangement of each circle is output by the output device 5 as an initial arrangement diagram and an initial arrangement table as shown in FIG. 4A, for example. The initial layout diagram and the initial layout table may be printed out as well as displayed on the monitor display. As shown on the left side of FIG. 4A, the initial arrangement diagram displays n circles c _i randomly arranged by the above calculation. Although not shown, each circle c _i, has been attached electric wire ID assigned in advance. In FIGS. 4A and 4B, only four circles corresponding to the thin lines are shown, and the others are omitted.

In addition, as shown on the right side of FIG. 4A, the initial arrangement table shows n circles c _i randomly arranged by the above calculation in a tabular form. The initial arrangement table, for example, wire center position indicating the wire ID, the center position _{P 1,} P 3, the coordinates of _{P 5} of each circle _{c i} for specifying the electric wire (x1, y1), (x3 , y3 ), (X5, y5), etc., and wire radii r1, r2, r3, etc. are included.

Next, in step T5, an inclusion circle calculation process is performed. About encompassing circle calculation processing is described in detail in FIG. 6 or later, will be described briefly here, in this process, when the packing by bundling the smallest possible circular shape so as not to overlap each other above each circle c _i with obtaining the inclusion circle of each circle c _i as packing encompassing circle, information about the position of each circle c _i of the packing encompassing circle and this time, for example, calculates the center position coordinates and radius. Step T5 corresponds to the inclusion circle calculation step and the inclusion circle calculation means in the claims.

Next, in step T6, based on information about the position of each circle c _i which is the calculated, whether or not the set positioning condition at step T1 is satisfied is determined. For example, the center position of the thick line representing a circle c ₁ is, whether it is located in the bent inner side is determined from the center position of the packing encompassing circle calculated. If it is determined that the arrangement condition is satisfied (Y in step T6), the process proceeds to step T7, and after the final arrangement diagram and the final arrangement table are output, the process proceeds to step T8, but it is determined that the arrangement condition is not satisfied. (N in Step T6), the process reaches Step T8 without outputting the final arrangement chart and the final arrangement table. Step T6 corresponds to the condition determination step and the condition determination means in the claims.

If it is determined that the arrangement condition is satisfied, in step T7, for example, a final arrangement diagram and a final arrangement table as shown in FIG. The final layout chart and the final layout table may be printed out as well as displayed on the monitor display. As shown on the right side of FIG. 5B, the final arrangement diagram displays n circles c _i arranged by the inclusive circle calculation process. Although not shown, each circle c _i, has been attached electric wire ID assigned in advance. A packing inclusion circle C including n circles c _i is also displayed, and a portion corresponding to the inside of the bend is also displayed by, for example, an arrow. Step T7 corresponds to the output step and output means in the claims.

Further, as shown on the right side of FIG. 5B, the final arrangement table shows n circles c _i arranged by the above-described inclusion circle calculation processing in a table format. Final placement table, according to the initial arrangement table, for example, wire ID for identifying the wire, the center position _{P 1b,} P _3b, the wire center position indicating coordinates such as _{P 5b} of each circle _{c i} (x1b, _y1b) , (X3b, y3b), (x5b, y5b), etc., and wire radii r1, r2, r3, etc. are included. In addition, in the final arrangement table, the calculated radius R1b of the packing inclusion circle is also displayed. In FIGS. 5A to 5C, only four circles corresponding to the thin lines are shown, and the others are omitted.

As a result of the inclusion circle calculation process in step T5 corresponding to the random arrangement in step T3, a result as shown in FIG. 5A or 5C may be obtained. When the arrangement condition is “the center position of the thick line is arranged on the inner side of the bending than the center position of the packing inclusion circle”, the processing result as shown in FIG. As in b), the final layout chart and the final layout table are displayed, but nothing is displayed for the processing result as shown in FIG. As shown in FIG. 5 (c), the wire center position of each circle _{c i} corresponding to different calculation results and Fig. 5 (b) (x1c, y1c ), (x3c, y3c), (x5c, y5c) or the like, Then, the calculated radius R1c of the packing inclusion circle is displayed.

  Then, in step T8, it is determined whether or not the number of trials has been tried out. If the trial has been performed (Y in step T8), a series of processes related to the present calculation method is terminated, and if the trial has not been performed yet ( N) in step T8, after the number of trials is counted up in step T9, the process returns to step T3.

After returning to step T3, a new random arrangement calculation of n circles c _i (i = 1, 2, 3,..., N) is performed by the same process as described above. Then, based on this random arrangement calculation, in step T4, a new initial arrangement diagram and an initial arrangement table as shown in FIG. 4B are displayed, and the inclusion circle calculation in step T5 is performed. The same processing is repeated until the number of trials is tried out.

  Next, the inclusion circle calculation process at step T5 in FIG. 3 will be described in detail with reference to FIGS. First, the basic processing procedure of the inclusion circle calculation process will be described with reference to FIG. FIG. 6 is a flowchart showing a basic processing procedure related to the inclusion circle calculation processing.

In this calculation process, the cross-sectional shape of the plurality of wires constituting the wire harness is regarded as a plurality of circles having a diameter corresponding to each outer shape, and when the n cylinders having these circles in the cross section are bundled, This results in the problem of examining the size of the surrounding circle. Actually, an effective calculation method for obtaining the outer diameter by bundling a plurality of wire rods in as small a circular shape as possible by using the computer and obtaining the outer diameter thereof will be considered. Note that in FIGS. 6 to 11, in order to understand the present encompassing circle calculating process generically, 4 and 5 in each circle c _i and its magnitude shown, slightly changed their number and their arrangement It is described.

In the basic processing shown in FIG. 6, as input information, n pieces of circles c ₁ , c ₂ ,..., C _n corresponding to the outer shapes of the cross-sectional shapes of a plurality of wires such as electric wires constituting the wire harness are used. Radii r ₁ , r ₂ ,..., R _n , a number p smaller than 1 and sufficiently close to 1, for example, p = 0.95, and an end reference value ε that is a sufficiently small positive number, for example, end reference value ε = min ((r ₁ , r ₂ ,..., r _n ) / 100) is given.

Further, as output information, n circles c ₁ , c ₂ ,..., C _n can be packed so as not to overlap each other, the radius R of the smallest possible circle, and the circle C, circles c ₁ , c ₂ , ..., the position information of c _n is outputted.

Therefore, in step S1 shown in FIG. 6, first, the circles c ₁ , c ₂ ,..., C _n are arranged on a plane so as not to overlap each other, and a great circle surrounding them, that is, an inclusion circle C is found.

Next, in step S2, step S3, and step S4, a circle having the same center as that of the inclusion circle C and having a radius that is p times the inclusion circle C, that is, a target circle D is determined. That is, the loop composed of N in step S2, step S3 and step S4 has the same center as the inclusion circle C and is slightly smaller than the inclusion circle C, and at least a plurality of circles c ₁ , c ₂ ,. A target circle D is defined such that one of _n protrudes from the inclusion circle C. In the following process, the arrangement is changed so that the circles c ₁ , c ₂ ,..., C _n fall within the target circle D.

Next, in step S5, search insertion processing is performed. That is, here, a circle other than the circle c _i is taken out from any one of the circles c _i protruding from the target circle D in descending order of distance, and those that can be placed further away are moved as far as possible, such movement. If you cannot do it, leave it in place. Then, one circle c _i is moved, that is, inserted into the space created by such movement. The process of step S5 will be described later with reference to FIGS.

Next, in step S6, is determined whether Insert circles c _i in step S5 is successful, if successful returns to step S3 (Y in step S6), and otherwise the process proceeds to step S7 (N in step S6). When returning to step S3, it is determined whether or not there is another protruding circle. If there is this, the search insertion process of step S5 is performed again on this protruding circle, and if not, the process proceeds to step S4 and the above-described processing is performed. The same processing is performed.

  On the other hand, in step S7, a circle having an intermediate size between the inclusion circle C and the target circle D that has not been successfully inserted is newly set as the target circle D. Next, in step S8, it is determined whether or not the difference between the radii of the inclusive circle and the target circle D used in the processing of step S7 is equal to or less than the end reference value ε. If it is larger, the process returns to step S3 and the same processing is repeated (N in step S8). If this difference is equal to or smaller than the end reference value ε, the process proceeds to step S9 (Y in step S8).

In step S9, the radius of this inclusion circle C (corresponding to the packing inclusion circle) is calculated as the final radius R of the wire harness. In addition, position information of the inclusion circle C and the circles c ₁ , c ₂ ,..., C _n at this time is also calculated. These calculation results are transferred for the process of step T6 shown in FIG. The p and the end reference value ε may be slightly changed as appropriate.

  The behavior of each circle according to the above processing procedure is shown using FIG. FIG. 7 is a diagram showing the behavior according to the processing procedure of FIG. 6. In particular, FIG. 7 (a) shows an initial state, FIG. 7 (b) shows an insertion trial circle protruding from the target circle, and FIG. FIG. 7C shows a state where the insertion trial circle in FIG. 7B is inserted into the target circle, and FIG. 7D shows the final result.

FIG. 7A shows an initial arrangement of given n circles c _i and an inclusion circle C surrounding them. FIG. 7B shows a state in the middle of the processing, which is a target circle D slightly smaller than the currently included circle C and one of the circles protruding from the target circle D, and insertion is attempted. An insertion trial circle c _n is shown.

Further, in FIG. 7 (c), the relative insertion trial circle c _n shown in FIG. 7 (b), the state after the search insertion processing in step S5 shown has been performed in FIG. 6 shown ing. In FIG. 7C, a circle m _i (a circle group surrounding a rough oblique line) indicates a moving circle group that has moved to insert the insertion trial circle c _n in the search insertion process. Incidentally, as it can be seen from this figure, circles protrudes other, in the course of insertion processing insertion trial circle c _n, also to enter the target circle D. FIG. 7D shows the result of the insertion process performed on all protruding circles.

  In this way, by repeatedly calculating the multiple wires that make up the wire harness as far as possible from the wires protruding from the inclusion circle, and inserting the wires protruding into the resulting space The outer diameter of the wire harness surrounding the plurality of wires is efficiently acquired.

  Next, the search insertion process in step S5 in FIG. 6 will be described with reference to FIG. FIG. 8 is a flowchart showing the search insertion process in FIG.

In the search insertion process shown in FIG. 8, as input information, radius r _{i of} n circles c _i , their centers (x _i , y _i ), i = 1, 2,..., N, and target A circle D is given. However, it is assumed that the n circles c _i do not overlap each other, and the last circle c _n protrudes from the target circle D. There may be other protruding circles.

Further, as output information, if the last circle c _n can be inserted into the target circle D without protruding the circle already in the target circle D from the target circle D, it is regarded as a success result. The center positions of the n circles to be realized are output, and if not possible, a message indicating that is output as a failure result.

First, in step S51 of the search insertion process, the n circles c _i are rearranged in order from the last circle c _n . Specifically, this order is based on the distance between the center of each of the n circles c _i and the center of the last circle c _n . Then, the circle numbers resulting from the rearrangement are newly set as c ₁ , c ₂ ,..., C _n for the sake of simplicity. Hereinafter, this last circle is referred to as an insertion trial circle.

Next, the process shown in step S52 to step S54a (or step S54b) is performed for i = 1, 2,..., N−1. In step S52, search processing is performed. In other words, the circle c _i is, to search for a migration candidate position movable in the target circle D without overlapping with other circles. Specifically, in this search process, the first search process shown in FIG. 9 or the second search process shown in FIG. 10 is performed. In the first search processing, the circle c _i is without overlapping with other circles within the target circle D, from the current position of the circle c _i, to search for a migration candidate position as a distance from the insertion trial circle c _n . In the second search process shown in FIG. 10, using the concept of a circle Voronoi diagram, circles c _i is searched movement candidate position movable without overlapping with other circles within the target circle D. These will be described later.

Then, step S53 and step S54a, in step S54b, if the movement candidate positions in the search process to move the circle c _i to the farthest position in which the insertion trial circle c _n (in step S53 Y, step S54a), leaving without moving candidate positions circles c _i to the current position (N in step S53, step S54b). After such processing is performed for i = 1, 2,..., N−1, the process proceeds to step S55. In addition, the said step S52-step S54 respond | corresponds to the search process of a claim.

Next, in step S55, to attempt against the space of the target circle D made in the loop processing consisting of step S52~ step S54a (or step S54b), the Insert of the insertion trial circle c _n .

Then, step S56 and step S57a, in step S57b, if successful Insert the above insert included attempts to move into it the insertion trial circle c _n (Y in step S56, step S57a), although Insert If not, a message indicating that is output (N in step S56, step S57b). When the above is successful, the center positions of n circles that realize it are output. Then, when a series of processes including these steps S51 to S57a (or step S57b) is completed, the process returns to the subsequent process shown in FIG.

  Further, two examples of the search process will be described with reference to FIGS. 9 and 10. First, the first search process will be described with reference to FIG. FIG. 9 is a flowchart showing the first search process.

In the first search processing of FIG. 9, when a space to move the n circles c _i, in the state moved to the farthest from the insertion trial circle c _n, circle c _i is in contact with the two circles Focus on the fact that it should be. However, one of the two circles in contact with each other may be the target circle D. Therefore, here, a set formed by the given n circles c _i and the entire target circle D is set as S = {c ₁ , c ₂ ,..., C _n , D}. Then, the processing shown in the following steps S521 to S529 is performed on all the two circles c _j and c _k εS other than the circle c _i .

First, in step S521, a position where the circle c _i having the radius r _i contacts both the circle c _j and the circle c _k is searched. However, if the circle c _j or the circle _ck is a circle other than the target circle D, it touches from the outside, and if it is the target circle D, it touches from the inside. There are only two such positions, and the centers in that case are (x ′ _i , y ′ _i ) and (x ″ _i , y ″ _i ), respectively.

Next, in step S522 determines, moving to one location of the two above, whether circular c _i is the distance from the insertion trial circle C _n from the current position. That is, the distance of one of the center _{(x 'i, y' i} ) from the distance X 'to the center of the insertion trial circle C _n, from the center of the circle c _i of the current position to the center of the insertion trial circle C _n X is compared, and if the distance X ′ is greater than the distance X, the process proceeds to step S523 (Y in step S522), otherwise the process proceeds to step S526 described later (N in step S522).

In step S523, for all the circles other than the circle c _i , the circle c _j , the circle c _k and the target circle D, the circle c _i with the radius r _i is placed at the center (x ′ _i , y ′ _i ). If they overlap, it is checked whether or not they overlap, and the overlap is determined in step S524. If it is determined that no circle overlaps, the process proceeds to step S525 (N in step S524), and the center (x ′ _i , y ′ _i ) is added to one of the movement candidate positions of the circle c _i in step S525. Otherwise, the process proceeds to step S526 (Y in step S524).

Further, the one center (x ′ _i , y ′ _i ) is replaced with the other center (x ″ _i , y ″ _i ), and the following processing in steps S526 to S529 is performed in the same manner as in steps S522 to S525. I do. In step S526 determines, when moved to the other position of the two above, whether circular c _i is the distance from the insertion trial circle C _n from the current position. That is, the distance of the other center _{(x "i, y" i} ) from the distance X "to the center of the insertion trial circle C _n, from the center of the circle c _i of the current position to the center of the insertion trial circle C _n X is compared, and if the distance X ″ is greater than the distance X, the process proceeds to step S527 (Y in step S526), otherwise proceeds directly to the next (N in step S526).

In step S527, at the circle c _i, circle c _j, for all circles other than the circle c _k and target circle D, the central circle c _i of radius _{r i (x "i, y} " i) to If they overlap, it is checked whether or not they overlap, and the overlap is determined in step S528. Here, if it is determined not to overlap any circle proceeds to step S529 (N in step S528), in addition to the center _{(x "i, y" i} ) to one of the migration candidate position of the circle c _i in step S529 Otherwise, the process proceeds directly (Y in step S528). When such a process is performed on all the two circles c _j and c _k other than the circle c _i , the process returns to the subsequent process shown in FIG.

By using the first search process as described above, the calculation of the outer diameter of the wire harness, which has been conventionally performed by the method and experience shown in FIG. 8, is improved and can be performed more accurately. Therefore, it helps the design of the wire harness. On the other hand, when the first search process is used, there is a problem that the amount of calculation becomes enormous. That is, in the first search process shown in FIG. 9, the above operation is performed on the set of circles c _i , circles c _j , and circles c _k , and therefore the calculation time is O (n ³ ). Become. In the search and insertion process of FIG. 8, since this is performed for all i = 1, 2,..., N, the calculation time is O (n ⁴ ). Furthermore, in the processing of FIG. 6, since this is incorporated and repeated processing is performed, the total calculation amount becomes enormous. This is improved in the second search process shown in FIG.

  FIG. 10 is a flowchart showing the second search process. FIG. 11A is a diagram showing an example of a set of circles. FIGS. 11B and 11C are a circle Voronoi diagram and a Laguerre circle Voronoi diagram for the circle set in FIG. 11A, respectively. is there.

First, the basic concept of the second search process will be described. In this second search processing, by utilizing the concept of known Voronoi diagram, to streamline the search of movement candidate positions insertion trial circle c _i. That is, in the first search process, in order to obtain the movement candidate position of the circle c _i , the positions in contact with all the circle sets c _j and c _k are obtained, but if the concept of the Voronoi diagram is used, Candidates can be limited.

  Given a finite number of circles that do not overlap each other on the plane, the plane can be divided according to which circle is closest to it. This divided figure is called a circular Voronoi diagram, which is also shown in Non-Patent Document 1 above.

For example, a circular Voronoi diagram for the circle group shown in FIG. 11A is as shown in FIG. Figure 11 (b) a point on the boundary side e _j called Voronoi edges of the two circles c _k, there from c _l equal distance, the other circle has the property that farther is. Thus, two circles c _k, against the c _l, the circle does not overlap the other circles would be centered on the boundary side e _j of the circle Voronoi diagram. Therefore, the movement candidate positions of the circle c _i is two circles c _k sandwiching the boundary side e _j of the circle Voronoi diagram may look only for a set of c _l. Since the number of n boundary side e _j of the circle Voronoi diagram of a circle is a number proportional to n, the circle c _k to be searched, the set of c _l is the first search process of FIG. 9 O (n ²⁾ In contrast, here, O (n) is obtained.

Further, with respect to the movement position candidates of the circle c _i in contact with the two circles c _k and c _l , in the first search process of FIG. 9, the overlap with all the circles c _j and c _k other than the circle c _i is performed. Although it was inspected, it is no longer necessary here. That is, the movement candidate positions of the circle c _i is sufficient by examining whether on the boundary edge e _j. This is because, if on the boundary edge e _j, never overlapping with other circles, to be on the boundary side e _j be overlapped with other circles, because derived from the nature of the circle Voronoi diagram. Therefore, the inspection time of O (n) can be set to O (1).

The procedure of the second search process based on such a concept is as shown in FIG. In step S521 ′ of FIG. 10, first, a circle Voronoi diagram is created for the circle set S- {c _i }, that is, all circles other than the circle c _i . Here, since this circle set S- {c _i } is composed of n circles, the number of boundary sides is also proportional to n.

Then, the following steps S522 ′ to S525 ′ are performed on each boundary edge e _j (j = 1, 2,..., N).

'In both sides of the circle c _k of the boundary edge e _j, a circle c having a radius r _i which is in contact with the c _l' Step S522 make _i. However, again, the circle c _k or the circle c _l is in contact from the outside if a circle other than target circle D, and shall contact the inside if the target circle D. There are at most two such circles.

Then, 'in a circle c having a radius r _i which is in contact with the above' step S523 it is determined that there is _i ( 'Y, yet step S524 step S523)' is determined that the center in the present on the boundary side e _j If so (Y in step S524 ′), the process proceeds to step S525 ′ to add the circle c ′ _i to the movement candidate position of the circle c _i . Otherwise, proceed directly to the next (N in step S523 ′, N in step S524 ′). Such processes, when performed on all boundary edges e _j, returns to the process subsequent thereto shown in FIG.

As apparent from the above description, by using the concept of Voronoi diagram, it can be seen that the search of movement candidate positions of the circle c _i is greatly simplified. It is shown in the said nonpatent literature 1 that the circular Voronoi figure of n circle | round | yen can be made with the calculation time of O (nlogn). Therefore, the process of step S521 ′ can be executed in O (nlogn) time. On the other hand, since the boundary side of the circle Voronoi diagram of n circles has only the number proportional to n, the processing from step S522 ′ to step S524 ′ can be executed in O (n) time. From the above, the calculation time of the second search process shown in FIG. 10 is O (nlogn). For reference, it can be seen that the first search process shown in FIG. 9 requires a calculation time of O (n ³ ), so that the efficiency is greatly improved. Incidentally, if the second search process of FIG. 10 is incorporated in the search insertion process of FIG. 8, the process of FIG. 10 is executed O (n) times in the search insertion process of FIG. The calculation time of the search insertion process of 8 is O (n ² logn).

  In addition, the simple calculation method of the said circular Voronoi diagram makes the Laguerre Voronoi diagram of the said nonpatent literature 1, and then performs this by the side flip operation of the said nonpatent literature 2 and the said nonpatent literature 3. This is a method of changing to a circular Voronoi diagram (see FIG. 11C).

  In this way, according to the inclusion circle calculation process, using a computer, a plurality of wires constituting the wire harness are rearranged as far as possible from the wires protruding from the inclusion circle, so that they protrude into the resulting space. By repeatedly calculating the operation of inserting the wire, the outer diameter of the wire harness surrounding the plurality of wires can be acquired efficiently. In particular, by adopting the concept of a circular Voronoi diagram, the outer diameter of the wire harness can be acquired very easily and in a short time.

  Only when the set arrangement condition is determined to be satisfied by the processing procedure shown in FIG. 3 while efficiently obtaining the packing inclusion circle using such an inclusion circle calculation process, the packing inclusion circle and Information about the position of multiple circles is displayed and output. Accordingly, it is possible to efficiently and automatically determine a packing inclusion circle that satisfies a desired wire arrangement condition necessary for various tests such as a bending durability test of the wire harness.

  In addition, in the said embodiment, in order to obtain | require the outer diameter of a wire harness, although a radius is output, it cannot be overemphasized that this may be a diameter. Further, the values of p and ε in the inclusive circle calculation process are not limited to the values shown in the above embodiment, and can be appropriately changed within the scope of the gist of the present invention. As for the arrangement condition of the wire, in order to obtain the bending life under more severe conditions, as shown in FIG. 4 (C), not only the thick line but also the middle line is arranged closer to the bending inner side of the packing inclusion circle. It is also possible to set to display the output. Furthermore, the present invention can be similarly applied not only to a wire harness routed in a vehicle but also to a wire harness routed indoors.

It is a block diagram which shows the basic composition of this invention. It is a block diagram which shows an example of the hardware constitutions for implement | achieving the calculation method and its apparatus of this invention. It is a flowchart which shows the basic process sequence which concerns on one Embodiment of the calculation method of this invention. FIG. 4A and FIG. 4B are diagrams showing an example of an initial arrangement diagram and an initial arrangement table. FIG. 5A to FIG. 5C are diagrams showing examples of final arrangement diagrams and final arrangement tables. It is a flowchart which shows the basic process sequence which concerns on an inclusion circle calculation process. 7A shows an initial state, FIG. 7B shows an insertion trial circle protruding from the target circle, and FIG. 7C shows an insertion trial circle in FIG. 7B inside the target circle. And FIG. 7D is a diagram showing the final result. It is a flowchart which shows the search insertion process in FIG. It is a flowchart which shows a 1st search process. It is a flowchart which shows a 2nd search process. FIG. 11A is a diagram showing an example of a set of circles. FIGS. 11B and 11C are a circle Voronoi diagram and a Laguerre circle Voronoi diagram for the circle set in FIG. 11A, respectively. is there.

Explanation of symbols

1 Input device 2 Input / output interface circuit 3 CPU
4 Memory 5 Output device C Inclusion circle D Target circle c _n Insertion trial circle _mn Movement circle e _j Boundary edge

Claims (10)

Considering the cross-sectional shapes of a plurality of wires having different thicknesses constituting the wire harness as a plurality of circles having a diameter corresponding to each outer shape, the plurality of circles are bundled into a circle shape as small as possible so as not to overlap each other; A calculation method for packing the plurality of wires so as to satisfy a desired arrangement condition,
Random placement step that repeats a predetermined number of trials and randomly arranges a plurality of circles corresponding to the plurality of wire rods so as not to overlap each other,
Each time the random placement step is initially arranged, the plurality of circles corresponding to the plurality of wire rods are bundled and packed in a circle as small as possible so as not to overlap each other. An inclusion circle calculation step for calculating information regarding the packing inclusion circle and the positions of the plurality of circles at this time,
A condition determination step of determining whether or not the arrangement condition is satisfied based on information on the positions of the plurality of circles calculated in the inclusion circle calculation step;
An output step of outputting information about the positions of the packing inclusion circle and the plurality of circles only when it is determined that the arrangement condition is satisfied in the condition determination step;
Including
The inclusion circle calculation step includes:
Assuming an inclusion circle including the plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shapes of the plurality of wires are a plurality of circles having a diameter corresponding to each outer shape. And a target circle defining step for defining a target circle having the same center as the inclusion circle and slightly smaller than the inclusion circle and protruding from at least one of the plurality of circles, and protruding from the target circle A search step for searching for a position where the circle other than the insertion trial circle can move as far as possible within the target circle without overlapping each other, and a search result by the search step An insertion step of inserting the insertion trial circle into a space in the target circle, which can be obtained by rearranging the plurality of circles, and inserting all of the insertion trial circles into the target circle A first search control step that returns to the search step after defining a new target circle that is slightly smaller than the current and has the insertion trial circle, and is configured to include the target By repeatedly executing the circle definition step, the search step, the insertion step, and the first search control step, the inclusion circle is gradually reduced to obtain the packing inclusion circle, and the packing inclusion circle Calculating information about the position and the position of the plurality of circles;
A wire packing calculation method characterized by that. In the wire rod packing calculation method according to claim 1,
A trial number setting step for setting the number of trials;
A wire packing calculation method, further comprising: In the wire rod packing calculation method according to claim 1 or 2,
The plurality of wires include
Includes multiple types of wire with different thicknesses,
As the arrangement condition, the circle corresponding to the thickest wire contacts the inside of the packing inclusion circle, or corresponds to another wire between the circle corresponding to the thickest wire and the inside of the packing inclusion circle. A condition setting step for automatically setting the circle corresponding to the thickest wire so as to be close to the inside of the packing inclusion circle to the extent that the circle does not enter,
A wire packing calculation method, further comprising: In the wire rod packing calculation method according to claim 1 or 2,
In the plurality of wires,
Includes multiple types of wire with different thicknesses,
In response to an input signal indicating that it is a bending endurance test, as the arrangement condition, the center position of the circle corresponding to the thickest wire is closer to the inside of the bending than the center position of the packing inclusion circle. And a condition setting step of automatically setting so that a circle corresponding to another wire rod does not enter between the circle corresponding to the thickest wire rod and the inside of the packing inclusion circle,
A wire packing calculation method, further comprising: In the wire rod packing calculation method according to any one of claims 1 to 4,
In the search step,
A circle Voronoi diagram is created with a circle group excluding one of the insertion trial circle and the plurality of circles, and the target circle, and is in contact with both side circles forming each boundary side in the circle Voronoi diagram By investigating whether or not the center of one circle is on the boundary side with respect to the plurality of circles other than the insertion trial circle, these circles can move within the target circle. Searching for a position,
A wire packing calculation method characterized by the above. In the wire rod packing calculation method according to any one of claims 1 to 5,
It is repeatedly executed together with the target circle definition step, the search step, the insertion step and the first search control step,
When the insertion trial circle cannot be inserted, the other new one having an intermediate size between the inclusion circle and the current target circle and having the insertion trial circle A second search control step for returning to the search step after setting a target circle;
A wire rod packing calculation method, further comprising: Considering the cross-sectional shapes of a plurality of wires having different thicknesses constituting the wire harness as a plurality of circles having a diameter corresponding to each outer shape, the plurality of circles are bundled into a circle shape as small as possible so as not to overlap each other; A calculation device for packing the plurality of wires so as to satisfy a desired arrangement condition,
Random arrangement means that repeats a predetermined number of trials and randomly arranges a plurality of circles corresponding to the plurality of wire rods so as not to overlap each other,
Each time the random placement step is initially arranged, the plurality of circles corresponding to the plurality of wire rods are bundled and packed in a circle as small as possible so as not to overlap each other. An inclusion circle calculation means for calculating the packing inclusion circle and information on the positions of the plurality of circles at this time, as a circle,
Condition determining means for determining whether or not the arrangement condition is satisfied based on information on the positions of the plurality of circles calculated by the inclusion circle calculating means;
Only when it is determined by the condition determination means that the arrangement condition is satisfied, an output means for outputting information on the positions of the packing inclusion circle and the plurality of circles;
Including
The inclusion circle calculation means includes:
Assuming an inclusion circle including the plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shapes of the plurality of wires are a plurality of circles having a diameter corresponding to each outer shape. And a target circle defining means for defining a target circle having the same center as the inclusion circle and slightly smaller than the inclusion circle and protruding from at least one of the plurality of circles, and protruding from the target circle A search means for searching for a position where the circle other than the insertion trial circle can move as far as possible within the target circle without overlapping each other, and a search result by the search means An insertion means for inserting the insertion trial circle into a space in the target circle which can be obtained by rearranging the plurality of circles, and all of the insertion trial circles are inserted into the target circle. A first search control means for returning to the search means after determining a new target circle that is slightly smaller than the current and having the insertion trial circle, the target circle definition means, the search The inclusion circle is gradually reduced by repeatedly executing the processing by the means, the insertion means, and the first search control means, and the packing inclusion circle is obtained. Position information calculating means for calculating information related to the position of the circle of
A wire packing calculation device characterized by the above. In the wire rod packing calculation apparatus according to claim 7,
Trial number setting means for setting the number of trials;
The wire material packing calculation device further comprising: In the wire rod packing calculation apparatus according to claim 7,
In response to an input signal indicating a predetermined test content related to the wire harness, condition setting means for automatically setting the arrangement conditions of the plurality of wires suitable for the test content,
The wire material packing calculation device further comprising: Considering the cross-sectional shapes of a plurality of wires having different thicknesses constituting the wire harness as a plurality of circles having a diameter corresponding to each outer shape, the plurality of circles are bundled into a circle shape as small as possible so as not to overlap each other; In order to pack the plurality of wires so as to satisfy a desired arrangement condition, a computer is provided.
Random arrangement means that repeats a preset number of trials and randomly arranges a plurality of circles corresponding to the plurality of wire rods so as not to overlap each other,
Each time the random placement step is initially arranged, the plurality of circles corresponding to the plurality of wire rods are bundled and packed in a circle as small as possible so as not to overlap each other. An inclusion circle calculating means for calculating information regarding the packing inclusion circle and the positions of the plurality of circles at this time,
Condition determining means for determining whether or not the arrangement condition is satisfied based on information on the positions of the plurality of circles calculated by the inclusion circle calculating means;
Only when the condition determining unit determines that the arrangement condition is satisfied, the condition determining unit functions as an output unit that outputs information on the positions of the packing inclusion circle and the plurality of circles, and
In the inclusion circle calculation means, a computer is
Assuming an inclusion circle including the plurality of circles arranged so as not to overlap each other on a plane, assuming that the cross-sectional shapes of the plurality of wires are a plurality of circles having a diameter corresponding to each outer shape. Means, a target circle defining means for defining a target circle that has the same center as the inclusion circle and is slightly smaller than the inclusion circle, and at least one of the plurality of circles protrudes, a circle protruding from the target circle An insertion trial circle, a search means for searching a position where the plurality of circles other than the insertion trial circle can move as far as possible within the target circle without overlapping each other, based on a search result by the search means Inserting means for inserting the insertion trial circle into a space in the target circle formed by changing the arrangement of a plurality of circles, and when all of the insertion trial circles are inserted into the target circle The first search control means, the target circle definition means, the search means, and the search means to return to the search means after defining the new target circle that is slightly smaller than the current and has the insertion trial circle By repeatedly executing the processing by the insertion means and the first search control means, the inclusion circle is gradually reduced to obtain the packing inclusion circle, and the position of the packing inclusion circle and the plurality of circles Function as position information calculation means for calculating information about the position;
A wire packing program characterized by that.

Images