A layout method, device, equipment and storage medium for dust reduction equipment

Abstract

The present application discloses a layout method, device, equipment and storage medium for dust reduction equipment, and relates to the field of electronic digital data processing. The method utilizes the characteristics that the construction site fence is specified in safety regulations, and the color of the construction site fence is generally more conspicuous and eye-catching than the surrounding environment. The above two characteristics give the present embodiment the possibility of target recognition, and define a series of continuous fences as a construction point, so that the present embodiment can be applied to construction sites with one or more construction points, and then lay dust reduction ports based on the minimum coverage circle, so that the dust reduction ports of each construction point are uniform and cover the dust at the construction point, and finally iterate the position of the pump room based on the shortest total length of the water supply pipeline to prevent the water pressure from dropping due to redundant use of the water supply pipeline.

Description

Technical Field

[0001] The present application relates to the technical field of electronic digital data processing, and in particular to a layout method, device, equipment and storage medium for dust reduction equipment. Background Art

[0002] Dust from construction sites is an important source of air pollution and one of the main causes of smog. During the construction and operation of engineering projects, in order to reduce the adverse effects of dust from construction sites, people often use construction site dust reduction spray systems to solidify dust, so as to reduce or prevent dust from spreading and polluting the environment.

[0003] Since each construction site is different in shape, size, and restrictions, and is affected by temporary site facilities, the layout of the dust suppression spray system on site often needs to be determined by the construction unit according to local conditions.

[0004] The commonly used method now is to measure the route direction on site to determine the planning scheme, and determine the layout plan through experiments, or directly install multiple spray heads on the fence of the construction site. The layout relationship between the spray systems is not considered, which leads to obstruction of equipment placement and pipelines of the spray system or unreasonable use of materials.

[0005] The layout method of the above-mentioned spray system is relatively inefficient and lacks scientificity. It is easy for the unreasonable layout of the construction site dust reduction spray system to appear at the bends of the line and in the restricted area of ​​the site. The layout plan needs to be modified during the construction process, which further increases the construction period and construction cost. Summary of the invention

[0006] The main purpose of the present application is to provide a layout method, device, equipment and storage medium for dust reduction equipment to solve the problem in the prior art that the layout between fixed fine water mist nozzles and mobile fine water mist carriers is not considered during the installation of fire sprinklers.

[0007] To achieve the above objectives, this application provides the following technical solutions:

[0008] A layout method for dust suppression equipment, the dust suppression equipment is applied to a construction site in a preset area, the dust suppression equipment comprises at least one water pump end and at least one dust suppression line, each dust suppression line is respectively connected to the water pump end, each dust suppression line has a plurality of dust suppression ports, each dust suppression port can cover a circle of a preset radius, the layout method comprises:

[0009] Step S1, generating a plane layout based on a horizontal plane;

[0010] Step S2, outputting all construction points in the construction site to the plane layout;

[0011] Step S3, obtaining the minimum covering circle of each construction point respectively;

[0012] Step S4, setting a plurality of dust suppression ports at a preset distance in each minimum coverage circle, wherein the distance between adjacent dust suppression ports is greater than one of the preset radius and less than two of the preset radius;

[0013] Step S5, performing single linear constraints on all dust reduction ports at each construction point, and forming a dust reduction line based on one construction point;

[0014] Step S6, defining a connecting port on each dust fall line;

[0015] Step S7, defining that all the communication ports are connected to the water pump end;

[0016] Step S8, defining a random point in the plane layout and iterating the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connection port reaches a minimum value;

[0017] Step S9, obtaining a random point position that matches the minimum value, wherein the random point position is the layout position of the water pump end.

[0018] As a further improvement of the present application, each construction site has a plurality of enclosures installed on its own edge. Step S2, outputting all construction points in the construction site to the plane layout, includes:

[0019] Step S21, acquiring image data of the preset area through a preset strategy;

[0020] Step S22, extracting the boundaries of all enclosures in each image data by using a boundary extraction algorithm;

[0021] Step S23, defining the boundary with a head-to-tail connection relationship as a construction point;

[0022] Step S24, obtaining the minimum covering circle of all boundaries of the current construction point;

[0023] Step S25, outputting the minimum covering circle of the current construction point to the plane layout.

[0024] As a further improvement of the present application, step S22, extracting the boundaries of all enclosures in each image data by using a boundary extraction algorithm, includes:

[0025] Step S221, obtaining all image edges of the current image data through the Canny edge detection operator;

[0026] Step S222, defining an erosion structure element of a preset pixel size;

[0027] Step S223, traversing all image edges with the center of the eroded structure element;

[0028] Step S224, deleting all paths traversed by the eroded structure element to obtain an eroded image of the current image data;

[0029] Step S225, differentiating the current image data and the eroded image of the current image data to obtain the boundaries of all objects;

[0030] Step S226, defining the enclosure as having the highest confidence, and using a target detection algorithm to detect whether the local image within the boundary of each object is an enclosure;

[0031] Step S227, obtaining the boundaries of all enclosure objects and defining them as the boundaries of all enclosures in the current image data.

[0032] As a further improvement of the present application, step S24, obtaining the minimum covering circle of all boundaries of the current construction point, includes:

[0033] Step S241, obtaining the resolution of the current image data, and defining the resolution as a grid density to divide the current image data into a plurality of grids;

[0034] Step S242, respectively obtain the pixel coordinate points of each boundary, and pack all the pixel coordinate points of the enclosures connected end to end into a coordinate data set;

[0035] Step S243, obtain any two coordinate points of the current coordinate data set and , and the line segment Get the initial circle as the diameter , where the subscript 2 represents the number of coordinate points within the initial circle;

[0036] Step S244, traverse each coordinate point of the current coordinate data set in turn, and determine the Coordinate points Is it located in the first iteration circle? , Coordinate points Not located in the first iteration circle If the value is within , then execute step S245;

[0037] Step S245, using line segment The diameter of the second iteration circle is obtained ;

[0038] Step S246, determine Coordinate points Is it located in the second iteration circle? In which , Coordinate points There is no circle located in the second iteration If the value is within , then execute step S247;

[0039] Step S247, using line segment The third iteration circle is obtained as the diameter ;

[0040] Step S248, determine Coordinate points Is it located in the third iteration circle? In which , Coordinate points Not located in the third iteration circle If the value is within , then execute step S249;

[0041] Step S249, connect , , A triangle is formed, and a circumscribed circle of the triangle is obtained, where the circumscribed circle is the minimum covering circle.

[0042] As a further improvement of the present application, the preset strategy includes one or more combinations of remote sensing interpretation, on-site mapping and measurement, drone photogrammetry, three-dimensional laser scanning, and bird's-eye view photography, and forms the same plane layout when multiple combinations are used.

[0043] As a further improvement of the present application, step S8, defining a random point in the plane layout and iterating the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connection port reaches a minimum, includes:

[0044] Step S81, defining a plurality of random solutions for the random point according to formula (1), and defining the optimization result of all random solutions as the sum of the distances from the random point to each connection port reaching the minimum value;

[0045] (1);

[0046] in, is the set of all random solutions, For each random solution, is the label of the random solution, is the number of all random solutions; is the set of velocities of all random solutions, are the speeds of each random solution respectively;

[0047] Step S82, initialize the position of each random solution, and update the current position and current speed of each random solution according to formula (2):

[0048] (2);

[0049] in, For the The random solution is The speed of the step, For the The random solution is The speed inertia of the step, is the inertia coefficient, For the The self-perception representation of a random solution, For the social cognitive representation of a random solution; and are learning factors, for A random number, For the The individual optimal solution obtained by random solutions is For the The global optimal solution obtained by random solutions is For the Step 1 A random solution, For the Step 1 A random solution;

[0050] Step S83, iterate each random solution according to formula (2) to update each and each ;

[0051] Step S84, determine each Compared with the previous iteration, whether the difference is less than or equal to the first preset adaptation threshold, if each If the difference between the values ​​in the previous iteration and the values ​​in the previous iteration are all less than or equal to the first preset adaptation threshold, step S85 is executed;

[0052] Step S85, determine each Compared with the difference of the previous iteration, whether it is less than or equal to the second preset adaptation threshold, if each If the difference between the values ​​in the previous iteration and the values ​​in the previous iteration are all less than or equal to the second preset adaptation threshold, step S86 is executed;

[0053] Step S86, determining whether the optimal solution of the random point has been obtained.

[0054] As a further improvement of the present application, in step S83, each random solution is iterated according to formula (2) to update each and each ,include:

[0055] Step S831, based on each iteration, the inertia coefficient is linearly reduced once according to formula (3):

[0056] (3);

[0057] in, For the The random solution is The inertia coefficient after step optimization, is the initial inertia coefficient, is the current iteration number, is the maximum number of iteration steps.

[0058] To achieve the above objectives, this application also provides the following technical solutions:

[0059] A layout device for dust suppression equipment, the layout device for dust suppression equipment is applied to the layout method for dust suppression equipment as described above, and the layout device for dust suppression equipment comprises:

[0060] A plane layout generation module, used for generating a plane layout based on a horizontal plane;

[0061] A construction point output module, used for outputting all construction points in the construction site to the plane layout;

[0062] A minimum covering circle acquisition module is used to obtain the minimum covering circle of each construction point;

[0063] A dust suppression port setting module, used to set a plurality of dust suppression ports at preset intervals in each minimum coverage circle, wherein the distance between adjacent dust suppression ports is greater than one of the preset radii and less than two of the preset radii;

[0064] A dust fall line generation module is used to perform single linear constraints on all dust fall openings at each construction point, and form a dust fall line based on one construction point;

[0065] A connection port definition module is used to define a connection port on each dust fall line;

[0066] A communication port connection relationship definition module, used to define that all communication ports are connected to the water pump end;

[0067] A random point definition and iteration module, used for defining a random point in the plane layout and iterating the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connection port reaches a minimum value;

[0068] The water pump end layout position definition module is used to obtain a random point position that matches the minimum value, and the random point position is the layout position of the water pump end.

[0069] To achieve the above objectives, this application also provides the following technical solutions:

[0070] An electronic device includes a processor and a memory coupled to the processor, wherein the memory stores program instructions executable by the processor; when the processor executes the program instructions stored in the memory, the layout method of the dust reduction equipment as described above is implemented.

[0071] To achieve the above objectives, this application also provides the following technical solutions:

[0072] A storage medium stores program instructions, and when the program instructions are executed by a processor, the layout method of dust reduction equipment as described above can be implemented.

[0073] The present application generates a plane layout based on a horizontal plane; outputs all construction points in the construction site to the plane layout; obtains the minimum coverage circle of each construction point; sets a number of dust reduction ports at preset intervals in each minimum coverage circle, and the distance between adjacent dust reduction ports is greater than a preset radius and less than two preset radii; performs single linear constraints on all dust reduction ports of each construction point, and forms a dust reduction line based on one construction point; defines a connecting port on each dust reduction line; defines that all connecting ports are connected to the water pump end; defines a random point in the plane layout and iterates the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connecting port reaches the minimum value; obtains the position of the random point that matches the minimum value, and the position of the random point is the layout position of the water pump end. The present application utilizes the characteristics that the construction site fence is stipulated by safety regulations, and the color of the construction site fence is generally more conspicuous and eye-catching than the surrounding environment. The above two characteristics give the present application the possibility of target recognition, and define a series of continuous fences as a construction point, so that the present application can be applied to construction sites with one or more construction points, and then lay dust reduction ports based on the minimum coverage circle, so that the dust reduction ports of each construction point are uniform and cover the dust at the construction point, and finally the position of the pump room is iterated based on the total length of the shortest water supply pipeline to prevent the water pressure from dropping due to redundant use of the water supply pipeline. BRIEF DESCRIPTION OF THE DRAWINGS

[0074] Figure 1 A schematic diagram of the steps of an embodiment of the method for laying out the dust suppression equipment of the present application;

[0075] Figure 2A schematic diagram of functional modules of an embodiment of a layout device of the dust reduction equipment of the present application;

[0076] Figure 3 This is a schematic diagram of the structure of an embodiment of the electronic device of the present application;

[0077] Figure 4 This is a schematic diagram of the structure of an embodiment of the storage medium of the present application. DETAILED DESCRIPTION

[0078] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0079] The terms "first", "second" and "third" in this application are only used for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Therefore, the features defined as "first", "second" and "third" can explicitly or implicitly include at least one of the features. In the description of this application, the meaning of "multiple" is at least two, such as two, three, etc., unless otherwise clearly and specifically defined. All directional indications (such as up, down, left, right, front, back...) in the embodiments of this application are only used to explain the relative position relationship, movement, etc. between the components under a certain specific posture (as shown in the accompanying drawings). If the specific posture changes, the directional indication also changes accordingly. In addition, the terms "including" and "having" and any of their variations are intended to cover non-exclusive inclusions. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but optionally also includes steps or units that are not listed, or optionally also includes other steps or units inherent to these processes, methods, products or devices.

[0080] Reference to "embodiments" herein means that a particular feature, structure, or characteristic described in conjunction with the embodiments may be included in at least one embodiment of the present application. The appearance of the phrase in various locations in the specification does not necessarily refer to the same embodiment, nor is it an independent or alternative embodiment that is mutually exclusive with other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0081] like Figure 1As shown, this embodiment provides an embodiment of a layout method of dust reduction equipment. In this embodiment, the dust reduction equipment is applied to a construction site in a preset area. The dust reduction equipment includes at least one water pump end and at least one dust reduction line. Each dust reduction line is respectively connected to the water pump end. Each dust reduction line has a plurality of dust reduction ports, and each dust reduction port can cover a circle of a preset radius.

[0082] It is worth noting that the dust suppression port can cover a circle of a preset radius which requires a two-dimensional presentation in the plane layout below.

[0083] Specifically, the layout method includes the following steps:

[0084] Step S1, generating a plane layout based on a horizontal plane.

[0085] Step S2: Output all construction points in the construction site to the plane layout.

[0086] Preferably, a digital elevation model of the construction site can be obtained through one or more combinations of remote sensing interpretation, on-site mapping and measurement, drone photogrammetry, three-dimensional laser scanning, and bird's-eye view photography; and then the digital elevation model can be converted into a plan view from a bird's-eye view.

[0087] Preferably, the above operations can be completed in Civil 3D, and clipping is usually required when generating a plane layout. Polygon clipping of the plane layout can be performed through the layer control center of Global Mapper.

[0088] Preferably, after polygon clipping is completed, you can directly use the Global Mapper's contour line generation function (line distance needs to be set).

[0089] Preferably, Gaussian projection can be performed on the target area by loading the CGCS2000 standard in Global Mapper and configuring the reference points.

[0090] Step S3, respectively obtain the minimum covering circle of each construction point.

[0091] Preferably, the minimum covering circle can adopt an O(N) algorithm.

[0092] Step S4: a plurality of dust suppression ports are respectively arranged at preset intervals in each minimum coverage circle, and the distance between adjacent dust suppression ports is greater than one preset radius and less than two preset radii.

[0093] Preferably, a radius of 1.5 is preferred, so that adjacent dust suppression ports overlap by 0.5 radius, further reducing or preventing dust from escaping.

[0094] Step S5, performing single linear constraints on all dust reduction openings of each construction point, and forming a dust reduction line based on one construction point.

[0095] Preferably, the single linear constraint of step S5 makes the pipeline of the dust reduction line appear only at the edge of the construction site, without affecting the construction process.

[0096] Step S6, defining a connecting port on each dust falling line respectively.

[0097] Step S7, defining that all the communication ports are connected to the water pump end.

[0098] Step S8, defining a random point in the plane layout and iterating the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connection port reaches a minimum value.

[0099] Step S9, obtaining a random point position that matches the minimum value, where the random point position is the layout position of the water pump end.

[0100] Furthermore, each construction site has a plurality of enclosures installed at its edges. Step S2 outputs all construction points in the construction site to a plane layout, including:

[0101] Step S21, acquiring image data of a preset area through a preset strategy.

[0102] Preferably, the preset strategy is also one or more combinations of the above-mentioned remote sensing interpretation, on-site mapping and measurement, drone photogrammetry, three-dimensional laser scanning, and bird's-eye view photography.

[0103] Step S22, extracting the boundaries of all enclosures in each image data using a boundary extraction algorithm.

[0104] Step S23, defining the boundary with an end-to-end connection relationship as a construction point.

[0105] Step S24, obtaining the minimum covering circle of all boundaries of the current construction point.

[0106] Step S25, outputting the minimum covering circle of the current construction point to the plane layout.

[0107] Furthermore, in step S22, the boundaries of all enclosures in each image data are extracted respectively by using a boundary extraction algorithm, including:

[0108] Step S221, obtaining all image edges of the current image data through the Canny edge detection operator.

[0109] Preferably, the first step of boundary extraction is usually edge detection. The edge is where the image brightness changes significantly, and is the dividing line between the object and the background or between different objects. The edge detection algorithm finds the edge by identifying the brightness gradient in the image. Commonly used edge detection operators include Sobel, Prewitt, Roberts and Canny.

[0110] Among them, Sobel operator, Prewitt operator, Roberts operator: The aforementioned operators detect edges by calculating the gradient amplitude of each pixel in the image, and estimate the gradient through filters in the horizontal and vertical directions. Canny edge detector: The Canny algorithm is a more complex edge detection method, which aims to capture the edges in the image as accurately as possible and minimize false detections and missed detections. The Canny detector first uses a Gaussian filter to smooth the image to reduce noise, then calculates the gradient amplitude and direction of each point in the image, then applies non-maximum suppression (NMS) to refine the edges, and finally uses a double threshold method and edge connection technology to detect and connect edges.

[0111] Step S222, defining an erosion structure element of a preset pixel size.

[0112] Preferably, the pixel size of the eroded structure element can be set according to the resolution of the image data, generally set to 3×3 pixels, and one layer of pixels can be eroded once. If the resolution is high, the preset pixel size can be selected as an odd number such as 5×5, 7×7, 9×9, etc.

[0113] Step S223, traverse all image edges with the center of the eroded structure element.

[0114] Step S224, deleting all paths traversed by the eroded structure element to obtain an eroded image of the current image data.

[0115] Step S225 , differentiating the current image data and the eroded image of the current image data to obtain the boundaries of all objects.

[0116] Step S226, defining the enclosure as having the highest confidence, and using the target detection algorithm to detect whether the local image within the boundary of each object is an enclosure.

[0117] Preferably, the target detection algorithm can be implemented by VJ, HOG, DPMDetector; deep learning Two-stageRCNN, SPPNet, FastRCNN, FasterRCNN; Trick algorithm FPN, CascadeRCNN; deep learning one-stage Yolo, X, SSD, RetinaNet; deep learning Anchor-free CornerNet, CenterNet, FCOS; TransformerDETR, etc.

[0118] Preferably, this embodiment prefers the Yolo algorithm.

[0119] Specifically, the size of the original image of the image data may be adjusted to 448×448, and then the adjusted image may be evenly divided into S×S (eg, 7×7) grids, and the size of each grid is 64×64.

[0120] Preferably, each grid is used to predict The horizontal coordinate, vertical coordinate, width, height of each detection box, and the confidence of each detection box, that is, each grid needs to predict value.

[0121] Each grid needs to be predicted indivual ;in, is the offset of the center of the detection box relative to the grid, is the width and height of the detection box relative to the above resized image, is the confidence of the grid, which takes a value of 1 or 0.

[0122] Preferably, the confidence level can be understood as whether there is a target in the current grid and the accuracy of the detection frame.

[0123] For example: suppose there is a target in a resized image, and the width and height of the resized image are but:

[0124] Divide the image into 7×7 (S×S) grids evenly, and there is a grid located at the center of the target. The coordinates of the grid are , let the coordinates of the center of the target be , the above offset can be calculated according to the following formula : .

[0125] Preferably, in actual detection, if the predicted detection box and the actual bounding box overlap perfectly, the intersection-and-union ratio is 1. In actual application, the value of the first preset threshold can generally be set to 0.5 to determine whether the predicted bounding box is correct, and the accuracy of the bounding box is positively correlated with the intersection-and-union ratio.

[0126] Preferably, the YOLO algorithm also needs to train the detection frame to improve the accuracy of target detection.

[0127] Next, the training model is trained using a preset pedestrian and vehicle training set, and the weights and biases of the training model are iteratively adjusted a first preset number of times using a back propagation algorithm to reduce the value of the loss function of the training model.

[0128] Preferably, the loss function is as follows:

[0129] .

[0130] in, For the Grid An indicator function of whether a detection box is responsible for the target, with a value of 1 or 0; , , , , Corresponding to indivual Predicted value.

[0131] It can be understood that the loss function includes the coordinate value deviation of the detection box, the confidence deviation, and the prediction probability deviation (or category deviation).

[0132] in, is the detection frame midpoint loss in the coordinate value deviation, is the loss of detection box width and height in coordinate value deviation, is the confidence deviation, is the deviation of the predicted probability (or class deviation).

[0133] in, is the positioning error penalty. Generally, ; That is the S×S grids mentioned above; is the number of bounding boxes; and For the The estimated values ​​of the horizontal and vertical coordinates of the midpoint of the bounding box; and For the An estimate of the width and height of the bounding box; For the The confidence of the bounding box; For the An estimate of the confidence of the bounding box; is the confidence prediction loss, generally ; For the The class probabilities of the bounding boxes; For the An estimate of the class probability of each bounding box; and In correspond .

[0134] It should be noted that since each grid does not necessarily contain a target, if there is no target in the grid, it will lead to The value of is 0, which makes the gradient span in the subsequent back propagation algorithm too large, so we introduce To control the loss of the predicted position of the detection box, and introduce Controls the penalty for non-existent targets within a single grid.

[0135] It should be noted that the meaning of the symbols used in the principle description of the above target detection algorithm is not interchangeable with the meaning of other symbols in the context.

[0136] Step S227, obtaining the boundaries of all enclosure objects and defining them as the boundaries of all enclosures in the current image data.

[0137] Furthermore, step S24, obtaining the minimum covering circle of all boundaries of the current construction point, includes:

[0138] Step S241 , obtaining the resolution of the current image data, and defining the resolution as grid density to divide the current image data into a plurality of grids.

[0139] Step S242, respectively obtain the pixel coordinate points of each boundary, and pack all the pixel coordinate points of the enclosures connected end to end into a coordinate data set.

[0140] Step S243, obtain any two coordinate points of the current coordinate data set and , and the line segment Get the initial circle as the diameter , where the subscript 2 represents the number of coordinate points in the initial circle.

[0141] Step S244, traverse each coordinate point of the current coordinate data set in turn, and determine the Coordinate points Is it located in the first iteration circle? , Coordinate points Not located in the first iteration circle If the value is within 100, execute step S245.

[0142] Step S245, using line segment The diameter of the second iteration circle is obtained .

[0143] Step S246, determine Coordinate points Is it located in the second iteration circle? In which , Coordinate points Not located in the second iteration circle If the value is within 100, execute step S247.

[0144] Step S247, using line segment The third iteration circle is obtained as the diameter .

[0145] Step S248, determine Coordinate points Is it located in the third iteration circle? In which , Coordinate points Not located in the third iteration circle If the value is within 100, execute step S249.

[0146] Step S249, connect , , A triangle is formed and the circumscribed circle of the triangle is obtained. The circumscribed circle is the minimum covering circle.

[0147] Further, step S8, defining a random point in the plane layout and iterating the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connection port reaches a minimum, includes:

[0148] Step S81, define several random solutions for the random point according to formula (1), and define the optimization result of all random solutions as the sum of the distances from the random point to each connection port reaching the minimum value.

[0149] (1).

[0150] in, is the set of all random solutions, For each random solution, is the label of the random solution, is the number of all random solutions; is the set of velocities of all random solutions, are the speeds of each random solution respectively.

[0151] Step S82, initialize the position of each random solution, and update the current position and current speed of each random solution according to formula (2):

[0152] (2).

[0153] in, For the The random solution is The speed of the step, For the The random solution is The speed inertia of the step, is the inertia coefficient, For the The self-perception representation of a random solution, For the social cognitive representation of a random solution; and are learning factors, for A random number, For the The individual optimal solution obtained by random solutions is For the The global optimal solution obtained by random solutions is For the Step 1 A random solution, For the Step 1 A random solution.

[0154] Preferably, The value range is , preferably ; The value range is , preferably .

[0155] Step S83, iterate each random solution according to formula (2) to update each and each .

[0156] Step S84, determine each Compared with the previous iteration, whether the difference is less than or equal to the first preset adaptation threshold, if each If the difference compared with the previous iteration is less than or equal to the first preset adaptation threshold, step S85 is executed.

[0157] Step S85, determine each Compared with the difference of the previous iteration, whether it is less than or equal to the second preset adaptation threshold, if each If the difference compared with the previous iteration is less than or equal to the second preset adaptation threshold, step S86 is executed.

[0158] Step S86, determining whether the optimal solution of the random point has been obtained.

[0159] Preferably, the values ​​of the first preset adaptation threshold and the second preset adaptation threshold need to be adjusted according to the specific problem, and generally need to be adjusted according to the calculation results. If the adaptation threshold is set too small, the algorithm may stop prematurely and fail to obtain the optimal solution; if the adaptation threshold is set too large, the algorithm may be over-iterated, wasting computing resources.

[0160] Preferably, the adaptation threshold may also be evaluated by one of the Griewank function, the Rastrigin function, the Schaffer function, the Ackley function, and the Rosenbrock function.

[0161] Further, in step S83, each random solution is iterated according to formula (2) to update each and each ,include:

[0162] Step S831, based on each iteration, the inertia coefficient is linearly reduced once according to formula (3):

[0163] (3).

[0164] in, For the The random solution is The inertia coefficient after step optimization, is the initial inertia coefficient, is the current iteration number, is the maximum number of iteration steps.

[0165] Preferably, the initial inertia coefficient is generally set to 0.5, and the maximum number of iteration steps is generally set according to actual needs, and in this embodiment can be set to 1000 times.

[0166] This embodiment generates a plane layout based on a horizontal plane; outputs all construction points in the construction site to the plane layout; obtains the minimum coverage circle of each construction point; sets a number of dust reduction ports at preset intervals in each minimum coverage circle, and the distance between adjacent dust reduction ports is greater than a preset radius and less than two preset radii; performs single linear constraints on all dust reduction ports of each construction point, and forms a dust reduction line based on one construction point; defines a connecting port on each dust reduction line; defines that all connecting ports are connected to the water pump end; defines a random point in the plane layout and iterates the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connecting port reaches the minimum value; obtains the position of the random point that matches the minimum value, and the position of the random point is the layout position of the water pump end. This embodiment utilizes the characteristics that the construction site fence is required by safety regulations, and the color of the construction site fence is generally more conspicuous and eye-catching than the surrounding environment. The above two characteristics give this embodiment the possibility of target recognition, and define a series of continuous fences as a construction point, so that this embodiment can be applied to construction sites with one or more construction points, and then lay dust reduction ports based on the minimum coverage circle, so that the dust reduction ports at each construction point are uniform and cover the dust at the construction point, and finally the position of the pump room is iterated based on the shortest total length of the water pipeline to prevent the water pressure from dropping due to redundant use of the water pipeline.

[0167] like Figure 2 As shown, this embodiment provides an embodiment of a layout device for dust reduction equipment. In this embodiment, the layout device is applied to the layout method as in the above embodiment. The layout device includes a plane layout generation module 1, a construction point output module 2, a minimum coverage circle acquisition module 3, a dust reduction port setting module 4, a dust reduction line generation module 5, a connecting port definition module 6, a connecting port connection relationship definition module 7, a random point definition and iteration module 8, and a water pump end layout position definition module 9 which are electrically connected in sequence.

[0168] Among them, the plane layout generation module 1 is used to generate a plane layout based on the horizontal plane; the construction point output module 2 is used to output all construction points in the construction site to the plane layout; the minimum coverage circle acquisition module 3 is used to obtain the minimum coverage circle of each construction point respectively; the dust reduction port setting module 4 is used to set a number of dust reduction ports at preset intervals in each minimum coverage circle, and the distance between adjacent dust reduction ports is greater than a preset radius and less than two preset radii; the dust reduction line generation module 5 is used to perform a single linear constraint on all dust reduction ports of each construction point respectively, and form a dust reduction line based on one construction point; the connecting port definition module 6 is used to define a connecting port on each dust reduction line respectively; the connecting port connection relationship definition module 7 is used to define that all connecting ports are connected to the water pump end; the random point definition and iteration module 8 is used to define a random point in the plane layout and iterate the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connecting port reaches the minimum value; the water pump end layout position definition module 9 is used to obtain the random point position that matches the minimum value, and the random point position is the layout position of the water pump end.

[0169] Furthermore, each construction site has several fences installed on their respective edges, and the construction point output module 2 includes a first construction point output submodule, a second construction point output submodule, a third construction point output submodule, a fourth construction point output submodule, and a fifth construction point output submodule that are electrically connected in sequence. The first construction point output submodule is electrically connected to the plane layout generation module 1, and the fifth construction point output submodule is electrically connected to the small coverage circle acquisition module 3.

[0170] Among them, the first construction point output submodule is used to obtain the image data of the preset area through a preset strategy; the second construction point output submodule is used to extract the boundaries of all enclosures in each image data through a boundary extraction algorithm; the third construction point output submodule is used to define the boundaries with end-to-end connection as a construction point; the fourth construction point output submodule is used to obtain the minimum covering circle of all boundaries of the current construction point; the fifth construction point output submodule is used to output the minimum covering circle of the current construction point to the plane layout.

[0171] Furthermore, the second construction point output submodule specifically includes a first construction point output unit, a second construction point output unit, a third construction point output unit, a fourth construction point output unit, a fifth construction point output unit, a sixth construction point output unit, and a seventh construction point output unit, which are electrically connected in sequence. The first construction point output unit is electrically connected to the first construction point output submodule, and the seventh construction point output unit is electrically connected to the third construction point output submodule.

[0172] Among them, the first construction point output unit is used to obtain all image edges of the current image data through the Canny edge detection operator; the second construction point output unit is used to define the erosion structure element of the preset pixel size; the third construction point output unit is used to traverse all image edges with the center of the erosion structure element; the fourth construction point output unit is used to delete all paths traversed by the erosion structure element to obtain the eroded image of the current image data; the fifth construction point output unit is used to differentiate the current image data and the eroded image of the current image data to obtain the boundaries of all objects; the sixth construction point output unit is used to define the enclosure with the highest confidence, and use the target detection algorithm to detect whether the local image within the boundary of each object is an enclosure; the seventh construction point output unit is used to obtain the boundaries of all enclosure objects and define them as the boundaries of all enclosures in the current image data.

[0173] Further, the fourth construction point output submodule specifically includes an eighth construction point output unit, a ninth construction point output unit, a tenth construction point output unit, an eleventh construction point output unit, a twelfth construction point output unit, a thirteenth construction point output unit, a fourteenth construction point output unit, a fifteenth construction point output unit, and a sixteenth construction point output unit, which are electrically connected in sequence, the eighth construction point output unit is electrically connected to the third construction point output submodule, and the sixteenth construction point output unit is electrically connected to the fifth construction point output submodule.

[0174] Among them, the eighth construction point output unit is used to obtain the resolution of the current image data, and define the resolution as the grid density to divide the current image data into several grids; the ninth construction point output unit is used to obtain the pixel coordinate points of each boundary respectively, and pack all the pixel coordinate points of the fences connected at the beginning and the end into a coordinate data set; the tenth construction point output unit is used to obtain any two coordinate points of the current coordinate data set and , and the line segment Get the initial circle as the diameter , where the subscript 2 indicates the number of coordinate points in the initial circle; the eleventh construction point output unit is used to traverse each coordinate point of the current coordinate data set in turn, and determine the Coordinate points Is it located in the first iteration circle? ; The twelfth construction point output unit is used to output line segments The diameter of the second iteration circle is obtained ; The thirteenth construction point output unit is used if the Coordinate points Not located in the first iteration circle If Coordinate points Is it located in the second iteration circle? In which ; The fourteenth construction point output unit is used if the Coordinate points Not located in the second iteration circle Inside, the line segment The third iteration circle is obtained as the diameter ; The fifteenth construction point output unit is used to determine the Coordinate points Is it located in the third iteration circle? In which ; The sixteenth construction point output unit is used if the Coordinate points Not located in the third iteration circle If inside, connect , , A triangle is formed and the circumscribed circle of the triangle is obtained. The circumscribed circle is the minimum covering circle.

[0175] Furthermore, the random point definition and iteration module 8 specifically includes a first random point definition and iteration submodule, a second random point definition and iteration submodule, a third random point definition and iteration submodule, a fourth random point definition and iteration submodule, a fifth random point definition and iteration submodule, and a sixth random point definition and iteration submodule, which are electrically connected in sequence; the first random point definition and iteration submodule is electrically connected to the connecting port connection relationship definition module 7, and the sixth random point definition and iteration submodule is electrically connected to the water pump end layout position definition module 9.

[0176] The first random point definition and iteration submodule is used to define several random solutions for the random points according to formula (1), and defines the optimization result of all random solutions as the sum of the distances from the random points to each connected port reaching the minimum value.

[0177] (1).

[0178] in, is the set of all random solutions, For each random solution, is the label of the random solution, is the number of all random solutions; is the set of velocities of all random solutions, are the speeds of each random solution respectively.

[0179] The second random point definition and iteration submodule is used to initialize the position of each random solution and update the current position and current velocity of each random solution according to formula (2):

[0180] (2).

[0181] in, For the The random solution is The speed of the step, For the The random solution is The speed inertia of the step, is the inertia coefficient, For the The self-perception representation of a random solution, For the social cognitive representation of a random solution; and are learning factors, for A random number, For the The individual optimal solution obtained by random solutions is For the The global optimal solution obtained by random solutions is For the Step 1 A random solution, For the Step 1 A random solution.

[0182] The third random point definition and iteration submodule is used to iterate each random solution according to formula (2) to update each and each .

[0183] The fourth random point definition and iteration submodule is used to determine each Whether the difference compared with the previous iteration is less than or equal to the first preset adaptation threshold.

[0184] The fifth random point definition and iteration submodule is used if each Compared with the difference of the previous iteration, if the difference is less than or equal to the first preset adaptation threshold, then each Whether the difference compared with the previous iteration is less than or equal to the second preset adaptation threshold.

[0185] The sixth random point definition and iteration submodule is used if each If the difference compared to the previous iteration is less than or equal to the second preset adaptation threshold, it is determined that the optimal solution of the random point has been obtained.

[0186] Furthermore, the third random point definition and iteration submodule is specifically used to linearly decrease the inertia coefficient once according to formula (3) based on each iteration step:

[0187] (3).

[0188] in, For the The random solution is The inertia coefficient after step optimization, is the initial inertia coefficient, is the current iteration number, is the maximum number of iteration steps.

[0189] It should be noted that this embodiment is a functional module item embodiment based on the above-mentioned method embodiment. For additional contents such as the preference, expansion, and example illustration of this embodiment, please refer to the above-mentioned method embodiment, and this embodiment will not be repeated here.

[0190] This embodiment generates a plane layout based on a horizontal plane; outputs all construction points in the construction site to the plane layout; obtains the minimum coverage circle of each construction point; sets a number of dust reduction ports at preset intervals in each minimum coverage circle, and the distance between adjacent dust reduction ports is greater than a preset radius and less than two preset radii; performs single linear constraints on all dust reduction ports of each construction point, and forms a dust reduction line based on one construction point; defines a connecting port on each dust reduction line; defines that all connecting ports are connected to the water pump end; defines a random point in the plane layout and iterates the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connecting port reaches the minimum value; obtains the position of the random point that matches the minimum value, and the position of the random point is the layout position of the water pump end. This embodiment utilizes the characteristics that the construction site fence is required by safety regulations, and the color of the construction site fence is generally more conspicuous and eye-catching than the surrounding environment. The above two characteristics give this embodiment the possibility of target recognition, and define a series of continuous fences as a construction point, so that this embodiment can be applied to construction sites with one or more construction points, and then lay dust reduction ports based on the minimum coverage circle, so that the dust reduction ports at each construction point are uniform and cover the dust at the construction point, and finally the position of the pump room is iterated based on the shortest total length of the water pipeline to prevent the water pressure from dropping due to redundant use of the water pipeline.

[0191] Figure 3 Schematic diagram of the structure of an electronic device according to an embodiment of the present application. Figure 3 As shown, the electronic device 10 includes a processor 101 and a memory 102 coupled to the processor 101 .

[0192] The memory 102 stores program instructions for implementing the layout method of the dust reduction equipment in any of the above embodiments.

[0193] The processor 101 is used to execute program instructions stored in the memory 102 to arrange the layout of the dust reduction equipment.

[0194] The processor 101 may also be referred to as a CPU (Central Processing Unit). The processor 101 may be an integrated circuit chip having a signal processing capability. The processor 101 may also be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0195] Further, Figure 4 This is a schematic diagram of the structure of a storage medium according to an embodiment of the present application. Figure 4 The storage medium 11 of the embodiment of the present application stores program instructions 111 that can implement the layout method of all the dust reduction devices mentioned above, wherein the program instructions 111 can be stored in the above storage medium in the form of a software product, including several instructions for enabling a computer device (which can be a personal computer, server, or network device, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes: various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, or terminal devices such as a computer, a server, a mobile phone, and a tablet.

[0196] In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic. For example, the division of units is only a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0197] In addition, each functional unit in each embodiment of the present application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The above integrated unit can be implemented in the form of hardware or in the form of software functional units. The above is only an implementation method of the present application, and does not limit the patent scope of the present application. Any equivalent structure or equivalent process transformation made using the contents of the specification and drawings of this application, or directly or indirectly used in other related technical fields, is also included in the patent protection scope of the present application.

Claims

1. A method for laying out dust suppression equipment, wherein the dust suppression equipment is applied to a construction site in a preset area, the dust suppression equipment comprises at least one water pump end and at least one dust suppression line, each dust suppression line is respectively connected to the water pump end, each dust suppression line has a plurality of dust suppression ports, each dust suppression port can cover a circle of a preset radius, characterized in that: The layout method comprises: Step S1, generating a plane layout based on a horizontal plane; Step S2, outputting all construction points in the construction site to the plane layout; Step S3, obtaining the minimum covering circle of each construction point respectively; Step S4, setting a plurality of dust suppression ports at a preset distance in each minimum coverage circle, wherein the distance between adjacent dust suppression ports is greater than one of the preset radius and less than two of the preset radius; Step S5, performing single linear constraints on all dust reduction ports at each construction point, and forming a dust reduction line based on one construction point; Step S6, defining a connecting port on each dust fall line; Step S7, defining that all the communication ports are connected to the water pump end; Step S8, defining a random point in the plane layout and iterating the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connection port reaches a minimum value; Step S9, obtaining a random point position that matches the minimum value, wherein the random point position is the layout position of the water pump end; Step S2, outputting all construction points in the construction site to the plane layout, including: Step S21, acquiring image data of the preset area through a preset strategy; Step S22, extracting the boundaries of all enclosures in each image data by using a boundary extraction algorithm; Step S23, defining the boundary with a head-to-tail connection relationship as a construction point; Step S24, obtaining the minimum covering circle of all boundaries of the current construction point; Step S25, outputting the minimum covering circle of the current construction point to the plane layout.

2. The layout method according to claim 1, characterized in that: Step S22, extracting the boundaries of all enclosures in each image data by using a boundary extraction algorithm, including: Step S221, obtaining all image edges of the current image data through the Canny edge detection operator; Step S222, defining an erosion structure element of a preset pixel size; Step S223, traversing all image edges with the center of the eroded structure element; Step S224, deleting all paths traversed by the eroded structure element to obtain an eroded image of the current image data; Step S225, differentiating the current image data and the eroded image of the current image data to obtain the boundaries of all objects; Step S226, defining the enclosure as having the highest confidence, and using a target detection algorithm to detect whether the local image within the boundary of each object is an enclosure; Step S227, obtaining the boundaries of all enclosure objects and defining them as the boundaries of all enclosures in the current image data.

3. The layout method according to claim 1, characterized in that: Step S24, obtaining the minimum covering circle of all boundaries of the current construction point, including: Step S241, obtaining the resolution of the current image data, and defining the resolution as a grid density to divide the current image data into a plurality of grids; Step S242, respectively obtain the pixel coordinate points of each boundary, and pack all the pixel coordinate points of the enclosures connected end to end into a coordinate data set; Step S243, obtain any two coordinate points of the current coordinate data set and , and the line segment Get the initial circle as the diameter , where the subscript 2 represents the number of coordinate points within the initial circle; Step S244, traverse each coordinate point of the current coordinate data set in turn, and determine the Coordinate points Is it located in the first iteration circle? , Coordinate points Not located in the first iteration circle If the value is within , then execute step S245; Step S245, using line segment The diameter of the second iteration circle is obtained ; Step S246, determine Coordinate points Is it located in the second iteration circle? In which , Coordinate points There is no circle located in the second iteration If the value is within , then execute step S247; Step S247, using line segment The third iteration circle is obtained as the diameter ; Step S248, determine Coordinate points Is it located in the third iteration circle? In which , Coordinate points Not located in the third iteration circle If the value is within , then execute step S249; Step S249, connect , , A triangle is formed, and a circumscribed circle of the triangle is obtained, where the circumscribed circle is the minimum covering circle.

4. The layout method according to claim 1, characterized in that: The preset strategy includes one or more combinations of remote sensing interpretation, on-site mapping and measurement, drone photogrammetry, three-dimensional laser scanning, and bird's-eye view photography, and forms the same plane layout when multiple combinations are used.

5. The layout method according to claim 1, characterized in that: Step S8, defining a random point in the plane layout and iterating the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connection port reaches a minimum, includes: Step S81, defining a plurality of random solutions for the random point according to formula (1), and defining the optimization result of all random solutions as the sum of the distances from the random point to each connection port reaching the minimum value; （1）； in, is the set of all random solutions, For each random solution, is the label of the random solution, is the number of all random solutions; is the set of velocities of all random solutions, are the speeds of each random solution respectively; Step S82, initialize the position of each random solution, and update the current position and current speed of each random solution according to formula (2): （2）； in, For the The random solution is The speed of the step, For the The random solution is The speed inertia of the step, is the inertia coefficient, For the The self-perception representation of a random solution, For the social cognitive representation of a random solution; and are learning factors, for A random number, For the The individual optimal solution obtained by random solutions is For the The global optimal solution obtained by random solutions is For the Step 1 A random solution, For the Step 1 A random solution; Step S83, iterate each random solution according to formula (2) to update each and each ; Step S84, determine each Compared with the previous iteration, whether the difference is less than or equal to the first preset adaptation threshold, if each If the difference between the values ​​in the previous iteration and the values ​​in the previous iteration are all less than or equal to the first preset adaptation threshold, step S85 is executed; Step S85, determine each Compared with the difference of the previous iteration, whether it is less than or equal to the second preset adaptation threshold, if each If the difference between the values ​​in the previous iteration and the values ​​in the previous iteration are all less than or equal to the second preset adaptation threshold, step S86 is executed; Step S86, determining whether the optimal solution of the random point has been obtained.

6. The layout method according to claim 5, characterized in that: Step S83, iterate each random solution according to formula (2) to update each and each ,include: Step S831, based on each iteration, the inertia coefficient is linearly reduced once according to formula (3): （3）； in, For the The random solution is The inertia coefficient after step optimization, is the initial inertia coefficient, is the current iteration number, is the maximum number of iteration steps.

7. A layout device for dust suppression equipment, the layout device for dust suppression equipment being applied to the layout method for dust suppression equipment according to any one of claims 1 to 6, characterized in that: The layout device of the dust reduction equipment comprises: A plane layout generation module, used for generating a plane layout based on a horizontal plane; A construction point output module, used for outputting all construction points in the construction site to the plane layout; A minimum covering circle acquisition module is used to obtain the minimum covering circle of each construction point; A dust suppression port setting module, used to set a plurality of dust suppression ports at preset intervals in each minimum coverage circle, wherein the distance between adjacent dust suppression ports is greater than one of the preset radii and less than two of the preset radii; A dust fall line generation module is used to perform single linear constraints on all dust fall openings at each construction point, and form a dust fall line based on one construction point; A connection port definition module is used to define a connection port on each dust fall line; A communication port connection relationship definition module, used to define that all communication ports are connected to the water pump end; A random point definition and iteration module, used for defining a random point in the plane layout and iterating the position of the random point through a global optimization algorithm so that the sum of the distances from the random point to each connection port reaches a minimum value; A water pump end layout position definition module, used for obtaining a random point position matching the minimum value, wherein the random point position is the layout position of the water pump end; The construction point output module includes a first construction point output submodule, a second construction point output submodule, a third construction point output submodule, a fourth construction point output submodule, and a fifth construction point output submodule which are electrically connected in sequence, the first construction point output submodule is electrically connected to the plane layout generation module, and the fifth construction point output submodule is electrically connected to the small coverage circle acquisition module; Among them, the first construction point output submodule is used to obtain the image data of the preset area through a preset strategy; the second construction point output submodule is used to extract the boundaries of all enclosures in each image data through a boundary extraction algorithm; the third construction point output submodule is used to define the boundaries with end-to-end connection as a construction point; the fourth construction point output submodule is used to obtain the minimum covering circle of all boundaries of the current construction point; the fifth construction point output submodule is used to output the minimum covering circle of the current construction point to the plane layout.

8. An electronic device, characterized in that: It includes a processor and a memory coupled to the processor, wherein the memory stores program instructions that can be executed by the processor; when the processor executes the program instructions stored in the memory, the layout method of the dust reduction equipment as described in any one of claims 1 to 6 is implemented.

9. A storage medium, characterized in that: The storage medium stores program instructions, and when the program instructions are executed by the processor, the layout method of the dust reduction equipment according to any one of claims 1 to 6 can be implemented.

Images