CN106302811B - Describe road network adsorption method when terminal positioning track - Google Patents
Describe road network adsorption method when terminal positioning track Download PDFInfo
- Publication number
- CN106302811B CN106302811B CN201610846626.3A CN201610846626A CN106302811B CN 106302811 B CN106302811 B CN 106302811B CN 201610846626 A CN201610846626 A CN 201610846626A CN 106302811 B CN106302811 B CN 106302811B
- Authority
- CN
- China
- Prior art keywords
- road network
- point
- anchor point
- network segment
- current anchor
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
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 present invention provides road network adsorption methods when a kind of description terminal positioning track.Compared to existing road network adsorption method, in the present invention: 1, road network stores in the way of digraph；2, setting starting point is searched for according to road network direction；3, searching algorithm uses SPFA algorithm；4, using the time of adjacent two o'clock multiplied by parameter C as longest search length.The present invention, which does not need to traverse all road network segments, can find the shortest road network segment with a distance from current anchor point, at the same can fast search to current anchor point to the shortest path between upper road network absorption point.
Description
Technical field
User's location data quick adsorption is linked into road network, and by neighboring user position location the present invention relates to a kind of
The method of user trajectory.
Background technique
Existing road network adsorption method uses following steps:
All road net datas, find the smallest with a distance from current anchor point on plan view where traversal current anchor point
Road network segment finds the point closest from current anchor point as current absorption point, if there is previous in the road network segment
A absorption point, then will currently adsorb and a little be connected with previous absorption point, form user path.
The above method has the drawback that: 1, needing to be traversed for road network segment all on plan view, time complexity is high；2,
Current absorption point is not necessarily shortest with the user path that previous absorption point is connected to form.
Summary of the invention
The technical problem to be solved by the present invention is reducing the time complexity of road network adsorption method, while improving accuracy.
In order to achieve the above object, the technical solution of the present invention is to provide road networks when a kind of description terminal positioning track
Adsorption method, which comprises the following steps:
Step 1 stores road network in the way of digraph, forms oriented road network figure；
Step 2, the anchor point that will acquire are as current anchor point；
Step 3 judges whether there is an anchor point and then enters step 4 if it does not exist, and if it exists, then enters step
6；
All road network segments, find the shortest road network piece with a distance from current anchor point in step 4, the oriented road network figure of traversal
Section finds absorption point of the point closest from current anchor point as current anchor point in the road network segment；
Step 5 obtains return step 2 after next anchor point；
Step 6, the difference for adsorbing the time corresponding with current anchor point point corresponding time for calculating a upper anchor point
Search length length=dwell × C is arranged in dwell, and in formula, C is preset parameter；
A upper anchor point is adsorbed two endpoints of the road network segment at place as search starting point by step 7, is used
SPFA algorithm searches for each road network segment on oriented road network figure along the direction of oriented road network figure, while recording each road network segment
Set membership, and calculate and search out the distance between the road network segment come and current anchor point every time, will have apart from minimum value
Road network segment be recorded as road network segment minLineString；
Step 8 calculates on road network segment minLineString with the closest point of current anchor point, is denoted as a little
LeastPoint is looked for using point leastPoint as the absorption of current anchor point point further according to the set membership of each road network segment
To the road network segment of the corresponding absorption point-to-point leastPoint of a upper anchor point, using the road network segment as user path；
Step 9 obtains return step 2 after next anchor point.
The present invention, which does not need to traverse all road network segments, can find the shortest road network segment with a distance from current anchor point, together
When can fast search to current anchor point to a upper road network absorption point between shortest path.
Detailed description of the invention
Fig. 1 is the flow chart that an attribute of the invention is verified.
Specific embodiment
Present invention will be further explained below with reference to specific examples.It should be understood that these embodiments are merely to illustrate the present invention
Rather than it limits the scope of the invention.In addition, it should also be understood that, after reading the content taught by the present invention, those skilled in the art
Member can make various changes or modifications the present invention, and such equivalent forms equally fall within the application the appended claims and limited
Range.
In conjunction with Fig. 1, a kind of road network adsorption method when describing terminal positioning track provided by the invention, including following step
It is rapid:
Step 1 stores road network in the way of digraph, forms oriented road network figure；
Step 2, the anchor point that will acquire are as current anchor point；
Step 3 judges whether there is an anchor point and then enters step 4 if it does not exist, and if it exists, then enters step
6；
All road network segments, find the shortest road network piece with a distance from current anchor point in step 4, the oriented road network figure of traversal
Section finds absorption point of the point closest from current anchor point as current anchor point in the road network segment；
Step 5 obtains return step 2 after next anchor point；
Step 6, the difference for adsorbing the time corresponding with current anchor point point corresponding time for calculating a upper anchor point
Search length length=dwell × C is arranged in dwell, and in formula, C is preset parameter；
A upper anchor point is adsorbed two endpoints of the road network segment at place as search starting point by step 7, is used
SPFA algorithm searches for each road network segment on oriented road network figure along the direction of oriented road network figure, while recording each road network segment
Set membership, and calculate and search out the distance between the road network segment come and current anchor point every time, will have apart from minimum value
Road network segment be recorded as road network segment minLineString；
Step 8 calculates on road network segment minLineString with the closest point of current anchor point, is denoted as a little
LeastPoint is looked for using point leastPoint as the absorption of current anchor point point further according to the set membership of each road network segment
To the road network segment of the corresponding absorption point-to-point leastPoint of a upper anchor point, using the road network segment as user path；
Step 9 obtains return step 2 after next anchor point.
Compared to existing road network adsorption method, of the invention thes improvement is that: 1, road network is in the way of digraph
Storage；2, setting starting point is searched for according to road network direction；3, searching algorithm uses SPFA algorithm；4, by the time of adjacent two o'clock multiplied by
Parameter C is as longest search length.
Claims (1)
1. road network adsorption method when a kind of description terminal positioning track, which comprises the following steps:
Step 1 stores road network in the way of digraph, forms oriented road network figure；
Step 2, the anchor point that will acquire are as current anchor point；
Step 3 judges whether there is an anchor point and then enters step 4 if it does not exist, and if it exists, then enters step 6；
All road network segments, find the shortest road network segment with a distance from current anchor point in step 4, the oriented road network figure of traversal,
Absorption point of the point closest from current anchor point as current anchor point is found in the road network segment；
Step 5 obtains return step 2 after next anchor point；
Step 6, the difference for adsorbing the time corresponding with current anchor point point corresponding time for calculating a upper anchor point
Search length length=dwell × C is arranged in dwell, and in formula, C is preset parameter；
A upper anchor point is adsorbed two endpoints of the road network segment at place as search starting point, using SPFA by step 7
Algorithm searches for each road network segment on oriented road network figure along the direction of oriented road network figure, while recording the father and son of each road network segment
Relationship, and calculate and search out the distance between the road network segment come and current anchor point every time, will there is the road apart from minimum value
Mesh sheet segment record is road network segment minLineString；
Step 8 calculates on road network segment minLineString with the closest point of current anchor point, is denoted as point leastPoint,
It finds one further according to the set membership of each road network segment using point leastPoint as the absorption of current anchor point point and determines
The road network segment of the corresponding absorption point-to-point leastPoint in site, using the road network segment as user path；
Step 9 obtains return step 2 after next anchor point.
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 CN106302811A (en) | 2017-01-04 |
| CN106302811B true 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车辆轨迹数据的地图匹配算法研究;陈滨;《中国优秀硕士学位论文全文数据库（信息科技辑）》;20160215(第2期);第27-34页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106302811A (en) | 2017-01-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10323948B2 (en) | GPS data repair | |
| CN107301254B (en) | Road network hot spot area mining method | |
| US10452728B2 (en) | Method and apparatus for recommending keywords | |
| WO2010075309A3 (en) | Method and system for multi-dimensional and geographic search | |
| CN104007763B (en) | A kind of fixed Electronic Nose node searching odor source method that cooperates with mobile robot | |
| CN105718470A (en) | POI (Point of Interest) data processing method and device | |
| Karagiorgou et al. | Segmentation-based road network construction | |
| CN106446157B (en) | Travel destination recommendation method and device | |
| EP3144703A1 (en) | Generating trail network maps | |
| CN104484162A (en) | Software testing case designing and writing method | |
| CN106302811B (en) | Describe road network adsorption method when terminal positioning track | |
| CN105318882B (en) | The method and device of point of interest binding road | |
| CN104850564A (en) | Index search method and system of data file | |
| CN104765767B (en) | For the knowledge store system and its knowledge searching method of intelligence learning | |
| CN103415070B (en) | Localization method and device based on mobile path | |
| CN107133335A (en) | A kind of repetition record detection method based on participle and index technology | |
| Baraglia et al. | A trajectory-based recommender system for tourism | |
| CN107644033A (en) | A kind of method and apparatus that data query is carried out in non-relational database | |
| CN109470259A (en) | A kind of method of Auto-matching up-to-date map in navigation procedure | |
| JP5516192B2 (en) | Model creation device, model creation program, and model creation method | |
| CN108509576A (en) | A kind of filtering optimization method of the inspection track mistake point based on electronic map | |
| KR101064833B1 (en) | Apparatus and method for mining of multi-dimensional association rules over interval data using clustering and characterization | |
| CN108240818B (en) | Path determining method and device | |
| CN106570040A (en) | Multilevel data indexing method and system based on pre-stack reverse time migration | |
| CN104748758A (en) | Method and device for improving navigation map |
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 |