CN103852083A - Method for increasing correlated multi-intersection attributes in data of navigation electronic map - Google Patents

Method for increasing correlated multi-intersection attributes in data of navigation electronic map Download PDF

Info

Publication number
CN103852083A
CN103852083A CN201210521975.XA CN201210521975A CN103852083A CN 103852083 A CN103852083 A CN 103852083A CN 201210521975 A CN201210521975 A CN 201210521975A CN 103852083 A CN103852083 A CN 103852083A
Authority
CN
China
Prior art keywords
road
attribute
multiple intersections
turn
turns
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
Application number
CN201210521975.XA
Other languages
Chinese (zh)
Other versions
CN103852083B (en
Inventor
秦科元
陆萍
陈从华
季刚
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xiamen Yaxun Zhilian Technology Co ltd
Original Assignee
Xiamen Yaxon Networks Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xiamen Yaxon Networks Co Ltd filed Critical Xiamen Yaxon Networks Co Ltd
Priority to CN201210521975.XA priority Critical patent/CN103852083B/en
Publication of CN103852083A publication Critical patent/CN103852083A/en
Application granted granted Critical
Publication of CN103852083B publication Critical patent/CN103852083B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/28Navigation; 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/30Map- or contour-matching
    • G01C21/32Structuring or formatting of map data
    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/36Input/output arrangements for on-board computers
    • G01C21/3667Display of a road map
    • G01C21/367Details, e.g. road map scale, orientation, zooming, illumination, level of detail, scrolling of road map or positioning of current position marker

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Navigation (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention provides a method for increasing correlated multi-intersection attributes in data of a navigation electronic map. The method comprises the following steps: analyzing a partial road network of a turning direction containing a plurality of multi-intersection attributes; a plurality of paths and newly-added correlated turning directions are additionally defined on a partial road; and revising a many-to-one relation among the multi-intersection attributes and the turning direction into a one-to-one relation so that road path induction information of a plurality of intersections which are very close is simple and accurate. The method is used for dispersedly correlating a plurality of intersection amplifying maps and direction road sign attributes correlated with the previous turning direction A on the different turning directions through the means of road copying and the like, so that the turning direction can not be modified and the properties of only one intersection are included, and furthermore, a function of adding the correlated multi-intersection attributes is easily added on the premise that a navigation path algorithm is not modified, and the plurality of intersections which are very close are very simple and accurate in a broadcasting process.

Description

A kind of method that increases associated Multiple Intersections attribute in data in navigation electronic map
Technical field
The present invention relates to data in navigation electronic map field, particularly relate to a kind of method that increases associated 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 8,650 ten thousand.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 20% left and right in whole auto navigation industrial chain of auto navigation core.
In map of navigation electronic development process, will produce and manyly new can promote ground plot quality, strengthen the figure layer information that hommization is considered.Map of navigation electronic physical format is the map of navigation electronic form using in navigational system.In the figure layer information increasing in map of navigation electronic, when inevitably there will be some as crossing enlarged drawing, direction road signs association the attributed graph layer at crossing in multiple actual road networks.But in the crossing data of current domestic Duo Jia map datum manufacturer, only comprise an actual road network crossing.And turn to data in our map of navigation electronic physical format data, also just comprise a crossing.If comprise multiple crossings in turning to, need to revise map of navigation electronic physical format, thereby also can have influence on the path planning algorithm of navigation engine.
Summary of the invention
In order to address the above problem, the present invention proposes a kind of method that increases associated Multiple Intersections attribute in data in navigation electronic map, thereby accomplish under the prerequisite without modification guidance path algorithm, easily add the function of associated Multiple Intersections attribute, make the very near some crossings of distance more accurately succinct in the time reporting.
A method that increases associated Multiple Intersections attribute in data in navigation electronic map, comprises the following steps:
Step 1, be defined as follows keyword:
Road arc: above the roadside, road that provides of figure business, the topology element taking out according to traffic flow direction, show this roadside, road submit through-flow to the situation in this roadside, road of coming in and going out;
Turn to: formed by two end to end road arcs in logic that join end to end and comprise, comprise direction information and path induction information; Multiple Intersections attribute: referring to have many crossing enlarged drawing, the direction road signs objects that stop road, is a kind of path induction information;
Turn to corresponding sub-road network: refer in particular to through a certain and turn to, its degree of depth is corresponding to turning to corresponding Multiple Intersections attribute to stop valid trace roadside number in road sequence, the tree type road network intercepting out from whole road networks;
Fork path: turn in corresponding sub-road network, the paths from the termination road that turns to a certain end road of this sub-road network, is made up of many roads that join end to end;
A type fork path: on this fork path, only have the termination road sequence process of a Multiple Intersections attribute;
Type B fork path: on this fork path, have the termination road sequence process that is greater than 1 Multiple Intersections attribute;
Node arc: form the road arc in fork path, except the information of road arc itself, also comprised by number of times and the number of copy times of the termination road sequence process of Multiple Intersections attribute;
In crossing, connect: proposed by figure business, for connecting roadside, Dian road, inner crossing, crossing;
Step 2, from correspondence the existing turnaround sequence of multiple Multiple Intersections attributes, filter out need to process all and turn to, be put into set T in, concrete steps are as follows:
Step 21, all Multiple Intersections attributes that figure business is provided, be designated as valid trace road by initial current attribute road with stopping the non-interior link road segment mark in crossing in road sequence, and the road of mentioning in later step means effective road;
Step 22, according to each Multiple Intersections attribute rise stop road, corresponded to and there is turning to of identical termination road, now may occur that turns to a corresponding multiple Multiple Intersections attribute, this is turned to and puts into chained list L1, in L1, all nodes are all elements of set T;
Step 23, for this attribute that may relate to remote direction content of direction road signs, judge whether the content of direction shown in it meets merging condition, described merging condition is that the length accumulative total that stops road sequence exceedes preset threshold value;
Step 24, direction road signs to all satisfied merging conditions in step 23, all merge this direction road signs 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 this crossing turned to and be put in the chained list L1 that need to carry out Multiple Intersections association process simultaneously;
Step 3, according to corresponding Multiple Intersections attribute feature, the means that copy, turn to increase, revise by road network analysis, road, processing that set is all in T turns to related road network, is unique reaching thereby make the road of each associated Multiple Intersections attribute, and concrete steps are as follows:
Step 31, will put into set Rt from the t that turns to of set T, if turn to rising of t to stop road, in set T, another had been replicated while turning to t' processing, and had had and the t that turns to that turns to the identical actual geographic of t position new, by all t that turn to newjoin in set Rt;
Step 32, for set in Rt, turn to t, check each Multiple Intersections attribute of its correspondence, if through turning to t, can not stop road sequence along this Multiple Intersections attribute and arrive sequence the last item road, remove the corresponding relation that turns to t and this Multiple Intersections attribute;
Step 33, basis turn to the Multiple Intersections attribute that t is corresponding stop road sequence situation and turn to the follow-up actual road network situation of t, build and turn to the sub-road network that t is corresponding;
Step 34, by copying road, the method that copies road arc decomposes and turns to the sub-road network that t is corresponding;
Step 35, turn to and delete by increase the method turning to, recover the sub-road network connectivity after decomposing, guarantee to turn to all Multiple Intersections attributes that t is corresponding to be finally split into and to turn to t or turn to t newcorresponding one by one, and be no longer the Multiple Intersections attribute that turns to t corresponding all.
By step 33, further refinement is as follows:
Step 331, create A type fork path according to the road sequence that only has a kind of Multiple Intersections attribute process, this fork path added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this fork path by through number of times;
Step 332, create Type B fork path according to the road sequence that has multiple Multiple Intersections attribute process, this fork path added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this fork path by through number of times;
Step 333, according to node arc on fork path by the number of times of process, calculate and turn to the number of times that in the corresponding sub-road network of t, on every fork path, each node arc need to be replicated.
By step 34, further refinement is as follows:
Step 341, according to the number of copy times of each node arc on every fork path, create roadside, the road arc object He Xin road object making new advances;
Step 342, corresponding to node arc and node arc road side attribute is copied in the object of roadside, corresponding newly-built road Hu He road;
Step 343, revise the part attribute of roadside, newly-built road Hu He road object according to sub-road network actual conditions after decomposing.
By step 35, further refinement is as follows:
Step 351, judgement turn to the type of the corresponding sub-road network of t, are all A type fork path if form its all forks path, and this sub-road network that turns to t is A type road network, otherwise is 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, leave corresponding one of them the Multiple Intersections attribute of original road sequence, node arc on other A type fork path replaces with new duplicated road, Type B road network is left to Type B fork path corresponding to original road, and the node arc on all A type fork paths replaces with the road that newly copies out.
The present invention is by decomposing the place segment path network that turns to that contains multiple Multiple Intersections attributes, on segment path, define separately some roads and newly-increased relevant turning to, many-to-one relationship by Multiple Intersections attribute and between turning to is modified to man-to-man relation, thereby makes at some path induction informations from the crossing place close to very more succinct accurately.The present invention is by means such as road copy, A upper associated multiple crossings enlarged drawing, direction road signs attribute will be turned to originally, (these turn to disperse to be associated with different turning to, identical at actual road network), can revise like this and turn to the characteristic that only comprises a crossing, thereby accomplish that without revising under the prerequisite of guidance path algorithm the function of easily adding associated Multiple Intersections attribute makes the very near some crossings of distance more accurately succinct in the time reporting.
Accompanying drawing explanation
Fig. 1 is 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.
Embodiment
As shown in Figure 1, a kind of method that increases associated Multiple Intersections attribute in data in navigation electronic map of the present invention, comprises the following steps:
Step 1, be defined as follows keyword:
Road arc: above the roadside, road that provides of figure business, the topology element taking out according to traffic flow direction, show this roadside, road submit through-flow to the situation in this roadside, road of coming in and going out;
Turn to: formed by two end to end road arcs in logic that join end to end and comprise, comprise direction information and path induction information; Multiple Intersections attribute: referring to have many crossing enlarged drawing and the direction road signs objects that stop road, is a kind of path induction information;
Turn to corresponding sub-road network: refer in particular to through a certain and turn to, its degree of depth is corresponding to turning to corresponding Multiple Intersections attribute to stop valid trace roadside number in road sequence, the tree type road network intercepting out from whole road networks;
Fork path: turn in corresponding sub-road network, the paths from the termination road that turns to a certain end road of this sub-road network, is made up of many roads that join end to end;
A type fork path: on this fork path, only have the termination road sequence process of a Multiple Intersections attribute;
Type B fork path: on this fork path, have the termination road sequence process that is greater than 1 Multiple Intersections attribute;
Node arc: form the road arc in fork path, except the information of road arc itself, also comprised by number of times and the number of copy times of the termination road sequence process of Multiple Intersections attribute;
In crossing, connect: proposed by figure business, for connecting roadside, Dian road, inner crossing, crossing;
Step 2, from correspondence the existing turnaround sequence of multiple Multiple Intersections attributes, filter out need to process all and turn to and be 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 stop invalid road in road sequence, initial current attribute road is designated as to valid trace road with stopping the non-interior link road segment mark in crossing in road sequence, and the road of mentioning below all refers to effective road;
Step 22, stop road according to effectively rising of each Multiple Intersections attribute, corresponded to and there is turning to of identical termination road, now may occur that turns to a corresponding multiple Multiple Intersections attribute, this is turned to and puts into chained list L1, and this need to carry out all nodes in the chained list L1 of Multiple Intersections association process is all elements of set T;
Step 23, will judge for this attribute that may relate to remote direction content of direction road signs whether the content of direction shown in it meets merging condition, described merging condition is that the length accumulative total that stops road sequence exceedes preset threshold value;
Step 24, direction road signs to all satisfied merging conditions in step 23, all merge this direction road signs 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 this crossing turned to and be put in the chained list L1 that need to carry out Multiple Intersections association process simultaneously;
Step 3, according to corresponding Multiple Intersections attribute feature, the means that copy, turn to increase, revise by road network analysis, road, processing that set is all in T turns to related road network, is unique reaching thereby make the road of each associated Multiple Intersections attribute, concrete steps as shown in Figure 3:
Step 31, search it and work turning to of stopping that road obtains after copying according to be analyzed turning to, the t that turns to from set T is put into set Rt, be replicated when another turns to t' in processing set T if turn to rising of t to stop road, had and the t that turns to that turns to the identical actual geographic of t position new, by all t that turn to newjoin in set Rt;
Step 32, for set in Rt, turn to t, check each Multiple Intersections attribute of its correspondence, if through turning to t, can not stop road sequence along this Multiple Intersections attribute and arrive sequence the last item road, remove the corresponding relation that turns to t and this Multiple Intersections attribute;
Step 33, basis turn to the Multiple Intersections attribute that t is corresponding stop road sequence situation and turn to the follow-up actual road network situation of t, build and turn to the sub-road network that t is corresponding;
Step 34, by copying road, the method that copies road arc decomposes and turns to the sub-road network that t is corresponding;
Step 35, turn to and delete by increase the method turning to, recover the sub-road network connectivity after decomposing, guarantee to turn to all Multiple Intersections attributes that t is corresponding to be finally split into and to turn to t or turn to t newcorresponding one by one, and be no longer the Multiple Intersections attribute that turns to t corresponding all.
As shown in Figure 4, by step 33, further refinement is as follows:
Step 331, create A type fork path according to the road sequence that only has a kind of Multiple Intersections attribute process, this fork path added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this fork path by through number of times;
Step 332, create Type B fork path according to the road sequence that has multiple Multiple Intersections attribute process, this fork path added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this fork path by through number of times;
Step 333, according to node arc on fork path by the number of times of process, calculate and turn to the number of times that in the corresponding sub-road network of t, on every fork path, each node arc need to be replicated.
As shown in Figure 5, by step 34, further refinement is as follows:
Step 341, according to the number of copy times of each node arc on every fork path, create roadside, the road arc object He Xin road object making new advances;
Step 342, corresponding to node arc and node arc road side attribute is copied in the object of roadside, corresponding newly-built road Hu He road;
Step 343, revise the part attribute of roadside, newly-built road Hu He road object according to sub-road network actual conditions after decomposing.
As shown in Figure 6, by step 35, further refinement is as follows:
Step 351, judgement turn to the type of the corresponding sub-road network of t, are all A type fork path if form its all forks path, and this sub-road network that turns to t is A type road network, otherwise is 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, leave corresponding one of them the Multiple Intersections attribute of original road sequence, node arc on other A type fork path replaces with new duplicated road, Type B road network is left to Type B fork path corresponding to original road, and the node arc on all A type fork paths replaces with the road that newly copies out.
The present invention is by means such as road copy, A upper associated multiple crossings enlarged drawing, direction road signs attribute etc. will be turned to originally, (these turn to disperse to be associated with different turning to, identical at actual road network), can revise like this and turn to the characteristic that only comprises a crossing, thereby accomplish without revising under the prerequisite of guidance path algorithm the function of easily adding associated Multiple Intersections attribute.
The above, it is only preferred embodiment of the present invention, not technical scope of the present invention is imposed any restrictions, therefore any trickle modification, equivalent variations and modification that every foundation technical spirit of the present invention is done above embodiment all still belong in the scope of technical solution of the present invention.

Claims (4)

1. a method that increases associated Multiple Intersections attribute in data in navigation electronic map, is characterized in that comprising the following steps:
Step 1, be defined as follows keyword:
Road arc: above the roadside, road that provides of figure business, the topology element taking out according to traffic flow direction, show this roadside, road submit through-flow to the situation in this roadside, road of coming in and going out;
Turn to: formed by two end to end road arcs in logic that join end to end and comprise, comprise direction information and path induction information;
Multiple Intersections attribute: referring to have many crossing enlarged drawing and the direction road signs objects that stop road, is a kind of path induction information;
Turn to corresponding sub-road network: refer in particular to through a certain and turn to, its degree of depth is corresponding to turning to corresponding Multiple Intersections attribute to stop valid trace roadside number in road sequence, the tree type road network intercepting out from whole road networks;
Fork path: turn in corresponding sub-road network, the paths from the termination road that turns to a certain end road of this sub-road network, is made up of many roads that join end to end;
A type fork path: on this fork path, only have the termination road sequence process of a Multiple Intersections attribute;
Type B fork path: on this fork path, have the termination road sequence process that is greater than 1 Multiple Intersections attribute;
Node arc: form the road arc in fork path, except the information of road arc itself, also comprised by number of times and the number of copy times of the termination road sequence process of Multiple Intersections attribute;
In crossing, connect: proposed by figure business, for connecting roadside, Dian road, inner crossing, crossing;
Step 2, from correspondence the existing turnaround sequence of multiple Multiple Intersections attributes, filter out need to process all and turn to, be put into set T in, concrete steps are as follows:
Step 21, all Multiple Intersections attributes that figure business is provided, be designated as valid trace road by initial current attribute road with stopping the non-interior link road segment mark in crossing in road sequence, and the road of mentioning below all refers to effective road;
Step 22, stop road according to effectively rising of each Multiple Intersections attribute, corresponded to and there is turning to of identical termination road, now may occur that turns to a corresponding multiple Multiple Intersections attribute, this is turned to and puts into chained list L1, and this need 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 content of direction road signs, judge whether the content of direction shown in it meets merging condition, described merging condition is that the length accumulative total that stops road sequence exceedes preset threshold value;
Step 24, direction road signs to all satisfied merging conditions in step 23, all merge this direction road signs 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 this crossing turned to and be put in the chained list L1 that need to carry out Multiple Intersections association process simultaneously;
Step 3, according to corresponding Multiple Intersections attribute feature, the means that copy, turn to increase, revise by road network analysis, road, processing that set is all in T turns to related road network, is unique reaching thereby make the road of each associated Multiple Intersections attribute, and concrete steps are as follows:
Step 31, will put into set Rt from the t that turns to of set T, if turn to rising of t to stop road, in set T, another had been replicated while turning to t' processing, and had had and the t that turns to that turns to the identical actual geographic of t position new, by all t that turn to newjoin in set Rt;
Step 32, for set in Rt, turn to t, check each Multiple Intersections attribute of its correspondence, if through turning to t, can not stop road sequence along this Multiple Intersections attribute and arrive sequence the last item road, remove the corresponding relation that turns to t and this Multiple Intersections attribute;
Step 33, basis turn to the Multiple Intersections attribute that t is corresponding stop road sequence situation and turn to the follow-up actual road network situation of t, build and turn to the sub-road network that t is corresponding;
Step 34, by copying road, the method that copies road arc decomposes and turns to the sub-road network that t is corresponding;
Step 35, turn to and delete by increase the method turning to, recover the sub-road network connectivity after decomposing, guarantee to turn to all Multiple Intersections attributes that t is corresponding to be finally split into and to turn to t or turn to t newcorresponding one by one, and be no longer the Multiple Intersections attribute that turns to t corresponding all.
2. a kind of method that increases associated Multiple Intersections attribute in data in navigation electronic map according to claim 1, is characterized in that further refinement is as follows by step 33:
Step 331, create A type fork path according to the road sequence that only has a kind of Multiple Intersections attribute process, this fork path added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this fork path by through number of times;
Step 332, create Type B fork path according to the road sequence that has multiple Multiple Intersections attribute process, this fork path added and turns to the corresponding sub-road network of t, add up simultaneously every node arc on this fork path by through number of times;
Step 333, according to node arc on fork path by the number of times of process, calculate and turn to the number of times that in the corresponding sub-road network of t, on every fork path, each node arc need to be replicated.
3. a kind of method that increases associated Multiple Intersections attribute in data in navigation electronic map according to claim 1, is characterized in that further refinement is as follows by step 34:
Step 341, according to the number of copy times of each node arc on every fork path, create roadside, the road arc object He Xin road object making new advances;
Step 342, corresponding to node arc and node arc road side attribute is copied in the object of roadside, corresponding newly-built road Hu He road;
Step 343, revise the part attribute of roadside, newly-built road Hu He road object according to sub-road network actual conditions after decomposing.
4. a kind of method that increases associated Multiple Intersections attribute in data in navigation electronic map according to claim 1, is characterized in that further refinement is as follows by step 35:
Step 351, judgement turn to the type of the corresponding sub-road network of t, are all A type fork path if form its all forks path, and this sub-road network that turns to t is A type road network, otherwise is 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, leave corresponding one of them the Multiple Intersections attribute of original road sequence, node arc on other A type fork path replaces with new duplicated road, Type B road network is left to Type B fork path corresponding to original road, and the node arc on all A type fork paths replaces with the road that newly copies out.
CN201210521975.XA 2012-12-07 2012-12-07 A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map Active CN103852083B (en)

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 true CN103852083A (en) 2014-06-11
CN103852083B 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)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105571600A (en) * 2014-10-15 2016-05-11 高德信息技术有限公司 Method and device for generating whole-course overview route
WO2018086545A1 (en) * 2016-11-09 2018-05-17 腾讯科技(深圳)有限公司 Information identification method in navigation, terminal and computer storage medium
CN108709561A (en) * 2018-04-15 2018-10-26 武汉中海庭数据技术有限公司 A kind of matching algorithm of the different scale data based on global road network feature
CN109073394A (en) * 2016-03-31 2018-12-21 赫尔环球有限公司 Definition to one or more gateways that the navigation data set for the map for indicating least partially overlapped geographic area is linked
CN110188152A (en) * 2019-05-30 2019-08-30 北京百度网讯科技有限公司 Electronic map road information processing method and device, electronic equipment, readable medium
CN112732859A (en) * 2021-01-25 2021-04-30 腾讯科技(深圳)有限公司 Prompt information generation method and device, electronic equipment and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050216188A1 (en) * 2004-03-24 2005-09-29 Xanavi Informatics Corporations On-vehicle information terminal, abridged map generating apparatus, abridged map display method and display apparatus
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

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3961361B2 (en) * 2002-07-22 2007-08-22 アルパイン株式会社 Navigation device
US20050216188A1 (en) * 2004-03-24 2005-09-29 Xanavi Informatics Corporations On-vehicle information terminal, abridged map generating apparatus, abridged map display method and display apparatus
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)

* Cited by examiner, † Cited by third party
Title
RAGLAND DAVID R, 等: "Gap acceptance for vehicles turning left across on-comming traffic: Implications for Intersection Decision Support design", 《ESCHOLARSHIP UNIVERSITY OF CALIFORNIA》 *
李宏利: "车载导航系统中的路径诱导模型与数据组织", 《地理信息世界》 *
韩刚 等: "车载导航系统中顾及道路转向限制的弧段Dijkstra算法", 《测绘学报》 *

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105571600A (en) * 2014-10-15 2016-05-11 高德信息技术有限公司 Method and device for generating whole-course overview route
CN105571600B (en) * 2014-10-15 2018-08-21 高德信息技术有限公司 A kind of whole process general view route generation method and device
CN109073394A (en) * 2016-03-31 2018-12-21 赫尔环球有限公司 Definition to one or more gateways that the navigation data set for the map for indicating least partially overlapped geographic area is linked
WO2018086545A1 (en) * 2016-11-09 2018-05-17 腾讯科技(深圳)有限公司 Information identification method in navigation, terminal and computer storage medium
US11231293B2 (en) 2016-11-09 2022-01-25 Tencent Technology (Shenzhen) Company Limited Method, terminal, and computer storage medium for identifying information during navigation
CN108709561A (en) * 2018-04-15 2018-10-26 武汉中海庭数据技术有限公司 A kind of matching algorithm of the different scale data based on global road network feature
US11486714B2 (en) 2018-04-15 2022-11-01 Wuhhan Kotel Big Date Corporation Matching algorithm for data with different scales based on global road network features
CN110188152A (en) * 2019-05-30 2019-08-30 北京百度网讯科技有限公司 Electronic map road information processing method and device, electronic equipment, readable medium
CN112732859A (en) * 2021-01-25 2021-04-30 腾讯科技(深圳)有限公司 Prompt information generation method and device, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN103852083B (en) 2016-06-29

Similar Documents

Publication Publication Date Title
CN106802954B (en) Unmanned vehicle semantic map model construction method and application method thereof on unmanned vehicle
CN103852083B (en) A kind of method increasing association Multiple Intersections attribute in data in navigation electronic map
EP3318985A1 (en) Driving route matching method and apparatus and storage medium
Graser et al. Towards an open source analysis toolbox for street network comparison: Indicators, tools and results of a comparison of OSM and the official A ustrian reference graph
CN104331422A (en) Road section type presumption method
CN101359434A (en) Process for constructing road net model for traffic navigation system and traffic emulation system
WO2011047729A1 (en) Incremental map generation, refinement and extension with gps traces
Pawar et al. Minor-street vehicle dilemma while maneuvering at unsignalized intersections
CN104899357A (en) Topology data extraction method based on AutoCAD plane intersection engineering drawing
WO2022205616A1 (en) Method and apparatus for constructing navigation elements in map
CN104422451A (en) Road recognition method and road recognition apparatus
JP2018538589A (en) Situation-dependent transmission of MAP messages to improve digital maps
Zhou et al. Experimental analysis of various types of road intersections for interchange detection
US11598639B2 (en) System for offsite navigation
CN110807931A (en) Traffic network directed graph path model construction and solving method based on steering relation
CN115292507A (en) Traffic travel analysis method, device, equipment and medium based on knowledge graph
CN112818071A (en) Traffic management field knowledge graph construction method and device based on unified road network
Wang et al. Research and application of traffic visualization based on vehicle GPS big data
CN101916267A (en) Intelligent spatial data object modeling method applied to management of spatial data resource of road system
CN109767617B (en) Method for studying and judging abnormal data of public security traffic management service based on Apriori
CN104331424B (en) The purification method of sensitive trajectory model in a kind of user's motion track
Liu et al. New generation of smart highway: Framework and insights
Tchuente et al. Providing more regular road signs infrastructure updates for connected driving: A crowdsourced approach with clustering and confidence level
CN111383450B (en) Traffic network description method and device
Favreau et al. What are intersections for pedestrian users?

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
CP03 Change of name, title or address
CP03 Change of name, title or address

Address after: 361009 Xiamen Torch High tech Zone Software Park Innovation Building C Area 303-E, Fujian Province

Patentee after: Xiamen Yaxun Zhilian Technology Co.,Ltd.

Country or region after: China

Address before: Xiamen City, Fujian province 361009 software industry base in view of the road No. 46

Patentee before: XIAMEN YAXON NETWORK Co.,Ltd.

Country or region before: China