A fire station addressing method, device, equipment and storage medium

Abstract

The application relates to a fire station addressing method, device, equipment and storage medium, which comprises the following steps: acquiring a target area grid map and alarm history data, wherein the target area grid map comprises the longitude and latitude of each grid vertex, and the alarm history data comprises the longitude and latitude of an alarm occurrence position and the number of alarms; according to the longitude and latitude of the grid vertex, the longitude and latitude of the alarm occurrence position and a preset algorithm, the average arrival time of all grid vertices to each alarm occurrence position is determined; the average arrival time of all grid vertices, the number of alarms and the maximum average arrival time and the maximum number of alarms of each fire station are compared, and the number of fire stations in the target area is determined; and the longitude and latitude of the fire station is determined according to the average arrival time of all grid vertices and the number of alarms. The fire station addressing method, device, equipment and storage medium provided by the application optimize the fire force allocation and improve the police efficiency.

Description

Technical Field

[0001] This invention relates to the field of fire station addressing technology, and in particular to a fire station addressing method, apparatus, equipment and storage medium. Background Technology

[0002] The previous round of fire protection informatization construction has achieved certain results, but with the continuous development of the economy and society and the accelerating process of urban modernization, higher requirements have been placed on the comprehensive capabilities of fire and rescue teams, such as response speed, dispatch and command, on-site operations, and scientific rescue. Among these, the reasonable distribution of fire and rescue stations is crucial to the effectiveness of fire and rescue response.

[0003] In reality, the selection of fire station locations is mostly based on subjective human judgment, and these methods do not take into account the need for refined decision-making based on historical data.

[0004] However, with the rapid development of society and urbanization, the fire and rescue needs in the original station area have also changed. Human subjective judgment will be delayed, resulting in uneven distribution of fire and rescue forces. Summary of the Invention

[0005] In view of this, it is necessary to provide a fire station addressing method, device, equipment and storage medium to solve the problems of fire station addressing not being able to be adjusted in a timely manner and uneven distribution of fire rescue forces in the prior art.

[0006] To achieve the above-mentioned technical objectives, the present invention adopts the following technical solution:

[0007] In a first aspect, the present invention provides a method for locating fire stations, comprising:

[0008] Obtain a gridded map of the target area and historical incident data. The gridded map of the target area includes the latitude and longitude of each grid vertex, and the historical incident data includes the latitude and longitude of the incident location and the number of incidents.

[0009] Based on the latitude and longitude of the grid vertices, the latitude and longitude of the location of the incident, and a preset algorithm, determine the average arrival time of all grid vertices to each location of the incident;

[0010] The average arrival time and number of alarms of all grid vertices are compared with the maximum average arrival time and maximum number of alarms of each fire station to determine the number of fire stations in the target area;

[0011] The latitude and longitude of the fire station are determined based on the average arrival time of all grid vertices and the number of alarms.

[0012] Preferably, the average arrival time and number of alarms for all grid vertices are compared with the maximum average arrival time and maximum number of alarms for each fire station to determine the number of fire stations within the target area, including:

[0013] If the average arrival time of the smallest grid vertex is less than the maximum average arrival time of each fire station, and the number of alarms is less than the maximum number of alarms of each fire station, then a fire station is set up in the target area.

[0014] Preferably, the method of comparing the average arrival time and number of alarms of all grid vertices with the maximum average arrival time and maximum number of alarms of each fire station to determine the number of fire stations in the target area further includes:

[0015] If the average arrival time of the smallest grid vertex is greater than the maximum average arrival time of each station, or the number of alarms is greater than the maximum number of alarms of each station, then multiple fire stations are set up in the target area.

[0016] Preferably, multiple fire stations are set up in the target area, including:

[0017] Increase the number of fire stations by the preset number of units, and update the number of fire stations;

[0018] Based on the gridded map of the target area and the updated number of fire stations, determine the average arrival time and number of alarms for each fire station;

[0019] If the average arrival time and number of alarms at each fire station do not meet the requirements of the target area, the number of fire stations will be increased by a preset number of units until the average arrival time and number of alarms at each fire station after the update meet the requirements of the target area.

[0020] Preferably, the average arrival time includes the average travel time; if the average arrival time and number of alarms at each fire station do not meet the requirements of the target area, the number of fire stations will be increased by a preset number of units until the average arrival time and number of alarms at each fire station after the update meet the requirements of the target area, including:

[0021] If multiple grid vertex combinations meet the requirements of the target area, then the combination with the smallest average travel time among the multiple grid vertex combinations is selected;

[0022] If the average travel time of multiple grid vertex combinations is minimized, then the combination with the smallest variance in the number of alarms allocated among the multiple grid vertex combinations is selected.

[0023] Preferably, if the average arrival time of the smallest grid vertex is less than the maximum average arrival time of each fire station, and the number of alarms is less than the maximum number of alarms of each fire station, then a fire station is set up in the target area, including:

[0024] Select multiple mesh vertices that meet preset conditions, and then subdivide the range of these multiple mesh vertices into smaller meshes.

[0025] Calculate the average arrival time of the grid vertices after grid subdivision, and select the range of grid vertices that meet the preset conditions to further subdivide the grid until the preset addressing range requirements are met.

[0026] Preferably, after determining the latitude and longitude of the fire station based on the average arrival time of all grid vertices and the number of alarms, the process further includes:

[0027] The deployment of fire stations will be adjusted based on the frequency of police incidents in the target area.

[0028] Secondly, the present invention also provides a fire station addressing device, characterized in that it comprises:

[0029] The acquisition module is used to acquire a gridded map of the target area and historical police incident data. The gridded map of the target area includes the latitude and longitude of each grid vertex, and the historical police incident data includes the latitude and longitude of the location where the incident occurred and the number of incidents.

[0030] The calculation module is used to determine all arrival times of each grid vertex to each location of an incident based on the latitude and longitude of the grid vertices, the latitude and longitude of the location of the incident, and a preset algorithm, and to calculate the average arrival time of all grid vertices.

[0031] The comparison module is used to compare the average arrival time and number of alarms of all grid vertices with the maximum average arrival time and maximum number of alarms of each station to determine the number of fire stations in the target area.

[0032] The addressing module is used to determine the latitude and longitude of the fire station based on the average arrival time of all grid vertices and the number of alarms.

[0033] Thirdly, the present invention also provides an electronic device, including a memory and a processor, wherein,

[0034] Memory, used to store programs;

[0035] The processor, coupled to the memory, is used to execute the program stored in the memory to implement the steps in the fire station addressing method in any of the above implementations.

[0036] Fourthly, the present invention also provides a computer-readable storage medium for storing a computer-readable program or instruction, which, when executed by a processor, can implement the steps in the fire station addressing method in any of the above implementations.

[0037] The beneficial effects of the above embodiments are as follows: The fire station addressing method, device, equipment and storage medium provided by the present invention obtains a gridded map of the target area and historical alarm data, calculates the average arrival time of all possible fire stations, compares the average arrival time and the number of alarms with the maximum average arrival time and the maximum number of alarms of each fire station, determines the location of the fire station, and realizes real-time adjustment of the fire station location and allocation of fire rescue forces. Attached Figure Description

[0038] Figure 1 A flowchart illustrating an embodiment of the fire station addressing method provided by the present invention;

[0039] Figure 2 This is a flowchart illustrating an embodiment of the present invention for setting up multiple fire stations;

[0040] Figure 3 A schematic diagram of an embodiment of the fire station addressing device provided by the present invention;

[0041] Figure 4 This is a schematic diagram of the structure of the fire station addressing electronic device provided in an embodiment of the present invention. Detailed Implementation

[0042] Preferred embodiments of the present invention will now be described in detail with reference to the accompanying drawings, which form part of this application and are used together with the embodiments of the present invention to illustrate the principles of the present invention, but are not intended to limit the scope of the present invention.

[0043] In the description of this application, "multiple" means two or more, unless otherwise expressly and specifically defined.

[0044] In this document, the term "embodiment" means that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of the invention. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a separate or alternative embodiment mutually exclusive with other embodiments. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described herein can be combined with other embodiments.

[0045] This invention provides a method, apparatus, device, and storage medium for fire station addressing, which will be described below.

[0046] Please see Figure 1 , Figure 1 This is a flowchart illustrating an embodiment of the fire station addressing method provided by the present invention. A specific embodiment of the present invention discloses a fire station addressing method, comprising:

[0047] S101. Obtain a gridded map of the target area and historical incident data. The gridded map of the target area includes the latitude and longitude of each grid vertex, and the historical incident data includes the latitude and longitude of the incident location and the number of incidents.

[0048] S102. Based on the latitude and longitude of the grid vertices, the latitude and longitude of the location of the incident, and the preset algorithm, determine the average arrival time of all grid vertices to each location of the incident.

[0049] S103. Compare the average arrival time and number of alarms of all grid vertices with the maximum average arrival time and maximum number of alarms of each fire station to determine the number of fire stations in the target area.

[0050] S104. Determine the latitude and longitude of the fire station based on the average arrival time of all grid vertices and the number of alarms.

[0051] In a specific embodiment of the present invention, step S101 first acquires a map of the target area, and then grids the map of the target area. This gridding is an initial gridding, with the side length of each grid set to 1 kilometer. The gridded map includes the latitude and longitude of each grid vertex. The acquired historical alarm data is historical data within a certain period. In this embodiment, the historical data is the alarm data for the most recent year.

[0052] In a specific embodiment of the present invention, the preset algorithm of step S102 is to call the path planning interface to implement the path planning algorithm, calculate the average arrival time of each grid vertex to all alarm locations, and the time taken for the fire station to travel to the alarm location is an important parameter for determining the location of the fire station.

[0053] In a specific embodiment of the present invention, step S103 determines the maximum average arrival time T and the maximum number of alarms C of the fire station based on historical alarm data, and determines the number of fire stations set up in the target area by using the average arrival time of the grid vertices and the number of alarms allocated.

[0054] In a specific embodiment of the present invention, step S104 determines the latitude and longitude of the grid points where fire stations are set up based on the number of fire stations to be set up in the target area, the average arrival time of possible grid vertices, and the number of alarms allocated, so as to quickly determine the location of fire stations in the target area and allocate fire rescue forces.

[0055] Compared with existing technologies, the fire station location method provided in this embodiment obtains a gridded map of the target area and historical alarm data, calculates the average arrival time of all possible fire stations, compares the average arrival time and the number of alarms with the maximum average arrival time and the maximum number of alarms for each fire station, determines the location of the fire station, and realizes real-time adjustment of the fire station location and allocation of fire rescue forces.

[0056] In some embodiments of the present invention, the number of fire stations in the target area is determined by comparing the average arrival time and number of alarms of all grid vertices with the maximum average arrival time and maximum number of alarms of each fire station, including:

[0057] If the average arrival time of the smallest grid vertex is less than the maximum average arrival time of each fire station, and the number of alarms is less than the maximum number of alarms of each fire station, then a fire station is set up in the target area.

[0058] In the above embodiment, the minimum average arrival time of the grid within the target area to the location of the alarm is calculated. When the minimum average arrival time is less than the maximum average arrival time T of the fire station in the historical data and the number of alarms allocated is less than the maximum number of alarms C of the fire station, it can be determined that only one fire station needs to be set up to meet the fire protection needs of the target area.

[0059] In some embodiments of the present invention, the number of fire stations in the target area is determined by comparing the average arrival time and number of alarms of all grid vertices with the maximum average arrival time and maximum number of alarms of each fire station, and the method further includes:

[0060] If the average arrival time of the smallest grid vertex is greater than the maximum average arrival time of each station, or the number of alarms is greater than the maximum number of alarms of each station, then multiple fire stations are set up in the target area.

[0061] In the above embodiments, when the minimum average arrival time is greater than the maximum average arrival time T of the fire station in historical data or the number of alarms assigned is greater than the maximum number of alarms C of the fire station, it can be determined that multiple fire stations need to be set up in the area to meet the fire protection needs of the area.

[0062] Please see Figure 2 , Figure 2 This is a flowchart illustrating an embodiment of the present invention of setting up multiple fire stations. In some embodiments of the present invention, multiple fire stations are set up in a target area, including:

[0063] S201. Increase the number of fire stations by the preset number of units and update the number of fire stations;

[0064] S202. Based on the gridded map of the target area and the updated number of fire stations, determine the average arrival time and number of alarms for each fire station;

[0065] S203. If the average arrival time and number of alarms at each fire station do not meet the requirements of the target area, the number of fire stations will be increased by a preset number of units until the average arrival time and number of alarms at each fire station meet the requirements of the target area after the update.

[0066] In a specific embodiment of the present invention, the preset unit quantity in step S201 is 1, that is, each time it is determined that the current number of fire stations does not meet the requirements of the target area, the current number of fire stations is increased by 1.

[0067] In a specific embodiment of the present invention, step S202 determines possible combinations of fire stations based on the number of fire stations, calculates the average arrival time of each possible combination of fire stations and the number of alarms assigned to each possible fire station.

[0068] In a specific embodiment of the present invention, step S203 compares the average arrival time of each possible combination of fire stations with the maximum average arrival time T of the fire station, compares the number of alarms allocated to each possible fire station with the maximum number of alarms of the fire station, and determines whether the current number of fire stations meets the needs of the target area. If it still does not meet the needs, the current number of fire stations is increased by a preset number of units in sequence, and the determination is repeated until the current number of fire stations meets the needs of the target area.

[0069] In the above embodiment, a preset number of units is set. When the number of fire stations in the target area does not meet the needs of the target area, the number of fire stations is increased by the preset number of units each time, and the judgment is repeated until the current number of fire stations meets the needs of the target area. It can be understood that the preset number of units can be set manually according to the actual situation.

[0070] In some embodiments of the present invention, the average arrival time includes the average travel time; if the average arrival time and the number of alarms at each fire station do not meet the requirements of the target area, the number of fire stations is increased by a preset number of units until the average arrival time and the number of alarms at each fire station after the update meet the requirements of the target area, including:

[0071] If multiple grid vertex combinations meet the requirements of the target area, then the combination with the smallest average travel time among the multiple grid vertex combinations is selected;

[0072] If the average travel time of multiple grid vertex combinations is minimized, then the combination with the smallest variance in the number of alarms allocated among the multiple grid vertex combinations is selected.

[0073] In the above embodiments, when multiple fire stations need to be set up in the target area, the number of grid vertices selected each time is the same as the number of fire stations required. When multiple grid vertex combinations meet the requirements of the target area, the average travel time of each combination is calculated, and the combination with the smallest average travel time is selected. When the average travel time of multiple grid vertex combinations is the smallest, the variance of the number of alarms allocated to the fire stations in each combination is calculated. The smaller the variance, the more stable the number of alarms allocated to the fire station. The combination with the smallest variance in the number of alarms allocated among multiple grid vertex combinations is selected as the fire station site selection point of the target area.

[0074] It is understandable that the site selection combination is a random combination. Some selection constraints can be set (such as removing combinations with grid points in the water system or combinations with adjacent grid points) to reduce the number of combinations selected, thereby reducing the amount of computation.

[0075] In some embodiments of the present invention, if the average arrival time of the smallest grid vertex is less than the maximum average arrival time of each fire station, and the number of alarms is less than the maximum number of alarms at each fire station, then a fire station is set up in the target area, including:

[0076] Select multiple mesh vertices that meet preset conditions, and then subdivide the range of these multiple mesh vertices into smaller meshes.

[0077] Calculate the average arrival time of the grid vertices after grid subdivision, and select the range of grid vertices that meet the preset conditions to further subdivide the grid until the preset addressing range requirements are met.

[0078] In the above embodiments, when only one fire station is set up in the target area, multiple grid vertices that meet the average arrival time and number of alarms for each station can be selected. In this embodiment, 10 grid vertices that meet the conditions are selected. Based on the position of these 10 grid vertices, the target area is narrowed down, and the area map of the 10 grid vertices is subdivided into grids. In this embodiment, the grid side length is reduced to half of the previous size each time it is subdivided. The average arrival time from each grid vertex to the location of the alarm and the number of alarms allocated are determined again to see if they meet the needs of the target area, thereby determining the fire station site selection point in the target area.

[0079] It is understandable that the preset addressing range requirement can be set manually according to the actual situation. In this embodiment, the requirement is met if the location accuracy of the fire station is within 100 meters.

[0080] In some embodiments of the present invention, after determining the latitude and longitude of the fire station based on the average arrival time of all grid vertices and the number of alarms, the method further includes:

[0081] The deployment of fire stations will be adjusted based on the frequency of police incidents in the target area.

[0082] In the above embodiments, after determining the location of the fire stations, the present invention can also adjust the rescue force of each fire station according to the actual situation. Specifically, for areas with high alarm density, the present invention will provide several suggestions for nearby fire stations. In such cases, nearby stations can be merged to form a fire station with a larger force. At the same time, there may be some more remote locations. The present invention provides the location of fire stations, but their emergency response needs are relatively low; in this case, the force allocation for those fire stations can be reduced. Thus, the force of the stations can be differentiated according to actual needs.

[0083] It should be noted that the present invention can also calculate whether the current fire station layout is reasonable (different force configurations meet different constraints: average arrival time and number of alarms based on path planning): if there is only one fire station in the area, the constraint conditions are calculated by referring to the case of only one fire station; if there are multiple fire stations in the area (belonging to the same administrative region), the constraint conditions are calculated by referring to the case of having multiple fire stations; in addition, it can also calculate whether the actual average arrival time of the fire station meets the constraint conditions.

[0084] In addition, the method provided by this invention can be run at different time periods to compare whether the results of the method provided by this invention are consistent, because the time obtained by path planning at different time periods will be different, and the more consistent result can be selected.

[0085] To better implement the fire station addressing method in this embodiment of the invention, based on the fire station addressing method, please refer to the corresponding documentation. Figure 3 , Figure 3 This is a schematic diagram of an embodiment of the fire station addressing device provided by the present invention. The embodiment of the present invention provides a fire station addressing device 300, comprising:

[0086] The acquisition module 301 is used to acquire a gridded map of the target area and historical police incident data. The gridded map of the target area includes the latitude and longitude of each grid vertex, and the historical police incident data includes the latitude and longitude of the location where the incident occurred and the number of incidents.

[0087] The calculation module 302 is used to determine all arrival times from each grid vertex to each location of an incident based on the latitude and longitude of the grid vertex, the latitude and longitude of the location of the incident, and a preset algorithm, and to calculate the average arrival time of all grid vertices.

[0088] The comparison module 303 is used to compare the average arrival time and number of alarms of all grid vertices with the maximum average arrival time and maximum number of alarms of each station to determine the number of fire stations in the target area.

[0089] Addressing module 304 is used to determine the latitude and longitude of the fire station based on the average arrival time of all grid vertices and the number of alarms.

[0090] It should be noted that the device 300 provided in the above embodiments can implement the technical solutions described in the above method embodiments. The specific implementation principles of the above modules or units can be found in the corresponding content in the above method embodiments, and will not be repeated here.

[0091] Please see Figure 4 , Figure 4 This is a schematic diagram of the structure of the fire station addressing electronic device provided in an embodiment of the present invention. Based on the above fire station addressing method, the present invention also provides a corresponding fire station addressing device, which can be a mobile terminal, desktop computer, laptop, handheld computer, server, or other computing device. The fire station addressing device includes a processor 410, a memory 420, and a display 430. Figure 4 Only some components of the electronic device are shown; however, it should be understood that it is not required to implement all of the components shown, and more or fewer components may be implemented instead.

[0092] In some embodiments, memory 420 may be an internal storage unit of the fire station addressing device, such as the hard drive or memory of the fire station addressing device. In other embodiments, memory 420 may be an external storage device of the fire station addressing device, such as a plug-in hard drive, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the fire station addressing device. Furthermore, memory 420 may include both internal and external storage units of the fire station addressing device. Memory 420 is used to store application software and various types of data installed on the fire station addressing device, such as the program code for installing the fire station addressing device. Memory 420 may also be used to temporarily store data that has been output or will be output. In one embodiment, memory 420 stores a fire station addressing program 440, which can be executed by processor 410 to implement the fire station addressing methods of the various embodiments of this application.

[0093] In some embodiments, processor 410 may be a central processing unit (CPU), microprocessor or other data processing chip, used to run program code stored in memory 420 or process data, such as executing fire station addressing methods.

[0094] In some embodiments, display 430 may be an LED display, a liquid crystal display, a touch-screen liquid crystal display, or an OLED (Organic Light-Emitting Diode) touchscreen. Display 430 is used to display information from the fire station addressing equipment and to display a visual user interface. Components 410-430 of the fire station addressing equipment communicate with each other via a system bus.

[0095] In one embodiment, the steps of the fire station addressing method described above are implemented when the processor 410 executes the fire station addressing program 440 in the memory 420.

[0096] This embodiment also provides a computer-readable storage medium storing a fire station addressing program, which, when executed by a processor, performs the following steps:

[0097] Obtain a gridded map of the target area and historical incident data. The gridded map of the target area includes the latitude and longitude of each grid vertex, and the historical incident data includes the latitude and longitude of the incident location and the number of incidents.

[0098] Based on the latitude and longitude of the grid vertices, the latitude and longitude of the location of the incident, and a preset algorithm, determine the average arrival time of all grid vertices to each location of the incident;

[0099] The average arrival time and number of alarms of all grid vertices are compared with the maximum average arrival time and maximum number of alarms of each fire station to determine the number of fire stations in the target area;

[0100] The latitude and longitude of the fire station are determined based on the average arrival time of all grid vertices and the number of alarms.

[0101] In summary, the fire station location method, apparatus, equipment, and storage medium provided in this embodiment of the present invention obtain a gridded map of the target area and historical alarm data, calculate the average arrival time of all possible fire stations, compare the average arrival time and the number of alarms with the maximum average arrival time and the maximum number of alarms for each fire station, determine the location of the fire station, and realize the real-time adjustment of the fire station location and the allocation of fire rescue forces.

[0102] The above description is only a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any changes or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for locating fire stations, characterized in that, include: Obtain a gridded map of the target area and historical police incident data, wherein the gridded map of the target area includes the latitude and longitude of each grid vertex, and the historical police incident data includes the latitude and longitude of the location where the incident occurred and the number of incidents; Based on the latitude and longitude of the grid vertices, the latitude and longitude of the location where the incident occurred, and a preset algorithm, determine the average arrival time of all grid vertices to each location where the incident occurred; The average arrival time and the number of alarms of all the grid vertices are compared with the maximum average arrival time and the maximum number of alarms of each fire station to determine the number of fire stations in the target area; The latitude and longitude of the fire station are determined based on the average arrival time of all grid vertices and the number of alarms, including: When multiple fire stations need to be set up in the target area, determine the combination where the number of grid vertices is the same as the number of fire stations. When multiple grid vertex combinations meet the requirements of the target area, calculate the average travel time of each combination and select the combination with the smallest average travel time. When the average travel time of multiple grid vertex combinations is the smallest, calculate the variance of the number of alarms allocated to the fire stations in each combination and select the combination with the smallest variance of the number of alarms allocated among multiple grid vertex combinations as the fire station site selection point for the target area. When only one fire station is set up in the target area, select multiple grid vertices that meet the average arrival time and number of alarms for each station. Based on the positions of the multiple grid vertices, narrow down the target area, subdivide the area map of the multiple grid vertices into grids, and re-determine whether the average arrival time from each grid vertex to the alarm location and the number of alarms allocated meet the needs of the target area. After the needs are met, determine the fire station site selection point in the target area.

2. The fire station addressing method according to claim 1, characterized in that, The step of comparing the average arrival time of all the grid vertices and the number of alarms with the maximum average arrival time and maximum number of alarms for each fire station to determine the number of fire stations in the target area includes: If the average arrival time of the smallest grid vertex is less than the maximum average arrival time of each fire station, and the number of alarms is less than the maximum number of alarms of each fire station, then a fire station is set up in the target area.

3. The fire station addressing method according to claim 2, characterized in that, The step of comparing the average arrival time of all the grid vertices and the number of alarms with the maximum average arrival time and maximum number of alarms for each fire station to determine the number of fire stations in the target area further includes: If the average arrival time of the smallest grid vertex is greater than the maximum average arrival time of each station, or the number of alarms is greater than the maximum number of alarms of each station, then multiple fire stations are set up in the target area.

4. The fire station addressing method according to claim 3, characterized in that, The target area is equipped with multiple fire stations, including: Increase the number of fire stations by the preset number of units, and update the number of fire stations; Based on the gridded map of the target area and the updated number of fire stations, determine the average arrival time and number of alarms for each fire station; If the average arrival time and number of alarms at each fire station do not meet the requirements of the target area, the number of fire stations will be increased by a preset number of units until the average arrival time and number of alarms at each fire station after the update meet the requirements of the target area.

5. The fire station addressing method according to claim 4, characterized in that, The average arrival time includes the average travel time; if the average arrival time and number of alarms at each fire station do not meet the requirements of the target area, the number of fire stations will be increased by a preset number of units until the average arrival time and number of alarms at each fire station after the update meet the requirements of the target area, including: If multiple grid vertex combinations meet the requirements of the target area, then the combination with the smallest average travel time among the multiple grid vertex combinations is selected; If the average travel time of a combination of multiple grid vertices is the smallest, then the combination with the smallest variance in allocating the number of alarms among the multiple grid vertices is selected.

6. The fire station addressing method according to claim 2, characterized in that, If the average arrival time of the smallest grid vertex is less than the maximum average arrival time of each fire station, and the number of alarms is less than the maximum number of alarms of each fire station, then a fire station is set up in the target area, including: Select multiple mesh vertices that meet preset conditions, and subdivide the range of the multiple mesh vertices that meet the preset conditions into meshes; Calculate the average arrival time of the grid vertices after grid subdivision, and select the range of grid vertices that meet the preset conditions to further subdivide the grid until the preset addressing range requirements are met.

7. The fire station addressing method according to claim 1, characterized in that, After determining the latitude and longitude of the fire station based on the average arrival time of all grid vertices and the number of alarms, the method further includes: The equipment at the fire stations will be adjusted based on the frequency of police incidents in the target area.

8. A fire station addressing device, characterized in that, include: The acquisition module is used to acquire a gridded map of the target area and historical police incident data. The gridded map of the target area includes the latitude and longitude of each grid vertex, and the historical police incident data includes the latitude and longitude of the location where the incident occurred and the number of incidents. The calculation module is used to determine all arrival times of each grid vertex to each location of the incident based on the latitude and longitude of the grid vertex, the latitude and longitude of the location of the incident, and a preset algorithm, and to calculate the average arrival time of all grid vertices. The comparison module is used to compare the average arrival time and the number of alarms of all the grid vertices with the maximum average arrival time and the maximum number of alarms of each station to determine the number of fire stations in the target area; The addressing module is used to determine the latitude and longitude of the fire station based on the average arrival time of all the grid vertices and the number of alarms, including: When multiple fire stations need to be set up in the target area, determine the combination where the number of grid vertices is the same as the number of fire stations. When multiple grid vertex combinations meet the requirements of the target area, calculate the average travel time of each combination and select the combination with the smallest average travel time. When the average travel time of multiple grid vertex combinations is the smallest, calculate the variance of the number of alarms allocated to the fire stations in each combination and select the combination with the smallest variance of the number of alarms allocated among multiple grid vertex combinations as the fire station site selection point for the target area. When only one fire station is set up in the target area, select multiple grid vertices that meet the average arrival time and number of alarms for each station. Based on the positions of the multiple grid vertices, narrow down the target area, subdivide the area map of the multiple grid vertices into grids, and re-determine whether the average arrival time from each grid vertex to the alarm location and the number of alarms allocated meet the needs of the target area. After the needs are met, determine the fire station site selection point in the target area.

9. An electronic device, characterized in that, Including memory and processor, among which, The memory is used to store programs; The processor, coupled to the memory, is used to execute the program stored in the memory to implement the steps of the fire station addressing method according to any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, Used to store computer-readable programs or instructions, which, when executed by a processor, are capable of implementing the steps of the fire station addressing method according to any one of claims 1-7.

Images