JP3617815B2 - Recording medium recording the evacuation farthest point detection program - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present inventionIsFor recording media devices that record the evacuation farthest point detection program, especially for specific floors and rooms in buildings.Evacuation safety verificationIn structures such as areas or tunnelsEvacuation safety verificationIn areas, etc., the distance to the exit is the longestFarthest evacuationDetect pointsRuThe present invention relates to a recording medium on which a program is recorded.
[0002]
[Prior art]
In designing buildings and structures, it is required to satisfy fire safety performance that allows safe evacuation in the event of a fire. Recently, we have objectively verified the safety of evacuation in the event of fire using engineering methods that predict human evacuation behavior in the event of a fire and engineering methods that predict the state of smoke and gas during a fire. Is required to do.
[0003]
For example, in the Building Standards Act, for each floor of a building, even if a fire occurs in any room on that floor, all persons existing on that floor are evacuated floors (floors with doorways leading directly to the ground. The same)) or verification that smoke or gas does not fall to a height that would hinder evacuation until the evacuation to the direct stairway to the ground (hereinafter simply referred to as the direct staircase) is completed Verification). In addition, if a fire breaks out in any room of a building for the entire building, there will be obstacles to evacuation until all the people in the building finish evacuating from the building to the ground. Verification that smoke or gas does not fall to the height (hereinafter referred to as the whole building evacuation safety performance) may be required.
[0004]
In floor evacuation safety verification, first, in the event of a fire in any room on the floor subject to verification, the time from each part of the room to any exit of that room (hereinafter referred to as room evacuation required time) )) Does not exceed the time it takes for smoke or gas to fall to a height that would prevent evacuation in that room (hereinafter referred to as smoke fall time). In addition, the time from each part of the verification target floor including the corridor to the direct staircase of the verification target floor (hereinafter referred to as floor evacuation time) must not exceed the smoke fall time on the verification target floor. To verify. In the whole building evacuation safety verification, after verifying the floor evacuation safety of each floor of the building, the time from each part in the building to the ground (hereinafter referred to as the whole building evacuation time) is the inside of the building. It is necessary to verify that the smoke fall time is not exceeded.
[0005]
Specifically, for example, when verifying the safety of evacuation on the fourth floor of the four-story shopping center 1 shown in FIG. 13, first, the room 2a surrounded by the surrounding walls such as the outer wall, the partition wall, the fire prevention smoke prevention shutter 5 and the like. From each part (including the part that cannot be evacuated without passing through the room 2a), any exit 3a from the room 2a₁, 3a₂, 3a_Three, 3a_FourVerify that the time required for evacuation to the room does not exceed the smoke fall time in room 2a. The same verification is performed for the other rooms 2b, 2c ... on the 4th floor. In addition, direct staircase 7 from each part of the area (parts other than staircase 8) surrounded by the thick line on the 4th floor in the figure₁~ 7₈That is, the entrance 7 of the staircase 8₁~ 7₈Verify that the time required for evacuation to the floor does not exceed the smoke fall time on the 4th floor. Direct stairway entrance 7 in each staircase 8₁~ 7₈Is connected to the first floor or the ground 9 which is the evacuation floor of the shopping center.
[0006]
[Problems to be solved by the invention]
The room evacuation time or floor evacuation time is, for example, from the room 2a in FIG. 13 or each part of the floor 6 to the exit 3a of the room 2a.₁~ 3a_FourOr direct stairs entrance 7 on that floor₁~ 7₈(Hereinafter, both may be referred to simply as exit E.)InThis corresponds to the maximum travel time (hereinafter referred to as the maximum evacuation travel time) Tmax. Assuming that the moving speed v in any part of the room 2a is constant, the maximum evacuation movement time Tmax is the maximum value of the moving distance from each part of the room or floor to the exit E of the room or floor. It can be calculated from Dmax (hereinafter referred to as the maximum evacuation movement distance) and the movement speed v. In order to obtain the maximum evacuation distance Dmax,Closest to that partThe travel distance to Exit E isIn all partsIt is necessary to find the largest point (hereinafter referred to as the evacuation farthest point).
[0007]
However, for example, in a large-scale building where stores and offices are arranged, there are many cases where the exits of living rooms, direct stairs and staircases are irregularly arranged, and it is difficult to find the farthest evacuation point. Many. In particular, when the farthest evacuation point is obtained by manual work on the design drawing, trial and error must be repeated, and there is a problem that it takes time to detect the farthest evacuation point and to further verify evacuation safety. In addition, when equipment such as merchandise display shelves or partition walls and other moving obstacles are arranged in the room, the evacuation route changes due to the presence of the moving obstacles, so that it becomes more difficult to detect the farthest evacuation point. In order to facilitate evacuation safety verification, there is a need to develop a system that can easily detect the farthest evacuation point in a building or structure area even when there are moving obstacles.
[0008]
Therefore, an object of the present invention is to provide the farthest evacuation point that can detect the farthest evacuation point in the area in a short time even when there is a moving obstacle.detectionIs in providing the program.
[0009]
[Means for Solving the Problems]
The present inventor, for example, indicates that the movement route having the maximum movement distance from each part in the area of the building or structure to the exit E of the area is the X-axis direction in the orthogonal XY coordinate system on the plan view of the area. We focused on the fact that it can be expressed as a grid-like movement route combining movement in the Y-axis direction. In this case, the movement distance D of the lattice-like movement route is expressed as the sum (| X | + | Y |) of the movement distance | X | in the X-axis direction and the movement distance | Y | in the Y-axis direction.
[0010]
The grid-like movement route from the farthest evacuation point in the area to its exit E is the movement route (hereinafter referred to as the longest) in which the sum of the movement distances in the X-axis and Y-axis directions (| X | + | Y |) is maximum. It is called a travel route.) Therefore, the farthest evacuation point in the area can be detected as a point where the sum (| X | + | Y |) of the moving distance from each exit Ei in the area becomes the maximum. The present invention has been completed based on this finding.
[0011]
Referring to the flowchart of FIG. 1 and FIG.One aspect of recording medium on which program is recordedIs surrounded by a surrounding wallOne or moreWith exit EiEvacuation safety verificationZone 2 or 6The closest exit from each point in Ei The computer to detect the farthest evacuation point where the distance traveled toofIn the orthogonal XY coordinate system of evacuation safety verification area 2 or 6Plan view 30 (see FIG. 13A)And initial distance D ₀ Storing unit and unit distance d twenty one Storage means twenty one Plan view from 30 ReadEach exit Ei in plan view 30 (for example, in FIG.₁, 3₂, 3_Three)Its coordinatesPolygonal region Zi having the exit Ei as the origin and the sum (| X | + | Y |) of the movement distance | X | in the X-axis direction and the movement distance | Y | In Fig. 3, polygonal areas Z1, Z2, Z3) are allocatedAllocation means (step of FIG. 1) 101 ~ 103 ); The predetermined moving distance D is the initial distance D ₀ Is increased by a unit distance d (D = D ₀ + Dj) for each polygon region Zi Means for simultaneously enlarging images at the same magnification (step of FIG. 104 ); And evacuation safety verificationIn area 2 or 6Plan view 30 And each polygonal area Zi By superimposingA non-overlapping area N that does not overlap any polygonal area Zi in the plan view 30Display andEach polygonal area ZiofExpansionReduce according toMinimum reduction of non-overlapping area NPoint or lineCoordinateAs evacuation safety verificationThe farthest evacuation point P in area 2 or 6Display means to display anddo itFunctionRuRecorded evacuation farthest point detection programIs.
[0012]
Preferably, as shown in FIG.Allocation means (step 103 )At each exit Ei of Plan 30ThatInitial distance D with exit Ei as origin and X and Y directions from origin₀4 points 15 apart_0-1, 15_0-2, 15_0-3, 15_0-4Initial area Zi of square with vertices₀(See (A) in the figure)Enlarging means (step 104 )Initial region Zi₀Each vertex 15_0-1, 15_0-2, 15_0-3, 15_0-4InThatFour points separated from the origin by the unit distance d in the X-axis direction and the Y-axis direction (for example, 15_0-14 points when the origin is 15_101-1, 15_101-2, 15_101-3, 15_101-4) Square unit area Zi₁₀₁, Zi₁₀₂, Zi₁₀₃, Zi₁₀₄Is assigned (see (B) in the figure), and the square unit area Zi assigned last time_{(j-1) 01}, Zi_{(j-1) 02}, Zi_{(j-1) 03}At each vertex of, ...ThatNext square unit area Zi with vertex as origin_j01, Zi_j02, Zi_j03,... Are allocated to enlarge the polygonal region Zi (see FIGS. 3C and 3D).
[0013]
1 and 3, the recording medium on which the evacuation farthest point detection program of the present invention is recorded.Other aspects ofIs surrounded by a surrounding wallOne or moreWith exit EiEvacuation safety verificationIn area 2 or 6The closest exit from each point Ei In order to detect the farthest evacuation point where the moving distance is the maximum among all points, the computer is connected to the orthogonal XY coordinate system of the evacuation safety verification area 2 or 6Plan view 30 (see FIG. 13A)And initial distance D ₀ Storing unit and unit distance d twenty one Storage means twenty one Plan view from 30Read,ThatEach exit Ei in plan view 30Its coordinatesA polygonal region Zi is assigned with the exit Ei as the origin and the sum of the movement distance | X | in the X-axis direction and the movement distance | Y | in the Y-axis direction (| X | + | Y |) equal to or less than the predetermined movement distance D.Allocation means (step of FIG. 1) 101 ~ 103 ); The predetermined moving distance D is the initial distance D ₀ Is increased by a unit distance d (D = D ₀ + Dj) for each polygon region Zi Means for simultaneously enlarging images at the same magnification (step of FIG. 104 );A non-overlapping area N that does not overlap any polygonal area Zi in the plan view 30Non-overlapping zone detection means for calculating (step of FIG. 1 105 ); AndMinimum reduction of non-overlapping area N when each polygonal area Zi is expandedPoint or lineFrom coordinatesEvacuation safety verificationThe farthest evacuation point P in area 2 or 6CalculationDoMinimum coordinate detection means (step of FIG. 1) 106 ~ 107 )This is a record of the evacuation farthest point detection program.
[0014]
DETAILED DESCRIPTION OF THE INVENTION
FIG. 2 shows an example of a block diagram of an apparatus for executing the evacuation farthest point detection program of the present invention. The apparatus includes a computer 20, a display device 22, an input device 23 such as a mouse / keyboard, and a scanner 24.Storage means (memory)21 is surrounded by surrounding walls in buildings and structures and has an exit EiEvacuation safety verificationArea plan 30And the initial distance described below D ₀ And unit distance dRemember. As the plan view 30, for example, a design drawing created by CAD can be used. Further, the image data read from the scanner 24 can be used as the plan view 30. Reference numeral 26 in FIG. 2 indicates data conversion means for converting analog image data into digital data.
[0015]
For example, when any floor 6 of the building is the target area, a plan view 30 of the floor 6 as shown in FIG.Storage means21. The exit Ei of the floor 6 is used as an entrance 7 to a predetermined evacuation floor of the building or a direct staircase leading to the ground 9. If any room 2 in the building is the target area, a plan view 30 of the room 2 should be used.Storage means21. The exit Ei of the room 2 is designated as an exit 3 leading to a predetermined evacuation floor of the building or a direct stairs to the ground 9.
[0016]
The computer 20 shown in FIG. 2 includes a farthest point detecting unit 27 and a moving time calculating unit 29. An example of the farthest point detection means 27 is:Storage means21 is a program for reading the plan view 30 of the target area 2 or 6 stored in 21 and detecting the farthest evacuation point P in the area 2 or 6. An example of the travel time calculation means 29 is a program that calculates the maximum travel time τmax from the farthest evacuation point P to any exit Ei based on the farthest evacuation point P detected by the farthest point detection means 27. . When the moving speed v in any part of the target area 2 or 6 is constant, the maximum movement time τmax corresponds to the maximum evacuation time Tmax in the area 2 or 6, that is, the room or floor evacuation time.
[0017]
FIG. 1 shows an example of a flow chart of processing in the farthest point detection means 27 of FIG. FIG. 3 shows an embodiment of the present invention in which the room 2 in the building 1 having outlets E1, E2, and E3 and having a rectangular plan view outer periphery is the target area. The processing in the farthest point detecting means 27 will be described below with reference to the flowchart of FIG. 2 and the embodiment of FIG. In addition, the surrounding wall of the target area 2 or 6 includes the outer wall of the building 1, the partition wall, the fire and smoke / shutter shutter 4 and the like. However, the application target area of the present invention is not limited to the area in the building 1, and the present invention can be applied to an area in a structure such as a tunnel.
[0018]
First, in step 101, the plan view 30 of the target area 2 isStorage meansFrom 21Farthest point detection means 27 InIn step 102, an orthogonal XY coordinate system is defined on the plan view 30. In FIG. 3A, the long side of the rectangular chamber 2 is parallel to the X axis, and the short side is parallel to the Y axis. However, the X axis and the Y axis do not have to be parallel to the peripheral wall of the area 2. By defining the XY coordinate system, the XY coordinates of the surrounding wall of the area 2 on the plan view 30, each exit Ei, and the moving obstacle 13 if necessary can be determined. By making it possible to identify the surrounding wall on the plan view 30, each exit Ei, the moving obstacle 13 and the like by an appropriate method, they can be automatically identified in step 102 to obtain coordinates. For example, if the plan view 30 is a CAD drawing or the like created on the Cartesian coordinate system, the Cartesian coordinate system set on the CAD drawing in Step 102 is adopted as the XY coordinate system, and each exit Ei or the like on the CAD drawing is used. The coordinates may be used. When the plan view 30 is image data, the coordinates of each exit Ei and the like can be obtained by appropriate image processing.
[0019]
In step 103,Farthest point detection means 27 By the allocation means ofExit Ei in plan view 30 (in FIG. 3, exit 3 of chamber 2₁, 3₂, 3_Three), The sum of the movement distance | X | in the X-axis direction and the movement distance | Y | in the Y-axis direction (| X | + | Y |) is equal to or less than the predetermined movement distance D. Initial region Zi of polygonal region Zi₀(Z1 in Fig. 3 (B)₀, Z2₀, Z3₀).The farthest point detection means 27 As shown in FIG. 30 And each polygonal area Zi And display device twenty two To display.Initial region Zi₀For example, as shown in FIG. 5A, the initial distance D from each outlet Ei in the X-axis direction and the Y-axis direction.₀4 points 15 apart_0-1, 15_0-2, 15_0-3, 15_0-4Can be a square area with the vertex at. In FIG. 5, the initial region Zi₀The portion represented by the dotted line in the lower half of the portion is a portion that does not overlap the inside of the area 2. When there is a portion that does not overlap with area 2 in this way, initial region Zi₀May be assigned as a region only overlapping the area 2 (in the figure, a region of a right isosceles triangle). FIG. 3B shows a polygonal area consisting only of a portion overlapping the area 2 in the square as an initial area Z1.₀, Z2₀, Z3₀Shows an example of assigning to each of the exits E1, E2, and E3.
[0020]
Each initial region Zi₀Is the initial distance D of the predetermined moving distance D₀It depends on. Initial distance D₀Is any initial area Zi in the target area 2₀The non-overlapping area N that does not overlap can be made large. Appropriate initial distance D according to the location of exit Ei₀However, when the outer periphery of the plan view of the area 2 is rectangular as shown in FIG. 3B, for example, 1/2 of the short side length of the rectangle is set to the initial distance D.₀It can be.
[0021]
Next, in step 104,Farthest point detection means 27 By means of enlargementBy increasing the predetermined moving distance D, the polygonal area Zi allocated to each exit Ei is expanded. By enlarging each polygonal area Zi by increasing the predetermined moving distance D, each area Zi is enlarged at the same magnification.Simultaneously (ie synchronized)Can be enlarged. 5B to 5D show the predetermined distance D as the initial distance D.₀An example of a method for enlarging the polygonal area Zi when the unit distance d is increased by a unit distance d. However, in the present invention, it is sufficient to enlarge the polygonal area Zi by increasing the predetermined movement distance D, and the enlargement method of the polygonal area Zi is not limited to the illustrated example.
[0022]
In FIG. 5B, the initial region Zi₀Each vertex 15_0-1, 15_0-2, 15_0-3, 15_0-4EachThatVertex 15_0-1, 15_0-2, 15_0-3, 15_0-4Is a square unit region Zi having four points separated from the origin by a unit distance d in the X-axis direction and the Y-axis direction.₁₀₁, Zi₁₀₂, Zi₁₀₃, Zi₁₀₄(Hereafter, each of these areas is referred to as a unit area Zi.₁There is. ) Is assigned. For example, vertex 15 in the figure_0-1For that vertex 15_0-14 points 15 apart from each other by unit distance d in the X-axis and Y-axis directions_101-1, 15_101-2, 15_101-3, 15_101-4Square unit area Zi₁₀₁Is assigned.
[0023]
Next, in the same figure (C), the square unit area Zi allocated in the same figure (B).₁₀₁, Zi₁₀₂, Zi₁₀₃, Zi₁₀₄For each vertex of the unit area Zi, with each vertex as the origin₁Square unit area Zi of the same orientation and size as₂₀₁, Zi₂₀₂, Zi₂₀₃, ..., Zi₂₀₉(Hereafter, each of these areas is referred to as a unit area Zi.₂There is. ) Is assigned. For example, the unit region Zi in FIG.₁₀₁Each vertex 15_101-1, 15_101-2, 15_101-3, 15_101-4For the square unit area Zi₂₀₁, Zi₂₀₂, Zi₂₀₃, Zi₂₀₉Is assigned. However, newly assigned unit area Zi₂₀₉Is the initial area Zi, all of which are allocated in FIG.₀Can be omitted.
[0024]
Furthermore, in the same figure (D), unit area Zi allocated in the same figure (C).₂₀₁, Zi₂₀₂, Zi₂₀₃, ..., Zi₂₀₈For each vertex of the unit area Zi, with each vertex as the origin₁Square unit area Zi of the same orientation and size as₃₀₁, Zi₃₀₂, Zi₃₀₃, ..., Zi₃₁₂(Hereafter, each of these areas is referred to as a unit area Zi._ThreeThere is. ) Is assigned. Also in this case, when all the parts of the unit area to be newly allocated overlap with the already assigned polygonal area Zi, the allocation of the unit area can be omitted. In this way, the square unit area Zi allocated last time_{(j-1) 01}, Zi_{(j-1) 02}, Zi_{(j-1) 03}The next square unit area Zi with each vertex as the origin_j01, Zi_j02, Zi_j03,... Can be repeated to enlarge the polygonal area Zi assigned to each exit Ei.
[0025]
5B to 5D, each unit region Zi_j01, Zi_j02, Zi_j03...,... Are not represented by dotted lines. Thus, each unit area Zi_jIf there is a part that does not overlap with area 2, each unit area Zi_jEach polygonal area Zi may be enlarged by repeating a cycle of assigning the area as an area only overlapping with the area 2 (in the figure, a right isosceles triangular area). FIG. 3C shows an example in which the polygonal area Zi overlapping the area 2 is enlarged.
[0026]
Step 105The farthest point detection means 27 By means of non-overlapping zone detection meansIn the plan view of the area 2, a non-overlapping area N that does not overlap any polygonal area Zi is obtained. For example, when the plan view 30 is a CAD drawing, the non-overlapping area N can be algebraically calculated from the coordinates of the area plan view and the coordinates of each polygonal area Zi. Further, when the plan view 30 is image data, the non-overlapping area N is reduced by image processing.CalculateIt is also possible. In step 106, Farthest point detection means 27 By the coordinate detection means at the time of the most reduced,It is determined whether or not the coordinate at the time of the smallest reduction of the non-overlapping area N has been detected. If the coordinate at the time of the smallest reduction cannot be detected, the process returns to step 104 to further enlarge each polygonal area Zi.
[0027]
If it is determined in step 106 that the coordinates at the time of the minimum reduction of the non-overlapping area N have been detected, the process proceeds to step 107,By the coordinate detection means at the time of the smallest reductionThe farthest evacuation point P in the area 2 is obtained from the coordinates when the non-overlapping area N is reduced most. In FIG. 3C, in step 105, the non-overlapping area N is detected as a single triangular area surrounded by two polygonal areas Z1 and Z2 and one wall (in this case, fire prevention smoke prevention shutter 4). Indicates the state that has been performed. In this case, by further enlarging each polygonal area Zi, the non-overlapping area N can be converged to one point as shown in FIG. Accordingly, when the non-overlapping area N is detected as the convergence point 16 in step 105, it is determined that the coordinate at the time of the smallest reduction has been detected in step 106, and the coordinate of the convergence point 16 is determined as the farthest evacuation point in the area 2 in step 107. P can be used.The farthest point detection means 27 As shown in FIG. 30 And each polygonal area Zi Plan view by overlapping with 30 Any polygonal region Zi Non-overlapping area N that does not overlap with the display device twenty two Each polygonal area as shown in FIG. Zi Convergence point of non-overlapping area N that shrinks according to the expansion of 16 Display device of evacuation farthest point P in evacuation safety verification area 2 or 6 as coordinates twenty two Can be displayed.
[0028]
However, the non-overlapping area N may be a line segment 17 in addition to the convergence point 16 at the time of minimum reduction. FIG. 4 shows an example in which the non-overlapping area N becomes a line segment 17 at the time of the smallest reduction. The figure shows the fire and smoke shutter 4 and the entrance 5₁,Five₂The case 2 is shown as a target area, and the area 2 has five outlets E1, E2, E3, E4, and E5. The initial area Zi of the polygonal area Zi at each of the exits E1 to E5 as shown in FIG.₀Then, when each polygonal area Zi is enlarged by increasing the predetermined movement distance D, the non-overlapping area N becomes a single pentagon as shown in FIG. When each polygonal area Zi is further enlarged, the non-overlapping area N becomes a line segment 17 as shown in FIG. In this case, when the non-overlapping area N is detected as the line segment 17 in step 105, it is determined that the coordinates at the time of the smallest reduction have been detected in step 106. In step 107, all points on the line segment 17 are within the area 2. The evacuation farthest point P can be used.
[0029]
Note that three cases shown in FIG. 6 are considered as typical cases in which the non-overlapping area N becomes the convergence point 16 at the time of the smallest reduction. FIG. 4A shows a case where the non-overlapping area N is a single square surrounded by four polygonal areas Zi. In this case, the non-overlapping area N converges to the center of gravity of the square. In this case, when the non-overlapping area N is detected as a single square as shown in FIG. 5A in step 105, it is determined in step 106 that the coordinates at the time of the smallest reduction can be detected, and the center of gravity of the square is determined in step 107. The coordinates of the point may be obtained by calculation and used as the farthest evacuation point P.
[0030]
FIG. 5B shows a case where the non-overlapping area N is a single right-angled isosceles triangle surrounded by two polygonal areas Zi and one wall. In this case, when the non-overlapping area N is detected as a single right isosceles triangle as shown in FIG. 5B in step 105, it is determined in step 106 that the coordinates at the time of the smallest reduction can be detected. The midpoint coordinates of the base of the isosceles triangle can be obtained by calculation to be the farthest evacuation point P. FIG. 6C shows a case where the non-overlapping region is a single right isosceles triangle surrounded by two orthogonal walls and one polygonal region Zi. The vertex coordinates can be calculated as the farthest evacuation point P.
[0031]
After the evacuation farthest point P is detected, in step 108,Farthest point detection means 27 By the maximum moving distance detection meansThe maximum evacuation travel distance Dmax in the target area 2 or 6 is obtained. Since the present invention obtains the coordinates at the time of the smallest reduction of the non-overlapping area N while increasing the predetermined movement distance D, the predetermined movement distance D when the coordinates at the time of the smallest reduction of the non-overlapping area N are detected is set as the maximum evacuation movement distance Dmax. can do. For example, as shown in FIG. 7A, the maximum evacuation movement distance Dmax is a grid-like longest movement route 14 extending from the evacuation farthest point P to the origin of the polygonal region Zi passing through the evacuation farthest point P._1a,14_2aIt corresponds to the distance.
[0032]
However, when the coordinates at the time of the minimum reduction of the non-overlapping area N are obtained by calculation as shown in FIG. 6, it is necessary to obtain the maximum escape distance Dmax by calculation in step 108. In this case, for example, the longest travel route 14 from the farthest evacuation point P to the origin Ei of any polygonal region Zi in contact with the non-overlapping region N of a square or a right isosceles triangle is determined. The maximum evacuation movement distance Dmax is obtained by calculating the distance. It should be noted that the longest movement route 14 can be arbitrarily combined with the movement in the X-axis direction and the movement in the Y-axis direction while avoiding useless detours, and there can be a plurality of longest movement routes 14. Therefore, when the moving obstacle 13 exists in the area 2 as shown in FIG. 7B, the longest moving route 14 avoiding the obstacle 13_1b,14_2bCan be selected.
[0033]
According to the present invention, since the farthest evacuation point P in the area can be easily and quickly obtained from the plan view of the target area 2 by a computer, the conventional troublesome trial and error is eliminated, It is possible to facilitate verification of evacuation safety of structures. Further, for example, as shown in FIG. 7B, even when the moving obstacle 13 is arranged in the target area 2, the farthest evacuation point P in the area can be accurately detected.
[0034]
Further, the present invention detects the farthest evacuation point P in the same manner not only when the room 2 in the building 1 is the target area but also when any floor 6 of the building 1 is the target area. Is possible. FIG. 7C shows an example in which the farthest evacuation point P is detected with the floor 6 including the room 2 and the hallway 11 as the target area. In this case as well, each exit Ei in the plan view of the area 6 (in the figure, the exit 7 of the direct staircase)₁, 7₂) In the polygonal area Zi₁, Zi₂Each polygonal area Zi by increasing the predetermined movement distance D₁, Zi₂The farthest evacuation point P in the area 6 can be detected from the coordinates at the time of the reduction of the non-overlapping area N when. 14 in the figure_1c,14_2cIndicates the longest travel route from the farthest evacuation point P in the area 6 to any exit Ei. If there is a moving obstacle 13 in the zone 6, avoid the moving obstacle 13 as shown in FIG._1d,14_2dCan be selected. The present invention can also be applied to a case where a space in a structure such as a tunnel is a target area.
[0035]
Thus, the object of the present invention is “the farthest evacuation point that can detect the farthest evacuation point in the area in a short time even when there is a moving obstacle.detectionProviding “program” can be achieved.
[0036]
As described above, the method for detecting the farthest evacuation point P from the minimum contraction coordinates of the non-overlapping area N when each polygonal area Zi is enlarged by increasing the predetermined moving distance D has been described. It is also possible to detect the farthest evacuation point P from the coordinates at which the non-overlapping area N appears when each polygonal area Zi is reduced.
[0037]
【Example】
FIG. 8A shows an example in the case where there is a portion (hereinafter referred to as a “wraparound portion”) that cannot be reached unless it surrounds the target area 2 or 6 when viewed from the exit Ei. Here, the “wraparound portion” refers to a portion that cannot be reached without combining movements in different directions (positive and negative directions) in the X-axis or Y-axis direction. For example, exit E1 in the figure (Direct stairs entrance 7 on floor 6)₁), The portion on the back side of the moving obstacle 13 is a wraparound portion. In addition, when the staircase 8 with the one-side exit E2 is provided in the area 6 as shown in the figure, the wall of the staircase 8 becomes a moving obstacle, so that the staircase 8 is viewed from the exit E2. The back side is the wraparound part. As shown in FIG. 8B, the target area 6 provided with the entrances E1 to E7 is the entrance 5₁~Five_FourEven when it is partitioned by the fire prevention and disaster prevention shutter 4 attached, there is a surrounding portion.
[0038]
9 and 10 show an example of a method for enlarging the polygonal region Zi when a surrounding portion exists in the detection target area 6. The method for enlarging the polygonal area Zi shown in the figure is the same as the method for enlarging the polygonal area Zi shown in FIG.₀Or unit area Zi₁, Zi₂, Zi_ThreeWhen, ... overlaps with a moving obstacle 13 in the area,ThatInitial region Zi₀Or unit area Zi₁, Zi₂, Zi_Three,... Are assigned as a polygonal area consisting of a portion of the square that does not overlap the moving obstacle 13.
[0039]
In FIG.Farthest point detection means 27 By the allocation means ofInitial distance D to exit Ei in X and Y axis directions₀Square initial region Zi with four points separated by vertices₀Is assigned ((A) in the figure). nextFarthest point detection means 27 By means of enlargement ofInitial region Zi₀A square unit region Zi having four vertices that are separated from each other by a unit distance d in the X-axis direction and the Y-axis direction.₁₀₁, Zi₁₀₂, Zi₁₀₃, Zi₁₀₄Is assigned ((B) in the figure). In this case, the unit area Zi₁₀₁Since it overlaps with the moving obstacle 13, it is assigned as a triangular area consisting of a portion of the square that does not overlap with the moving obstacle 13. Further, in FIG. 3C, the unit region Zi₁A square unit area Zi at each vertex of₂₀₁, Zi₂₀₂, Zi₂₀₃, ..., Zi₂₀₇Is assigned. In FIG. 5C, the unit region Zi₂₀₁, Zi₂₀₂Since it overlaps the moving obstacle 13, it is assigned as a triangular area. Further, in FIG. 4D, the unit region Zi₂A square unit area Zi at each vertex of₃₀₁, Zi₃₀₂, Zi₃₀₃, ..., Zi₃₀₉In this case too, the unit area Zi₃₀₁, Zi₃₀₂Since these overlap with the moving obstacle 13, those unit areas are allocated as pentagonal areas. (E) and (F) in the same figure show a state in which the polygonal area Zi is sequentially enlarged.
[0040]
Also, in FIG. 10, first in FIG.By allocation means, Square initial area Zi₀Overlaps the wall of the staircase 8 which is the moving obstacle 13, so that the initial region Zi₀Is assigned as a triangular area that does not overlap the moving obstacle 13. Then in the same figure (B)By means of enlargement, Initial area Zi₀Each square unit area Zi at the three vertices₁In this case too, the unit area Zi₁₀₁, 15₁₀₂Since it overlaps with the moving obstacle 13, it is assigned as a pentagonal region that does not overlap with the moving obstacle 13. FIGS. 3C and 3D show a state where the polygonal region Zi is sequentially enlarged in the same manner.
[0041]
By enlarging the polygonal area Zi as shown in FIGS. 9 and 10, even if there is a surrounding part in the target area 2 or 6, the evacuation farthest point P in the area is accurately detected according to the flowchart of FIG. can do. FIG. 11 shows an embodiment in which the present invention is applied to the target area 6 in FIG. As shown in FIG. 5B, even when there is a wraparound portion, the initial regions Z1 of the polygonal regions Z1 to Z7 at the exits E1 to E7 in the plan view of the section 6, respectively.₀~ Z7₀, And by enlarging each of the polygonal areas Z1 to Z7 by increasing the predetermined moving distance D, the farthest point of evacuation P can be detected from the coordinates when the non-overlapping area N is most contracted. FIG. 4D shows the longest travel route 14 from the farthest evacuation point P to the exit E6.
[0042]
Step 109 in the flowchart of FIG. 1 shows processing in the travel time calculation means 29. The travel time calculation means 29 calculates the maximum travel time τmax from the farthest evacuation point P to the exit Ei from the maximum evacuation distance Dmax in the area obtained in step 108 and the movement speed v in the area. The movement speed in areas 2 and 6 isStorage means twenty oneCan be remembered. The movement speed can be the walking speed of people when, for example, general buildings / structures are targeted, and the movement of wheelchairs and stretchers when targeted at areas within buildings such as hospitals. It can be speed. For example, when the moving speed v of every part in the areas 2 and 6 is constant, the maximum moving time τmax can be calculated by dividing the maximum evacuation moving distance Dmax by the moving speed v. In this case, the maximum travel time τmax corresponds to the time required for a room or floor evacuation in the area 2 or 6. The evacuation safety of a building can be verified by comparing the room or floor evacuation time with the smoke fall time.
[0043]
Further, when there are a plurality of sections having different moving speeds v in the target areas 2 and 6, the maximum moving time τmax can be calculated by selecting the longest moving route 14 having the longest moving time in Step 109. For example, FIG. 12 (A) shows an example of a section 2 or 6 in which a section (low speed section) 19b in which a moving speed such as a staircase or a slope is slow is partially included. In this case, the length that intersects the low-speed section 19b is calculated for each of the plurality of longest traveling routes 14 from the farthest evacuation point P of the section 2 or 6 to the exit E6, and the longest traveling route having the largest intersecting length. The maximum movement time τmax can be calculated by selecting 14b. FIG. 12B shows another example of the section 2 or 6 where the low speed section 19c is present. Also in this case, the maximum travel time τmax in such a zone 2 or 6 can be calculated by selecting the longest travel route 14c having the longest length that intersects the low speed section 19c. Therefore, the present invention can also be used for evacuation safety verification of buildings and structures where there are sections having different moving speeds v.
[0044]
【The invention's effect】
As explained above, the present inventionbyThe evacuation farthest point detection programEvacuation safety verificationPolygonal region where the sum of the movement distance | X | in the X-axis direction and the movement distance | Y | in the Y-axis direction (| X | + | Y |) is equal to or less than the predetermined movement distance D at each exit Ei in the plan view of the section Zi is assigned to obtain a non-overlapping area N that does not overlap any polygonal area Zi in the plan view, and each polygonal area Zi is determined by increasing the predetermined movement distance D.Simultaneously at the same magnificationSince the evacuation farthest point P in the area is detected from the coordinates at the time of reduction of the non-overlapping area N when enlarged, the following remarkable effect is obtained.
[0045]
(B) Since it is possible to easily detect the farthest evacuation point in a short time without troublesome trial and error, it is possible to contribute to the design of buildings and structures and facilities that consider evacuation safety verification. it can.
(B) Even when there are moving obstacles in the target area, the farthest evacuation point in the area can be accurately detected.
(C) Since the farthest evacuation point is detected while increasing the predetermined travel distance, the maximum evacuation travel distance within the area can be obtained simultaneously with the detection of the farthest point coordinates.
(D) When comparing multiple plans related to the placement of moving obstacles in the target area, the farthest evacuation point and the maximum evacuation distance of each plan can be easily grasped in a short time. Simplification can be achieved.
(E) By obtaining the moving speed in the target area, the maximum moving time from the evacuation farthest point to the exit can be calculated from the evacuation maximum moving distance and the moving speed.
[Brief description of the drawings]
FIG. 1 shows the present invention.ofIt is an example of a flowchart.
FIG. 2 shows the present invention.Thecarry outComputerIt is explanatory drawing of an example.
FIG. 3 is an explanatory diagram of an example of a farthest point detection method in a building room.
FIG. 4 is an explanatory diagram of another example of the farthest point detection method in a building room.
FIG. 5 is an explanatory diagram illustrating an example of a method for enlarging a polygonal area Zi.
FIG. 6 is an explanatory diagram of a method for detecting a coordinate at the time of the most contraction of a non-overlapping area.
FIG. 7 is an explanatory diagram of a longest travel route.
FIG. 8 is an explanatory diagram of a surrounding portion.
FIG. 9 is an explanatory diagram of an example of a method for enlarging a polygonal region Zi considering a surrounding portion.
FIG. 10 is an explanatory diagram of another example of a method for enlarging a polygonal region Zi in consideration of a surrounding portion.
FIG. 11 is an explanatory diagram of an example of a farthest point detection method on a specific floor of a building.
FIG. 12 is an explanatory diagram of a method for calculating the maximum evacuation travel time.
FIG. 13 is an example of a floor plan view and a room plan view of a building.
[Explanation of symbols]
1… Buildings and structures 2… Rooms in buildings
3 ... Room exit 4 ... Fire / smoke / shutter
5 ... Shutter entrance 6 ... Floor in the building
7 ... Direct stairs entrance 8 ... Stair room
9 ... ground 10 ... escalator room
11 ... corridor 13 ... moving obstacles
14 ... Longest travel route 15 ... Vertex
16 ... Convergence point 17 ... Line segment
19 ... Low speed compartment 20 ... Computer
twenty one…Storage means (memory)  22 ... Display device
23 ... Input device 24 ... Scanner
25 ... CAD drawing creation means 26 ... Data conversion means
27 ... Farthest point detection means 29 ... Travel time calculation means
30… area plan Ei… exit
D: Predetermined travel distance D₀... initial distance
d: Unit distance N: Non-overlapping area
P ... Evacuation farthest point Zi ... Polygonal area
Zi₀... Initial area Zi_j... Unit area

Claims (14)

Detects the farthest evacuation point of all points in the evacuation safety verification area that is surrounded by the surrounding wall and has one or more exits Ei from the point to the nearest exit Ei. Therefore, the computer stores a plane view of the orthogonal XY coordinate system of the section, an initial distance D ₀ and a unit distance d; reads the plane view from the storage means, and uses the coordinates of each exit Ei of the plan view , those the outlet Ei as the origin and moving distance of the X-axis direction | Y | | sum of X | movement distance and the Y-axis direction (| X | + | Y | ) is equal to or less than a predetermined travel distance D polygonal region allocation means Ru allocates Zi; and the plan view and each polygon region; enlarging means enlarges the predetermined moving distance D simultaneously each polygon areas Zi at the same magnification by increasing from an initial distance D ₀ by unit distance d a and any polygonal region Zi of the plan view by superimposing the Zi Display means for displaying a non-overlapping area N that does not overlap and displaying the farthest evacuation point P of the area as the most reduced point or line segment coordinate of the non-overlapping area N that shrinks in accordance with the enlargement of each polygonal area Zi recording medium recording the evacuation farthest point detecting program to function as a. The recording medium of claim 1, and vertex 4 points to those outlet Ei that are separated in the X-axis and Y-axis directions from and the origin and the origin by an initial distance D ₀ in each outlet Ei of the plan view by said allocation means vertex After allocating the initial region Zi ₀ square, the four points spaced on each vertex of the initial region Zi ₀ from the origin to our apex as the origin in the X-axis direction and the Y-axis direction by the unit distance d by the expansion means to allocate unit area Zi ₁ square further each next by assigning unit area Zi _j square polygons those apex on each vertex as the origin of the unit region Zi of square allocation previous _(j-1) and recording medium recording the evacuation farthest point detecting program to repeat the cycle to expand the region Zi. The recording medium of claim 2, wherein the allocation means and expansion means, when the initial region Zi ₀ or unit area Zi _j overlaps the moving obstacle safety verification zone evacuation, those initial area Zi ₀ or unit area Zi _j is assigned as a polygonal area consisting of portions of the square that do not overlap the obstacle, and the next square or polygon is assigned to each vertex of the square or polygonal unit area Zi _(j-1) assigned previously. recording medium recording the evacuation farthest point detecting program to repeat the cycle to expand is divided into the unit areas Zi _j prismatic polygonal region Zi. Detects the farthest evacuation point of all points in the evacuation safety verification area that is surrounded by the surrounding wall and has one or more exits Ei from the point to the nearest exit Ei. the order computer, storage means for storing a plan view of an orthogonal XY coordinate system of the zone and the initial distance D ₀ and the unit distance d; reads the plan view from said storage means, the coordinates of each outlet Ei of the plan view , those the outlet Ei as the origin and moving distance of the X-axis direction | Y | | sum of X | movement distance and the Y-axis direction (| X | + | Y | ) is equal to or less than a predetermined travel distance D polygonal region allocation means Ru allocates Zi; enlarging means enlarges the predetermined moving distance D simultaneously each polygon areas Zi at the same magnification by increasing from an initial distance D ₀ by unit distance d a; any polygon of the plan view non-overlapping area detection for calculating the non-overlapping region N that do not overlap with the region Zi Stage; and evacuation to the function as an outermost contraction during the coordinate detection means for calculating the evacuation farthest point P of the zone from the most reduced point or line segment coordinates of non-overlapping region N when enlarged each polygon region Zi top A recording medium on which a far point detection program is recorded. In the recording medium according to claim 4, vertices, four points of those outlet Ei that are separated in the X-axis and Y-axis directions from and the origin and the origin by an initial distance D ₀ in each outlet Ei of the plan view by said allocation means vertex After allocating the initial region Zi ₀ square, the four points spaced on each vertex of the initial region Zi ₀ from the origin to our apex as the origin in the X-axis direction and the Y-axis direction by the unit distance d by the expansion means to allocate unit area Zi ₁ square further each next by assigning unit area Zi _j square polygons those apex on each vertex as the origin of the unit region Zi of square allocation previous _(j-1) and A recording medium in which a farthest evacuation point detection program for repeating the cycle of enlarging the area Zi is recorded. The recording medium of claim 5, wherein the allocation means and expansion means, when the initial region Zi ₀ or unit area Zi _j overlaps the moving obstacle safety verification zone evacuation, those initial area Zi ₀ or unit area Zi _j is assigned as a polygonal area consisting of portions of the square that do not overlap the obstacle, and the next square or polygon is assigned to each vertex of the square or polygonal unit area Zi _(j-1) assigned previously. A recording medium on which a farthest evacuation point detection program for repeating a cycle of allocating a rectangular unit area Zi _j and enlarging the polygonal area Zi is recorded. In any of the recording medium of claims 4 6, in the case plan view the outer periphery of the evacuation safety verification area is rectangular, evacuation most of the initial distance D ₀ and 1/2 of the short side length of the rectangular A recording medium on which a far point detection program is recorded . In any of the recording medium of claims 4 7, wherein when the non-overlapping region detecting means is calculated by a single square surrounded the non-overlapping region N of four polygonal region Zi, when the highest reduction recording medium recording the evacuation farthest point detecting program for calculating the coordinates of the center of gravity of those said square as evacuation farthest point P by the coordinate detection means. In any of the recording medium of claims 4 7, calculated as a right-angled isosceles triangle alone the non-overlapping region detecting means is enclosed non-overlapping region N between two polygons region Zi and one wall when the recording medium recording the evacuation farthest point detecting program for calculating the coordinates of the midpoint of the base of those said isosceles triangle as evacuation farthest point P by the top reduced during the coordinate detection means. In any of the recording medium of claims 4 7, the two walls and a single right-angled isosceles triangle surrounded by the one polygonal region Zi of the non-overlapping region detecting means perpendicular to the non-overlapping region N when calculated Te, a recording medium recording the evacuation farthest point detecting program for calculating the coordinates of the vertices of those said isosceles triangle as evacuation farthest point P by the top reduced during the coordinate detection means. 11. The recording medium according to any one of claims 4 to 10 , wherein a predetermined movement distance D when a coordinate of a minimum reduction point or a line segment in the non-overlapping area N is detected is obtained as an evacuation maximum movement distance Dmax in the evacuation safety verification area. A recording medium on which an evacuation farthest point detection program provided with a maximum movement distance detection means is recorded. In the recording medium according to claim 11, maximum movement leading stores moving velocity v of the evacuation safety verification zone in the storage unit, the evacuation farthest point P based on the moving velocity v and the evacuation maximum moving distance Dmax to the exit Ei A recording medium on which is recorded a farthest evacuation point detection program provided with travel time calculation means for calculating time τmax. In any of the recording medium of claims 1 12, a plan view of one chamber of the building the plan view of the evacuation safety verification zone of said outlet Ei to a predetermined evacuation floor or ground of the building recording medium recording the chamber outlet and the evacuation farthest point detecting program leading to direct stairs. The recording medium according to any one of claims 1 to 12 , wherein the plan view of the evacuation safety verification area is a plan view of any floor in the building, and the exit Ei leads to a predetermined evacuation floor of the building or the ground. A recording medium recording a evacuation farthest point detection program as an exit of the floor to a direct staircase.

Images