CN109118007A - Paths planning method, device, electronic equipment and storage medium - Google Patents
Paths planning method, device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN109118007A CN109118007A CN201810953598.4A CN201810953598A CN109118007A CN 109118007 A CN109118007 A CN 109118007A CN 201810953598 A CN201810953598 A CN 201810953598A CN 109118007 A CN109118007 A CN 109118007A
- Authority
- CN
- China
- Prior art keywords
- alert data
- coordinate points
- alert
- densely distributed
- time
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
Abstract
The present invention relates to paths planning method, device, electronic equipment and storage mediums, belong to technical field of data processing.The described method includes: obtaining the alert data occurred in preset time period；The first spatially densely distributed alert data are filtered out from the alert data；The second densely distributed in time alert data are filtered out from the first alert data；Path planning is carried out to the second alert data based on preset rules, obtains program results.The emphasis when and where that the method occurs according to previous different classes of alert, cook up a plurality of police's patrol route, and then police strength can be arranged to important alert or preventable alert according to obtained patrol route in advance, the scheduling of police strength is maximumlly carried out in the case high-incidence time.
Description
Technical field
The present invention relates to technical field of data processing, in particular to paths planning method, device, electronic equipment and
Storage medium.
Background technique
There is a large amount of alert in each city daily, and the classification that alert occurs has certain over time and space
Rule needs to arrange police strength in advance for some important alerts or preventable alert, currently, for the pre- of emphasis alert
The anti-experience for depending on police, therefore the scheduling of police strength cannot be maximumlly carried out in the case high-incidence time.
Summary of the invention
In consideration of it, the purpose of the present invention is to provide a kind of paths planning method, device, electronic equipment and storage medium,
To effectively improve the above problem.
The embodiment of the present invention is achieved in that
In a first aspect, present embodiments providing a kind of paths planning method, comprising: obtain the police occurred in preset time period
Feelings data；The first spatially densely distributed alert data are filtered out from the alert data；From the first alert number
The second densely distributed in time alert data are filtered out in；Road is carried out to the second alert data based on preset rules
Diameter planning, obtains program results.In the present embodiment, by obtaining the alert data occurred in the past, then sieved from alert data
The first spatially densely distributed alert data are selected, then are filtered out from the first alert data densely distributed in time
Second alert data finally carry out path planning to the second alert data based on preset rules, obtain program results, in turn
A plurality of police's patrol route can be obtained according to program results, police is arranged in advance for important alert or preventable alert
Power maximumlly carries out the scheduling of police strength in the case high-incidence time.
The technical solution provided with reference to the above first aspect, it is described from the alert in some possible implementations
The first spatially densely distributed alert data are filtered out in data, comprising: turn the corresponding longitude and latitude of the alert data
Change the coordinate points in two-dimensional coordinate system into；Filtered out from the coordinate points according to default DBSCAN algorithm be spatially distributed it is close
First coordinate points of collection；Corresponding first alert data are obtained based on first coordinate points.
The technical solution provided with reference to the above first aspect, it is described from described first in some possible implementations
The second densely distributed in time alert data are filtered out in alert data, comprising: the first alert data are corresponding
Time conversion is at the coordinate points on unit circle；It is filtered out from the coordinate points on the unit circle according to default DBSCAN algorithm
The second densely distributed coordinate points on time；Corresponding second alert data are obtained based on second coordinate points.
The technical solution provided with reference to the above first aspect, it is described by described first in some possible implementations
The corresponding time conversion of alert data includes: by the corresponding time conversion of the first alert data at the coordinate points on unit circle
At number of seconds；The number of seconds is converted into the coordinate points on unit circle according to the conversion formula of preset number of seconds and degree.
The technical solution provided with reference to the above first aspect, it is described based on default rule in some possible implementations
Path planning then is carried out to the second alert data, comprising: based on the ant group algorithm with time window to the second alert number
According to progress path planning.
Second aspect, the embodiment of the invention provides a kind of path planning apparatus, comprising: obtains module, the first screening mould
Block, the second screening module and planning module；Module is obtained, for obtaining the alert data occurred in preset time period；First
Screening module, for filtering out the first spatially densely distributed alert data from the alert data；Second screening mould
Block, for filtering out the second densely distributed in time alert data from the first alert data；Planning module is used for
Path planning is carried out to the second alert data based on preset rules, obtains program results.
In conjunction with the technical solution that above-mentioned second aspect provides, in some possible implementations, the first screening mould
Block is also used to the coordinate points being converted into the alert data corresponding longitude and latitude in two-dimensional coordinate system；And it is also used to basis
Default DBSCAN algorithm filters out the first spatially densely distributed coordinate points from the coordinate points；And it is also used to be based on
First coordinate points obtain corresponding first alert data.
In conjunction with the technical solution that above-mentioned second aspect provides, in some possible implementations, the second screening mould
Block is also used to the corresponding time conversion of the first alert data into the coordinate points on unit circle；And it is also used to according to pre-
If DBSCAN algorithm filters out the second densely distributed in time coordinate points from the coordinate points on the unit circle；And also
For obtaining corresponding second alert data based on second coordinate points.
In conjunction with the technical solution that above-mentioned second aspect provides, in some possible implementations, the second screening mould
Block is also used to the corresponding time conversion of the first alert data into number of seconds；And it is also used to according to preset number of seconds and degree
The number of seconds is converted into the coordinate points on unit circle by several conversion formulas.
In conjunction with the technical solution that above-mentioned second aspect provides, in some possible implementations, the planning module, also
For carrying out path planning to the second alert data based on the ant group algorithm with time window.
The third aspect, the embodiment of the present invention provide a kind of electronic equipment, comprising: processor and memory, the processor
It is coupled with the memory.The memory is for storing program.The processor is for calling storage in the memory
Program, execute above-mentioned first aspect embodiment and/or some possible implementations under embodiment mention with reference to first aspect
The paths planning method of confession.
Fourth aspect is stored with computer journey the embodiment of the invention provides a kind of storage medium on the storage medium
Sequence, the computer program execute above-mentioned first aspect embodiment and/or implement with reference to first aspect when being run by processor
The paths planning method that some possible implementations under example provide.
Detailed description of the invention
In order to illustrate the technical solution of the embodiments of the present invention more clearly, below will be to needed in the embodiment attached
Figure is briefly described, it should be understood that the following drawings illustrates only certain embodiments of the present invention, therefore is not construed as pair
The restriction of range for those of ordinary skill in the art without creative efforts, can also be according to this
A little attached drawings obtain other relevant attached drawings.
Fig. 1 is the structural block diagram of a kind of electronic equipment provided in an embodiment of the present invention；
Fig. 2 is a kind of method flow diagram of paths planning method provided in an embodiment of the present invention；
Fig. 3 is a kind of method flow diagram for obtaining step S202 in Fig. 2 provided in an embodiment of the present invention；
Fig. 4 is the cluster result schematic diagram of alert data provided in an embodiment of the present invention spatially；
Fig. 5 is a kind of method flow diagram for obtaining step S203 in Fig. 4 provided in an embodiment of the present invention；
Fig. 6 is a kind of method flow diagram for obtaining step S401 in Fig. 4 provided in an embodiment of the present invention.
Fig. 7 is the cluster result schematic diagram of the first alert data provided in an embodiment of the present invention in time.
Fig. 8 is a kind of functional block diagram of path planning apparatus provided in an embodiment of the present invention.
Specific embodiment
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.The present invention being usually described and illustrated herein in the accompanying drawings is implemented
The component of example can be arranged and be designed with a variety of different configurations.
Therefore, the detailed description of the embodiment of the present invention provided in the accompanying drawings is not intended to limit below claimed
The scope of the present invention, but be merely representative of selected embodiment of the invention.Based on the embodiments of the present invention, this field is common
Technical staff's every other embodiment obtained without creative efforts belongs to the model that the present invention protects
It encloses.
It should also be noted that similar label and letter indicate similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined in a attached drawing, does not then need that it is further defined and explained in subsequent attached drawing.
In the description of the embodiment of the present invention, term " first ", " second ", " third " etc. are only used for distinguishing description, without
It can be interpreted as indication or suggestion relative importance.
These are only the preferred embodiment of the present invention, is not intended to restrict the invention, for those skilled in the art
For member, the invention may be variously modified and varied.All within the spirits and principles of the present invention, it is made it is any modification,
Equivalent replacement, improvement etc., should all be included in the protection scope of the present invention.
As shown in Figure 1, Fig. 1 shows the structural block diagram of a kind of electronic equipment 100 provided in an embodiment of the present invention.The electricity
Sub- equipment 100 includes: path planning apparatus 110, memory 120, storage control 130 and processor 140.
The memory 120, storage control 130, each element of processor 140 directly or indirectly electrically connect between each other
It connects, to realize the transmission or interaction of data.For example, these elements can pass through one or more communication bus or signal between each other
Line, which is realized, to be electrically connected.The path planning apparatus 110 includes at least one can be in the form of software or firmware (firmware)
It is stored in the memory 120 or is solidificated in the operating system (operating system, OS) of the electronic equipment 100
Software function module.The processor 140 is for executing the executable module stored in memory 120, such as described image
The software function module or computer program that processing unit 110 includes.
Wherein, memory 120 may be, but not limited to, random access memory (Random Access Memory,
RAM), read-only memory (Read Only Memory, ROM), programmable read only memory (Programmable Read-
Only Memory, PROM), erasable read-only memory (Erasable Programmable Read-Only Memory,
EPROM), electricallyerasable ROM (EEROM) (Electric Erasable Programmable Read-Only Memory,
EEPROM) etc..Wherein, memory 120 is for storing program, and the processor 140 is after receiving and executing instruction, described in execution
Program, method performed by the electronic equipment 100 for the flow definition that aftermentioned any embodiment of the embodiment of the present invention discloses can answer
It is realized in processor 140, or by processor 140.
Processor 140 may be a kind of IC chip, the processing capacity with signal.Above-mentioned processor can be
General processor, including central processing unit (Central Processing Unit, CPU), network processing unit (Network
Processor, NP) etc.；It can also be digital signal processor (DSP), specific integrated circuit (ASIC), ready-made programmable gate array
Arrange (FPGA) either other programmable logic device, discrete gate or transistor logic, discrete hardware components.It may be implemented
Or disclosed each method, step and logic diagram in the execution embodiment of the present invention.General processor can be microprocessor
Or the processor is also possible to any conventional processor etc..
Referring to Fig. 2, Fig. 2 is a kind of flow diagram of paths planning method provided in an embodiment of the present invention.The side
Method includes: step S201-S204.
Step S201: the alert data occurred in preset time period are obtained.
Specifically, according to a city or one is chosen in a certain year or some moon in the database of previous public security
Various types of other alert data that region occurs.For example, choosing 2017, this year occurs in all types of of Chaoyang District Beijing
Alert data, wherein the alert data are made of a lot of alert events comprising incident when and where.
Wherein, it should be noted that above-mentioned preset time period is set according to actual needs, for example, it may be in the past
One month, three months, half a year etc., therefore above-mentioned example cannot be understood as being the limitation to the application.
Step S202: the first spatially densely distributed alert data are filtered out from the alert data.
After obtaining history alert data, first time screening is carried out by the alert data of above-mentioned acquisition, screening for the first time is
Based on screening spatially, spatially densely distributed data, as the first alert data are filtered out.
As an alternative embodiment, can be carried out by step shown in Fig. 3 to the above process (step S202)
Explanation.
Step S301: the corresponding longitude and latitude of the alert data is converted into the coordinate points in two-dimensional coordinate system.
The longitude and latitude of point on earth spatially that alert is occurred is by conversion, the seat being converted into two-dimensional coordinate system
Punctuate, the conversion method can be a kind of mode of projection, optionally, be projected with Miller by the corresponding warp of the alert data
Latitude is converted into the coordinate points in two-dimensional coordinate system, it is to be appreciated that and the projection pattern is also possible to other modes, than
Such as Mercator projection, Gaüss-Krüger projection etc..Table 1 is please referred to, table 1 indicates the alert data of ten one place, according to acquisition
Alert data by coordinate points of ten one place with Miller projection lenses into two-dimensional coordinate system in table 1.
Table 1
S302: the first spatially densely distributed coordinate is filtered out from the coordinate points according to default DBSCAN algorithm
Point.
After obtaining corresponding coordinate points according to the corresponding longitude and latitude of the alert data, calculated according to DBSCAN set in advance
Method can filter out the first spatially densely distributed coordinate points from the coordinate points.
Wherein, the DBSCAN algorithm is obtained according to the concentration of the coordinate points in above-mentioned two-dimensional coordinate system based on close
The cluster of degree；To obtain the set of the big point of density as the first coordinate points, the relatively point of dispersion or apart from too far point just
It excludes.Referring to Fig. 4, Fig. 4 is the cluster result figure of alert data provided in an embodiment of the present invention spatially, according to Fig. 4 institute
Show, the region of this four points of the region He point 6-9 of this five points of point 1-5 is more intensive so passing through the point of DBSCAN algorithm arrived
The region of this four points of the region He point 6-9 of this five points of 1-5 is the first coordinate points, and point 10 and point 11 are more loose, then excludes.
The collection effectively put is combined into cluster, and the first coordinate points are made of each effective cluster, and point 1-5 means that a cluster.Effective ginseng of cluster
Number is set dynamically according to the distance between two o'clock and minimum samples.Such as point 10 and 11 distance have exceeded it is preset away from
From, then put 10 and point 11 cannot constitute effective cluster, in pre-determined distance but at this time most such as the distance of fruit dot 10 and point 11
The value of small sample setting is 3, and it is equally that cannot constitute effective cluster that there are two points for point 10 and point 11.That is, passing through setting
The parameter of DBSCAN algorithm, for example, the distance between setting two o'clock and minimum samples, i.e. cocoa are sieved from the coordinate points
Select the first spatially densely distributed coordinate points.
S303: corresponding first alert data are obtained based on first coordinate points.
After obtaining the first spatially densely distributed coordinate points, just obtained according to the first coordinate points each in current region
The first spatially more intensive alert data of place, such as point 1-5 indicate five cells of Chaoyang District, and point 6-9 indicates court
4 markets of Yang Qu, 10 and 11 indicate two parks of Chaoyang Districts, then this five cells are the first alert data, it is corresponding this
Four markets also illustrate that the first alert data, and the two parks then exclude.
Step S203: the second densely distributed in time alert data are filtered out from the first alert data.
After filtering out the first spatially densely distributed alert data in alert data, then from the first of space-intensive
The intensive second alert data of Annual distribution are filtered out in alert data, obtain the alert data of key area emphasis time.
Wherein, as an alternative embodiment, can be as shown in connection with fig. 5 the step of, is to the above process (step S203)
It is illustrated.
Step S401: by the corresponding time conversion of the first alert data at the coordinate points on unit circle.
After obtaining the first alert data, according to corresponding conversion rule, the first alert data corresponding time can be changed
The coordinate points being counted as on unit circle.
As an alternative embodiment, can process as shown in connection with fig. 6 the above process (step S401) is carried out
Illustrate,.
Step S501: by the corresponding time conversion of the first alert data at number of seconds.
As shown in Table 1, the 1 corresponding time of point is 08:04:10, is converted into number of seconds, that is, is converted into 29050 seconds.
Step S502: the number of seconds is converted by the coordinate on unit circle according to the conversion formula of preset number of seconds and degree
Point.
It, can be by the number of seconds according to the conversion formula of preset number of seconds and degree after obtaining the corresponding number of seconds of each event
The coordinate points being converted on unit circle.As an alternative embodiment, the conversion formula of the preset number of seconds and degree, public
Formula is as follows:
For putting the conversion of 1 corresponding second speed, formula is changed by this, the corresponding degree on unit circle can be obtained
Number, and then can be obtained the coordinate points of the point 1 on unit circle, for example, reading is 45 degree, then put 1 the on unit circle
On the circle of the bisector of one quadrant.
It is understood that can also be by corresponding time conversion component number, hourage；Similarly above-mentioned default conversion is public
Formula is also possible to other, for example, the numerical value of denominator becomes larger or becomes smaller, it is same available identical as a result, therefore cannot be into this
Embodiment shown in application is understood as the limitation to above-mentioned conversion rule.
Step S402: it is filtered out from the coordinate points on the unit circle according to default DBSCAN algorithm and is distributed in time
The second intensive coordinate points.
The coordinate points on obtained unit circle are screened by the DBSCAN algorithm, the seat from the unit circle
The second densely distributed in time coordinate points are filtered out in punctuate；Namely the coordinate points being distributed on unit circle are gathered
Class, so that the set for filtering out the big point of density just excludes, referring to Fig. 7, Fig. 7 as the second coordinate points apart from too far point
For the cluster result figure of the first alert data in time, according to Fig.7, the region of point 1-3 is more intensive so passing through
DBSCAN algorithm to point 1-3 be the second coordinate points, point 4 and point 5 then exclude.Wherein, using DBSCAN algorithm from the list
The process that the second densely distributed in time coordinate points are filtered out in coordinate points on circle of position may refer to above-mentioned steps S302
Shown in screening process, similar situation is not illustrated herein.
Step S403: corresponding second alert data are obtained based on second coordinate points.
Corresponding data are obtained according to the second coordinate points, are just obtained densely distributed in time in the first alert data
Two alert data, for example, point 1-3 compares concentration, point 4, and point 5 are more dispersed, such as point 1-3 indicates that these three cells are warned
The time of feelings is at ten four points in afternoon, and 14 thirty and ten five points, the time that point 4 indicates that alert occurs for the 4th cells is afternoon ten
8 points, the time that point 5 indicates that alert occurs for the 5th cell is at 21 points in afternoon, is arranged at ten eight points in afternoon and at 21 points in afternoon
It removes, at ten four points in afternoon, 14 thirty, ten five points are the second alert data.
Step S204: path planning is carried out to the second alert data based on preset rules, obtains program results.
After obtaining the second alert data, path planning is carried out to the second alert data based on preset rules, can be obtained
To program results, and then a plurality of police's patrol route can be obtained according to program results, so as to for important alert or can be with
The alert of prevention arranges police strength in advance, and the scheduling of police strength is maximumlly carried out in the case high-incidence time.
As an alternative embodiment, described carry out path rule to the second alert data based on preset rules
It draws, comprising: path planning is carried out to the second alert data based on the ant group algorithm with time window.Wherein, ant colony is being used
It, should be using the daily work of the every group of police personnel and time of having a rest as constraining when algorithm carries out path planning.
Wherein, it should be noted that above-mentioned preset rules are also possible to other algorithms such as grain for having path function
Swarm optimization, therefore above-mentioned example cannot be understood as being the limitation to the application.
Ant determines shift direction according to the information content on each paths during the motion, and every ant can be felt at it
Information exploration and retention are carried out in the range of knowing, in local environment, which point pheromones are most, just determine with biggish probability
Determine its direction of motion, every ant is all mobile towards the most direction of pheromones, when surrounding does not have pheromones guide,
Ant inertially can move according to the direction that oneself was moved originally, also, have on the direction of movement one random small
Disturbance, to retain original motor memory.If it find that the place for having it to have already passed through, then avoided with greater probability.
If there are barrier on the direction that ant will move, it can randomly choose another direction, or according to pheromones
Guide continue its foraging behavior.In fact, every ant is sowing and perceive and communicated by its pheromones,
Specific rules are diversification, it can distribute most pheromones when finding opposite optimal solution, and as it is walked
Distance it is more and more remoter, the pheromones sowed are fewer and fewer.
According to the movement rule of ant colony, path planning is carried out to the second alert data with ant group algorithm, first with police
Office is initial point, using the point that the point in the second data needs to go as ant colony, selects next point, is continued until all the points knot
Beam, in the case where running first time, ant colony does not start to activity, and pheromones are not present in figure, only exist in the second data
The distance in place, therefore pheromones are inversely proportional with distance in the case where running for the first time, optionally, according to the operation of first time ant colony
Path carries out second and runs, by the iteration of ant colony pheromones, obtains the operating path under the second suboptimization.
For example, being two o'clock-three in afternoon by the time that step has got the three high-incidence alerts in community in Chaoyang District, Beijing City
Between point, an optimal path is got by ant group algorithm at this time.Police will send an inspection troop to go out from police station
Hair is gone on patrol according to this preferred these three community of path access to 3 points in two o'clock, is visited accordingly at this time point
After having asked these three communities, continues to access next region for needing to go on patrol in meeting at a reasonable time, eventually pass back to police station, need
It should be noted that the path planning is to send more groups of police strength simultaneously, within reasonable time to all high-incidence periods
Region is gone on patrol.
Referring to Fig. 8, the embodiment of the present invention also provides a kind of path planning apparatus 110, the path planning apparatus 110 packet
It includes: obtaining module 111, the first screening module 112, the second screening module 113, planning module 114.
Module 111 is obtained to be used to obtain the alert data occurred in preset time period.
First screening module 112 from the alert data for filtering out the first spatially densely distributed alert number
According to.
Second screening module 113 is used to filter out densely distributed in time second from the first alert data alert
Feelings data.
Planning module 114 is used to carry out path planning to the second alert data based on preset rules, obtains planning knot
Fruit.
The embodiment of the present application also provides a kind of storage mediums, are stored thereon with computer program, the computer program
Above-mentioned paths planning method is executed when being run by processor.
It should be noted that all the embodiments in this specification are described in a progressive manner, each embodiment weight
Point explanation is the difference from other embodiments, and the same or similar parts between the embodiments can be referred to each other.
The technical effect of path planning apparatus 110 provided by the embodiment of the present invention, realization principle and generation and aforementioned
Embodiment of the method is identical, and to briefly describe, Installation practice part does not refer to place, can refer to corresponding in preceding method embodiment
Content.
In several embodiments provided herein, it should be understood that disclosed device and method can also pass through
Other modes are realized.The apparatus embodiments described above are merely exemplary, for example, flow chart and block diagram in attached drawing
Show the device of multiple embodiments according to the present invention, the architectural framework in the cards of method and computer program product,
Function and operation.In this regard, each box in flowchart or block diagram can represent the one of a module, section or code
Part, a part of the module, section or code, which includes that one or more is for implementing the specified logical function, to be held
Row instruction.It should also be noted that function marked in the box can also be to be different from some implementations as replacement
The sequence marked in attached drawing occurs.For example, two continuous boxes can actually be basically executed in parallel, they are sometimes
It can execute in the opposite order, this depends on the function involved.It is also noted that every in block diagram and or flow chart
The combination of box in a box and block diagram and or flow chart can use the dedicated base for executing defined function or movement
It realizes, or can realize using a combination of dedicated hardware and computer instructions in the system of hardware.
In addition, each functional module in each embodiment of the present invention can integrate one independent portion of formation together
Point, it is also possible to modules individualism, an independent part can also be integrated to form with two or more modules.
It, can be with if the function is realized and when sold or used as an independent product in the form of software function module
It is stored in a computer readable storage medium.Based on this understanding, technical solution of the present invention is substantially in other words
The part of the part that contributes to existing technology or the technical solution can be embodied in the form of software products, the meter
Calculation machine software product is stored in a storage medium, including some instructions are used so that a computer equipment (can be a
People's computer, server or network equipment etc.) it performs all or part of the steps of the method described in the various embodiments of the present invention.
And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only Memory), arbitrary access
The various media that can store program code such as memory (RAM, Random Access Memory), magnetic or disk.It needs
It is noted that herein, relational terms such as first and second and the like are used merely to an entity or operation
It is distinguished with another entity or operation, without necessarily requiring or implying between these entities or operation, there are any this
Actual relationship or sequence.Moreover, the terms "include", "comprise" or its any other variant are intended to nonexcludability
It include so that the process, method, article or equipment for including a series of elements not only includes those elements, but also to wrap
Include other elements that are not explicitly listed, or further include for this process, method, article or equipment intrinsic want
Element.In the absence of more restrictions, the element limited by sentence "including a ...", it is not excluded that including described want
There is also other identical elements in the process, method, article or equipment of element.
The foregoing is only a preferred embodiment of the present invention, is not intended to restrict the invention, for the skill of this field
For art personnel, the invention may be variously modified and varied.All within the spirits and principles of the present invention, made any to repair
Change, equivalent replacement, improvement etc., should all be included in the protection scope of the present invention.
Claims (10)
1. a kind of paths planning method characterized by comprising
Obtain the alert data occurred in preset time period；
The first spatially densely distributed alert data are filtered out from the alert data；
The second densely distributed in time alert data are filtered out from the first alert data；
Path planning is carried out to the second alert data based on preset rules, obtains program results.
2. the method according to claim 1, wherein described filter out from the alert data is spatially divided
The first intensive alert data of cloth, comprising:
The corresponding longitude and latitude of the alert data is converted into the coordinate points in two-dimensional coordinate system；
The first spatially densely distributed coordinate points are filtered out from the coordinate points according to default DBSCAN algorithm；
Corresponding first alert data are obtained based on first coordinate points.
3. the method according to claim 1, wherein described filter out from the first alert data in the time
Upper the second densely distributed alert data, comprising:
By the corresponding time conversion of the first alert data at the coordinate points on unit circle；
Densely distributed in time second is filtered out from the coordinate points on the unit circle according to default DBSCAN algorithm to sit
Punctuate；
Corresponding second alert data are obtained based on second coordinate points.
4. according to the method described in claim 3, it is characterized in that, described by the corresponding time conversion of the first alert data
At the coordinate points on unit circle, comprising:
By the corresponding time conversion of the first alert data at number of seconds；
The number of seconds is converted into the coordinate points on unit circle according to the conversion formula of preset number of seconds and degree.
5. method according to any of claims 1-4, which is characterized in that the preset rules that are based on are to described second
Alert data carry out path planning, comprising:
Path planning is carried out to the second alert data based on the ant group algorithm with time window.
6. a kind of path planning apparatus characterized by comprising
Module is obtained, for obtaining the alert data occurred in preset time period；
First screening module, for filtering out the first spatially densely distributed alert data from the alert data；
Second screening module, for filtering out the second densely distributed in time alert number from the first alert data
According to；
Planning module obtains program results for carrying out path planning to the second alert data based on preset rules.
7. device according to claim 6, which is characterized in that first screening module is also used to the alert number
The coordinate points being converted into according to corresponding longitude and latitude in two-dimensional coordinate system；And it is also used to basis and presets DBSCAN algorithm from the seat
The first spatially densely distributed coordinate points are filtered out in punctuate；And it is also used to be corresponded to based on first coordinate points
The first alert data.
8. device according to claim 6, which is characterized in that second screening module is also used to alert by described first
The corresponding time conversion of feelings data is at the coordinate points on unit circle；And it is also used to basis and presets DBSCAN algorithm from the unit
The second densely distributed in time coordinate points are filtered out in coordinate points on circle；And it is also used to based on second coordinate points
Obtain corresponding second alert data.
9. a kind of electronic equipment characterized by comprising processor and memory, the processor and memory coupling；
The memory is for storing program；
The processor is used to call the program of storage in the memory, executes any one of claim 1-5 institute
The method stated.
10. a kind of storage medium, which is characterized in that be stored thereon with computer program, the computer program is by processor
Method according to any one of claims 1 to 5 is executed when operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810953598.4A CN109118007A (en) | 2018-08-21 | 2018-08-21 | Paths planning method, device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810953598.4A CN109118007A (en) | 2018-08-21 | 2018-08-21 | Paths planning method, device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109118007A true CN109118007A (en) | 2019-01-01 |
Family
ID=64852484
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810953598.4A Pending CN109118007A (en) | 2018-08-21 | 2018-08-21 | Paths planning method, device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109118007A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111784039A (en) * | 2020-06-28 | 2020-10-16 | 中国人民公安大学 | City large-scale activity police force defense deploying method based on dynamic risk assessment |
| CN112540601A (en) * | 2019-09-23 | 2021-03-23 | 江苏美的清洁电器股份有限公司 | Control method, control device, electronic device and storage medium |
| CN114061578A (en) * | 2020-07-30 | 2022-02-18 | 南宁富桂精密工业有限公司 | Indoor positioning path optimization method, electronic device and computer readable storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103336999A (en) * | 2013-06-07 | 2013-10-02 | 同济大学 | Combined traffic evacuation optimization method based on a multi-ant colony algorithm |
| CN104778518A (en) * | 2015-04-30 | 2015-07-15 | 陈牧锋 | Police condition prediction parity data method and device |
| CN107317891A (en) * | 2017-05-10 | 2017-11-03 | 郑州埃文计算机科技有限公司 | A kind of geographic position locating method being distributed towards dynamic IP multizone |
| CN108106624A (en) * | 2017-12-14 | 2018-06-01 | 广东工业大学 | A kind of more people's Dispatch by appointment paths planning methods and relevant apparatus |
| CN108269000A (en) * | 2017-12-22 | 2018-07-10 | 武汉烽火众智数字技术有限责任公司 | Intelligent police deployment method and system based on alert big data space-time analysis |
-
2018
- 2018-08-21 CN CN201810953598.4A patent/CN109118007A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103336999A (en) * | 2013-06-07 | 2013-10-02 | 同济大学 | Combined traffic evacuation optimization method based on a multi-ant colony algorithm |
| CN104778518A (en) * | 2015-04-30 | 2015-07-15 | 陈牧锋 | Police condition prediction parity data method and device |
| CN107317891A (en) * | 2017-05-10 | 2017-11-03 | 郑州埃文计算机科技有限公司 | A kind of geographic position locating method being distributed towards dynamic IP multizone |
| CN108106624A (en) * | 2017-12-14 | 2018-06-01 | 广东工业大学 | A kind of more people's Dispatch by appointment paths planning methods and relevant apparatus |
| CN108269000A (en) * | 2017-12-22 | 2018-07-10 | 武汉烽火众智数字技术有限责任公司 | Intelligent police deployment method and system based on alert big data space-time analysis |
Non-Patent Citations (2)
| Title |
|---|
| 王帅: "犯罪案件时空热点分析研究", 《中国优秀硕士学位论文全文数据库社会科学Ⅰ辑》 * |
| 郑翠: "基于稀疏表示的语音信号欠定盲分离技术研究", 《中国优秀硕士学位论文全文数据库信息科技辑》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112540601A (en) * | 2019-09-23 | 2021-03-23 | 江苏美的清洁电器股份有限公司 | Control method, control device, electronic device and storage medium |
| CN112540601B (en) * | 2019-09-23 | 2022-04-01 | 美智纵横科技有限责任公司 | Control method, control device, electronic device and storage medium |
| CN111784039A (en) * | 2020-06-28 | 2020-10-16 | 中国人民公安大学 | City large-scale activity police force defense deploying method based on dynamic risk assessment |
| CN111784039B (en) * | 2020-06-28 | 2020-12-25 | 中国人民公安大学 | City large-scale activity police force defense deploying method based on dynamic risk assessment |
| CN114061578A (en) * | 2020-07-30 | 2022-02-18 | 南宁富桂精密工业有限公司 | Indoor positioning path optimization method, electronic device and computer readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Parwez et al. | Big data analytics for user-activity analysis and user-anomaly detection in mobile wireless network | |
| Wang et al. | GSNet: Learning spatial-temporal correlations from geographical and semantic aspects for traffic accident risk forecasting | |
| Lee et al. | Measuring geographical regularities of crowd behaviors for Twitter-based geo-social event detection | |
| Andrienko et al. | A visual analytics framework for spatio-temporal analysis and modelling | |
| US10187268B2 (en) | Geographic management system | |
| CN109118007A (en) | Paths planning method, device, electronic equipment and storage medium | |
| CN107305518A (en) | The display methods and device of warning information | |
| Khezerlou et al. | A traffic flow approach to early detection of gathering events: Comprehensive results | |
| US20080126858A1 (en) | Data visualization for diagnosing computing systems | |
| Çalışkan et al. | Urban coherence: a morphological definition | |
| Ali et al. | Persistence and availability of floating content in a campus environment | |
| CN102007782A (en) | Portable telephone information visualizing device, portable telephone information visualizing system, and portable telephone information visualizing method for use in the portable telephone information visualizing device and system | |
| CN101715203B (en) | Method and device for automatically positioning fault points | |
| Furno et al. | Mobile demand profiling for cellular cognitive networking | |
| Crnovrsanin et al. | Staged animation strategies for online dynamic networks | |
| Zinman et al. | Utilizing digital traces of mobile phones for understanding social dynamics in urban areas | |
| EP1936585A1 (en) | Method and apparatus for automatically identifying regions of interest in a digital map | |
| Chen et al. | Recurrent origin–destination network for exploration of human periodic collective dynamics | |
| Yoneki et al. | Distinct types of hubs in human dynamic networks | |
| CN106056515A (en) | Community grid event cluster feature extraction method | |
| Gómez et al. | Hotspot mapping for perception of security | |
| Ye et al. | Hybrid calibration of agent-based travel model using traffic counts and AVI data | |
| US20060101134A1 (en) | Apparatus, method and article of manufacture for visualizing patterns of change and behavior on a compute infrastructure | |
| Yuan et al. | An OSGi-based smart taxi service platform | |
| Cuong et al. | Analyzing Shared Bike Usage Through Graph-Based Spatio-Temporal Modelling |
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 | ||
| CB02 | Change of applicant information |
Address after: Room ER202, East Side of Office Building 2, Renshan Road, Jiangpu Street, Pukou District, Nanjing City, Jiangsu Province, 210000 Applicant after: NANJING ZHONGFU INFORMATION TECHNOLOGY CO., LTD. Address before: 210000 Nanjing Zijin (Pukou) Science and Technology Entrepreneurship Community, Gulou District, Nanjing City, Jiangsu Province, No. 99, Taizhong Road, 3-1 Building C901 Applicant before: NANJING ZHONGFU INFORMATION TECHNOLOGY CO., LTD. |
|
| CB02 | Change of applicant information | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190101 |
|
| RJ01 | Rejection of invention patent application after publication |