An automatic method for laying out smoke fire detectors in a substation and converter station

Abstract

The application relates to the technical field of building safety design, and discloses an automatic layout method of smoke fire detectors for transformer stations and converter stations, which comprises the following steps: dividing a room plane space into n spaces; selecting the i-th divided space for further division, and initializing i=1; classifying each subspace; constructing a plurality of polygons from the classified subspaces; forming straight lines and perpendicular lines in the polygons; judging whether the intersection of the straight lines and the perpendicular lines meets the set requirements; if not, moving the intersection to form a new point meeting the requirements; if yes, judging whether the intersection meets the set requirements; if yes, setting a smoke fire detector at the intersection; if not, recalculating; judging whether all the polygons are set; if not, recalculating; if yes, judging whether i is equal to n; if yes, ending the process; if not, setting i=i+1 and recalculating; and the application has the advantages of high design efficiency and reasonable layout.

Description

Technical Field

[0001] This invention relates to an automatic deployment method for smoke detectors in substations and converter stations, belonging to the technical field of building safety design. Background Technology

[0002] Smoke detectors are a common type of automatic fire detection sensor in substations and converter stations. Currently, in the engineering design phase, the placement of smoke detectors usually relies on manually drawing CAD drawings. Designers need to manually place the detectors according to their detection performance and the requirements of relevant national standards and specifications for fire alarms.

[0003] Currently, Chinese patent application publication number CN113962000A discloses a method for dynamically arranging smoke detectors in CAD drawings, including a dynamic arrangement method and a component analysis module. The specific operation steps for dynamically arranging smoke detectors in CAD drawings are as follows: S1, obtain the dwg file of the building base drawing to be drawn; S2, obtain the relevant floor information and the most basic element information of the constituent components in the drawing through CAD parsing services. This invention uses a deep neural network model to solve the problem of accurate identification of components and spaces in CAD architectural design drawings, reducing the excessive reliance on layers for component identification; based on the identified components and spaces, it solves the problem of smoke detector component placement in electrical design; relying on the precise calculation of the computer, it can ensure that the placement of components fully complies with the design specifications, and compared with manual design and drawing, it saves labor and time costs to the greatest extent.

[0004] However, during the layout process, the interior space of the building was not appropriately divided and classified. When arranging the installation positions of smoke detectors, if the calculated installation positions of the detectors were not suitable for installation, no corresponding adjustment methods were provided. They were simply marked as not suitable for installation, and subsequent manual recalculation was required. This resulted in problems of low design efficiency and unreasonable layout. Summary of the Invention

[0005] To address the aforementioned problems in existing technologies, this invention provides an automatic deployment method for smoke detectors in substations and converter stations.

[0006] The technical solution of the present invention is as follows:

[0007] An automatic deployment method for smoke detectors in substations and converter stations includes the following steps:

[0008] Step A1: Divide the room into planar spaces, creating X1, X2, X3, ..., X... n space;

[0009] Step A2: Select one of the partitioned spaces X i For space X i Further partition the space to create multiple subspaces and initialize i = 1;

[0010] Step A3: Calculate space X i The area of ​​each subspace is determined, and all subspaces are classified according to their area.

[0011] Step A4: Construct multiple polygons from the categorized subspaces;

[0012] Step A5: Calculate the straight-line distances between the vertices of the polygon, and select the two points with the longest relative straight-line distances as D1 and D2. Connect D1 and D2 with a straight line L. D1D2 At the same time, draw the straight line L. D1D2 perpendicular line L ⊥ ;

[0013] Step A6: Determine the line L D1D2 perpendicular to line L ⊥ If the intersection point O is inside the polygon and satisfies that the perpendicular distance from the edge of the polygon and the edge of the beam is ≥0.5m, then proceed to step A7; if yes, proceed to step A8.

[0014] Step A7: Extend the intersection point O along the perpendicular line L ⊥ Move the new point O' inside the polygon and ensure that the distance from the new point O' to the edge of the polygon and the beam is ≥0.5m.

[0015] Step A8: Calculate whether the distance from a point (O or O') within the polygon to the two vertices D1 and D2 is less than the protection radius R of the smoke detector. If yes, proceed to step A9; otherwise, use a perpendicular line L... ⊥ Using the edge as the boundary, divide the original polygon into two new polygons and proceed to step A5;

[0016] Step A9: Place a smoke detector at point (O or O') inside the polygon;

[0017] Step A10: Determine whether all the constructed polygons have been set up. If yes, proceed to step A11; otherwise, proceed to step A5.

[0018] Step A11: Determine if i is equal to n. If yes, end the process. If no, set i = i + 1 and proceed to step A2.

[0019] Furthermore, the method for dividing the room into planar spaces in step A1 includes: dividing the planar space into X1, X2, X3, ..., X... with the wall or beam height exceeding the ceiling by 600mm as the boundary.n Space, where n is the total number of spaces in the final partition.

[0020] Furthermore, in step A2, the space X... i Further division methods include: using a beam height exceeding the ceiling by 200mm as a boundary, dividing the space X... i Further subdivision is needed.

[0021] Furthermore, the method for classifying all subspaces in step A3 includes:

[0022] Choose an area S > 48m² 2 The subspaces are numbered sequentially as X i-1m , where m = 1, 2, ... and other natural numbers;

[0023] Choose an area of ​​32m² 2 <S≤48m 2 The subspaces are numbered sequentially as X i-2m , where m = 1, 2, ... and other natural numbers;

[0024] Choose an area of ​​24m² 2 <S≤32m 2 The subspaces are numbered sequentially as X i-3m , where m = 1, 2, ... and other natural numbers;

[0025] Choose an area of ​​16m² 2 <S≤24m 2 The subspaces are numbered sequentially as X i-4m , where m = 1, 2, ... and other natural numbers;

[0026] Choose an area S≤16m² 2 The subspaces are numbered sequentially as X i-5m , where m = 1, 2, ... and other natural numbers.

[0027] Furthermore, the method for constructing the polygon in step A4 includes:

[0028] Each subspace X i-1m Consider it as a polygon;

[0029] Every 2 adjacent subspaces X i-2m Consider it as a polygon;

[0030] Every 3 adjacent subspaces X i-3m Consider it as a polygon;

[0031] Every 4 adjacent subspaces X i-4m Consider it as a polygon;

[0032] Every 5 adjacent subspaces Xi-5m It is considered as a polygon.

[0033] Secondly, the present invention provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the aforementioned method for automatic placement of smoke detectors in substations and converter stations.

[0034] Thirdly, the present invention provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the aforementioned method for automatically deploying smoke detectors in substations and converter stations.

[0035] The present invention has the following beneficial effects:

[0036] 1. This invention proposes an automatic placement method for smoke detectors in substations and converter stations. By rationally dividing the space, the method can rationally place the smoke detectors within the divided space. When the installation location cannot be determined at the initial assessment, the installation location can be further determined by further dividing the space into polygons, eliminating the need for subsequent manual recalculation. Compared with the prior art, this method has the advantages of high design efficiency and rational layout.

[0037] 2. This invention automatically completes the calculation of many required parameters by means of a computer program, which can avoid errors that may occur during manual design, and has the advantages of high design efficiency and high accuracy.

[0038] 3. This invention ensures that no design process is overlooked by embedding important parameters into the program, guarantees no blind spots in fire detection of the space, and improves safety.

[0039] 4. The placement method of the smoke detectors set in this invention not only meets the requirements of the specifications and actual protection needs, but also avoids the problems of resource waste, system complexity and large maintenance workload caused by setting too many smoke detectors. It can be well applied in actual design. Attached Figure Description

[0040] Figure 1 This is a schematic diagram of the process of the present invention. Detailed Implementation

[0041] The present invention will now be described in detail with reference to the accompanying drawings and specific embodiments.

[0042] Example 1: Please refer to Figure 1 This embodiment provides an automatic deployment method for smoke detectors in substations and converter stations, including the following steps:

[0043] Step 1: Conduct detailed measurements of the room to obtain its specific dimensions and shape. Then, divide the room into planar spaces. According to Clause 6.2.3 and Appendix G of GB50116-2013 "Code for Design of Automatic Fire Alarm Systems," the planar space is divided into X1, X2, X3, ..., X..., based on the boundary where the wall or beam height exceeds the ceiling by 600mm. n Space, where n is the total number of spaces in the final partition;

[0044] Step 2: Select one of the partitioned spaces X i According to Clause 6.2.3 and Appendix G of GB50116-2013 "Code for Design of Automatic Fire Alarm Systems", the boundary for space X is defined as the beam height exceeding the ceiling by 200mm. i Further divide the space into multiple subspaces of the corresponding number, and initialize i = 1;

[0045] Step 3: Calculate space X i The area of ​​each subspace is determined, and all subspaces are classified according to their area.

[0046] The specific classification methods include: according to Article 6.2.3 and Appendix G of GB50116-2013 "Code for Design of Automatic Fire Alarm Systems";

[0047] Choose an area S > 48m² 2 The subspaces are numbered sequentially as X i-1m , where m = 1, 2, ... and other natural numbers;

[0048] Choose an area of ​​32m² 2 <S≤48m 2 The subspaces are numbered sequentially as X i-2m , where m = 1, 2, ... and other natural numbers;

[0049] Choose an area of ​​24m² 2 <S≤32m 2 The subspaces are numbered sequentially as X i-3m , where m = 1, 2, ... and other natural numbers;

[0050] Choose an area of ​​16m² 2 <S≤24m 2 The subspaces are numbered sequentially as X i-4m , where m = 1, 2, ... and other natural numbers;

[0051] Choose an area S≤16m² 2 The subspaces are numbered sequentially as X i-5m Where m = 1, 2, ... and other natural numbers

[0052] Step 4: Construct multiple polygons from the categorized subspaces;

[0053] Specific construction methods include:

[0054] Each subspace X i-1m Consider it as a polygon;

[0055] Every 2 adjacent subspaces X i-2m Consider it as a polygon;

[0056] Every 3 adjacent subspaces X i-3m Consider it as a polygon;

[0057] Every 4 adjacent subspaces X i-4m Consider it as a polygon;

[0058] Every 5 adjacent subspaces X i-5m It is considered as a polygon.

[0059] Step 5: Calculate the straight-line distances between the vertices of the constructed polygon, and select the two points with the longest relative straight-line distances as D1 and D2. Connect D1 and D2 with a straight line L. D1D2 At the same time, draw the straight line L. D1D2 perpendicular line L ⊥ ;

[0060] Step 6: Determine the line L D1D2 perpendicular to line L ⊥ If the intersection point O is inside the polygon and satisfies the condition that the perpendicular distance from the edge of the polygon and the edge of the beam is ≥0.5m, then proceed to step seven; if yes, proceed to step eight. The requirement for the perpendicular distance from the edge is also determined according to Article 6.2.3 and Appendix G of GB50116-2013 "Code for Design of Automatic Fire Alarm System".

[0061] Step 7: Extend the perpendicular line L from the intersection point O. ⊥ Move the new point O' inside the polygon and ensure that the distance from the new point O' to the edge of the polygon and the beam is ≥0.5m.

[0062] Step 8: Calculate whether the distance from a point (O or O') within the polygon to the two vertices D1 and D2 is less than the protection radius R of the smoke detector. If yes, proceed to step 9; otherwise, use a perpendicular line L... ⊥ Using the edges as the basis, divide the original polygon into two new polygons, and return to step 5 to recalculate;

[0063] Step 9: Place a smoke detector at point (O or O') inside the polygon;

[0064] Step 10: Determine if all constructed polygons have been set up. If yes, proceed to Step 11; otherwise, return to Step 5 for recalculation.

[0065] Step 11: Determine if i equals n. If yes, end the process. If no, set i = i + 1 and return to step 2 to recalculate.

[0066] Example 2: This example provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor. When the processor executes the computer program, it can implement the automatic placement method for smoke detectors in substations and converter stations provided in Example 1.

[0067] Example 3: This example provides a computer-readable storage medium storing a computer program that, when executed by a processor, can implement the automatic placement method for smoke detectors in substations and converter stations provided in Example 1.

[0068] The above description is merely an embodiment of the present invention and does not limit the patent scope of the present invention. Any equivalent structural or procedural transformations made based on the content of the present invention's specification and drawings, or direct or indirect applications in other related technical fields, are similarly included within the patent protection scope of the present invention.

Claims

1. An automatic deployment method for smoke detectors in substations and converter stations, characterized in that: Includes the following steps: Step A1: Divide the room into planar spaces, creating X1, X2, X3, ..., X... n space; Step A2: Select one of the partitioned spaces X i For space X i Further divide the space into multiple subspaces and initialize i=1; Step A3: Calculate space X i The area of ​​each subspace is determined, and all subspaces are classified according to their area. Step A4: Construct multiple polygons from the categorized subspaces; Step A5: Calculate the straight-line distances between the vertices of the polygon, and select the two points with the longest relative straight-line distances as D1 and D2. Connect D1 and D2 with a straight line L. D1D2 At the same time, draw the straight line L. D1D2 The perpendicular line L⊥; Step A6: Determine the line L D1D2 If the intersection point O with the perpendicular line L⊥ is inside the polygon and satisfies that the perpendicular distance from the edge of the polygon and the edge of the beam is ≥0.5m, then proceed to step A7; if yes, proceed to step A8. Step A7: Move the intersection point O along the perpendicular line L⊥ inside the polygon, and ensure that the distance from the new point O' to the edge of the polygon and the beam is ≥0.5m; Step A8: Calculate whether the distance from point O or O' inside the polygon to the two vertices D1 and D2 is less than the protection radius R of the smoke detector. If yes, proceed to step A9. If no, divide the original polygon into two new polygons with the perpendicular line L⊥ as the side, and proceed to step A5. Step A9: Place a smoke detector at point O or O' inside the polygon; Step A10: Determine whether all the constructed polygons have been set up. If yes, proceed to step A11; otherwise, proceed to step A5. Step A11: Determine if i is equal to n. If yes, end the process. If no, set i = i + 1 and proceed to step A2. in, The method for dividing the room into planar spaces in step A1 includes: dividing the planar space into X1, X2, X3, ..., X... using the wall or beam height exceeding the ceiling by 600mm as the boundary. n Space, where n is the total number of spaces in the final partition; In step A2, space X is... i Further division methods include: using a beam height exceeding the ceiling by 200mm as a boundary, dividing the space X... i Further division; The method for classifying all subspaces in step A3 includes: Choose an area S > 48m² 2 The subspaces are numbered sequentially as X i-1m Where m = 1, 2, ... natural numbers; Choose an area of ​​32m² 2 <S≤48m 2 The subspaces are numbered sequentially as X i-2m Where m = 1, 2, ... natural numbers; Choose an area of ​​24m² 2 <S≤32m 2 The subspaces are numbered sequentially as X i-3m Where m = 1, 2, ... natural numbers; Choose an area of ​​16m² 2 <S≤24m 2 The subspaces are numbered sequentially as X i-4m Where m = 1, 2, ... natural numbers; Choose an area S≤16m² 2 The subspaces are numbered sequentially as X i-5m Where m = 1, 2, ... natural numbers; The method for constructing the polygon in step A4 includes: Each subspace X i-1m Consider it as a polygon; Every 2 adjacent subspaces X i-2m Consider it as a polygon; Every 3 adjacent subspaces X i-3m Consider it as a polygon; Every 4 adjacent subspaces X i-4m Consider it as a polygon; Every 5 adjacent subspaces X i-5m It is considered as a polygon.

2. An electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that: When the processor executes the program, it implements the automatic placement method for smoke detectors in substations and converter stations as described in claim 1.

3. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by the processor, it implements the automatic placement method for smoke detectors in substations and converter stations as described in claim 1.

Images