CN117635401B - City management patrol scheme generation method, device, equipment and storage medium - Google Patents
City management patrol scheme generation method, device, equipment and storage medium Download PDFInfo
- Publication number
- CN117635401B CN117635401B CN202410099583.1A CN202410099583A CN117635401B CN 117635401 B CN117635401 B CN 117635401B CN 202410099583 A CN202410099583 A CN 202410099583A CN 117635401 B CN117635401 B CN 117635401B
- Authority
- CN
- China
- Prior art keywords
- patrol
- area
- generating
- road section
- target jurisdiction
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 230000006870 function Effects 0.000 claims description 10
- 238000000605 extraction Methods 0.000 claims description 3
- 238000003012 network analysis Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 5
- 230000008676 import Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a method, a device, equipment and a storage medium for generating an urban management patrol scheme, wherein the method comprises the following steps: determining a hot spot area according to the historical event data; overlapping the hot spot area and the target jurisdiction area to obtain an important patrol area; determining all patrol areas in the target jurisdiction area, and extracting patrol points; importing a road network and patrol points of the target jurisdiction area by using a GIS tool to generate a virtual reference point network; and generating the shortest patrol path of the target jurisdiction by using Dijkstra algorithm according to the virtual reference point network. The invention considers the factors of time, road, distance, running speed and the like aiming at the business requirement of urban management patrol scheduling, and optimizes the system based on the factors. By using the network analysis module in the ArcGIS, the patrol path scene is effectively simulated, and the Dijkstra algorithm is combined to optimize the optimal path, so that higher work execution efficiency can be realized with the least time cost during patrol.
Description
Technical Field
The invention relates to the technical field of security protection and control, in particular to a method, a device, equipment and a storage medium for generating an urban management patrol scheme.
Background
In urban management, an important component of urban management work is patrol work of urban management staff, a scheduling scheme of the urban management patrol staff is important for maintaining public order of cities and safety of citizens, and for urban management patrol scheduling, limited human resources often cannot discover and process events in time due to limited human resources and actual condition differences of different areas.
At present, the design of a patrol path aiming at urban management generally provides key patrol areas for urban management patrol personnel, and the urban management patrol personnel carry out patrol management on different areas according to the requirements of patrol time and patrol times. However, in such a way, the urban management patrol personnel cannot patrol according to the shortest path, i.e. the most efficient urban management patrol scheme according to the actual situation, and thus the overall patrol efficiency of urban management cannot be improved.
Therefore, how to provide a shortest path urban pipeline patrol scheme to improve the overall efficiency of urban management patrol is a technical problem to be solved.
Disclosure of Invention
The invention mainly aims to provide a method, a device, equipment and a storage medium for generating an urban management patrol scheme, and aims to solve the technical problem that the current urban management patrol scheme has randomness, so that the integral patrol efficiency of urban management is low.
In order to achieve the above object, the present invention provides a method for generating an urban management patrol scheme, comprising the steps of:
acquiring historical event data, and determining a hot spot area according to the historical event data;
overlapping the hot spot area with the target jurisdiction area, and taking the overlapping area in the overlapping area as a key patrol area;
based on the key patrol areas, determining all patrol areas in the target jurisdiction area, and extracting patrol points in all patrol areas;
importing a road network and patrol points of the target jurisdiction area by using a GIS tool to generate a virtual reference point network;
and generating the shortest patrol path of the target jurisdiction by using Dijkstra algorithm according to the virtual reference point network.
Optionally, acquiring historical event data, and determining a hotspot area according to the historical event data specifically includes:
acquiring historical event data, and extracting the position coordinates of each event in the historical event data;
determining an associated region of the position coordinates as a hot spot region based on the position coordinates of each event; each hot spot area is an area formed by the position coordinates corresponding to each event in a preset distance range.
Optionally, the step of overlapping the hot spot area with the target jurisdiction area and taking the overlapping area in the overlapping area as the key patrol area specifically includes: and carrying out region superposition on the hot spot region and the target jurisdiction region, and taking the whole region formed by the regions with the same position coordinates as a key patrol region.
Optionally, based on the key patrol area, determining all patrol areas in the target jurisdiction specifically includes:
calculating a probability density function of the target jurisdiction by using KDE kernel density estimation, and generating all patrol areas in the target jurisdiction;
the expression of KDE kernel density estimation specifically comprises:
；
where f (X) is an estimate of the probability density f, N is the number of samples in the dataset, H is the average number of samples, X i Is the ith sample, h is bandwidth, and K is kernel function;
wherein, the Gaussian kernel function used by K is in the form of:
；
where u is an intermediate variable.
Optionally, based on the step of extracting patrol points in the whole patrol area, the method specifically includes:
extracting important attention areas in the whole patrol areas; wherein the important attention area is a preset type area;
and taking the intersection point of the gateway of the important attention area and the adjacent roads as a patrol point in the whole patrol area.
Optionally, the step of using a GIS tool to import a road network and patrol points of the target jurisdiction and generate a virtual reference point network specifically includes:
a GIS tool is used for guiding in a road network and patrol points of a target jurisdiction area, and patrol weight quantized values of each road section between a patrol starting point and each patrol point are calculated;
generating a virtual reference point network according to patrol weight quantized values of each road section;
the expression for calculating the patrol weight quantized value of each road section is specifically as follows:
；
wherein,for the time weight, setting the ++each according to the peak period, off-peak period and actual traffic condition>Setting the speed weight according to the speed limit of different road sections and the actual speed condition>For the weight of the road block, if there is an emergency or road block on the road section, setting it to a value other than 0, otherwise, 0,/or->The distance weight of the road section is represented by t, the traffic time of the road section is represented by s, v, the speed of the road section is represented by m/s, c is represented by whether the road section has a sudden roadblock, 1 is represented by the existence, 0 is represented by the absence, and d is represented by the length of the road section and is represented by m.
Optionally, generating the shortest patrol path of the target jurisdiction by using Dijkstra algorithm according to the virtual reference point network, which specifically includes:
let S= {1,2, …, P } be the set of all candidate patrol points of the virtual reference point network, each patrol point has a pair of labels #,/>)；/>For +.>To patrol point->The shortest path length between the two; />To be from->To->Is +.>A patrol point preceding the point;
(1) Setting an initial value to set a departure patrol point asNote t= =%>，/>=0, v is null;
(2) Checking all patrol points from t to S-VDistance of (1), set->=min[/>,/>+/>]，/>Is the point t to->Is a direct connection distance of (2);
(3) Selecting the next patrol point, and selecting from S-VMinimum corresponding patrol point +.>，/>A patrol point selected as the shortest path is put into the set V;
(4) Searching forBefore patrol point of (2)>；
(5) Checking whether S-V is empty, if so, the algorithm ends, otherwise t=Repeating the steps 2-4;
(6) A shortest patrol path is obtained to patrol the target jurisdiction.
In addition, in order to achieve the above object, the present invention also provides an apparatus for generating an urban management patrol scheme, including:
the acquisition module is used for acquiring historical event data and determining a hot spot area according to the historical event data;
the overlapping module is used for overlapping the hot spot area with the target jurisdiction area and taking the overlapping area in the overlapping area as a key patrol area;
the extraction module is used for determining all patrol areas in the target jurisdiction area based on the key patrol areas and extracting patrol points in the all patrol areas;
the importing module is used for importing a road network and patrol points of the target jurisdiction area by using a GIS tool to generate a virtual reference point network;
and the generation module is used for generating the shortest patrol path of the target jurisdiction area by using Dijkstra algorithm according to the virtual reference point network.
In addition, in order to achieve the above object, the present invention also provides an urban management patrol scheme generating device, comprising: the system comprises a memory, a processor and a city management patrol scheme generating program which is stored in the memory and can run on the processor, wherein the city management patrol scheme generating program realizes the steps of the city management patrol scheme generating method when being executed by the processor.
In addition, in order to achieve the above object, the present invention also provides a storage medium having stored thereon a city management patrol scheme generating program, which when executed by a processor, implements the steps of the above-described city management patrol scheme generating method.
The invention has the beneficial effects that: a method, a device, equipment and a storage medium for generating a city management patrol scheme are provided, and the factors such as time, road, distance, running speed and the like are considered and optimized on the basis aiming at the business requirement of city management patrol scheduling. By using the network analysis module in the ArcGIS, the patrol path scene is effectively simulated, and the Dijkstra algorithm is combined to optimize the optimal path, so that higher work execution efficiency can be realized with the least time cost during patrol.
Drawings
FIG. 1 is a schematic diagram of a device structure of a hardware operating environment according to an embodiment of the present invention;
FIG. 2 is a schematic flow chart of an embodiment of a method for generating a city management patrol scheme of the present invention;
fig. 3 is a block diagram of a device for generating an urban management patrol scheme according to an embodiment of the invention.
The achievement of the objects, functional features and advantages of the present invention will be further described with reference to the accompanying drawings, in conjunction with the embodiments.
Detailed Description
It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
The present invention will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
Referring to fig. 1, fig. 1 is a schematic diagram of an apparatus structure of a hardware running environment according to an embodiment of the present invention.
As shown in fig. 1, the apparatus may include: a processor 1001, such as a CPU, a communication bus 1002, a user interface 1003, a network interface 1004, and a memory 1005. Wherein the communication bus 1002 is used to enable connected communication between these components. The user interface 1003 may include a Display, an input unit such as a Keyboard (Keyboard), and the optional user interface 1003 may also include a standard wired interface, a wireless interface. The network interface 1004 may optionally include a standard wired interface, a wireless interface (e.g., WI-FI interface). The memory 1005 may be a high-speed RAM memory or a stable memory (non-volatile memory), such as a disk memory. The memory 1005 may also optionally be a storage device separate from the processor 1001 described above.
It will be appreciated by those skilled in the art that the arrangement of the apparatus shown in fig. 1 is not limiting and may include more or fewer components than shown, or certain components may be combined, or a different arrangement of components.
As shown in fig. 1, an operating system, a network communication module, a user interface module, and a city management patrol scheme generation program may be included in a memory 1005 as one type of computer storage medium.
In the terminal shown in fig. 1, the network interface 1004 is mainly used for connecting to a background server and performing data communication with the background server; the user interface 1003 is mainly used for connecting a client (user side) and performing data communication with the client; and the processor 1001 may be configured to call the city management patrol scheme generation program stored in the memory 1005 and perform the following operations:
acquiring historical event data, and determining a hot spot area according to the historical event data;
overlapping the hot spot area with the target jurisdiction area, and taking the overlapping area in the overlapping area as a key patrol area;
based on the key patrol areas, determining all patrol areas in the target jurisdiction area, and extracting patrol points in all patrol areas;
importing a road network and patrol points of the target jurisdiction area by using a GIS tool to generate a virtual reference point network;
and generating the shortest patrol path of the target jurisdiction by using Dijkstra algorithm according to the virtual reference point network.
The specific embodiment of the present invention applied to the apparatus is basically the same as each embodiment of the following method for generating the urban management patrol scheme, and will not be described herein.
The embodiment of the invention provides a method for generating an urban management patrol scheme, and referring to fig. 2, fig. 2 is a flow diagram of an embodiment of the method for generating the urban management patrol scheme.
In this embodiment, the method for generating the urban management patrol scheme includes the following steps:
s100: acquiring historical event data, and determining a hot spot area according to the historical event data;
s200: overlapping the hot spot area with the target jurisdiction area, and taking the overlapping area in the overlapping area as a key patrol area;
s300: based on the key patrol areas, determining all patrol areas in the target jurisdiction area, and extracting patrol points in all patrol areas;
s400: importing a road network and patrol points of the target jurisdiction area by using a GIS tool to generate a virtual reference point network;
s500: and generating the shortest patrol path of the target jurisdiction by using Dijkstra algorithm according to the virtual reference point network.
In a preferred embodiment, the step of acquiring historical event data and determining a hot spot area according to the historical event data specifically includes: acquiring historical event data, and extracting the position coordinates of each event in the historical event data; determining an associated region of the position coordinates as a hot spot region based on the position coordinates of each event; each hot spot area is an area formed by the position coordinates corresponding to each event in a preset distance range.
In a preferred embodiment, the step of overlapping the hot spot area with the target jurisdiction area and taking the overlapping area in the overlapping area as the key patrol area specifically includes: and carrying out region superposition on the hot spot region and the target jurisdiction region, and taking the whole region formed by the regions with the same position coordinates as a key patrol region.
In a preferred embodiment, the step of determining all patrol areas in the target jurisdiction based on the key patrol areas specifically includes: calculating a probability density function of the target jurisdiction by using KDE kernel density estimation, and generating all patrol areas in the target jurisdiction;
the expression of KDE kernel density estimation specifically comprises:
；
where f (X) is an estimate of the probability density f, N is the number of samples in the dataset, H is the average number of samples, X i Is the ith sample, h is bandwidth, and K is kernel function;
wherein, the Gaussian kernel function used by K is in the form of:
；
where u is an intermediate variable.
In a preferred embodiment, the step of extracting patrol points in the whole patrol area specifically includes: extracting important attention areas in the whole patrol areas; wherein the important attention area is a preset type area; and taking the intersection point of the gateway of the important attention area and the adjacent roads as a patrol point in the whole patrol area. In practice, the predetermined type of area includes one or more of a retail business area, a living area, a attraction area, a bus stop, and a parking area.
In a preferred embodiment, the step of importing the road network and patrol points of the target jurisdiction by using the GIS tool to generate the virtual reference point network specifically includes: a GIS tool is used for guiding in a road network and patrol points of a target jurisdiction area, and patrol weight quantized values of each road section between a patrol starting point and each patrol point are calculated; generating a virtual reference point network according to patrol weight quantized values of each road section;
the expression for calculating the patrol weight quantized value of each road section is specifically as follows:
；
wherein,for time weight, according to peak time, off-peak timePeriod and actual traffic conditions are set respectively, +.>Setting the speed weight according to the speed limit of different road sections and the actual speed condition>For the weight of the road block, if there is an emergency or road block on the road section, setting it to a value other than 0, otherwise, 0,/or->The distance weight of the road section is represented by t, the traffic time of the road section is represented by s, v, the speed of the road section is represented by m/s, c is represented by whether the road section has a sudden roadblock, 1 is represented by the existence, 0 is represented by the absence, and d is represented by the length of the road section and is represented by m.
In a preferred embodiment, the step of generating the shortest patrol path of the target jurisdiction according to the virtual reference point network by using Dijkstra algorithm specifically includes:
let S= {1,2, …, P } be the set of all candidate patrol points of the virtual reference point network, each patrol point has a pair of labels #,/>)；/>For +.>To patrol point->The shortest path length between the two; />To be from->To->Is +.>A patrol point preceding the point;
(1) Setting an initial value to set a departure patrol point asNote t= =%>，/>=0, v is null;
(2) Checking all patrol points from t to S-VDistance of (1), set->=min[/>,/>+/>]，/>Is the point t to->Is a direct connection distance of (2);
(3) Selecting the next patrol point, and selecting from S-VMinimum corresponding patrol point +.>，/>A patrol point selected as the shortest path is put into the set V;
(4) Searching forBefore patrol point of (2)>；
(5) Checking whether S-V is empty, if so, the algorithm ends, otherwise t=Repeating the steps 2-4;
(6) A shortest patrol path is obtained to patrol the target jurisdiction.
In this embodiment, a method for generating an urban management patrol scheme is provided, and factors such as time, road, distance, driving speed and the like are considered and optimized on the basis of the service requirement of urban management patrol scheduling. By using the network analysis module in the ArcGIS, the patrol path scene is effectively simulated, and the Dijkstra algorithm is combined to optimize the optimal path, so that higher work execution efficiency can be realized with the least time cost during patrol.
Referring to fig. 3, fig. 3 is a block diagram illustrating an embodiment of an apparatus for generating an urban management patrol scheme according to the present invention.
As shown in fig. 3, the device for generating the urban management patrol scheme according to the embodiment of the present invention includes:
the acquisition module 10 is used for acquiring historical event data and determining a hot spot area according to the historical event data;
the superposition module 20 is configured to perform region superposition on the hotspot region and the target jurisdiction region, and take the superposition region in the superposition region as a key patrol region;
an extraction module 30, configured to determine all patrol areas in the target jurisdiction based on the key patrol areas, and extract patrol points in the all patrol areas;
an importing module 40, configured to import the road network and the patrol points of the target jurisdiction using the GIS tool, and generate a virtual reference point network;
a generating module 50, configured to generate, according to the virtual reference point network, a shortest patrol path of the target jurisdiction using Dijkstra algorithm.
Other embodiments or specific implementation manners of the device for generating the urban management patrol scheme of the present invention may refer to the above method embodiments, and are not described herein again.
In addition, the invention also provides a city management patrol scheme generating device, which comprises: the system comprises a memory, a processor and a city management patrol scheme generating program which is stored in the memory and can run on the processor, wherein the city management patrol scheme generating program realizes the steps of the city management patrol scheme generating method when being executed by the processor.
The specific implementation manner of the device for generating the urban management patrol scheme is basically the same as the above embodiments of the method for generating the urban management patrol scheme, and is not repeated here.
Furthermore, the invention also provides a readable storage medium, which comprises a computer readable storage medium, and the city management patrol scheme generating program is stored on the computer readable storage medium. The readable storage medium may be a Memory 1005 in the terminal of fig. 1, or may be at least one of a ROM (Read-Only Memory)/RAM (Random Access Memory ), a magnetic disk, and an optical disk, and the readable storage medium includes several instructions for causing a device for generating a patrol scheme for urban management with a processor to execute the method for generating a patrol scheme for urban management according to the embodiments of the present invention.
The specific implementation manner of the readable storage medium in the present application is basically the same as the above embodiments of the method for generating the urban management patrol scheme, and will not be described herein again.
It is appreciated that in the description herein, reference to the terms "one embodiment," "another embodiment," "other embodiments," or "first through nth embodiments," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or system that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or system. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or system that comprises the element.
The foregoing embodiment numbers of the present invention are merely for the purpose of description, and do not represent the advantages or disadvantages of the embodiments.
From the above description of the embodiments, it will be clear to those skilled in the art that the above-described embodiment method may be implemented by means of software plus a necessary general hardware platform, but of course may also be implemented by means of hardware, but in many cases the former is a preferred embodiment. Based on such understanding, the technical solution of the present invention may be embodied essentially or in a part contributing to the prior art in the form of a software product stored in a storage medium (e.g. ROM/RAM, magnetic disk, optical disk) as described above, comprising instructions for causing a terminal device (which may be a mobile phone, a computer, a server, an air conditioner, or a network device, etc.) to perform the method according to the embodiments of the present invention.
The foregoing description is only of the preferred embodiments of the present invention, and is not intended to limit the scope of the invention, but rather is intended to cover any equivalents of the structures or equivalent processes disclosed herein or in the alternative, which may be employed directly or indirectly in other related arts.
Claims (9)
1. The city management patrol scheme generating method is characterized by comprising the following steps:
acquiring historical event data, and determining a hot spot area according to the historical event data;
overlapping the hot spot area with the target jurisdiction area, and taking the overlapping area in the overlapping area as a key patrol area;
based on the key patrol areas, determining all patrol areas in the target jurisdiction area, and extracting patrol points in all patrol areas;
importing a road network and patrol points of the target jurisdiction area by using a GIS tool to generate a virtual reference point network; the method specifically comprises the following steps:
a GIS tool is used for guiding in a road network and patrol points of a target jurisdiction area, and patrol weight quantized values of each road section between a patrol starting point and each patrol point are calculated;
generating a virtual reference point network according to patrol weight quantized values of each road section;
the expression for calculating the patrol weight quantized value of each road section is specifically as follows:
；
wherein,for the time weight, setting the ++each according to the peak period, off-peak period and actual traffic condition>Setting the speed weight according to the speed limit of different road sections and the actual speed condition>For the weight of the road block, if there is an emergency or road block on the road section, setting it to a value other than 0, otherwise, 0,/or->The distance weight of the road section is t, the traffic time of the road section is s, v is the speed of the road section, m/s, c is whether the road section has a sudden roadblock, 1 is no, 0 is no, and d is the length of the road section, and m is the unit;
and generating the shortest patrol path of the target jurisdiction by using Dijkstra algorithm according to the virtual reference point network.
2. The method for generating a city management patrol scheme as recited in claim 1, wherein the step of obtaining historical event data and determining a hot spot area based on the historical event data comprises:
acquiring historical event data, and extracting the position coordinates of each event in the historical event data;
determining an associated region of the position coordinates as a hot spot region based on the position coordinates of each event; each hot spot area is an area formed by the position coordinates corresponding to each event in a preset distance range.
3. The method for generating a city management patrol scheme as claimed in claim 2, wherein the step of overlapping the hot spot area with the target jurisdiction area and taking the overlapping area in the overlapping area as the key patrol area specifically comprises: and carrying out region superposition on the hot spot region and the target jurisdiction region, and taking the whole region formed by the regions with the same position coordinates as a key patrol region.
4. The method for generating a city management patrol scheme as recited in claim 1, wherein the step of determining all patrol areas in the target jurisdiction based on the accent patrol areas comprises:
calculating a probability density function of the target jurisdiction by using KDE kernel density estimation, and generating all patrol areas in the target jurisdiction;
the expression of KDE kernel density estimation specifically comprises:
；
wherein,probability density function, N is the number of samples in the dataset, H is the average number of samples, X i Is the ith sample, h is bandwidth, and K is kernel function;
wherein, the Gaussian kernel function used by K is in the form of:
；
where u is an intermediate variable.
5. The method for generating a city management patrol scheme as recited in claim 4, wherein the step of extracting patrol points in the entire patrol area comprises:
extracting important attention areas in the whole patrol areas; wherein the important attention area is a preset type area;
and taking the intersection point of the gateway of the important attention area and the adjacent roads as a patrol point in the whole patrol area.
6. The method for generating a city management patrol scheme as recited in claim 1, wherein the step of generating a shortest patrol path of the target jurisdiction using Dijkstra algorithm based on the virtual reference point network, comprises:
let s= {1,2, …, P } be the set of all candidate patrol points of the virtual reference point network, each patrol pointIs provided with a pair of marks,/>)；/>For +.>To patrol point->The shortest path length between the two; />To be from->To->Is +.>A patrol point preceding the point;
(1) Setting an initial value to set a departure patrol point asNote t= =%>，/>=0, v is null;
(2) Checking all patrol points from t to S-VDistance of (1), set->=min[/>,/>+/>]，/>Is the point t to->Direct connection distance of->Is from->To the point->Is the shortest path length of (a);
(3) Selecting the next patrol point, and selecting from S-VMinimum corresponding patrol point +.>，/>A patrol point selected as the shortest path is put into the set V;
(4) Searching forBefore patrol point of (2)>；
(5) Checking whether S-V is empty, if so, the algorithm ends, otherwise t=Repeating steps (2) - (4);
(6) A shortest patrol path is obtained to patrol the target jurisdiction.
7. An urban management patrol scheme generating device, comprising:
the acquisition module is used for acquiring historical event data and determining a hot spot area according to the historical event data;
the overlapping module is used for overlapping the hot spot area with the target jurisdiction area and taking the overlapping area in the overlapping area as a key patrol area;
the extraction module is used for determining all patrol areas in the target jurisdiction area based on the key patrol areas and extracting patrol points in the all patrol areas;
the importing module is used for importing a road network and patrol points of the target jurisdiction area by using a GIS tool to generate a virtual reference point network; the method specifically comprises the following steps:
a GIS tool is used for guiding in a road network and patrol points of a target jurisdiction area, and patrol weight quantized values of each road section between a patrol starting point and each patrol point are calculated;
generating a virtual reference point network according to patrol weight quantized values of each road section;
the expression for calculating the patrol weight quantized value of each road section is specifically as follows:
；
wherein,for the time weight, setting the ++each according to the peak period, off-peak period and actual traffic condition>Setting the speed weight according to the speed limit of different road sections and the actual speed condition>For the weight of the road block, if there is an emergency or road block on the road section, setting it to a value other than 0, otherwise, 0,/or->The distance weight of the road section is t, the traffic time of the road section is s, v is the speed of the road section, m/s, c is whether the road section has a sudden roadblock, 1 is no, 0 is no, and d is the length of the road section, and m is the unit;
and the generation module is used for generating the shortest patrol path of the target jurisdiction area by using Dijkstra algorithm according to the virtual reference point network.
8. An urban management patrol scheme generating device, characterized in that the urban management patrol scheme generating device comprises: a memory, a processor and a city management patrol scheme generation program stored on the memory and executable on the processor, the city management patrol scheme generation program, when executed by the processor, implementing the steps of the city management patrol scheme generation method of any of claims 1-6.
9. A storage medium, wherein the storage medium has stored thereon a city management patrol scheme generation program that, when executed by a processor, implements the steps of the city management patrol scheme generation method of any of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410099583.1A CN117635401B (en) | 2024-01-24 | 2024-01-24 | City management patrol scheme generation method, device, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410099583.1A CN117635401B (en) | 2024-01-24 | 2024-01-24 | City management patrol scheme generation method, device, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117635401A CN117635401A (en) | 2024-03-01 |
| CN117635401B true CN117635401B (en) | 2024-04-12 |
Family
ID=90030738
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410099583.1A Active CN117635401B (en) | 2024-01-24 | 2024-01-24 | City management patrol scheme generation method, device, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117635401B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109740798A (en) * | 2018-12-17 | 2019-05-10 | 中国人民公安大学 | It is a kind of based on road network police service patrol interrogate and examine method for optimizing route |
| CN114819254A (en) * | 2022-03-07 | 2022-07-29 | 迪爱斯信息技术股份有限公司 | Intelligent planning method and system for police patrol route |
| CN115292432A (en) * | 2022-08-01 | 2022-11-04 | 哈尔滨海邻科信息技术有限公司 | Patrol route determining method and device, computer equipment and storage medium |
| CN116050775A (en) * | 2023-02-03 | 2023-05-02 | 公安部第三研究所 | Method, device, processor and readable storage medium for realizing patrol, prevention and control and resident service route design based on space kernel density algorithm |
| CN116168517A (en) * | 2022-12-22 | 2023-05-26 | 西南技术物理研究所 | Beidou-based warning system and method for off-route between patrol personnel and vehicle |
| EP4273769A1 (en) * | 2022-05-03 | 2023-11-08 | Fundación Tecnalia Research & Innovation | System and method for determining installation of urban infrastructures in urban environments |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9448081B2 (en) * | 2008-06-24 | 2016-09-20 | Tomtom North America, Inc. | Methods and systems for dynamically adaptive road network hierarchy and routing |
| KR101830522B1 (en) * | 2016-08-22 | 2018-02-21 | 가톨릭대학교 산학협력단 | Method for predicting crime occurrence of prediction target region using big data |
-
2024
- 2024-01-24 CN CN202410099583.1A patent/CN117635401B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109740798A (en) * | 2018-12-17 | 2019-05-10 | 中国人民公安大学 | It is a kind of based on road network police service patrol interrogate and examine method for optimizing route |
| CN114819254A (en) * | 2022-03-07 | 2022-07-29 | 迪爱斯信息技术股份有限公司 | Intelligent planning method and system for police patrol route |
| EP4273769A1 (en) * | 2022-05-03 | 2023-11-08 | Fundación Tecnalia Research & Innovation | System and method for determining installation of urban infrastructures in urban environments |
| CN115292432A (en) * | 2022-08-01 | 2022-11-04 | 哈尔滨海邻科信息技术有限公司 | Patrol route determining method and device, computer equipment and storage medium |
| CN116168517A (en) * | 2022-12-22 | 2023-05-26 | 西南技术物理研究所 | Beidou-based warning system and method for off-route between patrol personnel and vehicle |
| CN116050775A (en) * | 2023-02-03 | 2023-05-02 | 公安部第三研究所 | Method, device, processor and readable storage medium for realizing patrol, prevention and control and resident service route design based on space kernel density algorithm |
Non-Patent Citations (4)
| Title |
|---|
| GIS在公共安全领域的应用;张静 等;《地理信息世界》;20060830(04);53-58 * |
| Using geographical information systems to organize police patrol routes effectively by grouping hotspots of crash and crime data;Pei-Fen Kuo 等;《 Journal of Transport Geography》;20130615;第30卷;138-148 * |
| 城市智慧安全保障***的研究与实现;王星捷 等;《计算机技术与发展》;20200910;第30卷(第09期);127-131 * |
| 大数据背景下的警察巡逻路径规划模型构建;刘莹 等;《中国刑警学院学报》;20200620(03);101-107 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117635401A (en) | 2024-03-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4032126B1 (en) | Mobile object position estimation system and mobile object position estimation method | |
| US20180045525A1 (en) | Systems and Methods for Predicting Vehicle Fuel Consumption | |
| CN104683405A (en) | Method and device for distributing map matching task by cluster server in Internet of Vehicles | |
| CN104599002B (en) | Method and equipment for predicting order value | |
| CN112163446B (en) | Obstacle detection method and device, electronic equipment and storage medium | |
| CN115988421A (en) | Time weight clustering-based occupational and residential area estimation method and device | |
| CN109389848B (en) | Vehicle networking real-time analysis system based on HASH | |
| MacDonald et al. | Modelling electric vehicle charging network capacity and performance during short-notice evacuations | |
| CN109308538A (en) | Conclusion of the business conversion ratio prediction technique and device | |
| CN107655490B (en) | Hot spot path discovery method based on mobile user track segmentation and hottest search | |
| CN117635401B (en) | City management patrol scheme generation method, device, equipment and storage medium | |
| CN111651664A (en) | Accident vehicle positioning method and device based on accident position point, storage medium and terminal | |
| CN111831764A (en) | Method and device for determining stop station, electronic equipment and medium | |
| Ben Chaabene et al. | A roadside unit placement scheme for vehicular ad-hoc networks | |
| CN111626589A (en) | Siltation area determination method and device and vehicle scheduling method and device | |
| CN111898624B (en) | Method, device, equipment and storage medium for processing positioning information | |
| CN115861939B (en) | Method, device, equipment and storage medium for inquiring vehicles in the same race | |
| US11812331B2 (en) | Method and apparatus for map query and electronic device | |
| CN112749822B (en) | Method and device for generating route | |
| CN111586160B (en) | Data processing method, device, data processing equipment and storage medium | |
| CN111984856A (en) | Information pushing method and device, server and computer readable storage medium | |
| CN112197785B (en) | Travel route generation method, travel route generation device, mobile carrier, and storage medium | |
| Unsal et al. | Optimization of dynamic school bus routing problem by using metaheuristic and clustering methods | |
| CN115119253B (en) | Method, device and equipment for monitoring regional pedestrian flow and determining monitoring parameters | |
| CN116129653B (en) | Bayonet vehicle detection method, device, equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |