CN106302811A - Describe road network adsorption method during terminal positioning track - Google Patents
Describe road network adsorption method during terminal positioning track Download PDFInfo
- Publication number
- CN106302811A CN106302811A CN201610846626.3A CN201610846626A CN106302811A CN 106302811 A CN106302811 A CN 106302811A CN 201610846626 A CN201610846626 A CN 201610846626A CN 106302811 A CN106302811 A CN 106302811A
- Authority
- CN
- China
- Prior art keywords
- road network
- anchor point
- point
- network fragment
- fragment
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/52—Network services specially adapted for the location of the user terminal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/029—Location-based management or tracking services
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention provides a kind of road network adsorption method when describing terminal positioning track.Compared to existing road network adsorption method, in the present invention: 1, road network stores according to the mode of directed graph；2, arrange starting point to search for according to road network direction；3, searching algorithm uses SPFA algorithm；4, the time of adjacent 2 is multiplied by parameter C as the longest search length.The present invention need not to travel through all road network fragments and can find from the shortest road network fragment of current anchor point distance, simultaneously can fast search to current anchor point to a upper road network adsorption site between shortest path.
Description
Technical field
The present invention relates to a kind of data quick adsorption that user positioned to road network, and neighboring user position location is linked into
The method of user trajectory.
Background technology
Existing road network adsorption method employing following steps:
All of road net data on the plane graph at traversal current anchor point place, finds from current anchor point distance minimum
Road network fragment, finds from the closest point of current anchor point as current adsorption site, if there is previous in this road network fragment
Individual adsorption site, then be connected current adsorption site with previous adsorption site, forms user path.
Said method has the drawback that: 1, needing to travel through all of road network fragment on plane graph, time complexity is high；2、
The user path that current adsorption site and previous adsorption site are connected to form is not necessarily the shortest.
Summary of the invention
The technical problem to be solved in the present invention is: reduces the time complexity of road network adsorption method, improves accuracy simultaneously.
In order to achieve the above object, the technical scheme is that and provide a kind of road network when describing terminal positioning track
Adsorption method, it is characterised in that comprise the following steps:
Step 1, road network is stored according to the mode of directed graph, form oriented road network figure；
Step 2, using the anchor point that gets as current anchor point；
Step 3, judge whether an anchor point, if not existing, then entering step 4, if existing, then entering step
6；
Step 4, travel through all of road network fragment on oriented road network figure, find from the shortest road network sheet of current anchor point distance
Section, finds from the closest point of current anchor point as the adsorption site of current anchor point in this road network fragment；
Step 2 is returned after step 5, the next anchor point of acquisition；
Step 6, calculate the difference of time corresponding with current anchor point time corresponding to the adsorption site of an anchor point
Dwell, arranges search length length=dwell × C, and in formula, C is parameter set in advance；
Step 7, using two end points of the road network fragment at the adsorption site place of a upper anchor point as search starting point, use
SPFA algorithm searches for each road network fragment on oriented road network figure along the direction of oriented road network figure, records each road network fragment simultaneously
Filiation, and calculate every time the distance between search road network fragment and current anchor point out, will have distance minima
Road network fragment be recorded as road network fragment minLineString；
Point closest with current anchor point in step 8, calculating road network fragment minLineString, is designated as a little
LeastPoint, using a leastPoint as the adsorption site of current anchor point, further according to the filiation of each road network fragment, looks for
To the road network fragment of absorption point-to-point leastPoint corresponding to a upper anchor point, using this road network fragment as user path；
Step 2 is returned after step 9, the next anchor point of acquisition.
The present invention need not travel through all road network fragments and can find from current anchor point apart from the shortest road network fragment, same
Time can fast search to current anchor point to a upper road network adsorption site between shortest path.
Accompanying drawing explanation
Fig. 1 is the flow chart of an attribute checking of the present invention.
Detailed description of the invention
Below in conjunction with specific embodiment, the present invention is expanded on further.Should be understood that these embodiments are merely to illustrate the present invention
Rather than restriction the scope of the present invention.In addition, it is to be understood that after having read the content that the present invention lectures, people in the art
The present invention can be made various changes or modifications by member, and these equivalent form of values fall within the application appended claims equally and limited
Scope.
In conjunction with Fig. 1, a kind of road network adsorption method when describing terminal positioning track that the present invention provides, including following step
Rapid:
Step 1, road network is stored according to the mode of directed graph, form oriented road network figure；
Step 2, using the anchor point that gets as current anchor point；
Step 3, judge whether an anchor point, if not existing, then entering step 4, if existing, then entering step
6；
Step 4, travel through all of road network fragment on oriented road network figure, find from the shortest road network sheet of current anchor point distance
Section, finds from the closest point of current anchor point as the adsorption site of current anchor point in this road network fragment；
Step 2 is returned after step 5, the next anchor point of acquisition；
Step 6, calculate the difference of time corresponding with current anchor point time corresponding to the adsorption site of an anchor point
Dwell, arranges search length length=dwell × C, and in formula, C is parameter set in advance；
Step 7, using two end points of the road network fragment at the adsorption site place of a upper anchor point as search starting point, use
SPFA algorithm searches for each road network fragment on oriented road network figure along the direction of oriented road network figure, records each road network fragment simultaneously
Filiation, and calculate every time the distance between search road network fragment and current anchor point out, will have distance minima
Road network fragment be recorded as road network fragment minLineString；
Point closest with current anchor point in step 8, calculating road network fragment minLineString, is designated as a little
LeastPoint, using a leastPoint as the adsorption site of current anchor point, further according to the filiation of each road network fragment, looks for
To the road network fragment of absorption point-to-point leastPoint corresponding to a upper anchor point, using this road network fragment as user path；
Step 2 is returned after step 9, the next anchor point of acquisition.
Compared to existing road network adsorption method, the present invention thes improvement is that: 1, road network is according to the mode of directed graph
Storage；2, arrange starting point to search for according to road network direction；3, searching algorithm uses SPFA algorithm；4, the time of adjacent 2 is multiplied by
Parameter C is as the longest search length.
Claims (1)
1. road network adsorption method when describing terminal positioning track, it is characterised in that comprise the following steps:
Step 1, road network is stored according to the mode of directed graph, form oriented road network figure；
Step 2, using the anchor point that gets as current anchor point；
Step 3, judging whether an anchor point, if not existing, then entering step 4, if existing, then entering step 6；
Step 4, travel through all of road network fragment on oriented road network figure, find from the shortest road network fragment of current anchor point distance,
This road network fragment finds from the closest point of current anchor point as the adsorption site of current anchor point；
Step 2 is returned after step 5, the next anchor point of acquisition；
Step 6, calculate the difference of time corresponding with current anchor point time corresponding to the adsorption site of an anchor point
Dwell, arranges search length length=dwell × C, and in formula, C is parameter set in advance；
Step 7, using two end points of the road network fragment at the adsorption site place of a upper anchor point as search starting point, use SPFA
Algorithm searches for each road network fragment on oriented road network figure along the direction of oriented road network figure, records the father and son of each road network fragment simultaneously
Relation, and calculate every time the distance between search road network fragment and current anchor point out, will there is the road of distance minima
Mesh sheet segment record is road network fragment minLineString；
Point closest with current anchor point in step 8, calculating road network fragment minLineString, is designated as a leastPoint,
Using a leastPoint as the adsorption site of current anchor point, further according to the filiation of each road network fragment, one is found to determine
The road network fragment of the absorption point-to-point leastPoint that site is corresponding, using this road network fragment as user path；
Step 2 is returned after step 9, the next anchor point of acquisition.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610846626.3A CN106302811B (en) | 2016-09-23 | 2016-09-23 | Describe road network adsorption method when terminal positioning track |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610846626.3A CN106302811B (en) | 2016-09-23 | 2016-09-23 | Describe road network adsorption method when terminal positioning track |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106302811A true CN106302811A (en) | 2017-01-04 |
| CN106302811B CN106302811B (en) | 2019-07-09 |
Family
ID=57711867
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610846626.3A Active CN106302811B (en) | 2016-09-23 | 2016-09-23 | Describe road network adsorption method when terminal positioning track |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106302811B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101201255A (en) * | 2007-12-21 | 2008-06-18 | 四川川大智胜软件股份有限公司 | Vehicle combined navigation system based on intelligent navigation algorithm |
| WO2009061058A1 (en) * | 2007-11-09 | 2009-05-14 | Thinkware Systems Corporation | Map matching method using geomagnetic sensor and navigation system |
| CN103149576A (en) * | 2013-01-29 | 2013-06-12 | 武汉大学 | Map matching method of floating car data |
| CN104075725A (en) * | 2014-06-27 | 2014-10-01 | 腾讯科技（深圳）有限公司 | Navigation route generation method, and related equipment and system used in same |
-
2016
- 2016-09-23 CN CN201610846626.3A patent/CN106302811B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009061058A1 (en) * | 2007-11-09 | 2009-05-14 | Thinkware Systems Corporation | Map matching method using geomagnetic sensor and navigation system |
| CN101201255A (en) * | 2007-12-21 | 2008-06-18 | 四川川大智胜软件股份有限公司 | Vehicle combined navigation system based on intelligent navigation algorithm |
| CN103149576A (en) * | 2013-01-29 | 2013-06-12 | 武汉大学 | Map matching method of floating car data |
| CN104075725A (en) * | 2014-06-27 | 2014-10-01 | 腾讯科技（深圳）有限公司 | Navigation route generation method, and related equipment and system used in same |
Non-Patent Citations (1)
| Title |
|---|
| 陈滨: "基于GPS车辆轨迹数据的地图匹配算法研究", 《中国优秀硕士学位论文全文数据库（信息科技辑）》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106302811B (en) | 2019-07-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10323948B2 (en) | GPS data repair | |
| US10452728B2 (en) | Method and apparatus for recommending keywords | |
| CN103593430B (en) | Clustering method based on mobile object spatiotemporal information trajectory subsections | |
| CN109269514A (en) | The method and apparatus for determining motion profile | |
| RU2019107593A (en) | DEVICE AND METHOD FOR STORING DATA, VERIFICATION OF DATA AND COMMUNICATION OF DATA | |
| CN107015563A (en) | Method for planning path for mobile robot and device | |
| CN104063467B (en) | Intra-domain traffic flow pattern discovery method based on improved similarity search technology | |
| CN103455414B (en) | Obtain the method and device of the logical place of control | |
| WO2014121092A3 (en) | Data records selection | |
| CN103324706B (en) | There is the method for the track data hot spot of time-constrain | |
| KR102015235B1 (en) | Path Lookup Methods, Apparatus, Devices, and Nonvolatile Computer Storage Media | |
| CN106844089A (en) | A kind of method and apparatus for recovering tree data storage | |
| CN103365967A (en) | Automatic difference detection method and device based on crawler | |
| Aljubayrin et al. | Finding non-dominated paths in uncertain road networks | |
| CN105318882B (en) | The method and device of point of interest binding road | |
| JP2018028905A5 (en) | ||
| CN104765767B (en) | For the knowledge store system and its knowledge searching method of intelligence learning | |
| CN104484162A (en) | Software testing case designing and writing method | |
| CN106156245A (en) | Line feature in a kind of electronic chart merges method and device | |
| CN107133335A (en) | A kind of repetition record detection method based on participle and index technology | |
| CN103235862B (en) | Select disassembly sequence planning method and device | |
| CN103455964B (en) | A kind of case clue analytic system based on case information and method | |
| Wang et al. | Using DTW to measure trajectory distance in grid space | |
| CN105698796B (en) | A kind of method for searching path of multirobot scheduling system | |
| CN106302811A (en) | Describe road network adsorption method during terminal positioning track |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |