CN101635114A - Method and system for updating road codes and map data server - Google Patents
Method and system for updating road codes and map data server Download PDFInfo
- Publication number
- CN101635114A CN101635114A CN200810068590A CN200810068590A CN101635114A CN 101635114 A CN101635114 A CN 101635114A CN 200810068590 A CN200810068590 A CN 200810068590A CN 200810068590 A CN200810068590 A CN 200810068590A CN 101635114 A CN101635114 A CN 101635114A
- Authority
- CN
- China
- Prior art keywords
- road
- road network
- new
- node
- network node
- 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.)
- Pending
Links
Images
Landscapes
- Navigation (AREA)
Abstract
The invention is suitable to be used in a field of traffic information coding, and provides a method and a system for updating road codes and a map data server. The method comprises the following steps of: according to a new-edition map, generating node data of a new road network; matching the generated nodes of the new road network with the nodes of the old road network; and coding the non-matched nodes of the new road network. In the method, the nodes of the new and the old road networks are matched, the nodes which are successfully matched of the new road network use the codes of the nodes of the old road network, the nodes failed to be matched of the new road network are coded according to the type to which the nodes belong, so that the method for updating the road codes is realized. Moreover, the uniqueness and the continuous usability of the road codes in the digital map in different editions are ensured; and in particular, under a condition that the map editions of the ATMS and the terminal are not synchronously updated, the method can ensure that the terminal uses the majority of the information data which are sent by the ATMS and related to the traffic network without updating the map edition.
Description
Technical field
The invention belongs to the transport information coding field, relate in particular to a kind of road codes update method, system and map data server.
Background technology
Advanced traffic control system (Advanced Traffic Management Systems, ATMS) by the various transport information in the road traffic road network are gathered in real time, transmission and analyzing and processing, obtain road traffic condition, for the traveler and the participant of road traffic provides decision support, reduce the travel time that causes by congested in traffic and traffic hazard to greatest extent and incur loss through delay, improve the security and the operational efficiency of road traffic.
The transport information of ATMS is expressed, and need encode to the road of numerical map usually, is transferred on user's the traffic information terminal to reach in the mode of backstage calculating traffic condition information by road codes.
To road codes, mainly be at present the uniqueness that guarantees coding by the Data Source of map manufacturer, can accomplish that promptly road codes is unique in the numerical map of a version.If the numerical map edition upgrading of this map manufacturer, might can change to some extent by original road codes so, in the numerical map of two versions, new and old road codes can't be corresponding one by one, same the corresponding different coding of road possibility causes former many historical informations relevant for road codes to use.At this moment, the road codes of ATMS has upgraded if the road codes of terminal does not have to upgrade, and then terminal can produce wrong explanation to the transport information that ATMS sends, and misleads the user.Even ground constantization of graph code also has a limitation so in the time of the assurance map upgrading of map manufacturer when using map, must bind with map manufacturer, change to other map as needs, then be very difficult.
Summary of the invention
The purpose of the embodiment of the invention is to provide a kind of road codes update method, is intended to solve when having ATMS renewal map now the problem that new and old road codes is not unique.
The embodiment of the invention is achieved in that a kind of road codes update method, and described method comprises the steps:
Generate new road network node data according to new version map;
With new road network node and the old road network node matching that generates; And
To the new road network nodes encoding that does not mate
Another purpose of the embodiment of the invention is to provide a kind of road codes update system, and described system comprises:
The map topology processing unit is used to read that the new edition electronic map data is analyzed, topology is handled, and forms traffic network, generates new road network node data;
Old road network node matching unit newly,, be used for the node location coupling of order, revise described new road network node data and output according to matching result with node location with old each node of road network that reads of each node of traffic network of described map topology processing unit generation; And
The matched node coding unit is not used for the new road network node that the new road network node data that described new, old road network node matching unit is exported does not mate is encoded.
Another purpose of the embodiment of the invention is to provide a kind of map data server that comprises above-mentioned road codes update system.
In embodiments of the present invention, mate by node new and old traffic network, the new traffic network node that the match is successful is continued to use the coding of old acquaintance's path net node, to mating unsuccessful new traffic network nodes encoding, has realized a kind of road codes update method according to affiliated type.The uniqueness and the lasting availability of road codes in the numerical map of different editions have been guaranteed, be specially adapted to the inconsistent situation of map version updating between ATMS and the terminal, can guarantee that with the method the terminal map version does not upgrade the most network of communication lines relevant information data that yet can use ATMS to send.
Description of drawings
Fig. 1 is the road synoptic diagram that the embodiment of the invention provides;
Fig. 2 is the realization flow figure of the road codes update method that provides of the embodiment of the invention;
Fig. 3 be the embodiment of the invention provide to the process flow diagram of new road network nodes encoding of coupling not;
Fig. 4 is the crossing change type synoptic diagram that the embodiment of the invention provides;
Partition type synoptic diagram is provided in the road that provides of the embodiment of the invention Fig. 5;
Fig. 6 is the road extension type synoptic diagram that the embodiment of the invention provides;
Fig. 7 is that the road that the embodiment of the invention provides extends crossing type synoptic diagram;
Fig. 8 is that the road extension that the embodiment of the invention provides converges the type synoptic diagram;
Fig. 9 is the structural drawing of the road codes update system that provides of the embodiment of the invention;
Figure 10 is the structural drawing of the nodes encoding module that provides of the embodiment of the invention.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer,, the present invention is further elaborated below in conjunction with drawings and Examples.Should be appreciated that specific embodiment described herein only in order to explanation the present invention, and be not used in qualification the present invention.
In embodiments of the present invention, mate by node new and old traffic network, the new traffic network node that the match is successful is continued to use the coding of old acquaintance's path net node, to mating unsuccessful new traffic network nodes encoding, has realized a kind of road codes update method according to affiliated type.
Road is meant that numerical map the preceding paragraph does not have the road of branch.As shown in Figure 1, expression has 5 roads, can represent according to the highway section, promptly is expressed as road ABC, D, E, F, G; Also can use end points to represent, promptly be expressed as road abce, de, ef, fh, fg.What suppose that road represents is directive, as shown in Figure 1, if road ABC can two way, can be expressed as two road abce and ecba, if road ABC can only one-way traffic, then is expressed as road abce.As ae, ed, de.
Node is meant the intersection point (as the e among Fig. 1, f) of a road and its another road, the perhaps end of a road (as a among Fig. 1, d, g, h).
As can be seen, how complicated no matter the shape of a road have, as long as middle do not have other node, can think a road, for example the road abce shown in Fig. 1.The simplest road is directly connected by two end points exactly, for example the road ef shown in Fig. 1.
All give a unique numbering with each node in the numerical map, every road travel direction according to the rules so, use the nodes encoding of road starting point and terminal point to represent, just can obtain a unique combination, for example ae, ed, de, in the embodiment of the invention, just adopt this method representation road.
Road can not all be a straight line, when numerical map is handled, road is all regarded as to be linked to each other by a rule line segment form, and promptly comes matched curve with broken line.As shown in Figure 1, road ae fitted to be linked to each other with ce by line segment ab, bc form, shown in Fig. 1 dotted line.Node b, e are called the shape point of road ae, can determine line segment ab, bc and ce in conjunction with shape point b, e by node a, e, i.e. broken line abce, thereby can obtain the shape of road ae by shape point b, e.Certainly, corresponding road, shape node match more at most is good more, and concrete shape number of nodes can be determined according to actual conditions.
The invention process example assumes is analyzed the old edition numerical map, topology is handled, and forms traffic network, promptly generates old road network node data.In the present embodiment, each node in the employing storage of array traffic network.The nodal information of storing in each node comprises longitude, latitude, nodes encoding, corresponding terminal point coding, corresponding road shape, match flag position etc.Nodes encoding is unique in the traffic network that forms.With a certain node is the road of starting point, and the pairing nodes encoding of this road terminal point is the corresponding terminal point coding of this node.The corresponding terminal point coding of node can be one or more, and for example among Fig. 1, the corresponding terminal point of node f is encoded to e, h, g.If this node is not any road starting point, then its corresponding terminal point coding is changed to-1.Corresponding road shape is represented the encode shape of represented road of this node and counterpart terminal, and in the present embodiment, corresponding road shape can represent that this pointed is stored the array of shape point with a pointer.Certainly, the counterpart terminal of node is encoded to when a plurality of, and corresponding road shape also is a plurality of, and quantity is identical with the counterpart terminal group/cording quantity.The match flag position be used to identify this node whether with new road network respective nodes coupling, before mating, the match flag position all is changed to-1, have only when this node after the match is successful with new road network respective nodes, be 1 just with the matching identification position.According to the road codes rule each node of old road network and road are encoded, for example, can encode to node with letter, nonnegative number etc., road travel direction is according to the rules represented with the nodes encoding of road starting point and terminal point, can also encode to identify the district at this road place to node according to certain way.
Fig. 2 shows the realization flow of the road codes update method that the embodiment of the invention provides, and details are as follows:
In step S201, generate the new road network node data of new version map;
To the new edition numerical map analyze, topology handles, and forms traffic network, generates new road network node data.Equally, each node in the employing storage of array traffic network.The nodal information of storing in each node comprises longitude, latitude, nodes encoding, corresponding terminal point coding, encoding state zone bit etc.At this moment, nodes encoding is the temporary code that generates automatically when generating node data, and it is unique in the traffic network that forms, and in the present embodiment, temporary code is a nonnegative number.It is the road of starting point that the corresponding terminal point of node is encoded to this node, and the nodes encoding of its terminal point correspondence can be one or more, if this node is not any road starting point, then its corresponding terminal point coding is changed to-1.Whether the nodes encoding that the encoding state zone bit is used to identify this node correspondence is temporary code, and when generating new road network node data, each node corresponding codes state flag bit all is changed to-1, and the nodes encoding of representing each node correspondence is a temporary code.
In step S202, with new road network node and the old road network node matching that generates;
In the present embodiment, the node location of new each node of road network that order will generate and the node location of old each node of road network coupling, be longitude, the latitude in the comparison node information, have only when longitude and latitude are all identical and think that just the node in new, the old road network is same node that the match is successful.After the match is successful, nodes encoding with this node in the old road network is replaced the nodes encoding of corresponding node in the new road network, and be 1 with encoding state zone bit, the match flag position of this node in new, the old road network, the nodes encoding of representing this node in the new road network is final coding, and this node has been finished coupling in the old road network.The nodes encoding of this node is replaced the nodes encoding of corresponding node in the new road network in the old road network of above-mentioned usefulness, comprises that the nodes encoding of all these corresponding node in the new road network node data all will be replaced.Therefore for example, temporary code is that the node of a0, b0 can both be connected to the node that temporary code is c0, all can include temporary code c0 in temporary code is the nodal information of a0, b0.The discovery temporary code is that the node serial number of node in old road network of c0 is C now, then needs c0 in the new road network node data is replaced with C, comprises that temporary code is the node of a0, b0, and the c0 in its nodal information also will replace with C.All all need carry out the back process that temporary code replaces with final coding according to this step, promptly the temporary code in all new road network node datas are all replaced with final coding.Certainly, in old road network, the match flag position be 1 node can be again with new road network in node mate, to raise the efficiency.
In step S203, to the new road network nodes encoding that does not mate.
In embodiments of the present invention, travel through in the new road network the not node of coupling, promptly the encoding state zone bit is-1 node, according under the node not match-type to nodes encoding.In the present embodiment, match-type is not divided into three kinds:
Fine difference type: because the fine difference of map datum (being longitude, the latitude of node) causes node matching not go up.As long as the distance of corresponding node thinks then that less than the value of setting the corresponding node in new, the old road network is same node in new, the old road network.
Relevant road change type:, cause original node location change or the generation newly-increased node relevant with original node because road increases or extends.
Irrelevant new added road type: road increases, and does not all have with original road and is connected but increase road.
In embodiments of the present invention, to not the coupling new road network nodes encoding idiographic flow as shown in Figure 3, details are as follows:
In step S301, take out a not new road network node of coupling;
The array of the new road network node of traversal storage is taken out a not new road network node of coupling, and the encoding state zone bit is-1 node.
In step S302, judge that this does not mate new road network node and whether belongs to the fine difference type;
In the present embodiment, in old acquaintance's path net, search to have in the setting range around the longitude that do not mate new road network node by this and the determined position of latitude and do not mate old road network node, if have then this does not mate new road network node and belongs to the fine difference type, it is same node with the old road network node of the not coupling that finds, execution in step S303; If do not find old road network node, then do not belong to fine difference type, execution in step S304.Certainly, setting range can be according to the actual conditions setting.
In step S303, be the new road network nodes encoding of fine difference type;
Replace the nodes encoding that this does not mate new road network node with the nodes encoding that does not mate old road network node that finds, and be 1 with encoding state zone bit, the match flag position of this same node in new, the old road network, replacement process repeats no more as mentioned above, execution in step S307 after finishing.
In step S304, judge that this does not mate new road network node and whether belongs to relevant road change type;
In the present embodiment, relevant road change type can be divided into following five classes again, does not belong to following five classes relevant road change type, then execution in step S305 if mate new road network node; Otherwise, execution in step S306 then:
The crossing change type: in new road network array, this does not mate new road network node and other have mated road of new road network node formation.Promptly this does not mate in the new road network node corresponding terminal point and is encoded to non-negatively, and should non-negative encoding state zone bit of encoding institute's corresponding node be 1; Perhaps to be that the corresponding terminal point of 1 new road network node is encoded to non-negative for certain encoding state zone bit, and the encoding state of this non-negative coding corresponding node is designated-1.Shown in Fig. 4 (a), in the old road network, road is ac, cd, ce (being assumed to be one-way road); Shown in Fig. 4 (b), many Yi Tiaolu in the new road network, road end points c has extended to the right, and at this time, road has just become 4, is respectively ac, cd, ce, cf.Increase a node f in this case newly, node f is the end points f of road cf, has increased a road cf, but this situation can not cause original road, nodes encoding to change.
Increase the partition type in the road: in new road network array, two do not mate the road that new road network node is constituted, and wherein one do not mate new road network node and be positioned on the old road network road.The encoding state zone bit that is certain new road network node is-1, its corresponding terminal point is encoded to non-negative, encoding state zone bit of this non-negative coding institute corresponding node is-1, and this two does not mate and have one mating on the road that new road network node constituted in the new road network node.Shown in Fig. 5 (a), in the old road network, road is ab, bc, bd (being assumed to be one-way road); Shown in Fig. 5 (b), newly-built road ef, f is divided into road bf, fc with road bc on road bc.The decision node f whether method on road bc is:
(1) in the nodal information of node b, take out the shape point of storing in the pointer of the corresponding road shape of the expression array pointed, constitute each line segment of expression road shape by node b, c, each shape point;
(2) computing node f takes out the minor increment that calculates to the distance of each line segment, is made as d
Min
(3) if d
Min≤ d then thinks node f on road bc, and wherein d is the specification error distance.
Certainly, the specification error distance can be set according to actual conditions.
Road extension type: in new road network array, one mated new road network node and do not mate one section of road that new road network node constitutes with old road network in certain bar road identical, and this road a certain mated that this has mated new road network node in the corresponding new road network of old road network node in the old road network.Promptly in old road network, search this mated mating of new road network node correspondence old road network node with do not mate the road that old road network node is constituted, if in this road and the new road network one section of a certain road identical, and the road in this new road network has mated new road network node and by one and has not mated new road network node and constitute, and thinks that then this does not mate new road network node and does not mate old road network node is because road extends the respective nodes that causes variation.Shown in Fig. 6 (a), in the old road network, road is ab, bc, bd (being assumed to be one-way road); Shown in Fig. 6 (b), in new road network, road also is ab, bc, bd, and a section of road bc is identical with road bc in the old road network, thinks that then road bc has extended.Above-mentioned judge one section of road bc in the new road network with old road network in road bc whether identical, whether the shape point of promptly judging road bc in the old road network substantially all drops on one section of new road network road bc, if think that then a section of road bc in the new road network is identical with road bc in the old road network.
Road extends crossing type: in new road network array, one does not mate new road network node has mated on the road of new road network node formation two, and this do not mate new road network node with another mated new road network node constitute one section of road with this to have mated the corresponding a certain road that mates old road network node place of new road network node identical, another node of this road is not for mating old road network node in the old road network.Be that road in a certain old road network extends the road intersect in another old road network.Shown in Fig. 7 (a), in the old road network, road is ab, bc, bd, ef (being assumed to be one-way road); Shown in Fig. 7 (b), in new road network, road also be ab, bc, bd, ef, and road bc is identical in one section old road network of road bc, and c is positioned on the road ef, the judgement road is identical, node be positioned on a certain road method as mentioned above, repeat no more.
The road extension converges type: in new road network array, one do not mate one section of two road of new road network node place with old road network in two road identical respectively, and respectively there is the nodes encoding of a node the same on the same link in new, the old road network, in the old road network, all respectively there is a node in two road for not mating old road network node.Be in the old road network two do not mate old road network node separately the place road extend to intersect.Shown in Fig. 8 (a), in the old road network, road is ab, bc, bd, ef (being assumed to be one-way road); Shown in Fig. 8 (b), in new road network, road is ab, bf, bd, ef, and a section of road bf is identical with road bc in the old road network, and a section of road ef is identical with road ef in the old road network, and in the promptly old road network, road ef, bc extension intersects at node f.
In step S305, for belonging to the new road network nodes encoding of not coupling of relevant road change type;
In the present embodiment, the new road network nodes encoding of not coupling to the relevant road change type of five classes is:
Crossing change type: matched node is not encoded according to the road codes rule.
Increase the partition type in the road: matched node is not encoded according to the road codes rule.
Road extension type: replace the nodes encoding that this does not mate new road network node with the nodes encoding that does not mate old road network node that finds, and be 1 with encoding state zone bit, the match flag position of this same node in new, the old road network.
Road extend to intersect type: replace the nodes encoding that this does not mate new road network node with the nodes encoding that does not mate old road network node, and be 1 with encoding state zone bit, the match flag position of this same node in new, the old road network.
Road extends and to converge type: replace the nodes encoding that this does not mate new road network node with two arbitrary nodes encodings that do not mate old road network node, and be 1 with encoding state zone bit, the match flag position of node in new, the old road network.
After coding is finished, execution in step S307.
In step S306, be the new road network nodes encoding of not coupling of irrelevant new added road type;
In the present embodiment, do not belong to fine difference type and relevant road change type, then belong to irrelevant new added road type if mate new road network node, according to the road codes rule to this not matched node encode, after finishing, execution in step S307.
In step S307, judge whether to also have the not new road network node of coupling, if having then execution in step S301, if do not have then execution in step S308;
In step S308, finish.
Fig. 9 shows the road codes update system that the embodiment of the invention provides, and for convenience of explanation, only shows the part relevant with the embodiment of the invention.This system can built-inly run on map datum change server, map data server, ATMS etc.
Map topology processing unit 901 reads that the new edition electronic map data is analyzed, topology is handled, and forms traffic network, generates new road network node data.
Newly, old road network node matching unit 902, the node location of each node with the node location coupling of old each node of road network that reads, is revised new road network node data and output according to matching result in the traffic network that order generates map topology processing unit 901.Processing procedure is as implied above, repeats no more.
The matched node coding unit 903, and the new road network node that does not mate in the new road network node data of new, old road network node matching unit 902 outputs is encoded.As one embodiment of the present of invention, when not mating new road network node and encode, for the accuracy that guarantees to encode, node type judge module 9031 is judged the not new road network node types of coupling that receives, in embodiments of the present invention, the new road network node that does not mate is divided into fine difference type, relevant road change type and irrelevant new added road type, and determination methods repeats no more as mentioned above.The nodes encoding module 9032 bases not type of matched node are encoded to the new road network node that does not mate.
Figure 10 shows the structure of the nodes encoding module that the embodiment of the invention provides, and for convenience of explanation, only shows the part relevant with the embodiment of the invention.Nodes encoding module 9032 comprises fine difference type encoding pack 90321, relevant road change type encoding pack 90322 and irrelevant new added road type encoding pack 90323, is used for the not matched node of corresponding fine difference type, relevant road change type and irrelevant new added road type is encoded.Three kinds of assemblies carry out Methods for Coding as mentioned above to the not new road network node of coupling of respective type, repeat no more.
In embodiments of the present invention, mate by node new and old traffic network, the new traffic network node that the match is successful is continued to use the coding of old acquaintance's path net node, to mating unsuccessful new traffic network nodes encoding, has realized a kind of road codes update method according to affiliated type.The uniqueness and the lasting availability of road codes in the numerical map of different editions have been guaranteed, be specially adapted to the inconsistent situation of map version updating between ATMS and the terminal, can guarantee that with the method the terminal map version does not upgrade the most network of communication lines relevant information data that yet can use ATMS to send.
The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (11)
1, a kind of road codes update method is characterized in that, described method comprises the steps:
Generate new road network node data according to new version map;
With new road network node and the old road network node matching that generates; And
To the new road network nodes encoding that does not mate.
2, the method for claim 1 is characterized in that, described the step of new road network nodes encoding of coupling not is specially:
Judge whether the described not new road network node of coupling is the fine difference type;
When the new road network node of described not coupling when being the fine difference type, with the nodes encoding of the corresponding not old road network node of coupling nodes encoding as the described new road network node that does not mate.
3, the method for claim 1 is characterized in that, described the step of new road network nodes encoding of coupling not is specially:
Whether the new road network node of judging described not coupling is relevant road change type;
When the new road network node of described not coupling during for relevant road change type, the new road network nodes encoding that described relevant road change type is not mated.
4, method as claimed in claim 3 is characterized in that, the step of the described new road network nodes encoding that relevant road change type is not mated is specially:
Judge whether the new road network node of coupling is not to increase the partition type in crossing change type or the road;
When the new road network node of coupling not is when increasing the partition type in crossing change type or the road, with the nodes encoding of the corresponding not old road network node of coupling nodes encoding as the described new road network node that does not mate.
5, method as claimed in claim 3 is characterized in that, the step of the described new road network nodes encoding that relevant road change type is not mated is specially:
Judge whether the new road network node of coupling is not that road extension type, road extend crossing type or the road extension converges type;
When the new road network node that does not mate is that road extension type, road extend crossing type or the road extension converges type, the described not new road network node of coupling is encoded according to the road codes rule.
6, the method for claim 1 is characterized in that, described the step of new road network nodes encoding of coupling not is specially:
Whether the new road network node of judging described not coupling is irrelevant new added road type;
When the described new road network node that does not mate is when haveing nothing to do the new added road type, the described not new road network node of coupling is encoded according to the road codes rule.
As claim 5 or the described method of 6 arbitrary claims, it is characterized in that 7, described road codes rule is old road network nodes encoding rule.
8, a kind of road codes update system is characterized in that, described system comprises:
The map topology processing unit is used to read that the new edition electronic map data is analyzed, topology is handled, and forms traffic network, generates new road network node data;
Old road network node matching unit newly,, be used for the node location coupling of order, revise described new road network node data and output according to matching result with node location with old each node of road network that reads of each node of traffic network of described map topology processing unit generation; And
The matched node coding unit is not used for the new road network node that the new road network node data that described new, old road network node matching unit is exported does not mate is encoded.
9, system as claimed in claim 8 is characterized in that, described not matched node coding unit comprises:
The node type judge module is used to judge the described not new road network node types of coupling that receives; And
The nodes encoding module is encoded to the described not new road network node of coupling according to the type of matched node not.
10, system as claimed in claim 9 is characterized in that, described nodes encoding module comprises:
Fine difference type encoding pack is to the not new road network nodes encoding of coupling of the fine difference type of described node type judge module output, with the nodes encoding of the corresponding not old road network node of the coupling nodes encoding as the described new road network node that does not mate;
Relevant road change type encoding pack, to the not new road network nodes encoding of coupling of the relevant road change type of described node type judge module output, as the nodes encoding of the described not new road network node of coupling or according to the road codes rule the described new road network node that does not mate is encoded with the nodes encoding of the corresponding not old road network node of coupling; And
Irrelevant new added road type encoding pack to the not new road network nodes encoding of coupling of the irrelevant new added road type of described node type judge module output, is encoded to the described not new road network node of coupling according to the road codes rule.
11, a kind of map data server that comprises the described road codes update system of the arbitrary claim of claim 8 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810068590A CN101635114A (en) | 2008-07-22 | 2008-07-22 | Method and system for updating road codes and map data server |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN200810068590A CN101635114A (en) | 2008-07-22 | 2008-07-22 | Method and system for updating road codes and map data server |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101635114A true CN101635114A (en) | 2010-01-27 |
Family
ID=41594293
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN200810068590A Pending CN101635114A (en) | 2008-07-22 | 2008-07-22 | Method and system for updating road codes and map data server |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101635114A (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102496332A (en) * | 2011-12-15 | 2012-06-13 | 北京易华录信息技术股份有限公司 | Geographic position based road information coding system and coding method thereof |
| CN105677686A (en) * | 2014-11-21 | 2016-06-15 | 高德软件有限公司 | Road coding method and device |
| CN109872534A (en) * | 2019-03-21 | 2019-06-11 | 中交信有限责任公司 | A kind of whole nation road passenger transportation station code system and method |
| CN109949692A (en) * | 2019-03-27 | 2019-06-28 | 腾讯大地通途（北京）科技有限公司 | Road network method, apparatus, computer equipment and storage medium |
| CN110345950A (en) * | 2018-04-08 | 2019-10-18 | 高德软件有限公司 | A kind of road codes method and road matching method |
| CN110428655A (en) * | 2019-06-27 | 2019-11-08 | 苏州清研捷运信息科技有限公司 | A kind of data processing method in the forbidden section of lorry |
| CN110781201A (en) * | 2019-11-07 | 2020-02-11 | 广东星舆科技有限公司 | Automatic updating method and device for road topological relation data |
| CN111858789A (en) * | 2020-01-10 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Road network data processing method and device, electronic equipment and storage medium |
| CN112100311A (en) * | 2020-11-19 | 2020-12-18 | 深圳市城市交通规划设计研究中心股份有限公司 | Road traffic network geographic information data management method, device and system |
| WO2021073455A1 (en) * | 2019-10-18 | 2021-04-22 | 上海商汤临港智能科技有限公司 | Path generation method and apparatus, and electronic device and storage medium |
| US11047699B2 (en) | 2019-05-22 | 2021-06-29 | Here Global B.V. | Bloom filter multiple traffic-aware route decoding |
| US11054277B2 (en) | 2019-05-22 | 2021-07-06 | Here Global B.V. | Bloom filter multiple traffic-aware route encoding |
| CN113221597A (en) * | 2020-01-21 | 2021-08-06 | 初速度（苏州）科技有限公司 | Road segment dividing method and device |
| US11137259B2 (en) | 2019-05-22 | 2021-10-05 | Here Global B.V. | Bloom filter route decoding |
| US11187546B2 (en) | 2019-05-22 | 2021-11-30 | Here Global B.V. | Bloom filter route encoding |
| US11193779B2 (en) | 2019-05-22 | 2021-12-07 | Here Global B.V. | Decoding routes to pois in proximity searches using bloom filters |
| CN115398182A (en) * | 2020-07-30 | 2022-11-25 | 深圳元戎启行科技有限公司 | Electronic map updating method and device, computer equipment and storage medium |
| US11526480B2 (en) | 2020-05-20 | 2022-12-13 | Here Global B.V. | Decoding a route encoded by a probabilistic encoding data structure |
| US11566911B2 (en) | 2019-05-22 | 2023-01-31 | Here Global B.V. | Encoding routes to POIs in proximity searches using bloom filters |
| US11578989B2 (en) | 2019-05-22 | 2023-02-14 | Here Global B.V. | Encoding parking search cruise routes using bloom filters |
-
2008
- 2008-07-22 CN CN200810068590A patent/CN101635114A/en active Pending
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102496332A (en) * | 2011-12-15 | 2012-06-13 | 北京易华录信息技术股份有限公司 | Geographic position based road information coding system and coding method thereof |
| CN105677686A (en) * | 2014-11-21 | 2016-06-15 | 高德软件有限公司 | Road coding method and device |
| CN105677686B (en) * | 2014-11-21 | 2019-06-21 | 高德软件有限公司 | A kind of road codes method and device |
| CN110345950A (en) * | 2018-04-08 | 2019-10-18 | 高德软件有限公司 | A kind of road codes method and road matching method |
| CN110345950B (en) * | 2018-04-08 | 2021-06-08 | 阿里巴巴（中国）有限公司 | Road coding method and road matching method |
| CN109872534A (en) * | 2019-03-21 | 2019-06-11 | 中交信有限责任公司 | A kind of whole nation road passenger transportation station code system and method |
| CN109949692B (en) * | 2019-03-27 | 2021-03-26 | 腾讯大地通途（北京）科技有限公司 | Road network matching method and device, computer equipment and storage medium |
| CN109949692A (en) * | 2019-03-27 | 2019-06-28 | 腾讯大地通途（北京）科技有限公司 | Road network method, apparatus, computer equipment and storage medium |
| US11578989B2 (en) | 2019-05-22 | 2023-02-14 | Here Global B.V. | Encoding parking search cruise routes using bloom filters |
| US11566911B2 (en) | 2019-05-22 | 2023-01-31 | Here Global B.V. | Encoding routes to POIs in proximity searches using bloom filters |
| US11193779B2 (en) | 2019-05-22 | 2021-12-07 | Here Global B.V. | Decoding routes to pois in proximity searches using bloom filters |
| US11137259B2 (en) | 2019-05-22 | 2021-10-05 | Here Global B.V. | Bloom filter route decoding |
| US11047699B2 (en) | 2019-05-22 | 2021-06-29 | Here Global B.V. | Bloom filter multiple traffic-aware route decoding |
| US11054277B2 (en) | 2019-05-22 | 2021-07-06 | Here Global B.V. | Bloom filter multiple traffic-aware route encoding |
| US11187546B2 (en) | 2019-05-22 | 2021-11-30 | Here Global B.V. | Bloom filter route encoding |
| CN110428655A (en) * | 2019-06-27 | 2019-11-08 | 苏州清研捷运信息科技有限公司 | A kind of data processing method in the forbidden section of lorry |
| WO2021073455A1 (en) * | 2019-10-18 | 2021-04-22 | 上海商汤临港智能科技有限公司 | Path generation method and apparatus, and electronic device and storage medium |
| CN110781201A (en) * | 2019-11-07 | 2020-02-11 | 广东星舆科技有限公司 | Automatic updating method and device for road topological relation data |
| CN111858789A (en) * | 2020-01-10 | 2020-10-30 | 北京嘀嘀无限科技发展有限公司 | Road network data processing method and device, electronic equipment and storage medium |
| CN113221597A (en) * | 2020-01-21 | 2021-08-06 | 初速度（苏州）科技有限公司 | Road segment dividing method and device |
| CN113221597B (en) * | 2020-01-21 | 2022-05-27 | 初速度（苏州）科技有限公司 | Road segment dividing method and device |
| US11526480B2 (en) | 2020-05-20 | 2022-12-13 | Here Global B.V. | Decoding a route encoded by a probabilistic encoding data structure |
| US11720538B2 (en) | 2020-05-20 | 2023-08-08 | Here Global B.V. | Providing incremental updates of categorical information using a probabilistic encoding data structure |
| US11755553B2 (en) | 2020-05-20 | 2023-09-12 | Here Global B.V. | Traffic-aware route decoding using a probabilistic encoding data structure |
| US11853280B2 (en) | 2020-05-20 | 2023-12-26 | Here Global B.V. | Encoding a route using a probabilistic encoding data structure |
| CN115398182A (en) * | 2020-07-30 | 2022-11-25 | 深圳元戎启行科技有限公司 | Electronic map updating method and device, computer equipment and storage medium |
| CN112100311B (en) * | 2020-11-19 | 2021-03-05 | 深圳市城市交通规划设计研究中心股份有限公司 | Road traffic network geographic information data management method, device and system |
| CN112100311A (en) * | 2020-11-19 | 2020-12-18 | 深圳市城市交通规划设计研究中心股份有限公司 | Road traffic network geographic information data management method, device and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101635114A (en) | Method and system for updating road codes and map data server | |
| CN100529668C (en) | Iterative logical renewal of navigable map database | |
| CN101589417B (en) | Map information managing system and map information distribution system | |
| Boudia et al. | An effective memetic algorithm with population management for the split delivery vehicle routing problem | |
| US8170793B2 (en) | System and method for determining routing point placement for aiding in encoding and decoding a path | |
| CN103729191B (en) | A kind of can the code generating method of flexible and system | |
| CN102080961A (en) | Navigation system for updating partly map layers, and method for the same | |
| CN106981024B (en) | Transaction limit calculation processing system and processing method thereof | |
| CN102901509B (en) | Map difference data generation apparatus and map difference data generation method | |
| CN103250031A (en) | Routing system, routing method, and routing program | |
| CN103279544A (en) | Method and device for storing and inquiring tree structure data in relational database | |
| CN111583652A (en) | Topological modeling method and system for traffic network | |
| CN112902970A (en) | Routing inspection path planning method and routing inspection robot | |
| CN114584539B (en) | Cloud upgrading method and system for industrial field device | |
| CN113760971A (en) | Method, computing device and storage medium for retrieving data of a graph database | |
| CN109933786B (en) | Method for constructing responder message tool based on compiling rule | |
| CN104748757B (en) | A kind of data in navigation electronic map update method and device | |
| CN112965710A (en) | Processing method, device and system of computation graph | |
| CN101558406A (en) | Update method for databases, particularly navigation databases | |
| CN112306531A (en) | Thing model-based Internet of things data expansion method | |
| CN103021257B (en) | Method and apparatus for generating electronic map | |
| CN110442589B (en) | Electronic map updating method, device and equipment | |
| CN117076563A (en) | Pruning method and device applied to blockchain | |
| CN110233796B (en) | Power communication network optimization method and equipment based on weighted routing algorithm | |
| CN115378863B (en) | Space-based network topology design method based on average service performance and related equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20100127 |