CN103852083B - A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map - Google Patents
A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map Download PDFInfo
- Publication number
- CN103852083B CN103852083B CN201210521975.XA CN201210521975A CN103852083B CN 103852083 B CN103852083 B CN 103852083B CN 201210521975 A CN201210521975 A CN 201210521975A CN 103852083 B CN103852083 B CN 103852083B
- Authority
- CN
- China
- Prior art keywords
- road
- attribute
- multiple intersections
- turn
- divergent paths
- 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
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
- G01C21/30—Map- or contour-matching
- G01C21/32—Structuring or formatting of map data
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3667—Display of a road map
- G01C21/367—Details, e.g. road map scale, orientation, zooming, illumination, level of detail, scrolling of road map or positioning of current position marker
Abstract
A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map of the present invention, by the place segment path network that turns to containing multiple Multiple Intersections attributes is decomposed, segment path defines some roads separately and increases relevant turning to newly, Multiple Intersections attribute and the many-to-one relationship between turning to are modified to man-to-man relation, so that more succinct accurately in some paths chosen information from the crossing place close to very；The present invention is by means such as road duplications, to originally turn to multiple crossings enlarged drawing of association, direction road signs attribute on A, dispersion is associated with different turning to, so can revise and turn to the characteristic only comprising a crossing, thus accomplishing under the premise without revising guidance path algorithm, the easily function of interpolation association Multiple Intersections attribute so that more succinct accurate when reporting apart from very near some crossings.
Description
Technical field
The present invention relates to data in navigation electronic map field, particularly relate to a kind of method increasing association Multiple Intersections attribute in data in navigation electronic map.
Background technology
It is reported, by the first quarter in 2012, China's Private Car owning amount reached 86,500,000.Whole nation passenger car sales volume increases year after year.Along with the development of automobile industry, auto navigation industry is also rapidly developed, as map of navigation electronic accounting about 20% in whole auto navigation industrial chain of auto navigation core.
In map of navigation electronic development process, will produce many new can promote Map quality, strengthen the map data mining platform that hommization considers.Map of navigation electronic physical format is the map of navigation electronic form used in navigation system.In the map data mining platform increased in map of navigation electronic, inevitably there will be some and be associated with in multiple actual road network the attributed graph layer at crossing as crossing enlarged drawing, direction road signs are such simultaneously.But in the intersection data of current domestic Duo Jia map datum manufacturer, only comprise an actual road network crossing.And our map of navigation electronic physical format data turn to data, also simply contain a crossing.If to comprise multiple crossing in turning to, then need amendment map of navigation electronic physical format, thus also influencing whether the path planning algorithm of navigation engine.
Summary of the invention
In order to solve the problems referred to above, the present invention proposes a kind of method increasing association Multiple Intersections attribute in data in navigation electronic map, thus accomplishing under the premise without revising guidance path algorithm, the easily function of interpolation association Multiple Intersections attribute so that more succinct accurate when reporting apart from very near some crossings.
A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map, comprises the following steps:
Step 1, define following key word:
Road arc: above the roadside, road that figure business provides, according to the topology element that traffic flow direction takes out, it was shown that this roadside, road is submitted through-flow to the situation with this roadside, road that comes in and goes out；
Turn to: being joined end to end by two and including end to end road arc in logic is constituted, and comprises direction information and paths chosen information；Multiple Intersections attribute: refer to have the crossing enlarged drawing of a plurality of termination road, direction road signs object, is a kind of paths chosen information；
Turning to corresponding sub-road network: refer in particular to and turn to through a certain, its degree of depth terminates valid trace roadside number in road sequence, the tree-shaped road network intercepted out from whole road networks corresponding to turning to the Multiple Intersections attribute of correspondence；
Divergent paths: turn in corresponding sub-road network, terminates road to a paths of a certain end road of this sub-road network from what turn to, is made up of a plurality of road that joins end to end；
A type divergent paths: on this divergent paths, the termination road sequence of only one of which Multiple Intersections attribute is passed through；
Type B divergent paths: on this divergent paths, has and passes through more than the termination road sequence of 1 Multiple Intersections attribute；
Node arc: constitute the road arc of divergent paths, except the information of road arc itself, further comprises by the number of times of the termination road sequence process of Multiple Intersections attribute and number of copy times；
Connect in crossing: proposed by figure business, for connecting the roadside, road of internal crossing, crossing point；
Step 2, from the corresponding existing turnaround sequence of multiple Multiple Intersections attributes, filter out need to carry out to process all and turn to, be put in set T, shown in comprising the following steps that:
Step 21, all Multiple Intersections attributes that figure business is provided, be designated as valid trace road by initial for current attribute road with terminating the non-interior link road segment mark in crossing in road sequence, and the road mentioned in later step means effective road；
Step 22, according to each Multiple Intersections attribute rise terminate road, corresponded to and be there is turning to of identical termination road, now being likely to occur one and turn to corresponding multiple Multiple Intersections attribute, this turned to and put in chained list L1, in L1, all nodes are all elements of set T；
Step 23, for this attribute that may relate to remote direction instruction content of direction road signs, to judge whether direction content shown in it meets merging condition, described merging condition is terminate that the length of road sequence is accumulative exceedes preset threshold value；
Step 24, direction road signs to satisfied merging conditions all in step 23, all merge direction road sign title, and corresponded to corresponding first crossing and turn to；
Step 25, direction road signs to the Multiple Intersections association that can not merge, and other Multiple Intersections relating attribute is all associated with first crossing and turns to, and is turned at this crossing simultaneously and is put in the chained list L1 needing to carry out Multiple Intersections association process；
Step 3, according to corresponding Multiple Intersections attribute feature, replicated, turn to the means of increase, amendment by road network analysis, road, process in set T and all turn to involved road network so that the road of each association Multiple Intersections attribute be unique up to, shown in comprising the following steps that:
Step 31, putting in set Rt from the t that turns to of set T, if turning to rising of t to terminate road another was replicated when turning to t' in processing set T, what namely had actual geographic position identical with turning to t turns to tnew, then t is turned to by allnewJoin in set Rt；
Step 32, for set Rt turns to t, check each Multiple Intersections attribute of its correspondence, if through turning to t, it is impossible to terminate road sequence along this Multiple Intersections attribute and arrive sequence the last item road, then release and turn to the t corresponding relation with this Multiple Intersections attribute；
Step 33, basis turn to Multiple Intersections attribute corresponding for t terminate road sequence situation and turn to the follow-up actual road network situation of t, build and turn to sub-road network corresponding for t；
Step 34, by replicate road, replicate road arc method decompose turn to sub-road network corresponding for t；
Step 35, turn to and delete the method turned to by increasing, recover the sub-road network connectivity after decomposing, it is ensured that all Multiple Intersections attributes turning to t corresponding are finally split into and turn to t or turn to tnewOne_to_one corresponding, and be no longer turn to the corresponding all of Multiple Intersections attribute of t.
Step 33 is refined further as follows:
Step 331, create A type divergent paths according to the road sequence only having a kind of Multiple Intersections attribute process, this divergent paths added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this divergent paths by through number of times；
Step 332, create Type B divergent paths according to the road sequence having multiple Multiple Intersections attribute process, this divergent paths added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this divergent paths by through number of times；
Step 333, according to node arc on divergent paths by the number of times of process, calculate and turn in the corresponding sub-road network of t each node arc on every divergent paths to need the number of times being replicated.
Step 34 is refined further as follows:
Step 341, number of copy times according to node arc each on every divergent paths, create the road arc object and new roadside, road object that make new advances；
Step 342, corresponding with node arc for node arc road side attribute is copied in the object of roadside, corresponding newly-built road Hu He road；
Step 343, according to the part attribute of sub-road network practical situation amendment roadside, newly-built road Hu He road object after decomposing.
Step 35 is refined further as follows:
Step 351, judging the type that turns to the corresponding sub-road network of t, if all divergent paths constituting it are all A type divergent paths, then this turns to the sub-road network of t to be A type road network, is otherwise Type B road network；
Step 352, basis turn to its road network connectivity of type recovery of the corresponding sub-road network of t, to A type road network, original road sequence pair is stayed to answer one of them Multiple Intersections attribute, node arc on other A type divergent paths replaces with new duplicated road, Type B road network then stays the corresponding all of Type B divergent paths of original road, and the node arc on all of A type divergent paths replaces with the new road replicated out.
The present invention is by decomposing the place segment path network that turns to containing multiple Multiple Intersections attributes, segment path defines some roads separately and increases relevant turning to newly, Multiple Intersections attribute and the many-to-one relationship between turning to are modified to man-to-man relation, so that more succinct accurately in some paths chosen information from the crossing place close to very.The present invention is by means such as road duplications, to originally turn to multiple crossings enlarged drawing of association, direction road signs attribute on A, dispersion is associated with different turning to, and (these turn to, it is identical at actual road network), so can revise and turn to the characteristic only comprising a crossing, thus accomplishing under the premise without revising guidance path algorithm, the easily function of interpolation association Multiple Intersections attribute so that more succinct accurate when reporting apart from very near some crossings.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the present invention；
Fig. 2 is the idiographic flow schematic diagram of step 2 in the present invention；
Fig. 3 is the idiographic flow schematic diagram of step 3 in the present invention；
Fig. 4 is the idiographic flow schematic diagram of step 33 in the present invention；
Fig. 5 is the idiographic flow schematic diagram of step 34 in the present invention；
Fig. 6 is the idiographic flow schematic diagram of step 35 in the present invention.
Below in conjunction with the drawings and specific embodiments, the invention will be further described.
Detailed description of the invention
As it is shown in figure 1, a kind of method increasing association Multiple Intersections attribute in data in navigation electronic map of the present invention, comprise the following steps:
Step 1, define following key word:
Road arc: above the roadside, road that figure business provides, according to the topology element that traffic flow direction takes out, it was shown that this roadside, road is submitted through-flow to the situation with this roadside, road that comes in and goes out；
Turn to: being joined end to end by two and including end to end road arc in logic is constituted, and comprises direction information and paths chosen information；Multiple Intersections attribute: refer to crossing enlarged drawing and the direction road signs object with a plurality of termination road, is a kind of paths chosen information；
Turning to corresponding sub-road network: refer in particular to and turn to through a certain, its degree of depth terminates valid trace roadside number in road sequence, the tree-shaped road network intercepted out from whole road networks corresponding to turning to the Multiple Intersections attribute of correspondence；
Divergent paths: turn in corresponding sub-road network, terminates road to a paths of a certain end road of this sub-road network from what turn to, is made up of a plurality of road that joins end to end；
A type divergent paths: on this divergent paths, the termination road sequence of only one of which Multiple Intersections attribute is passed through；
Type B divergent paths: on this divergent paths, has and passes through more than the termination road sequence of 1 Multiple Intersections attribute；
Node arc: constitute the road arc of divergent paths, except the information of road arc itself, further comprises by the number of times of the termination road sequence process of Multiple Intersections attribute and number of copy times；
Connect in crossing: proposed by figure business, for connecting the roadside, road of internal crossing, crossing point；
Step 2, from the corresponding existing turnaround sequence of multiple Multiple Intersections attributes, all turning to that filtering out needs to carry out processing is put in set T, concrete steps as shown in Figure 2:
Step 21, all Multiple Intersections attributes that figure business is provided, get rid of Multiple Intersections attribute and terminate invalid road in road sequence, with terminating the non-interior link road segment mark in crossing in road sequence, initial for current attribute road is designated as valid trace road, and the road being subsequently noted all refers to effective road；
Step 22, terminate road according to effectively rising of each Multiple Intersections attribute, corresponded to and be there is turning to of identical termination road, now it is likely to occur one and turns to corresponding multiple Multiple Intersections attribute, this being turned to and put in chained list L1, this needs to carry out all nodes in the chained list L1 of Multiple Intersections association process is all elements of set T；
Step 23, judging whether direction content shown in it meets merging condition for this attribute that may relate to remote direction instruction content of direction road signs, described merging condition is terminate that the length of road sequence is accumulative exceedes preset threshold value；
Step 24, direction road signs to satisfied merging conditions all in step 23, all merge direction road sign title, and corresponded to corresponding first crossing and turn to；
Step 25, direction road signs to the Multiple Intersections association that can not merge, and other Multiple Intersections relating attribute is all associated with first crossing and turns to, and is turned at this crossing simultaneously and is put in the chained list L1 needing to carry out Multiple Intersections association process；
Step 3, according to corresponding Multiple Intersections attribute feature, replicated, turn to the means of increase, amendment by road network analysis, road, process in set T and all turn to involved road network so that the road of each association Multiple Intersections attribute be unique up to, concrete steps as shown in Figure 3:
Step 31, according to be analyzed turn to search its rise terminate road replicate after obtain turn to, namely the t that turns to from set T is put in set Rt, if turning to rising of t to terminate road another was replicated when turning to t' in processing set T, what namely had actual geographic position identical with turning to t turns to tnew, then t is turned to by allnewJoin in set Rt；
Step 32, for set Rt turns to t, check each Multiple Intersections attribute of its correspondence, if through turning to t, it is impossible to terminate road sequence along this Multiple Intersections attribute and arrive sequence the last item road, then release and turn to the t corresponding relation with this Multiple Intersections attribute；
Step 33, basis turn to Multiple Intersections attribute corresponding for t terminate road sequence situation and turn to the follow-up actual road network situation of t, build and turn to sub-road network corresponding for t；
Step 34, by replicate road, replicate road arc method decompose turn to sub-road network corresponding for t；
Step 35, turn to and delete the method turned to by increasing, recover the sub-road network connectivity after decomposing, it is ensured that all Multiple Intersections attributes turning to t corresponding are finally split into and turn to t or turn to tnewOne_to_one corresponding, and be no longer turn to the corresponding all of Multiple Intersections attribute of t.
As shown in Figure 4, step 33 is refined further as follows:
Step 331, create A type divergent paths according to the road sequence only having a kind of Multiple Intersections attribute process, this divergent paths added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this divergent paths by through number of times；
Step 332, create Type B divergent paths according to the road sequence having multiple Multiple Intersections attribute process, this divergent paths added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this divergent paths by through number of times；
Step 333, according to node arc on divergent paths by the number of times of process, calculate and turn in the corresponding sub-road network of t each node arc on every divergent paths to need the number of times being replicated.
As it is shown in figure 5, step 34 is refined further as follows:
Step 341, number of copy times according to node arc each on every divergent paths, create the road arc object and new roadside, road object that make new advances；
Step 342, corresponding with node arc for node arc road side attribute is copied in the object of roadside, corresponding newly-built road Hu He road；
Step 343, according to the part attribute of sub-road network practical situation amendment roadside, newly-built road Hu He road object after decomposing.
As shown in Figure 6, step 35 is refined further as follows:
Step 351, judging the type that turns to the corresponding sub-road network of t, if all divergent paths constituting it are all A type divergent paths, then this turns to the sub-road network of t to be A type road network, is otherwise Type B road network；
Step 352, basis turn to its road network connectivity of type recovery of the corresponding sub-road network of t, to A type road network, original road sequence pair is stayed to answer one of them Multiple Intersections attribute, node arc on other A type divergent paths replaces with new duplicated road, Type B road network then stays the corresponding all of Type B divergent paths of original road, and the node arc on all of A type divergent paths replaces with the new road replicated out.
The present invention is by means such as road duplications, to originally turn to multiple crossings enlarged drawing of association, direction road signs attribute etc. on A, dispersion is associated with different turning to, and (these turn to, it is identical at actual road network), so can revise and turn to the characteristic only comprising a crossing, thus accomplishing under the premise without revising guidance path algorithm, easily add the function of association Multiple Intersections attribute.
The above, it it is only present pre-ferred embodiments, not the technical scope of the present invention is imposed any restrictions, therefore every any trickle amendment, equivalent variations and modification above example made according to the technical spirit of the present invention, all still fall within the scope of technical solution of the present invention.
Claims (4)
1. the method increasing association Multiple Intersections attribute in data in navigation electronic map, it is characterised in that comprise the following steps:
Step 1, define following key word:
Road arc: above the roadside, road that figure business provides, according to the topology element that traffic flow direction takes out, it was shown that this roadside, road is submitted through-flow to the situation with this roadside, road that comes in and goes out；
Turn to: being joined end to end by two and including end to end road arc in logic is constituted, and comprises direction information and paths chosen information；
Multiple Intersections attribute: refer to crossing enlarged drawing and the direction road signs object with a plurality of termination road, is a kind of paths chosen information；
Turning to corresponding sub-road network: refer in particular to and turn to through a certain, its degree of depth terminates valid trace roadside number in road sequence, the tree-shaped road network intercepted out from whole road networks corresponding to turning to the Multiple Intersections attribute of correspondence；
Divergent paths: turn in corresponding sub-road network, terminates road to a paths of a certain end road of this sub-road network from what turn to, is made up of a plurality of road that joins end to end；
A type divergent paths: on this divergent paths, the termination road sequence of only one of which Multiple Intersections attribute is passed through；
Type B divergent paths: on this divergent paths, has and passes through more than the termination road sequence of 1 Multiple Intersections attribute；
Node arc: constitute the road arc of divergent paths, except the information of road arc itself, further comprises by the number of times of the termination road sequence process of Multiple Intersections attribute and number of copy times；
Connect in crossing: proposed by figure business, for connecting the roadside, road of internal crossing, crossing point；
Step 2, from the corresponding existing turnaround sequence of multiple Multiple Intersections attributes, filter out need to carry out to process all and turn to, be put in set T, shown in comprising the following steps that:
Step 21, all Multiple Intersections attributes that figure business is provided, be designated as valid trace road by initial for current attribute road with terminating the non-interior link road segment mark in crossing in road sequence, and the road being subsequently noted all refers to effective road；
Step 22, terminate road according to effectively rising of each Multiple Intersections attribute, corresponded to and be there is turning to of identical termination road, now it is likely to occur one and turns to corresponding multiple Multiple Intersections attribute, this being turned to and put in chained list L1, this needs to carry out all nodes in the chained list L1 of Multiple Intersections association process is all elements of set T；
Step 23, for this attribute that may relate to remote direction instruction content of direction road signs, to judge whether direction content shown in it meets merging condition, described merging condition is terminate that the length of road sequence is accumulative exceedes preset threshold value；
Step 24, direction road signs to satisfied merging conditions all in step 23, all merge direction road sign title, and corresponded to corresponding first crossing and turn to；
Step 25, direction road signs to the Multiple Intersections association that can not merge, and other Multiple Intersections relating attribute is all associated with first crossing and turns to, and is turned at this crossing simultaneously and is put in the chained list L1 needing to carry out Multiple Intersections association process；
Step 3, according to corresponding Multiple Intersections attribute feature, replicated by road network analysis, road, increase turns to, deletes the means turned to, process in set T and all turn to involved road network so that the road of each association Multiple Intersections attribute be unique up to, shown in comprising the following steps that:
Step 31, putting in set Rt from the t that turns to of set T, if turning to rising of t to terminate road another was replicated when turning to t' in processing set T, what namely had actual geographic position identical with turning to t turns to tnew, then t is turned to by allnewJoin in set Rt；
Step 32, for set Rt turns to t, check each Multiple Intersections attribute of its correspondence, if through turning to t, it is impossible to terminate road sequence along this Multiple Intersections attribute and arrive sequence the last item road, then release and turn to the t corresponding relation with this Multiple Intersections attribute；
Step 33, basis turn to Multiple Intersections attribute corresponding for t terminate road sequence situation and turn to the follow-up actual road network situation of t, build and turn to sub-road network corresponding for t；
Step 34, by replicate road, replicate road arc method decompose turn to sub-road network corresponding for t；
Step 35, turn to and delete the method turned to by increasing, recover the sub-road network connectivity after decomposing, it is ensured that all Multiple Intersections attributes turning to t corresponding are finally split into and turn to t or turn to tnewOne_to_one corresponding, and be no longer turn to the corresponding all of Multiple Intersections attribute of t.
2. a kind of method increasing association Multiple Intersections attribute in data in navigation electronic map according to claim 1, it is characterised in that step 33 is refined further as follows:
Step 331, create A type divergent paths according to the road sequence only having a kind of Multiple Intersections attribute process, this divergent paths added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this divergent paths by through number of times；
Step 332, create Type B divergent paths according to the road sequence having multiple Multiple Intersections attribute process, this divergent paths added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this divergent paths by through number of times；
Step 333, according to node arc on divergent paths by the number of times of process, calculate and turn in the corresponding sub-road network of t each node arc on every divergent paths to need the number of times being replicated.
3. a kind of method increasing association Multiple Intersections attribute in data in navigation electronic map according to claim 1, it is characterised in that step 34 is refined further as follows:
Step 341, number of copy times according to node arc each on every divergent paths, create the road arc object and new roadside, road object that make new advances；
Step 342, corresponding with node arc for node arc road side attribute is copied in the object of roadside, corresponding newly-built road Hu He road；
Step 343, according to the part attribute of sub-road network practical situation amendment roadside, newly-built road Hu He road object after decomposing.
4. a kind of method increasing association Multiple Intersections attribute in data in navigation electronic map according to claim 1, it is characterised in that step 35 is refined further as follows:
Step 351, judging the type that turns to the corresponding sub-road network of t, if all divergent paths constituting it are all A type divergent paths, then this turns to the sub-road network of t to be A type road network, is otherwise Type B road network；
Step 352, basis turn to its road network connectivity of type recovery of the corresponding sub-road network of t, to A type road network, original road sequence pair is stayed to answer one of them Multiple Intersections attribute, node arc on other A type divergent paths replaces with new duplicated road, Type B road network then stays the corresponding all of Type B divergent paths of original road, and the node arc on all of A type divergent paths replaces with the new road replicated out.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210521975.XA CN103852083B (en) | 2012-12-07 | 2012-12-07 | A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210521975.XA CN103852083B (en) | 2012-12-07 | 2012-12-07 | A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103852083A CN103852083A (en) | 2014-06-11 |
| CN103852083B true CN103852083B (en) | 2016-06-29 |
Family
ID=50860024
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210521975.XA Active CN103852083B (en) | 2012-12-07 | 2012-12-07 | A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103852083B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105571600B (en) * | 2014-10-15 | 2018-08-21 | 高德信息技术有限公司 | A kind of whole process general view route generation method and device |
| EP3436780A1 (en) * | 2016-03-31 | 2019-02-06 | HERE Global B.V. | Definition of one or more gateways for linking navigation data sets representing maps of at least partially overlapping geographic regions |
| CN108072375B (en) * | 2016-11-09 | 2020-01-10 | 腾讯科技（深圳）有限公司 | Information identification method in navigation and terminal |
| CN108709561B (en) * | 2018-04-15 | 2020-10-30 | 武汉中海庭数据技术有限公司 | Matching algorithm for different-scale data based on global road network characteristics |
| CN110188152B (en) * | 2019-05-30 | 2021-06-04 | 北京百度网讯科技有限公司 | Electronic map road information processing method and device, electronic equipment and readable medium |
| CN112732859B (en) * | 2021-01-25 | 2022-05-06 | 腾讯科技（深圳）有限公司 | Prompt information generation method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3961361B2 (en) * | 2002-07-22 | 2007-08-22 | アルパイン株式会社 | Navigation device |
| CN101140166A (en) * | 2006-09-06 | 2008-03-12 | 阿尔派株式会社 | Navigation device and describing method of cross point indication map |
| CN101275849A (en) * | 2007-03-29 | 2008-10-01 | Skc&C株式会社 | Crossroad guide method in a navigation system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4509620B2 (en) * | 2004-03-24 | 2010-07-21 | クラリオン株式会社 | In-vehicle information terminal, summary map creation device, summary map display method |
-
2012
- 2012-12-07 CN CN201210521975.XA patent/CN103852083B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP3961361B2 (en) * | 2002-07-22 | 2007-08-22 | アルパイン株式会社 | Navigation device |
| CN101140166A (en) * | 2006-09-06 | 2008-03-12 | 阿尔派株式会社 | Navigation device and describing method of cross point indication map |
| CN101275849A (en) * | 2007-03-29 | 2008-10-01 | Skc&C株式会社 | Crossroad guide method in a navigation system |
Non-Patent Citations (3)
| Title |
|---|
| Gap acceptance for vehicles turning left across on-comming traffic: Implications for Intersection Decision Support design;Ragland David R, 等;《eScholarship University of California》;20060104;论文正文第1-25页 * |
| 车载导航系统中的路径诱导模型与数据组织;李宏利;《地理信息世界》;20111030(第5期);第37-41页 * |
| 车载导航系统中顾及道路转向限制的弧段Dijkstra算法;韩刚 等;《测绘学报》;20021130;第31卷(第4期);第366-368页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103852083A (en) | 2014-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103852083B (en) | A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map | |
| Maiti et al. | A conceptualization of vehicle platoons and platoon operations | |
| Tostes et al. | From data to knowledge: City-wide traffic flows analysis and prediction using bing maps | |
| Arellano et al. | TrafficModeler extensions: A case for rapid VANET simulation using, OMNET++, SUMO, and VEINS | |
| CN101359434A (en) | Process for constructing road net model for traffic navigation system and traffic emulation system | |
| CN110619426B (en) | Road network model construction method, device, equipment and storage medium | |
| CN104835339B (en) | A kind of reminding method and system based on geographical position to special traffic violation | |
| Pawar et al. | Minor-street vehicle dilemma while maneuvering at unsignalized intersections | |
| CN110807931B (en) | Traffic network directed graph path model construction and solving method based on steering relation | |
| KR20220137035A (en) | Method and device for building navigation elements on maps | |
| Chai et al. | Traffic performance of shared lanes at signalized intersections based on cellular automata modeling | |
| CN112818071A (en) | Traffic management field knowledge graph construction method and device based on unified road network | |
| CN113704853A (en) | Multisource road network data automatic fusion method based on road element topological feature classification | |
| David et al. | The eco-driving behaviour: A strategic way to control tailpipe emission | |
| CN110530378B (en) | Vehicle positioning method based on MAP message set of V2X | |
| Munigety et al. | Analysis and modelling of tactical decisions of vehicular lateral movement in mixed traffic environment | |
| JP2004271576A (en) | Route network data updating system | |
| CN115100867A (en) | Urban intelligent traffic simulation method based on digital twins | |
| Lee et al. | Congestion score computation of big traffic data | |
| Gupta et al. | Simulation of pedestrian at intersection in urban congested area | |
| CN101308028B (en) | Navigational route database generalization method suitable for road information loading | |
| Sangole et al. | Modeling vehicle group gap acceptance at uncontrolled T-intersections in Indian traffic | |
| CN110428655A (en) | A kind of data processing method in the forbidden section of lorry | |
| Liu et al. | Research for incremental update data model applied in navigation electronic map | |
| CN104835346B (en) | Road network marking method for traffic crossing state indication |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |