CN109815418A - City vehicle range coverage calculation method based on space-time restriction - Google Patents
City vehicle range coverage calculation method based on space-time restriction Download PDFInfo
- Publication number
- CN109815418A CN109815418A CN201910036510.7A CN201910036510A CN109815418A CN 109815418 A CN109815418 A CN 109815418A CN 201910036510 A CN201910036510 A CN 201910036510A CN 109815418 A CN109815418 A CN 109815418A
- Authority
- CN
- China
- Prior art keywords
- track
- point
- road
- angle
- path
- 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.)
- Granted
Links
Landscapes
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The city vehicle range coverage calculation method based on space-time restriction that the invention discloses a kind of, method includes the following steps: being screened to obtain track sets point according to track data collection, to calculate track accessible point according to track sets point；The track covering path that track accessible point will be present is concentrated, and path locus is selected to arrive at the maximum road of number, and boundary point is added and calculates road collection；It calculates the boundary point and calculates the angle that road concentrates all boundary point and inquiry event line and positive direction of the x-axis, the sequence of foundation angle and fillet point, obtain range coverage.This method introduces the constraint of time and track covering path when calculating city vehicle boundary point, it is effectively reduced the calculating of redundancy track data, an important factor for influencing range coverage calculated result query time section is introduced simultaneously, improves the actual effect and accuracy of range coverage.
Description
Technical field
The present invention relates to traffic data digging technology field, in particular to a kind of city vehicle based on space-time restriction is reachable
Region calculation method.
Background technique
Most of existing city vehicle range coverage calculation methods are concentrated on based on area of space query point and boundary point
Space length, set out moment and running time time interval calculating, be not effectively introduced into the influence of query time section,
And in practical applications, the period be usually influence range coverage calculated result an important factor for one of.At the same time, most of
City vehicle range coverage calculation method is not supported to calculate range coverage in the different periods, by our observation,
The different periods, since urban transportation situation is different, the range coverage calculated can be very different, and existing city
City's vehicle range coverage calculation method does not well solve this problem.
Summary of the invention
The present invention is directed to solve at least some of the technical problems in related technologies.
For this purpose, it is an object of the invention to propose a kind of city vehicle range coverage calculation method based on space-time restriction.
In order to achieve the above objectives, the invention proposes the city vehicle range coverage calculation method based on space-time restriction, packets
Include following steps: step S1 screens to obtain track sets point according to track data collection, to calculate rail according to the track sets point
Mark accessible point；Step S2, the track covering path that the track accessible point will be present are concentrated, and select path locus to arrive at number maximum
Road, be added boundary point calculate road collection；Step S3 calculates the boundary point calculating road and concentrates all boundary points and look into
The angle for asking event line and positive direction of the x-axis sorts according to the angle and connects the boundary point, obtains range coverage.
The city vehicle range coverage calculation method based on space-time restriction of the embodiment of the present invention, by calculating city vehicle
The constraint that time and track covering path are introduced when boundary point, is effectively reduced the calculating of redundancy track data；Simultaneously
An important factor for influencing range coverage calculated result query time section is introduced, the actual effect of range coverage is improved；And pass through
Boundary point calculates road collection selection method and selects the track covering path collection for calculating boundary point, according further to road transform angle set and
Path locus arrives at number sieve and selects to inquire event S as the boundary point of center all directions calculating road, in feature modeling road
Road selects K candidate tracks accessible point according to the track arrival number of track accessible point and calculates boundary point, improves accessoble region
The accuracy in domain.
In addition, the city vehicle range coverage calculation method according to the above embodiment of the present invention based on space-time restriction may be used also
With following additional technical characteristic:
Further, in one embodiment of the invention, the step S1 includes: step S101, in track data set
In filter out meet inquiry event space-time restriction track data collection, to constitute the target trajectory collection；Step S102, in institute
It states target trajectory and concentrates the track sets point for filtering out and meeting query time section constraint, to constitute target trajectory segment；Step
S103 remembers sequence point set of the target trajectory segment on road, to generate track accessible point.
Further, in one embodiment of the invention, the step S2 includes: step S201, when the track is covered
For the arbitrary trajectory covering path that lid road is concentrated there are when the track accessible point, note can by track accessible point addition track
It is concentrated up to；Step S202 traverses the track covering path and concentrates any track covering path, zequin and described
Inquire the first angle of event line and positive direction of the x-axis, the of terminal and the inquiry event S line and positive direction of the x-axis
Two angles, wherein the road angle of all track covering paths constitutes road transform angle set, and provides that the first angle is greater than institute
State second angle；Step S203 concentrates selection path locus to arrive at the maximum road of number, side is added in the track covering path
Boundary's point calculates road collection.
Optionally, in one embodiment of the invention, step S204 traverses the road transform angle set, to except the rail
Mark carries out the track covering path up to any road angle except point set and screens, and updates the track covering path collection
Attribute value；Step S205, the track covering path that the track covering path is concentrated are deleted, and by the road angle
Path locus described in collection arrive at the maximum road of number road angle delete, judge the track covering path collection whether be
It is empty.
Further, in one embodiment of the invention, the step S3 includes: step S301, traverses the boundary
Point calculates the track accessible point that road is concentrated, and carries out descending arrangement to the track accessible point according to track arrival is several,
Preceding K track accessible point is selected in sequence as candidate tracks accessible point and is added candidate up to point set；Step S302, according to institute
It states candidate reachable point set and calculates boundary point, and the boundary point is calculated into all boundary points on road collection and constitutes boundary point set；
Step S303 calculates the angle that the boundary point concentrates all boundary point and inquiry the event line and positive direction of the x-axis,
And arrange the angled ascending order of institute, it is sequentially connected the boundary point, obtains the range coverage.
Further, in one embodiment of the invention, the track accessible point V in the step S103i(vxi,
vyi,numi) calculation formula are as follows:
Wherein, vxiFor the track accessible point abscissa, STi kFor on the track data that sets out of inquiry event and
Path segment in query time section T,For m-th of sequence of points in track,It is transformed into for sequence of points geographic logitude flat
The abscissa of areal coordinate system, vyiFor the track accessible point ordinate,Plane coordinate system is transformed into for sequence of points geographic latitude
Ordinate, numiFor the track number for arriving at the location point.
Further, in one embodiment of the invention, as | STi a|<|STi b| when, then choose the mesh in starting point
It marks path segment to calculate, generates the track accessible point Vi(vxi,vyi,numi), wherein numi=1；When | STi a|>|STi b| when, then it selects the path segment on terminal to calculate, generates
The track accessible point Vi(vxi,vyi,numi), whereinnumi=1.
Further, in one embodiment of the invention, deterministic process in the step S205 are as follows: cover the track
Lid road is concentrated from the track covering path and is deleted, and the road angle is deleted from the road transform angle set, described in judgement
Whether track covering path integrates as empty set, if empty set, then terminates, and otherwise executes the step 203.
Further, in one embodiment of the invention, described to calculate boundary point according to the candidate reachable point set
Calculation formula are as follows:
Wherein, qxjFor the abscissa of the boundary point, qyjFor the ordinate of the boundary point.
Further, in one embodiment of the invention, it is described calculate the boundary point concentrate all boundary point and
The calculation formula of the angle of the inquiry event line and positive direction of the x-axis are as follows:
Wherein, AiFor angle value, sy is the ordinate of the inquiry event, and sx is the horizontal seat of the inquiry event
Mark.
The additional aspect of the present invention and advantage will be set forth in part in the description, and will partially become from the following description
Obviously, or practice through the invention is recognized.
Detailed description of the invention
Above-mentioned and/or additional aspect and advantage of the invention will become from the following description of the accompanying drawings of embodiments
Obviously and it is readily appreciated that, in which:
Fig. 1 is the city vehicle range coverage calculation method flow chart based on space-time restriction of one embodiment of the invention；
Fig. 2 is accessible point calculation flow chart in track in the step S1 of one embodiment of the invention；
Fig. 3 is that target trajectory segment is located at linking-up road schematic diagram in the step S1 of one embodiment of the invention；
Fig. 4 is that selection boundary point calculates road flow chart in the step S2 of one embodiment of the invention；
Fig. 5 is that track covering path collection selects boundary point calculating road signal in the step S2 of one embodiment of the invention
Figure；
Fig. 6 is boundary point calculation flow chart in the step S3 of one embodiment of the invention.
Specific embodiment
The embodiment of the present invention is described below in detail, examples of the embodiments are shown in the accompanying drawings, wherein from beginning to end
Same or similar label indicates same or similar element or element with the same or similar functions.Below with reference to attached
The embodiment of figure description is exemplary, it is intended to is used to explain the present invention, and is not considered as limiting the invention.
The city vehicle range coverage calculation method items based on space-time restriction of the embodiment of the present invention are determined first
Justice.
Define 1. track Trj: track refers to the sequence of points that vehicle leaves in area of space with the time, uses TrjiIt indicates
The track data of i-th of vehicle, wherein i indicates vehicle ID.By TrjiM-th of sequence of points is used in trackTable
Show, whereinIndicate that sequence of points geographic logitude is transformed into the abscissa of plane coordinate system,Indicate the conversion of sequence of points geographic latitude
To the ordinate of plane coordinate system,Indicate timestamp.
Define 2. inquiry event S: inquiry event S refers to the starting point of range coverage inquiry, by specific location point and spy
Timing, which is carved, to be constituted, and S (sx, sy, st) is expressed as, and wherein sx indicates that the geographic logitude of inquiry starting point is transformed into the cross of plane coordinate system
Coordinate, sy indicate that inquiry starting point geographic latitude is transformed into the ordinate of plane coordinate system, and st expression is set out the moment.
Define 3. query time section T: query time section refer to set out from inquiry event S reach range coverage to timing
Between segment, with T=[st+eta- εST,st+eta+εST] indicate, wherein eta be from inquire event running time base
Number, εSTFor time interval threshold value.
Define 4. target trajectory segment collection ST: target trajectory segment STiRefer to the track data to set out from inquiry event S
TrjiThe upper and path segment in query time section T.ST={ ST1,ST2,…STnIndicate target trajectory segment collection.
5. tracks are defined up to point set V: track is up to point set V={ V1,V2,…Vn, wherein ViIt indicates from inquiry event
S sets out, and in given time period T, there are one or more tracks to arrive at this location point for track data concentration.Specifically, it uses
Vi(vxi,vyi,numi) i-th of track accessible point in representation space region, wherein vxiIndicate accessible point abscissa, vyiExpression can
Up to an ordinate, numiIndicate the track number of the arrival location point.
Define 6. track covering path collection R: for any road Rj, when there are track accessible point ViIn road RjRemembered when upper
ViForClaim RjFor track covering path, it is expressed as Rj(Oj,Dj,RVj,tnj).Wherein Oj={ oxj,oyjIndicate track covering
Road starting point transverse and longitudinal coordinate collection, oxjIndicate starting point abscissa, oyjIndicate starting point ordinate；Dj={ dxj,dyjIndicate that terminal is horizontal
Ordinate collection, dxjIndicate terminal abscissa, dyjIndicate terminal ordinate；Indicate road Rj
On track up to point set；tnjIndicate that path locus arrives at number, i.e. RjOn track accessible point track arrive at number summation.R=
{R1,R2,…,RnIndicate track covering path collection.
Define 7. linking-up roads < Ra,Rb>: for RaWith RbIf RaTerminal (starting point) and RbStarting point (terminal) transverse and longitudinal coordinate phase
Deng i.e. oxb=dxa,oyb=dyaOr oxa=dxb,oya=dybWhen, then claim RaWith RbThere are connection relationships, are expressed as < Ra,Rb>。
Define 8. boundary points and calculate road collection QR: exercise boundary point calculates road collection selection method, from track covering path
Concentration selects boundary point and calculates road collection, is expressed as QR={ QR1,QR2,…QRn}。
Define 9. range coverage RR: range coverage is to calculate to calculate boundary point on road collection in boundary point, is further connected
The region that boundary point is formed.
The city vehicle range coverage based on space-time restriction proposed according to embodiments of the present invention is described with reference to the accompanying drawings
Calculation method.
Fig. 1 is the city vehicle range coverage calculation method flow chart based on space-time restriction of one embodiment of the invention.
As shown in Figure 1, should city vehicle range coverage calculation method based on space-time restriction the following steps are included:
In step sl, it is screened to obtain track sets point according to track data collection, to calculate track according to track sets point
Accessible point.
Further, in one embodiment of the invention, step S1 includes:
Step S101 filters out the track data collection for meeting inquiry event space-time restriction, in the data set of track with structure
At target trajectory collection；
Step S102 is concentrated in target trajectory and is filtered out the track sets point for meeting query time section constraint, to constitute mesh
Mark path segment；
Step S103 remembers sequence point set of the target trajectory segment on road, to generate track accessible point.
It should be noted that track accessible point Vi(vxi,vyi,numi) calculation formula are as follows:
Wherein, vxiFor track accessible point abscissa, STi kOn the track data to set out for inquiry event and in inquiry
Between path segment in section T,For m-th of sequence of points in track,Plane coordinate system is transformed into for sequence of points geographic logitude
Abscissa, vyiFor track accessible point ordinate,The ordinate of plane coordinate system is transformed into for sequence of points geographic latitude,
numiFor the track number for arriving at the location point.
Further, as | STi a|<|STi b| when, then the target trajectory fragment computations in starting point are chosen, described in generation
Track accessible point Vi(vxi,vyi,numi), whereinnumi=1；When |
STi a|>|STi b| when, then it selects the path segment on terminal to calculate, generates the track accessible point Vi(vxi,vyi,
numi), whereinnumi=1.
For example, as shown in Fig. 2, realizing the detailed step of the track step S1 accessible point calculation process are as follows:
Step 1.1 filters out the track data collection for meeting inquiry event S space-time restriction, structure in the data set Trj of track
At target trajectory collection.Specifically, work as TrjiIn sequence of pointsIt is less than with inquiry event S transverse and longitudinal coordinate Euclidean distance to spacing
From threshold epsilonSDAnd timestampIn given time threshold epsilonSTWhen interior, i.e.,AndWhen, Trji is expressed as CTi, target trajectory collection CT={ CT is added1,CT2,...CTn}。
Step 1.2 filters out the track sets point for meeting query time section T constraint in target trajectory collection CT, constitutes target
Path segment is expressed asTarget trajectory in all track datas
Segment constitutes target trajectory segment collection ST={ ST1,ST2,...,STn}。
Step 1.3 remembers target trajectory segment STi in road RkOn sequence point set be STi k.As target trajectory segment STiPosition
In same road RkOn, then to target trajectory segment STi kIt calculates and generates track accessible point Vi(vxi,vyi,numi), specificallynumi=1.As target trajectory segment STiPositioned at linking-up road < Ra,Rb
> on when, then compare road RaOn sequence point set STi aAnd RbOn sequence point set STi bSequence count size.When | STi a|<|
STi b| when, then choose RbOn target trajectory fragment computations, generate track accessible point Vi(vxi,vyi,numi), specifically,numi=1；It is on the contrary then select RaOn path segment calculate, generate rail
Mark accessible point Vi(vxi,vyi,numi), specifically,numi=1.Into one
It walks all track accessible points and generates track up to point set V.
Following target trajectory segments are located at linking-up road and calculate detailed example.
As shown in figure 3,It is target trajectory
Segment is located at road R1、R2、R3Sequence point set, road R1、R2、R3There are connection relationships.Wherein sequence of points P1 1、In road
Road R1On,In road R2On,In road R3On, thus, R1On sequence points | ST1 1| it is
3, R2On sequence pointsIt is 5, R3On sequence points | ST3 1| it is 1.Due toTherefore selection R2
On target trajectory fragment computations generate V1。
Step 1.4 traverses track up to point set V, for arbitrary trajectory accessible point Vi, calculate it and another track accessible point Vj
Between distance, be expressed asIf Dis≤εDD, then merge ViAnd Vj, i.e. update ViAttribute
Value numi=numi+numj, V is then deleted from Vj。
In step s 2, the track covering path that track accessible point will be present is concentrated, and selects path locus to arrive at number maximum
Road, be added boundary point calculate road collection.
Further, in one embodiment of the invention, step S2 includes:
Step S201, when the arbitrary trajectory covering path that track covering path is concentrated is there are when the accessible point of track, note is by rail
Mark accessible point is added track accessible point and concentrates；
Step S202, traversal track covering path concentrate arbitrary trajectory covering path, and zequin and inquiry event connect
The first angle of line and positive direction of the x-axis, terminal and the second angle for inquiring event S line and positive direction of the x-axis, wherein all
The road angle of track covering path constitutes road transform angle set, and provides that first angle is greater than second angle；And step S203,
In track, covering path concentrates selection path locus to arrive at the maximum road of number, and boundary point is added and calculates road collection.
Step S204 traverses road transform angle set, covers to except track carries out track up to any road angle in addition to point set
The screening of lid road, and update track covering path set attribute value；
Step S205, the track covering path that track covering path is concentrated are deleted, and by road-rail in road transform angle set
The road angle that mark arrives at the maximum road of number is deleted, and judges whether track covering path collection is empty.
Wherein, deterministic process are as follows: track covering path is concentrated from track covering path and is deleted, road angle is from road angle
Degree, which is concentrated, to be deleted, and is judged that whether track covering path integrates as empty set, if empty set, is then terminated, no to then follow the steps 203.
For example, as shown in figure 4, realizing that step S2 selection boundary point calculates the detailed step of road process are as follows:
Step 2.1 is to any road R in road networkj, when there are track accessible point ViIn road RjV was remembered when upperiForAdd
Enter RVjIn.Specifically claim RjFor track covering path, it is expressed as Rj(Oj,Dj,RVj,tnj),All track covering paths constitute track covering path collection R=
{R1,R2,…Rn}。
Step 2.2 traverses track covering path collection R, to arbitrary trajectory covering path Rj, zequin OjWith inquiry event
The angle of S line and positive direction of the x-axis is denoted as OAj, terminal DjDA is denoted as with the angle of inquiry event S line and positive direction of the x-axisj,
Provide OAj≥DAjIf (OAj<DAj, then O is exchangedjAnd Dj, i.e., original starting point is denoted as terminal, and terminal originally is denoted as starting point).Rail
Mark is up to point set RVjIn track accessible pointIt is denoted as with the angle of inquiry event S line and positive direction of the x-axisRail
Mark accessible point transform angle set is denoted asRjRoad angle be denoted as RAj={ OAj,DAj,
RVAj}.The road angle of all track covering paths constitutes road transform angle set, is denoted as RA={ RA1,RA2,...,RAn}。
Step 2.3 selects path locus to arrive at the maximum road R of number in the covering path collection R of trackj, boundary point is added
It calculates in road collection QR.
Step 2.4 traverses road transform angle set RA, to except RAjExcept any road angle RAnExecute following judgement: if RAn
OA in road anglen≤OAjAnd DAn≥ODj, then by RnIt covers in collection R and deletes from track road, RAnFrom road transform angle set RA
It deletes；Otherwise, RV is traversednMiddle arbitrary trajectory accessible pointIfThen willFrom RVAnMiddle deletion,From RVnMiddle deletion traverses RVnStep 2.5 is executed after the completion.It traverses RA and executes step 2.6 after the completion.
Step 2.5 updates Rn={ On,Dn,RVn,tnnAttribute value.Specifically, work as OAn>OAjAnd DAj>DAnWhen, according to road
Road transform angle set RAnBy RnRoad angle is split into (OAj,OAn] section be denoted as Rα(Oα,Dα,RVα,tnα) and road angle exist
[DAn,DAj) section be denoted as Rβ(Oβ,Dβ,RVβ,tnβ).Update attribute value Oα=On, Dβ=Dn, to RVnIn it is any'sRV is addedα, to RVnIn it is any'sRV is addedβ, section RαAnd RβTrack is reachable
Point transform angle set is denoted as RVA respectivelyαAnd RVAβ.From RVAαSelect minimum valueUpdate attribute value Dα={ dxα,dyα, dxα=
vxs, dyα=vys,From RVAβSelect maximum valueUpdate attribute value Oβ={ oxβ,oyβ, oxβ
=vxm, oyβ=vym,By RnIt is deleted from R, RαAnd RβIt is added in R, RAnFrom road transform angle set RA
Middle deletion, RAαAnd RAβIt is added in RA.
Work as OAj<OAnAnd DAn≥DAjWhen, minimum value is selected from RVAnUpdate attribute value Dn=(dxn,dyn),
dxn=vxs, dyn=vys,
Work as DAn<DAjAnd OAn≤OAjWhen, from RVAnIn select maximum valueUpdate attribute value On={ oxn,oyn,
oxn=vxm, oyn=vym,
Step 2.6 is by RjIt is deleted from R, RAjIt is deleted from RA, judges whether R is empty set, if empty set, is then terminated；It is no
Then follow the steps 2.3.
As shown in figure 5, from track covering path collection R={ R1,R2,R3,R4,R5In select boundary point calculate road.Respectively
To track covering path R1、R2、R3、R4、R5The angle of zequin and inquiry event S line and positive direction of the x-axis is denoted as OA1、
OA2、OA3、OA4、OA5；Track covering path R1、R2、R3、R4、R5Terminal and the angle for inquiring event S line and positive direction of the x-axis
It is denoted as DA1、DA2、DA3、DA4、DA5；R1Upper track accessible point collection RV1={ RV1 a,RV1 b,RV1 c,RV1 d, R2Upper track accessible point
CollectionR3Upper track accessible point collectionR4Upper track accessible point collectionR5Upper track accessible point collectionR1、
R2、R3、R4、R5On track be denoted as RVA up to point set and inquiry event S line and the transform angle set of positive direction of the x-axis1、RVA2、
RVA3、RVA4、RVA5, the road transform angle set of R is RA={ RA1,RA2,RA3,RA4,RA5, R1、R2、R3、R4、R5Path locus
Arriving at number is respectively 70,60,50,150 and 100.
The R in the covering path collection R of track4It is maximum that path locus arrives at number, therefore by R4It is added in QR.Due to OA3<OA4And
DA3>DA4, therefore by R3It is deleted from R, RA3It is deleted from RA.
Next R is updated1、R2And R5Attribute value, due to DA1<OA4<OA1,Therefore from RV1Middle deletion
RV1 d, from RVA1Middle deletionUpdate dx1=vxc, dy1=vyc,Similarly, due to OA2<DA4<
DA2,Therefore from RV2Middle deletionWithFrom RVA2Middle deletionWith
Update ox4=vxn, oy4=vyn,Due to OA5>OA4And DA4> DA,Therefore from RV5Middle deletion RV5 p,RV5 q,From RVA5Middle deletion According to RA5And RA4By R5Road angle is split into (OA4,OA5] section be denoted as Rα, Update attribute value Oα
=O5,dxα=vxo,dyα=vyo,Road angle is in [DA4,DA5) section be denoted as
Rβ, Update attribute value Dβ=D5,oxβ=vxs,oyβ=vys,By R4And R5From
It is deleted in R, RαAnd RβIt is added in R, RA4And RA5It is deleted from RA, RAα,RAβIt is added in RA.Due to R={ R1,R2,Rα,
RβAnd RA={ RA1,RA2,RAα,RAβIt is not empty set, continue above-mentioned steps until R and RA is sky.
In step s3, it calculates boundary point calculating road and is concentrating all boundary point and inquiry event line and x-axis just
The angle in direction obtains range coverage according to angle sequence and fillet point.
Further, in one embodiment of the invention, step S3 includes:
Step S301, traversal boundary point calculates the track accessible point that road is concentrated, and arriving at several pairs of tracks according to track can
A descending arrangement is carried out up to, selects in sequence preceding K track accessible point as candidate tracks accessible point and candidate accessible point is added
Collection；
Step S302 calculates boundary point up to point set according to candidate, and boundary point is calculated all boundaries on road collection
Point constitutes boundary point set；
It should be noted that calculating the calculation formula of boundary point are as follows:
Wherein, qxjFor the abscissa of boundary point, qyjFor the ordinate of boundary point.
Step S303 calculates the angle that boundary point concentrates all boundary point and inquiry event line and positive direction of the x-axis,
And arrange the angled ascending order of institute, it is sequentially connected boundary point, obtains range coverage.
Wherein, the calculation formula of angle are as follows:
A in formulaiFor angle value, sy is the ordinate for inquiring event, and sx is the abscissa for inquiring event.
For example, as shown in fig. 6, realizing the detailed step of step S3 boundary point calculation process are as follows:
Step 3.1 traverses boundary point and calculates road collection QR={ QR1,QR2,....,QRn, to QRjIn track accessible pointNumber num is arrived at according to trackiDescending arrangement is carried out, selects in sequence preceding K track accessible point as candidate tracks accessible point
And candidate tracks are added up to point set
Step 3.2 calculates road QR according to boundary pointjOn candidate tracks up to point set CRVjCalculate boundary point Qj(qxj,
qyj), specificallyFurther all boundary points are calculated on road
Boundary point constitutes boundary point set, is denoted as Q={ Q1,Q2,...,Qn}。
Step 3.3 calculates Arbitrary Boundaries point QiAngle A between S line and positive direction of the x-axisi, i.e.,Further to all boundary points according to angle AiAscending order arrangement, is sequentially connected boundary point Qi, obtain
Range coverage RR.
In conclusion the city vehicle range coverage calculation method based on space-time restriction of the embodiment of the present invention, is calculating
The constraint of time and track covering path are introduced when city vehicle boundary point, specifically, calculate inquiry event S to timing
Between range coverage in section when, first filter out in given time period and meet the track data of inquiry event S space-time restriction,
Track is calculated accordingly up to point set, and track covering path collection is further calculated by road network, is calculated by boundary point
Road collection selection method selects the track covering path collection for calculating boundary point, then calculates boundary point set, last according to angle
Sort simultaneously fillet point, obtains city vehicle range coverage.
The city vehicle range coverage calculation method based on space-time restriction proposed according to embodiments of the present invention, by counting
The constraint that time and track covering path are introduced when calculating city vehicle boundary point, is effectively reduced the meter of redundancy track data
It calculates；An important factor for influencing range coverage calculated result query time section is introduced simultaneously, improves the actual effect of range coverage；
And the track covering path collection that road collection selection method selects calculating boundary point is calculated by boundary point, according further to road angle
Degree integrates and path locus arrives at number sieve and selects to inquire event S as the boundary point of center all directions calculating road, on boundary
The track arrival number for calculating foundation track accessible point on road selects K candidate tracks accessible point and calculates boundary point, improves
The accuracy of range coverage.
In addition, term " first ", " second " are used for descriptive purposes only and cannot be understood as indicating or suggesting relative importance
Or implicitly indicate the quantity of indicated technical characteristic.Define " first " as a result, the feature of " second " can be expressed or
Implicitly include at least one this feature.In the description of the present invention, the meaning of " plurality " is at least two, such as two, three
It is a etc., unless otherwise specifically defined.
In the present invention unless specifically defined or limited otherwise, term " installation ", " connected ", " connection ", " fixation " etc.
Term shall be understood in a broad sense, for example, it may be being fixedly connected, may be a detachable connection, or integral；It can be mechanical connect
It connects, is also possible to be electrically connected；It can be directly connected, can also can be in two elements indirectly connected through an intermediary
The interaction relationship of the connection in portion or two elements, unless otherwise restricted clearly.For those of ordinary skill in the art
For, the specific meanings of the above terms in the present invention can be understood according to specific conditions.
In the present invention unless specifically defined or limited otherwise, fisrt feature in the second feature " on " or " down " can be with
It is that the first and second features directly contact or the first and second features pass through intermediary mediate contact.Moreover, fisrt feature exists
Second feature " on ", " top " and " above " but fisrt feature be directly above or diagonally above the second feature, or be merely representative of
First feature horizontal height is higher than second feature.Fisrt feature can be under the second feature " below ", " below " and " below "
One feature is directly under or diagonally below the second feature, or is merely representative of first feature horizontal height less than second feature.
In the description of this specification, reference term " one embodiment ", " some embodiments ", " example ", " specifically show
The description of example " or " some examples " etc. means specific features, structure, material or spy described in conjunction with this embodiment or example
Point is included at least one embodiment or example of the invention.In the present specification, schematic expression of the above terms are not
It must be directed to identical embodiment or example.Moreover, particular features, structures, materials, or characteristics described can be in office
It can be combined in any suitable manner in one or more embodiment or examples.In addition, without conflicting with each other, the skill of this field
Art personnel can tie the feature of different embodiments or examples described in this specification and different embodiments or examples
It closes and combines.
Although the embodiments of the present invention has been shown and described above, it is to be understood that above-described embodiment is example
Property, it is not considered as limiting the invention, those skilled in the art within the scope of the invention can be to above-mentioned
Embodiment is changed, modifies, replacement and variant.
Claims (10)
1. a kind of city vehicle range coverage calculation method based on space-time restriction, which comprises the following steps:
Step S1 screens to obtain track sets point according to track data collection, reachable to calculate track according to the track sets point
Point；
Step S2, the track covering path that the track accessible point will be present are concentrated, and path locus is selected to arrive at the maximum road of number
Road is added boundary point and calculates road collection；And
Step S3 calculates the boundary point calculating road and concentrates all boundary point and inquiry event line and positive direction of the x-axis
Angle, sort according to the angle and connect the boundary point, obtain range coverage.
2. the city vehicle range coverage calculation method according to claim 1 based on space-time restriction, which is characterized in that institute
Stating step S1 includes:
Step S101 filters out the track data collection for meeting inquiry event space-time restriction, in the data set of track to constitute
State target trajectory collection；
Step S102 is concentrated in the target trajectory and is filtered out the track sets point for meeting query time section constraint, to constitute mesh
Mark path segment；
Step S103 remembers sequence point set of the target trajectory segment on road, to generate track accessible point.
3. the city vehicle range coverage calculation method according to claim 1 based on space-time restriction, which is characterized in that institute
Stating step S2 includes:
Step S201, when the arbitrary trajectory covering path that the track covering path is concentrated is there are when the track accessible point, note
Track accessible point is added in the track accessible point to concentrate；
Step S202 traverses the track covering path and concentrates any track covering path, zequin and the inquiry
The first angle of event line and positive direction of the x-axis, second jiao of terminal and the inquiry event S line and positive direction of the x-axis
Degree, wherein the road angles of all track covering paths constitutes road transform angle set, and provides that the first angle is greater than described the
Two angles；And
Step S203 concentrates selection path locus to arrive at the maximum road of number, boundary point meter is added in the track covering path
Calculate road collection.
4. the city vehicle range coverage calculation method according to claim 3 based on space-time restriction, which is characterized in that institute
State step S2 further include:
Step S204 traverses the road transform angle set, to except the track carries out institute up to any road angle in addition to point set
The screening of track covering path is stated, and updates the track covering path set attribute value；
Step S205, the track covering path that the track covering path is concentrated are deleted, and by the road transform angle set
Described in path locus arrive at the road angle of the maximum road of number and delete, judge whether the track covering path collection is empty.
5. the city vehicle range coverage calculation method according to claim 1 based on space-time restriction, which is characterized in that institute
Stating step S3 includes:
Step S301 traverses the boundary point and calculates the track accessible point that road is concentrated, and arrives at several pairs of institutes according to track
It states track accessible point and carries out descending arrangement, select in sequence preceding K track accessible point as candidate tracks accessible point and time is added
It selects up to point set；
Step S302 calculates boundary point according to the candidate reachable point set, and the boundary point is calculated owning on road collection
Boundary point constitutes boundary point set；And
Step S303 calculates the boundary point and concentrates all boundary point and the inquiry event line and positive direction of the x-axis
Angle, and the angled ascending order of institute is arranged, it is sequentially connected the boundary point, obtains the range coverage.
6. the city vehicle range coverage calculation method according to claim 2 based on space-time restriction, which is characterized in that institute
State the track accessible point V in step S103i(vxi,vyi,numi) calculation formula are as follows:
Wherein, vxiFor the track accessible point abscissa, STi kOn the track data to set out for the inquiry event and looking into
The path segment in period T is ask,For m-th of sequence of points in track,Plane is transformed into for sequence of points geographic logitude to sit
Mark the abscissa of system, vyiFor the track accessible point ordinate,The vertical of plane coordinate system is transformed into for sequence of points geographic latitude
Coordinate, numiFor the track number for arriving at the location point.
7. the city vehicle range coverage calculation method according to claim 6 based on space-time restriction, which is characterized in that when
|STi a|<|STi b| when, then the target trajectory fragment computations in starting point are chosen, the track accessible point V is generatedi(vxi,
vyi,numi), whereinWhen | STi a|>|STi b| when, then
It selects the path segment on terminal to calculate, generates the track accessible point Vi(vxi,vyi,numi), wherein
8. the city vehicle range coverage calculation method according to claim 4 based on space-time restriction, which is characterized in that institute
State deterministic process in step S205 are as follows:
The track covering path is concentrated from the track covering path and is deleted, the road angle is from the road transform angle set
Middle deletion judges that whether the track covering path integrates as empty set, if empty set, then terminates, otherwise execute the step 203.
9. the city vehicle range coverage calculation method according to claim 5 based on space-time restriction, which is characterized in that institute
It states according to the candidate calculation formula for calculating boundary point up to point set are as follows:
Wherein, qxjFor the abscissa of the boundary point, qyjFor the ordinate of the boundary point.
10. the city vehicle range coverage calculation method according to claim 5 based on space-time restriction, which is characterized in that
The calculating for calculating the boundary point and concentrating the angle of all boundary points and the inquiry event line and positive direction of the x-axis
Formula are as follows:
Wherein, AiFor angle value, sy is the ordinate of the inquiry event, and sx is the abscissa of the inquiry event.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910036510.7A CN109815418B (en) | 2019-01-15 | 2019-01-15 | Urban vehicle reachable area calculation method based on space-time constraint |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910036510.7A CN109815418B (en) | 2019-01-15 | 2019-01-15 | Urban vehicle reachable area calculation method based on space-time constraint |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109815418A true CN109815418A (en) | 2019-05-28 |
| CN109815418B CN109815418B (en) | 2020-11-06 |
Family
ID=66604280
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910036510.7A Active CN109815418B (en) | 2019-01-15 | 2019-01-15 | Urban vehicle reachable area calculation method based on space-time constraint |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109815418B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103984683A (en) * | 2013-02-07 | 2014-08-13 | 百度在线网络技术（北京）有限公司 | LBS (location based service)-based retrieval method and equipment |
| CN103984684A (en) * | 2013-02-07 | 2014-08-13 | 百度在线网络技术（北京）有限公司 | LBS (location based service)-based reachable area determining method and equipment |
| US20150160028A1 (en) * | 2012-10-04 | 2015-06-11 | Google Inc. | Presenting information on a map |
| CN105258704A (en) * | 2014-06-16 | 2016-01-20 | 中国科学院沈阳自动化研究所 | Multi-scale space-time hot point path detection method based on rapid road network modeling |
| CN108022006A (en) * | 2017-11-24 | 2018-05-11 | 浙江大学 | The accessibility probability and Area generation method of a kind of data-driven |
| CN109029476A (en) * | 2018-06-04 | 2018-12-18 | 北京京东金融科技控股有限公司 | A kind of method and apparatus for determining range coverage |
-
2019
- 2019-01-15 CN CN201910036510.7A patent/CN109815418B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150160028A1 (en) * | 2012-10-04 | 2015-06-11 | Google Inc. | Presenting information on a map |
| CN103984683A (en) * | 2013-02-07 | 2014-08-13 | 百度在线网络技术（北京）有限公司 | LBS (location based service)-based retrieval method and equipment |
| CN103984684A (en) * | 2013-02-07 | 2014-08-13 | 百度在线网络技术（北京）有限公司 | LBS (location based service)-based reachable area determining method and equipment |
| CN105258704A (en) * | 2014-06-16 | 2016-01-20 | 中国科学院沈阳自动化研究所 | Multi-scale space-time hot point path detection method based on rapid road network modeling |
| CN108022006A (en) * | 2017-11-24 | 2018-05-11 | 浙江大学 | The accessibility probability and Area generation method of a kind of data-driven |
| CN109029476A (en) * | 2018-06-04 | 2018-12-18 | 北京京东金融科技控股有限公司 | A kind of method and apparatus for determining range coverage |
Non-Patent Citations (3)
| Title |
|---|
| GUOJUN WU,YICHEN DING, ET AL.: ""Mining Spatio-Temporal Reachable Regions over Massive Trajectory Data"", 《2017 IEEE 33RD INTERNATIONAL CONFERENCE ON DATA ENGINEERING》 * |
| SIYANG QIN,YOUCHEN ZUO,ET AL.: ""Travel Trajectories Analysis Based on Call Detail Record Data"", 《2017 29TH CHINESE CONTROL AND DECISION CONFERENCE》 * |
| 翟瀚: ""个人时空可达性动态互动模型研究及应用"", 《中国优秀硕士学位论文全文数据库 基础科学辑》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109815418B (en) | 2020-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110111574B (en) | Urban traffic imbalance evaluation method based on flow tree analysis | |
| CN113470365A (en) | Bus arrival time prediction method oriented to missing data | |
| CN105551239B (en) | travel time prediction method and device | |
| CN109686091B (en) | Traffic flow filling algorithm based on multi-source data fusion | |
| CN108776727A (en) | A kind of geometry feature extracting method based on taxi track data | |
| CN107195180A (en) | A kind of traffic trip track extraction method and device based on the alert data of electricity | |
| CN108362293A (en) | A kind of track of vehicle matching process based on key point technology | |
| CN103077604A (en) | Traffic sensor management using traffic simulation to chose the sensors | |
| CN106710208A (en) | Traffic state acquisition method and device | |
| CN106062846B (en) | Collection method, collection device, recording medium and the hourage calculating apparatus of detection information | |
| CN106790468A (en) | A kind of distributed implementation method for analyzing user's WiFi event trace rules | |
| CN106017476A (en) | Method for generating indoor positioning and navigating map model | |
| CN104636457B (en) | A kind of method and device of location finding cognition | |
| CN111540195A (en) | Regional traffic reachability evaluation method based on traffic big data | |
| US20090222198A1 (en) | Method of determining a route as a function of the sinuosity index | |
| CN109520499A (en) | Region isochronal method in real time is realized based on vehicle GPS track data | |
| CN108538054A (en) | A kind of method and system obtaining traffic information based on mobile phone signaling data | |
| CN107978219B (en) | Method and device for constructing road network of digital map | |
| CN109815418A (en) | City vehicle range coverage calculation method based on space-time restriction | |
| CN108710996A (en) | Gather region hotel addressing appraisal procedure in hotel based on tourism trip time and space usage | |
| CN107665580A (en) | A kind of design method of the novel intelligent traffic model based on sensor network | |
| CN113129586B (en) | Plane intersection overall operation evaluation method based on road section speed data | |
| CN102184636A (en) | Floating vehicle technology based road widening identification method | |
| CN113129589B (en) | Individual OD cell inference method based on bayonet detection data | |
| Garrison | Networks: reminiscence and lessons |
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 |