Safety emergency scheduling optimization method based on geographic information platform

Abstract

The invention relates to the technical field of safety emergency scheduling, in particular to a safety emergency scheduling optimization method based on a geographic information platform, which comprises the following steps: acquiring a contour map space of a disaster area; determining the rescue route difficulty from each rescue coordinate to each to-be-rescued coordinate in the contour map space; obtaining a first attribution degree of each difficult to-be-rescued point in an initial rescue jurisdiction of each rescue coordinate in the contour map space to the rescue coordinate and a second attribution degree of each difficult to-be-rescued point to the adjacent rescue coordinate; determining a final treatment area of each rescue coordinate in the contour map space according to the attribution degree; acquiring the priority of each rescue path in the final rescue jurisdiction of each rescue coordinate in the contour map space; and carrying out rescue work on the final rescue jurisdiction according to the priority of the rescue path. According to the invention, the influence of the rescue jurisdiction and the unbalanced path configuration in the jurisdiction is reduced, and the efficiency of safety emergency scheduling is improved.

Description

Technical Field

[0001] The present invention relates to the technical field of safety emergency dispatch, and in particular to a safety emergency dispatch optimization method based on a geographic information platform. Background Art

[0002] The geographic information platform is a product of the integration of multiple technologies. When studying safety emergency dispatch, it is mainly based on the positioning service of mobile terminals, so as to use GIS functions such as spatial information analysis to dispatch emergency rescue forces and obtain real-time emergency plans. The emergency plan is to improve the emergency rescue capabilities of accidents. It is a scientific and effective plan and arrangement made in advance for the relevant procedures of emergency rescue work after the accident. The emergency plan is a normative guiding document for the entire rescue work. It clarifies how to carry out various tasks before and after the accident, and ensures the smooth progress of emergency rescue work.

[0003] In the existing safety emergency dispatch, safety emergency dispatch is only achieved by analyzing the difficulty of the rescue path to carry out emergency rescue work. However, the coordinates of emergency rescue personnel may be farther away than those of other rescue personnel, and it takes more time to arrive. The rescue jurisdiction and path configuration are unbalanced, and the safety emergency dispatch efficiency is low. At the same time, specific geographic information cannot be directly integrated into the emergency plan, and the information of emergency rescue personnel cannot be combined with the disaster situation. There is still room for optimization of the safety emergency dispatch response mechanism. Summary of the invention

[0004] In order to solve the above problems, the present invention provides a safety emergency dispatch optimization method based on a geographic information platform.

[0005] The security emergency dispatch optimization method based on the geographic information platform of the present invention adopts the following technical solutions:

[0006] An embodiment of the present invention provides a security emergency dispatch optimization method based on a geographic information platform, the method comprising the following steps:

[0007] Obtaining the contour map space of the disaster-stricken area, which includes several rescue coordinates, coordinates to be rescued, and contour maps of different positions in the map information. The rescue coordinates and the coordinates to be rescued respectively include the quantity of materials to be carried and the quantity of materials required. Each pair of rescue coordinates and coordinates to be rescued corresponds to a rescue route.

[0008] According to the number of contour lines that the rescue route passes through, the extreme value change of the contour lines, and the number of materials carried corresponding to the rescue coordinates, the difficulty of the rescue route from each rescue coordinate to each coordinate to be rescued in the contour map space is obtained; according to the difficulty of the rescue route, the initial rescue jurisdiction of each rescue coordinate in the contour map space is obtained;

[0009] Perform outlier detection on the coordinates to be rescued in the initial rescue area, obtain the difficult-to-rescue points in the initial rescue area of ​​each rescue coordinate in the contour map space and the first outlier factor of each difficult-to-rescue point; obtain the second outlier factor corresponding to the difficult-to-rescue point under the adjacent rescue coordinates;

[0010] According to the first outlier factor and the difficulty of the rescue route, the first degree of belonging of each difficult to be rescued point to the rescue coordinate in the initial rescue area of ​​each rescue coordinate in the contour map space is obtained; according to the second outlier factor and the difficulty of the rescue route, the second degree of belonging of each difficult to be rescued point to the adjacent rescue coordinate in the initial rescue area of ​​each rescue coordinate in the contour map space is obtained;

[0011] According to the magnitude of the first attribution degree and the second attribution degree, the difficult rescue point is included in the initial rescue jurisdiction of the rescue coordinate, and the final rescue jurisdiction of each rescue coordinate in the contour map space is obtained;

[0012] Obtain several rescue paths within the final treatment area for each rescue coordinate in the contour map space; obtain the priority of each rescue path within the final treatment area for each rescue coordinate in the contour map space according to the total amount of required materials in the rescue path; and perform rescue work on the final treatment area according to the priority of the rescue path.

[0013] Furthermore, the difficulty of the rescue route from each rescue coordinate to each coordinate to be rescued in the contour map space is obtained according to the number of contour lines passed by the rescue route, the extreme value change of the contour lines, and the number of materials carried corresponding to the rescue coordinates, including the following specific steps:

[0014] L i,j =norm(n i,j ×M i,j ×F i )

[0015] Where n i,j is the number of contour lines passed by the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area; M i,j is the height range of all contour lines in the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area; F i is the number of materials carried corresponding to the i-th rescue coordinate; norm() is the linear normalization function; L i,j It is the difficulty of the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area.

[0016] Furthermore, the initial rescue jurisdiction of each rescue coordinate in the contour map space is obtained according to the difficulty of the rescue route, including the following specific steps:

[0017] The difficulty of the rescue route from each rescue coordinate to the jth coordinate to be rescued in the contour map space of the disaster-stricken area is obtained respectively, the jth coordinate to be rescued is included in the rescue coordinates with the lowest rescue route difficulty, all the coordinates to be rescued in the contour map space are included in the classification, and the initial rescue jurisdiction of each rescue coordinate in the contour map space of the disaster-stricken area is obtained.

[0018] Furthermore, the outlier detection is performed on the coordinates to be rescued in the initial rescue area to obtain the difficult to be rescued points in the initial rescue area of ​​each rescue coordinate in the contour map space and the first outlier factor of each difficult to be rescued point, including the following specific steps:

[0019] The LOF algorithm is used to perform outlier detection on all coordinates to be rescued in the initial rescue jurisdiction of the i-th rescue coordinate. The nearest neighbor K value of the LOF algorithm is the upper integer value of TH1 times the number of coordinates to be rescued in the i-th initial rescue jurisdiction. TH1 is a preset hyperparameter. The outliers detected by the LOF algorithm are regarded as the difficult points to be rescued in the initial rescue jurisdiction of the i-th rescue coordinate, and the first outlier factor of each difficult point to be rescued in the initial rescue jurisdiction of the i-th rescue coordinate is recorded.

[0020] Furthermore, the specific method for obtaining the second outlier factor corresponding to the difficult rescue point under adjacent rescue coordinates is as follows:

[0021] For the kth difficult-to-rescue point in the initial rescue area of ​​the ith rescue coordinate, obtain the adjacent rescue coordinate closest to the kth difficult-to-rescue point and mark it as the adjacent rescue coordinate of the kth difficult-to-rescue point; add the kth difficult-to-rescue point to the adjacent rescue coordinates, and use the LOF algorithm to perform outlier detection on all the coordinates to be rescued in the initial rescue area of ​​the adjacent rescue coordinates, and obtain the second outlier factor corresponding to the kth difficult-to-rescue point under the adjacent rescue coordinates.

[0022] Furthermore, the method of obtaining the first degree of belonging of each difficult to-be-rescued point to the corresponding rescue coordinate in the initial rescue area of ​​each rescue coordinate in the contour map space according to the first outlier factor and the difficulty of the rescue route includes the following specific steps:

[0023] z1 i,k =exp[-LOF1(i,k)×L2 i,k ]

[0024] Where LOF1(i,k) is the first outlier factor of the kth difficult-to-rescue point in the initial rescue area of ​​the i-th rescue coordinate in the contour map space of the disaster-stricken area; L2 i,kis the difficulty of the rescue route from the i-th rescue coordinate to the k-th difficult rescue point in the contour map space of the disaster-stricken area; exp[] is an exponential function with a natural constant as the base; z1 i,k It is the first degree of belonging of the kth difficult-to-rescue point to the rescue coordinate in the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

[0025] Furthermore, the second degree of belonging of each difficult to-be-rescued point to the adjacent rescue coordinates in the initial rescue area of ​​each rescue coordinate in the contour map space is obtained according to the second outlier factor and the difficulty of the rescue route, and the specific steps include the following:

[0026] z i,k =exp[-LOF(i,k)×L1 k ]

[0027] Where LOF(i,k) is the second outlier factor corresponding to the kth difficult rescue point in the initial rescue area of ​​the i-th rescue coordinate in the contour map space of the disaster area under the adjacent rescue coordinates; L1 k is the difficulty of the rescue route from the adjacent rescue coordinates of the kth difficult rescue point to the kth difficult rescue point; exp[] is an exponential function with a natural constant as the base; z i,k It is the second degree of belonging of the kth difficult-to-rescue point to the adjacent rescue coordinates within the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

[0028] Furthermore, the difficult rescue point is included in the initial rescue area of ​​the rescue coordinates according to the first degree of belonging and the second degree of belonging, and the final rescue area of ​​each rescue coordinate in the contour map space is obtained, including the following specific steps:

[0029] For the kth difficult-to-rescue point within the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space, if the first degree of belonging corresponding to the kth difficult-to-rescue point is greater than the corresponding second degree of belonging, the kth difficult-to-rescue point will be finally included in the initial rescue jurisdiction of the rescue coordinate to which it belongs; otherwise, the kth difficult-to-rescue point will be finally included in the initial rescue jurisdiction of the adjacent rescue coordinates of the kth difficult-to-rescue point. All difficult-to-rescue points within the initial rescue jurisdiction of the i-th rescue coordinate will be finally included in the classification to obtain the final rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

[0030] Furthermore, the specific method for obtaining several rescue paths within the final rescue area of ​​each rescue coordinate in the contour map space is as follows:

[0031] For the final treatment jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area, take the i-th rescue coordinate in the final treatment jurisdiction as the starting point, use the Dijkstra algorithm to perform the shortest path planning for the coordinates to be rescued in the final treatment jurisdiction, and record the path passing through the most coordinates to be rescued as a rescue route. Then, in order from most to least, obtain the rescue paths corresponding to the remaining coordinates to be rescued in the final treatment jurisdiction of the i-th rescue coordinate, and obtain all the rescue paths within the final treatment jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

[0032] Furthermore, the step of obtaining the priority of each rescue path in the final treatment area of ​​each rescue coordinate in the contour map space according to the total amount of required materials in the rescue path includes the following specific steps:

[0033] For all rescue paths in the final rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area, the total amount of required materials in each rescue path is obtained, and the total amount of required materials in the rescue path is used as the priority of the rescue path.

[0034] The beneficial effects of the technical solution of the present invention are as follows: the present invention reduces the impact of the imbalanced configuration of the rescue area and the path within the area by analyzing the difficulty of different rescue routes and the reasonable final rescue area of ​​different rescue coordinates in the contour map space of the disaster-stricken area, and the optimal rescue path within the area, and improves the efficiency of safety emergency dispatch. When determining the difficulty of the rescue route, the difficulty of the rescue route is determined by analyzing the number of contour lines passed by the rescue route, the extreme value change of the contour lines, and the number of materials carried corresponding to the rescue coordinates, thereby improving the scientificity, accuracy and objectivity of the difficulty of the rescue route. When determining the final rescue area, by analyzing the first degree of belonging of the difficult rescue point to the rescue coordinates and the second degree of belonging to the adjacent rescue coordinates, the influence of the difficult rescue point on the adjacent rescue coordinates is more reasonably analyzed, and the difficult rescue point is included in the appropriate area to obtain the final rescue area, thereby improving the accuracy, scientificity and objectivity of the final rescue area. When determining the rescue path, the priority of the rescue path is also analyzed according to the total amount of materials required in the rescue path, thereby improving the scientificity, accuracy and objectivity of the rescue path. BRIEF DESCRIPTION OF THE DRAWINGS

[0035] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0036] Figure 1A flowchart of the steps of a safety emergency dispatch optimization method based on a geographic information platform provided by an embodiment of the present invention. DETAILED DESCRIPTION

[0037] In order to further explain the technical means and effects adopted by the present invention to achieve the predetermined invention purpose, the specific implementation method, structure, features and effects of the safety emergency dispatch optimization method based on the geographic information platform proposed by the present invention are described in detail below in combination with the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" does not necessarily refer to the same embodiment. In addition, specific features, structures or characteristics in one or more embodiments may be combined in any suitable form.

[0038] Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.

[0039] The specific scheme of the security emergency dispatch optimization method based on the geographic information platform provided by the present invention is described in detail below with reference to the accompanying drawings.

[0040] See also Figure 1 , which shows a flowchart of a safety emergency dispatch optimization method based on a geographic information platform provided by an embodiment of the present invention, the method comprising the following steps:

[0041] Step S001, obtain the contour map space of the disaster-stricken area, the contour map space includes a number of rescue coordinates, coordinates to be rescued and contour maps of different positions in the map information, the rescue coordinates and the coordinates to be rescued respectively include the quantity of carried materials and required materials, and each pair of rescue coordinates and coordinates to be rescued corresponds to a rescue route.

[0042] It should be noted that the main purpose of this embodiment is to improve the efficiency of safety emergency dispatch based on geographic information, and relevant data is first obtained before starting.

[0043] Specifically, the contour map space of the disaster-stricken area is obtained. The contour map space includes several rescue coordinates, coordinates to be rescued, and contour maps of different positions in the map information. The rescue coordinates and the coordinates to be rescued respectively include the quantity of materials to be carried and the quantity of materials required. Each pair of rescue coordinates and coordinates to be rescued corresponds to a rescue route, as follows:

[0044] Specifically, this embodiment obtains a regional topographic map of the disaster-stricken area through the global positioning system GPS and remote sensing technology, and draws a contour map based on the regional topographic map. The elevation difference between every two contour lines in the contour map is 2 meters, and the scale value of the contour map is 0.1 km.

[0045] It should be noted that disaster relief personnel or organizations usually spontaneously form teams to go to various rescue sites. If accurate rescue is required during the disaster relief process, the coordinates of the disaster-stricken people must be obtained first, and those who cannot be contacted can only be rescued through carpet searches. In emergency rescue, disaster relief personnel must first be deployed to clear and known disaster sites to ensure the effectiveness of rescue for the disaster-stricken people as much as possible. Therefore, it is necessary to first obtain the coordinates of each disaster-stricken person and rescue team, that is, the coordinates to be rescued and the rescue coordinates, and combine the road routes in the map of the disaster area to obtain the accessible routes between the coordinates to be rescued and the rescue coordinates.

[0046] Specifically, the coordinates of the disaster-stricken people to be rescued and the rescue coordinates of the rescue teams are obtained through satellite positioning; the disaster-stricken people and rescue teams that can be contacted are connected through satellite networks or 5G networks to obtain the list and quantity of materials required by the disaster-stricken people, as well as the list and quantity of materials carried by the rescue teams; all the coordinates to be rescued and their required lists and quantities of materials, as well as all the rescue coordinates and their lists and quantities of materials carried are mapped to the contour map of the disaster-stricken area, and all the rescue coordinates are connected with the coordinates to be rescued through the existing route map to obtain the rescue route, and obtain the contour map space of the disaster-stricken area.

[0047] At this point, the contour map space of the disaster-stricken area is obtained.

[0048] Step S002: Obtain the difficulty of the rescue route from each rescue coordinate to each coordinate to be rescued in the contour map space according to the number of contour lines that the rescue route passes through, the extreme value change of the contour lines, and the number of materials carried corresponding to the rescue coordinates; obtain the initial rescue jurisdiction of each rescue coordinate in the contour map space according to the difficulty of the rescue route.

[0049] It should be noted that when rescuers arrive at the disaster-stricken areas, they need to transport materials to the rescue coordinates as needed. During the transportation process, they are affected by road conditions. For example, the elevation changes significantly, which means that rescuers need to climb frequently, which has a great impact on the timeliness of the rescue. The greater the demand for materials in the rescued area, the greater the impact of road conditions. Therefore, the difficulty of the rescue route is first obtained by analyzing the number of contour lines passed by the rescue route, the extreme value changes of the contour lines, and the amount of materials carried corresponding to the rescue coordinates.

[0050] Specifically, according to the number of contour lines that the rescue route passes through, the extreme value change of the contour lines, and the number of materials carried corresponding to the rescue coordinates, the difficulty of the rescue route from each rescue coordinate to each coordinate to be rescued in the contour map space is obtained, as follows:

[0051] L i,j =norm(n i,j ×M i,j ×F i)

[0052] Where n i,j is the number of contour lines passed by the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area; M i,j is the height range of all contour lines in the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area; F i is the number of materials carried corresponding to the i-th rescue coordinate; norm() is a linear normalization function used for normalization processing; L i,j It is the difficulty of the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area.

[0053] It should be noted that n i,j The larger the value, the more difficult the road conditions are. i,j It reflects the height that the rescue team needs to climb or descend in the entire rescue route. The greater the range, the more difficult the rescue route is. At the same time, the amount of supplies carried by the rescue team is taken into account. The greater the amount, the more difficult the rescue route from the i-th rescue coordinate to the j-th rescue coordinate is.

[0054] It should be noted that when rescuers carry out rescue operations at a rescue site, they mainly consider the efficiency and difficulty of the rescue. Among them, the most influential factor in efficiency is the rescue road condition. Therefore, the difficulty of the rescue route is analyzed above. Next, according to the difficulty of the rescue route, the rescue area for each rescue coordinate is selected, which contains several coordinates to be rescued.

[0055] Specifically, according to the difficulty of the rescue route, the initial rescue jurisdiction of each rescue coordinate in the contour map space is obtained, as follows:

[0056] The difficulty of the rescue route from each rescue coordinate to the jth coordinate to be rescued in the contour map space of the disaster-stricken area is obtained respectively, and the jth coordinate to be rescued is included in the rescue coordinates with the lowest rescue route difficulty. All coordinates to be rescued in the contour map space are included in the classification, and the initial rescue jurisdiction of each rescue coordinate in the contour map space of the disaster-stricken area is obtained. It should be noted that the initial rescue jurisdiction of each rescue coordinate contains several coordinates to be rescued.

[0057] At this point, the initial rescue jurisdiction of each rescue coordinate in the contour map space is obtained.

[0058] Step S003, perform outlier detection on the coordinates to be rescued in the initial rescue area, obtain the difficult-to-rescue points in the initial rescue area of ​​each rescue coordinate in the contour map space and the first outlier factor of each difficult-to-rescue point; obtain the second outlier factor corresponding to the difficult-to-rescue point under the adjacent rescue coordinates.

[0059] It should be noted that, within the initial rescue jurisdiction, there may be some coordinates of the rescued personnel within the jurisdiction that are extremely far away and have much farther road conditions than other coordinates of the rescued personnel, so that the rescue organization needs to spend more time to reach these remote rescued personnel, that is, there are no other coordinates of the rescued personnel to which it belongs around the remote coordinate of the rescued personnel. Therefore, this embodiment first analyzes the initial rescue jurisdiction of each rescue coordinate to obtain difficult rescue coordinates, and then reasonably divides and incorporates these difficult rescue coordinates to optimize the initial rescue jurisdiction of the rescue coordinates.

[0060] Specifically, outlier detection is performed on the coordinates to be rescued in the initial rescue area to obtain the difficult-to-rescue points in the initial rescue area of ​​each rescue coordinate in the contour map space and the first outlier factor of each difficult-to-rescue point, as follows:

[0061] The LOF algorithm is used to perform outlier detection on all coordinates to be rescued in the initial rescue area of ​​the i-th rescue coordinate. The nearest neighbor K value of the LOF algorithm is the upper integer value of TH1 times the number of coordinates to be rescued in the i-th initial rescue area. TH1 is a preset hyperparameter. This embodiment is described as TH1=0.05. The outliers detected by the LOF algorithm are used as difficult points to be rescued in the initial rescue area of ​​the i-th rescue coordinate. The first outlier factor of each difficult point to be rescued in the initial rescue area of ​​the i-th rescue coordinate is recorded.

[0062] It should be noted that when these difficult rescue coordinates are reasonably divided and included, this embodiment mainly considers dividing them into adjacent rescue coordinate ranges so that the distance change is minimal.

[0063] Furthermore, the second outlier factor corresponding to the difficult rescue point under the adjacent rescue coordinates is obtained, as follows:

[0064] For the kth difficult-to-rescue point in the initial rescue area of ​​the ith rescue coordinate, obtain the nearest adjacent rescue coordinate to the kth difficult-to-rescue point as the adjacent rescue coordinate of the kth difficult-to-rescue point; add the kth difficult-to-rescue point to the adjacent rescue coordinates, and use the LOF algorithm to perform outlier detection on all coordinates to be rescued in the initial rescue area of ​​the adjacent rescue coordinates to obtain the second outlier factor corresponding to the kth difficult-to-rescue point under the adjacent rescue coordinates. It should be noted that obtaining the outlier factor of the coordinates to be rescued in the initial rescue area by the LOF algorithm is an existing method of the LOF algorithm, which will not be repeated in this embodiment.

[0065] At this point, the first outlier factor and the second outlier factor of the difficult point to be rescued are obtained.

[0066] Step S004: obtain the first degree of belonging of each difficult-to-rescue point in the initial rescue jurisdiction of each rescue coordinate in the contour map space to its own rescue coordinates according to the first outlier factor and the difficulty of the rescue route; obtain the second degree of belonging of each difficult-to-rescue point in the initial rescue jurisdiction of each rescue coordinate in the contour map space to the adjacent rescue coordinates according to the second outlier factor and the difficulty of the rescue route; and incorporate the difficult-to-rescue point into the initial rescue jurisdiction of the rescue coordinates according to the size of the first degree of belonging and the second degree of belonging to obtain the final rescue jurisdiction of each rescue coordinate in the contour map space.

[0067] It should be noted that the outlier factors of the difficult rescue points in their initial rescue jurisdictions and the difficulty of the rescue routes are obtained above. By analyzing the changes in these parameters, it is determined that the difficult rescue points are divided into the initial rescue jurisdictions of the rescue coordinates for better emergency dispatch.

[0068] Specifically, according to the first outlier factor and the difficulty of the rescue route, the first degree of belonging of each difficult rescue point to the rescue coordinate in the initial rescue area of ​​each rescue coordinate in the contour map space is obtained, as follows:

[0069] z1 i,k =exp[-LOF1(i,k)×L2 i,k ]

[0070] Where LOF1(i,k) is the first outlier factor of the kth difficult-to-rescue point in the initial rescue area of ​​the i-th rescue coordinate in the contour map space of the disaster-stricken area; L2 i,k is the difficulty of the rescue route corresponding to the i-th rescue coordinate to the k-th difficult rescue point in the contour map space of the disaster-stricken area; exp[] is an exponential function with a natural constant as the base. This embodiment adopts the exp[-U] model to present an inverse proportional relationship, and U is the input of the model; z1 i,k It is the first degree of belonging of the kth difficult-to-rescue point to the rescue coordinate in the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

[0071] It should be noted that the smaller LOF1(i,k) is, the smaller the outlier is, and the kth difficult rescue point should be attributed to the i-th rescue coordinate; at the same time, if the corresponding rescue route is less difficult, it means that the kth difficult rescue point should be attributed to the i-th rescue coordinate.

[0072] Furthermore, according to the second outlier factor and the difficulty of the rescue route, the second degree of belonging of each difficult rescue point to the adjacent rescue coordinates in the initial rescue area of ​​each rescue coordinate in the contour map space is obtained, as follows:

[0073] z i,k=exp[-LOF(i,k)×L1 k ]

[0074] Where LOF(i,k) is the second outlier factor corresponding to the kth difficult rescue point in the initial rescue area of ​​the i-th rescue coordinate in the contour map space of the disaster area under the adjacent rescue coordinates; L1 k is the difficulty of the rescue route from the adjacent rescue coordinates of the kth difficult rescue point to the kth difficult rescue point; exp[] is an exponential function with a natural constant as the base; z i,k It is the second degree of belonging of the kth difficult-to-rescue point to the adjacent rescue coordinates within the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

[0075] Further, according to the magnitude of the first degree of belonging and the second degree of belonging, the difficult rescue point is included in the initial rescue jurisdiction of the rescue coordinates, and the final rescue jurisdiction of each rescue coordinate in the contour map space is obtained, as follows;

[0076] For the kth difficult-to-rescue point within the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space, if the first degree of belonging corresponding to the kth difficult-to-rescue point is greater than the corresponding second degree of belonging, the kth difficult-to-rescue point will be finally included in the initial rescue jurisdiction of the rescue coordinate to which it belongs; otherwise, the kth difficult-to-rescue point will be finally included in the initial rescue jurisdiction of the adjacent rescue coordinates of the kth difficult-to-rescue point. All difficult-to-rescue points within the initial rescue jurisdiction of the i-th rescue coordinate will be finally included in the classification to obtain the final rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

[0077] At this point, the final rescue jurisdiction for each rescue coordinate in the contour map space is obtained.

[0078] Step S005, obtain several rescue paths within the final treatment area of ​​each rescue coordinate in the contour map space; obtain the priority of each rescue path within the final treatment area of ​​each rescue coordinate in the contour map space according to the total amount of required materials in the rescue path; and perform rescue work on the final treatment area according to the priority of the rescue path.

[0079] It should be noted that the final rescue area for each rescue coordinate in the contour map space is obtained above. By planning the path of the coordinates to be rescued in the final rescue area, a reasonable rescue path in the final rescue area is obtained, thereby improving the efficiency of safety emergency dispatch.

[0080] Specifically, several rescue paths within the final rescue area of ​​each rescue coordinate in the contour map space are obtained, as follows:

[0081] For the final treatment area of ​​the i-th rescue coordinate in the contour map space of the disaster-stricken area, take the i-th rescue coordinate in the final treatment area as the starting point, use the Dijkstra algorithm (Dijkstra) to plan the shortest path for the coordinates to be rescued in the final treatment area, and record the path passing through the most coordinates to be rescued as a rescue route. Then, in order from most to least, obtain the rescue paths corresponding to the remaining coordinates to be rescued in the final treatment area of ​​the i-th rescue coordinate, and obtain all rescue paths in the final treatment area of ​​the i-th rescue coordinate in the contour map space of the disaster-stricken area.

[0082] Furthermore, the priority of each rescue path in the final treatment area of ​​each rescue coordinate in the contour map space is obtained according to the total amount of required materials in the rescue path; rescue work is carried out on the final treatment area according to the priority of the rescue path, as follows:

[0083] For all rescue paths in the final treatment jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area, the total amount of required materials in each rescue path is obtained, and the total amount of required materials in the rescue path is used as the priority of the rescue path; by giving priority to the coordinates to be rescued with greater demand, the burden on the rescue organization on the way to the subsequent coordinates to be rescued is reduced.

[0084] It should be noted that the priority of each rescue path within the final treatment area of ​​each rescue coordinate has been obtained above, and rescue work will be carried out on all final treatment areas according to the priority of the rescue path. The details will not be repeated here. By reasonably planning the rescue path, the efficiency of safety emergency dispatch is improved.

[0085] Through the above steps, the security emergency dispatch optimization method based on geographic information platform is completed.

[0086] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the principles of the present invention should be included in the protection scope of the present invention.

Claims

1. A safety emergency dispatch optimization method based on a geographic information platform, characterized in that: The method comprises the following steps: Acquire a contour map space of the disaster-stricken area, wherein the contour map space includes a number of rescue coordinates, coordinates to be rescued, and contour maps of different positions in the map information, wherein the rescue coordinates and coordinates to be rescued respectively include the quantity of materials to be carried and the quantity of materials required, and each pair of rescue coordinates and coordinates to be rescued corresponds to a rescue route; According to the number of contour lines that the rescue route passes through, the extreme value change of the contour lines, and the number of materials carried corresponding to the rescue coordinates, the difficulty of the rescue route from each rescue coordinate to each coordinate to be rescued in the contour map space is obtained; according to the difficulty of the rescue route, the initial rescue jurisdiction of each rescue coordinate in the contour map space is obtained; Perform outlier detection on the coordinates to be rescued in the initial rescue area, obtain the difficult-to-rescue points in the initial rescue area of ​​each rescue coordinate in the contour map space and the first outlier factor of each difficult-to-rescue point; obtain the second outlier factor corresponding to the difficult-to-rescue point under the adjacent rescue coordinates; According to the first outlier factor and the difficulty of the rescue route, the first degree of belonging of each difficult to be rescued point to the rescue coordinate in the initial rescue area of ​​each rescue coordinate in the contour map space is obtained; according to the second outlier factor and the difficulty of the rescue route, the second degree of belonging of each difficult to be rescued point to the adjacent rescue coordinate in the initial rescue area of ​​each rescue coordinate in the contour map space is obtained; According to the magnitude of the first attribution degree and the second attribution degree, the difficult rescue point is included in the initial rescue jurisdiction of the rescue coordinate, and the final rescue jurisdiction of each rescue coordinate in the contour map space is obtained; Obtain several rescue paths within the final treatment area for each rescue coordinate in the contour map space; obtain the priority of each rescue path within the final treatment area for each rescue coordinate in the contour map space according to the total amount of required materials in the rescue path; and perform rescue work on the final treatment area according to the priority of the rescue path.

2. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The difficulty of the rescue route from each rescue coordinate to each coordinate to be rescued in the contour map space is obtained according to the number of contour lines passed by the rescue route, the extreme value change of the contour lines, and the number of materials carried corresponding to the rescue coordinates. The specific steps include the following: L i,j =norm(n i,j ×M i,j ×F i ) Where n i,j is the number of contour lines passed by the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area; M i,j is the height range of all contour lines in the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area; F i is the number of materials carried corresponding to the i-th rescue coordinate; norm() is the linear normalization function; L i,j It is the difficulty of the rescue route from the i-th rescue coordinate to the j-th coordinate to be rescued in the contour map space of the disaster-stricken area.

3. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The specific steps of obtaining the initial rescue jurisdiction of each rescue coordinate in the contour map space according to the difficulty of the rescue route are as follows: The difficulty of the rescue route from each rescue coordinate to the jth coordinate to be rescued in the contour map space of the disaster-stricken area is obtained respectively, the jth coordinate to be rescued is included in the rescue coordinates with the lowest rescue route difficulty, all the coordinates to be rescued in the contour map space are included in the classification, and the initial rescue jurisdiction of each rescue coordinate in the contour map space of the disaster-stricken area is obtained.

4. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The outlier detection is performed on the coordinates to be rescued in the initial rescue area to obtain the difficult to be rescued points in the initial rescue area of ​​each rescue coordinate in the contour map space and the first outlier factor of each difficult to be rescued point, including the following specific steps: The LOF algorithm is used to perform outlier detection on all coordinates to be rescued in the initial rescue jurisdiction of the i-th rescue coordinate. The nearest neighbor K value of the LOF algorithm is the upper integer value of TH1 times the number of coordinates to be rescued in the i-th initial rescue jurisdiction. TH1 is a preset hyperparameter. The outliers detected by the LOF algorithm are regarded as the difficult points to be rescued in the initial rescue jurisdiction of the i-th rescue coordinate, and the first outlier factor of each difficult point to be rescued in the initial rescue jurisdiction of the i-th rescue coordinate is recorded.

5. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The specific method for obtaining the second outlier factor corresponding to the difficult rescue point under adjacent rescue coordinates is as follows: For the kth difficult-to-rescue point in the initial rescue area of ​​the ith rescue coordinate, obtain the adjacent rescue coordinate closest to the kth difficult-to-rescue point and mark it as the adjacent rescue coordinate of the kth difficult-to-rescue point; add the kth difficult-to-rescue point to the adjacent rescue coordinates, and use the LOF algorithm to perform outlier detection on all the coordinates to be rescued in the initial rescue area of ​​the adjacent rescue coordinates, and obtain the second outlier factor corresponding to the kth difficult-to-rescue point under the adjacent rescue coordinates.

6. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The specific steps of obtaining the first degree of belonging of each difficult to-be-rescued point to the corresponding rescue coordinate in the initial rescue area of ​​each rescue coordinate in the contour map space according to the first outlier factor and the difficulty of the rescue route include the following: z1 i,k =exp[-LOF1(i,k)×L2 i,k ] Where LOF1(i,k) is the first outlier factor of the kth difficult-to-rescue point in the initial rescue area of ​​the i-th rescue coordinate in the contour map space of the disaster-stricken area; L2 i,k is the difficulty of the rescue route corresponding to the i-th rescue coordinate to the k-th difficult rescue point in the contour map space of the disaster-stricken area; exp[] is an exponential function with a natural constant as the base; z1 i,k It is the first degree of belonging of the kth difficult-to-rescue point to the rescue coordinate in the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

7. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The method of obtaining the second degree of belonging of each difficult to-be-rescued point to the adjacent rescue coordinates in the initial rescue area of ​​each rescue coordinate in the contour map space according to the second outlier factor and the difficulty of the rescue route includes the following specific steps: z i,k =exp[-LOF(i,k)×L1 k ] Where LOF(i,k) is the second outlier factor corresponding to the kth difficult rescue point in the initial rescue area of ​​the i-th rescue coordinate in the contour map space of the disaster area under the adjacent rescue coordinates; L1 k The difficulty of the rescue route from the adjacent rescue coordinates of the k-th difficult rescue point to the k-th difficult rescue point; exp[] is an exponential function with a natural constant as base; z i,k It is the second degree of belonging of the kth difficult-to-rescue point to the adjacent rescue coordinates within the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

8. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The method of incorporating the difficult rescue point into the initial rescue area of ​​the rescue coordinates according to the first degree of attribution and the second degree of attribution, and obtaining the final rescue area of ​​each rescue coordinate in the contour map space, includes the following specific steps: For the kth difficult-to-rescue point within the initial rescue jurisdiction of the i-th rescue coordinate in the contour map space, if the first degree of belonging corresponding to the kth difficult-to-rescue point is greater than the corresponding second degree of belonging, the kth difficult-to-rescue point will be finally included in the initial rescue jurisdiction of the rescue coordinate to which it belongs; otherwise, the kth difficult-to-rescue point will be finally included in the initial rescue jurisdiction of the adjacent rescue coordinates of the kth difficult-to-rescue point. All difficult-to-rescue points within the initial rescue jurisdiction of the i-th rescue coordinate will be finally included in the classification to obtain the final rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area.

9. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The specific method for obtaining several rescue paths within the final rescue area for each rescue coordinate in the contour map space is as follows: For the final treatment area of ​​the i-th rescue coordinate in the contour map space of the disaster-stricken area, take the i-th rescue coordinate in the final treatment area as the starting point, use the Dijkstra algorithm to plan the shortest path for the coordinates to be rescued in the final treatment area, and record the path passing through the most coordinates to be rescued as a rescue route. Then, in order from most to least, obtain the rescue paths corresponding to the remaining coordinates to be rescued in the final treatment area of ​​the i-th rescue coordinate, and obtain all the rescue paths in the final treatment area of ​​the i-th rescue coordinate in the contour map space of the disaster-stricken area.

10. The security emergency dispatch optimization method based on geographic information platform according to claim 1 is characterized in that: The specific steps of obtaining the priority of each rescue path in the final treatment area of ​​each rescue coordinate in the contour map space according to the total amount of required materials in the rescue path are as follows: For all rescue paths in the final rescue jurisdiction of the i-th rescue coordinate in the contour map space of the disaster-stricken area, the total amount of required materials in each rescue path is obtained, and the total amount of required materials in the rescue path is used as the priority of the rescue path.

Images