CN101620803A - Method and device for recording traffic restricted information on electronic map - Google Patents
Method and device for recording traffic restricted information on electronic map Download PDFInfo
- Publication number
- CN101620803A CN101620803A CN200910090869A CN200910090869A CN101620803A CN 101620803 A CN101620803 A CN 101620803A CN 200910090869 A CN200910090869 A CN 200910090869A CN 200910090869 A CN200910090869 A CN 200910090869A CN 101620803 A CN101620803 A CN 101620803A
- Authority
- CN
- China
- Prior art keywords
- sequence
- limit
- tabulation
- limit sequence
- sequence number
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Traffic Control Systems (AREA)
Abstract
The invention provides a method and a device for recording traffic restricted information on an electronic map. The method comprises the following steps: acquiring a directed network picture of an intersection; acquiring a passable sequence set with the directed network picture, wherein each passable sequence of the passable sequence set is a sequential combination formed by side sequence numbers of the directed network picture and indicates to be passable from a front side to a rear side; acquiring a traffic restricted sequence set of the directed network picture, wherein each traffic restricted sequence of the traffic restricted sequence set is a sequential combination formed by the side sequence numbers of the directed network picture and indicates to restrict pass from the front side to the rear side; and eliminating the traffic restricted sequence from the traffic restricted sequence set if the traffic restricted sequence is judged to be contained in a passable sequence. The embodiment of the invention adopts the passable sequence to select the traffic restricted sequence with a great amount of redundant data, thereby eliminating redundant side sequence numbers of the traffic restricted sequence, simplifying an expression way of the traffic restricted information and reducing the redundant data.
Description
Technical field
The present invention relates to electronic map technique, be meant especially a kind of in electronic chart the method and apparatus of recording traffic restricted information.
Background technology
Electronic chart is the description to real world, but is different from real world, for example, a road in the real world, use two limits to represent in map of navigation electronic, a crossroad can be represented by the digraph that many limits and point are formed in map of navigation electronic.
In the process of calculating guidance path, traffic restricted information has important effect.Adopt map vector to represent navigation information after the reality road digitalization, wherein to traffic restricted information, for example in the crossing directed subgraph in map of navigation electronic, normally adopt the sequential recording traffic restricted information on limit, comprising permanent ban, current no through traffic with the time period.
The inventor is in realizing process of the present invention, find that there are the following problems at least in the prior art: when adopting the sequential recording traffic restricted information on limit, more polygon even each the limit sequence number that needs record to relate to, produced a large amount of redundant datas, cause the space waste of electronic chart storage medium, especially more obvious for the cellphone subscriber; Redundant data makes navigating instrument manufacturer can only adopt high configure hardware, otherwise very easily produces accidents such as internal memory overflows; Because necessity foundation when traffic restricted information is navigator calculating feasible path, above-mentioned redundancy-affecting to the computing velocity of equipment, make that the navigator response is blunt, have caused the waste of computational resource.
Summary of the invention
The purpose of this invention is to provide a kind of in electronic chart the method and apparatus of recording traffic restricted information, be used for eliminating the redundant data of the stored traffic restricted information of electronic chart.
A kind of in electronic chart the method for recording traffic restricted information, comprising: step 1, obtain the directed networks figure at a crossing; Step 2 is obtained the passed through sequence sets of described directed networks figure, the orderly combination that each the passed through sequence in the described sequence sets that passes through is made up of the limit sequence number among the directed networks figure, expression in the past while to after can pass through; Obtain the cross sequence set limit of described directed networks figure, the orderly combination that each limit sequence that described limit sequence is concentrated is made up of the limit sequence number among the directed networks figure, expression in the past while to after limit and pass through; Wherein, one side preceding first pairing limit of limit sequence number that is meant in the described orderly combination Yi Bian the back is meant last the pairing limit of limit sequence number in the described orderly combination, and all is any limits among the described directed networks figure; Step 3 for a limit sequence, is included in the sequence of can passing through if judge this limit sequence, then concentrates from described limit sequence and rejects this limit sequence; Limit sequence concentrates remaining all limit sequences to form the middle collection of a limit sequence.
Wherein, after the described step 2, also comprise: calculate whole subsequences of each described limit sequence, put into one and hand over the set of limit subsequence; Then in step 3, a described limit sequence is in the set of described friendship limit subsequence.
A kind of in electronic chart the device of recording traffic restricted information, comprising: the network chart administrative unit is used to obtain or make up the directed networks figure at a crossing; The sequence sets construction unit is used to obtain the cross sequence set limit of described directed networks figure, the orderly combination that each limit sequence that described limit sequence is concentrated is made up of the limit sequence number among the directed networks figure, expression in the past while to after limit and pass through; Wherein, one side preceding first pairing limit of limit sequence number that is meant in the described orderly combination Yi Bian the back is meant last the pairing limit of limit sequence number in the described orderly combination, and all is any limits among the described directed networks figure; The traffic restricted information acquiring unit is used for for a limit sequence, is included in the sequence of can passing through if judge this limit sequence, then concentrates from described limit sequence and rejects this limit sequence; Limit sequence concentrates remaining all limit sequences to form the middle collection of a limit sequence.
Embodiments of the invention have following beneficial effect, for the limit sequence that mass of redundancy data is arranged, have adopted the sequence b that can pass through that it is screened, and have removed limit sequence number unnecessary among the limit sequence a, and have removed some limit sequence a; Simplify the expression mode of traffic restricted information, reduced redundant data.
Description of drawings
Fig. 1 is the digraph at a crossing of the embodiment of the invention;
Fig. 2 is an embodiment of the invention method flow synoptic diagram one;
Fig. 3 is an embodiment of the invention method flow synoptic diagram two;
Fig. 4 is split as a plurality of subsequence synoptic diagram for the embodiment of the invention with sequence;
Fig. 5 has the method flow synoptic diagram of road conditions condition restriction for the embodiment of the invention;
Fig. 6 obtains the sequence sets method flow synoptic diagram that can pass through for the embodiment of the invention;
Fig. 7 obtains cross sequence set limit method flow synoptic diagram for the embodiment of the invention;
Fig. 8 is an embodiment of the invention apparatus structure synoptic diagram.
Embodiment
For making purpose of the present invention, technical characterictic and implementation result clearer, below in conjunction with the accompanying drawings and the specific embodiments technical scheme of the present invention is described in detail.Among the embodiment provided by the invention, but limit sequence is screened, reduce the redundant data that solves in the electronic chart by the passed through sequence that adopts the traffic information correspondence.
As shown in Figure 1, there is corresponding sequence number on the limit, and this sequence number is called the limit sequence number on this limit, and each limit is meant determined line segment between two point of crossing.1. see " no left turn " sign and " craspedodromes " sign on the limit on the road corresponding, represent to have traffic restricted information: the 1. 8. impassability to the limit from the limit is expressed as several sequences of form in electronic chart:
(1)①--②--③--④--⑤--⑥--⑦--⑧
(2)①--②--③--⑨--⑩--⑥--⑦--⑧
......
4. 1. from the limit is that appointment is transitable to the limit, then is expressed as several sequences of form, but is called traffic information:
I ①--②--③--④
II ⑤--⑥--⑦--⑧
But traffic restricted information should not be the subsequence of certain traffic information, otherwise is called information collision.
In the above-mentioned expression mode, when adopting sequence (1), (2) recording traffic restricted information, find, adopt a subsequence of a certain sequence can express traffic restricted information,--5. with sequence 9.--10. represented to get final product as from 1. adopting sequence 4. to 8. traffic restricted information; Can know by contrast,, can make that then there is redundant data in electronic chart if adopt sequence (1) and (2).
The embodiment of the invention provide a kind of in electronic chart the method for recording traffic restricted information, as shown in Figure 2, comprising:
Obtain described directed networks figure traffic restricted information sequence sets A (hereinafter to be referred as: cross sequence set limit), each traffic restricted information sequence that described limit sequence is concentrated (hereinafter to be referred as: limit sequence) the orderly combination of forming by the limit sequence number among the directed networks figure, expression in the past while to after limit and pass through;
Wherein, one side preceding first pairing limit of limit sequence number that is meant in the described orderly combination Yi Bian the back is meant last the pairing limit of limit sequence number in the described orderly combination, and all is any limits among the described directed networks figure;
Use the technology that present embodiment provides, for each the limit sequence a that is write down among the cross sequence set limit A that mass of redundancy data is arranged, all adopted the passed through sequence b among the sequence sets B that to pass through that it is screened, remove limit sequence number unnecessary among the limit sequence a, and removed some limit sequence a; Simplify the expression mode of traffic restricted information, reduced redundant data.
After the described step 102, can also comprise: calculate whole subsequences of each described limit sequence, put into traffic restricted information subsequence set A1 (hereinafter to be referred as: hand over limit subsequence set A1);
Then in step 103, a described limit sequence is in described friendship limit subsequence set A1.
In the technique scheme, form the middle collection of limit sequence M and also comprise afterwards:
Step 104 sorts to each limit sequence among the collection M in the middle of the limit sequence according to the preset priority standard;
Pre-priority criteria comprises: sequence length u or equivalent sequence number v; Wherein, sequence length u is meant the number of the limit sequence number that this sequence comprises; Equivalent sequence number v, when being meant in the middle of the limit sequence at least one sequence equivalence that sequence and limit sequence among the collection M concentrate, the number of described at least one sequence; Each described limit sequence all should a corresponding at least sequence length u and a sequence number v of equal value;
Step 105, when each described limit sequence being sorted according to described equivalent sequence number v, v1+v2+......vi=C, wherein C is a definite value, i is the sequence number of limit sequence, simultaneously in formula, the number of all limit sequences in this formula when i has also represented to satisfy condition, vi represents the equivalent sequence number of this limit sequence;
Among the collection M, choose i limit sequence and as a result of export in the middle of the limit sequence, a described i limit sequence satisfies: make the value minimum of i, and make the individual described limit sequence of i sequence length u with the value minimum.
Can derive by the technical scheme that is provided, calculate whole edge sequence set of expressing the traffic restriction in the map of navigation electronic; Obtain whole subsequences of these sequences; The subsequence and the relation of inclusion of doing of the edge sequence set of can passing through are calculated, and each subsequence is composed upward different weight; Select the subsequence set to substitute the edge sequence set of original expression traffic restriction according to weighted value; By this mode, can when guaranteeing data correctness, highly simplify the expression of traffic restricted information, reduced data redundancy.
Among the embodiment that is provided, can pass through sequence sets B and cross sequence set limit A all can segment, if considering some road (corresponding to the limit) as that time segment is current, for example some road at night 20 to can two way between 8 of mornings, in the morning 8 at 20 in evening then be one-way traffic, so, this road is that time segment can be passed through, and perhaps is called time segment traffic restriction.Because a road is if time segment is transitable, so also being equivalent to is that the time segment restriction is current, so the limit sequence number on the limit of those road correspondences can be illustrated in the sequence of the sequence sets B that can pass through, also can be illustrated in the sequence of cross sequence set limit A.
The sequence sets B that can pass through comprises: first tabulation, i.e. PassRoads tabulation, second tabulation, i.e. TimePassRoads tabulation; The described sequence of forever can passing through is deposited in described first tabulation, and the described time segment sequence of can passing through is deposited in described second tabulation.
Cross sequence set limit A comprises: the 3rd tabulation, i.e. alwaysforbidRoads tabulation, the 4th tabulation, i.e. timelimitRoads tabulation; The current sequence of described permanent restriction is deposited in described the 3rd tabulation, and the current sequence of described time segment restriction is deposited in described the 4th tabulation.
After forming the middle collection of limit sequence M, can the limit sequence a among the collection M in the middle of the limit sequence further be screened to remove more redundant data, comprising:
Step 1031 sorts to each limit sequence among the collection M in the middle of the described limit sequence according to the preset priority standard.
Selected priority criteria can be: sequence length u, and equivalent sequence number v.
Sequence length u is meant, the number of the limit sequence number that this sequence comprised; Equivalent sequence number v is meant among the middle collection of the limit sequence M to have the number that sequence can substitute old sequence among the A now.
At first each described limit sequence is sorted, for example sort from big to small according to equivalent sequence number v.
Step 1032, if A, B all divide according to the time period, then also should there be two tabulations among the collection M in the middle of the limit sequence, corresponding with A, corresponding with alwaysforbidRoads tabulation among the C is the vPartRoad table, and corresponding with the timelimitRoads tabulation among the C is that vTimePartRoad shows.
Selected priority criteria remains: sequence length u, and equivalent sequence number v.At this moment,
Sequence length u is meant the sequence that belongs in vPartRoad table, the vTimePartRoad table, the number of the limit sequence number that this sequence comprised.
Equivalent sequence number v refers to belong in the vPartRoad table and is equivalent to the number of the sequence of (substituting) alwaysforbidRoads in tabulating; Belong in the vTimePartRoad table and be equivalent to the number of the sequence of (substituting) timelimitRoads in tabulating.
Step 1033 is tested to collection M in the middle of the limit sequence, comprising:
If do not consider the situation that time segment is current,, from C, select minimum and the shortest a plurality of sequences as simplifying result's output then with collection M and cross sequence set limit A combination in the middle of the limit sequence.
If consider the situation that time segment is current, then vCPartRoad table and vCTimePartRoad table are combined with alwaysforbidRoads and timelimitRoads respectively separately, from vCPartRoad table, vCTimePartRoad table, select minimum and the shortest a plurality of sequences as simplifying result's output.
Because v1+v2+......vi=C, wherein C is a definite value, can specify in advance; V1＞v2＞...＞vi is a natural number, thus v1, v2 ... the value of vi etc. is big more, and then i is more little, also is " minimum ", and opposite extreme situations is to work as v1=C, then i=1; Row length u in regular turn again when v is identical selects the shortest sequence;
Minimum and the shortest preferential with the former, but usually u is hour, and v also causes i less more greatly, so minimum and the shortest two purposes can reach simultaneously.
The technology that present embodiment provides, with sequence length u, and equivalent sequence number v, collection M in the middle of the limit sequence is tested, not only eliminated the redundant data of stored traffic restricted information in the electronic chart, and guaranteed to eliminate results set after the redundant data and can trust and wrong unavailable data can not occur.
In conjunction with the above-mentioned technology that provides, present embodiment provides the method for the redundant data of stored traffic restricted information in a kind of preferred elimination electronic chart, as shown in Figure 3, comprising:
The directed networks figure Map at a crossing is obtained or made up to step 201.
Directed networks figure Map specifically can be with reference to the accompanying drawings 1, and a road uses two limits to represent among the figure, therefore the network topological diagram that may be made up of many limits and point of the directed networks figure Map at a crossing.
Step 202 is obtained the passed through sequence sets B of directed networks figure Map; Obtain the cross sequence set limit A of directed networks figure Map.
Each passed through sequence b that can pass through among the sequence sets B represents, arrives the orderly combination of limit sequence number afterwards on one side in the past, while and preceding to after should pass through.
Each limit sequence a among the cross sequence set limit A represents, arrive the orderly combination of limit sequence number afterwards on one side in the past, while and preceding to after limit and pass through;
One side, one side, back, preceding one side and back all refer to any limit among the described directed networks figure on one side before described.
Wherein, because no matter a limit sequence a or the sequence b that can pass through all are orderly combinations of limit sequence number.
Step 203, the whole subsequences that calculate each limit sequence a among the cross sequence set limit A are as new limit sequence a; For distinguishing with cross sequence set limit A, the set that these subsequences are formed is called hands over limit subsequence set A1.
As shown in Figure 4, specifically provide an embodiment who calculates subsequence.Among this embodiment, adopt binary tree algorithm, ask the subsequence of to pass through sequence b or limit sequence a by the mode from growing to lacking; Can adopt recursive mode to the cutting of sequence two ends, obtain tree, promptly the butt that truncates obtains left and right sides child node to each sequence node, and right child node is regeneration left side child node not.
Step 204 filters out from hand over limit subsequence set A1 and hands over the standby subsequence of limit.
For a limit sequence a, be included among the sequence b that can pass through if judge this limit sequence a, then reject this limit sequence a;
Judge that this limit sequence a is comprised in all limit sequence numbers of being meant among the sequence b that can pass through among a all in b, and consistent among the order of these limit sequence numbers and the b and continuously.For example, 4. a is--5., 2. b is--3.--4.--5., owing to satisfy 4.--5. all in b, 4.--5. consistent among order and the b, and 4.--5. be continuous in sequence, so judge that a is comprised among the b.
Sequence sets B does not comprise if the sequence among the friendship limit subsequence set A1 can not be passed through, and then is considered as handing over the standby subsequence of limit.The standby subsequence of remaining all friendship limits forms the middle collection of limit sequence M among the friendship limit subsequence set A1.
Step 205 according to collection M in the middle of the limit sequence, generates standby son sequence set A2.
Collection M is consistent with sequence among the standby son sequence set A2 in the middle of the limit sequence, but in standby son sequence set A2, needs to hand at each write down all traffic restricted informations that it can replace above limitting standby subsequence.
Selected priority criteria can be: sequence length u, and equivalent sequence number v.
Sequence length u is meant, the number of the limit sequence number that this sequence comprised; Equivalent sequence number v is meant among the middle collection of the limit sequence M to have the number that sequence can substitute old sequence among the A now.
Step 206, with standby son sequence set A2 with and cross sequence set limit A combine, takes out minimum and the shortest sequence sets as the simplification result.
Step 207 will be simplified the result and be converted to appointment specification, the i.e. form of the concrete needs that the client approved.
Export the bark mark arrangement set after simplifying, specifically can be converted to " bark mark, period, bark mark, bark mark ... " form of gdf specification, perhaps be converted to other form.
The foregoing description has been described the method for obtaining the traffic restricted information of having removed redundant data.
Further, map of navigation electronic is a map vector, this map vector correspondence a directed networks figure Map, therefrom can obtain a plurality of crossings directed subgraph, the simplification of traffic restricted information is primarily aimed at is to be that elementary cell is extracted and sought help through connections sequence and replace the method for limit sequence with the crossing directed subgraph.Often need in the reality to consider that some highway sections are current between in limited time, therefore, the cross sequence set limit A and the sequence sets B that can pass through for forming further can be divided into it two tabulations separately:
Cross sequence set limit A can be divided into: alwaysforbidRoads tabulation, timelimitRoads tabulation.
The sequence sets B that can pass through can be divided into: PassRoads tabulation, TimePassRoads tabulation.As shown in Figure 5, comprising:
The directed networks figure Map at crossing is obtained or made up to step 301.
Specifically can 1 be built with reference to the accompanying drawings to network chart Map.Among the directed networks figure Map, road uses two limits to represent, therefore the network topological diagram be made up of many limits and point of the directed networks figure Map at a crossing.
Step 302 is obtained the passed through sequence sets B of directed networks figure Map; Obtain the cross sequence set limit A of directed networks figure Map.
The implication of each the passed through sequence b among the sequence sets B of can passing through is, arrives the orderly combination of limit sequence number afterwards on one side in the past, while and preceding to after should pass through; One side, back are not refered in particular to certain two concrete limit on one side wherein, but for distinguishing two appellations that adopt on the limit.Before on one side, the back on one side, preceding one side and back on one side might be identical, one side for example on one side and precedingly be meant same limit, but be not must be identical the limit.
Because no matter a limit sequence a or the sequence b that can pass through all are orderly combinations of limit sequence number; Therefore judging that this limit sequence a is included among the sequence b that can pass through is meant:
(i) all limit sequence numbers among a are all in b;
(ii) consistent among the order of limit sequence number and the b and continuously among a.For example, 1. b is--2.--3.--and 4.--5., 4. a is--5., owing to satisfied among a 4.--5. in b, 4.--5. consistent among order and the b, and 4.--5. be continuous, so judge that a is in b.
Each limit sequence a among the cross sequence set limit A represents, arrives the orderly combination of limit sequence number afterwards on one side in the past, while and should no through traffic after preceding the arriving.
Need to prove, a highway section might only be to forbid travelling in some time periods, the highway section that for example has 6:00 in the morning only allows one-way traffic to evening between the 22:00, therefore, according to above description with two classes that are divided among the cross sequence set limit A, be recorded in respectively in two tabulations, wherein:
Permanent traffic restricted information is charged to the alwaysforbidRoads tabulation, and time period traffic restricted information path is charged to the timelimitRoads tabulation.
In like manner, all among the sequence sets B that can pass through are divided into two classes, are recorded in respectively in two tabulations: permanent traffic information is charged to the PassRoads tabulation, and the time period traffic information is charged to the TimePassRoads tabulation.
As shown in Figure 4, specifically provide an embodiment who calculates subsequence.Ask the subsequence of to pass through sequence b or limit sequence a by the mode from growing to lacking; Can adopt recursive mode to the cutting of sequence two ends, obtain tree, promptly the butt that truncates obtains left and right sides child node to each sequence node, and right child node is regeneration left side child node not.
Can be according to above-mentioned recursion method, calculate in alwaysforbidRoads tabulation, the timelimitRoads tabulation each whole subsequences respectively.
Step 304 is to screening in alwaysforbidRoads tabulation and the timelimitRoads tabulation.In screening process:
For an a1 in the alwaysforbidRoads tabulation, concrete decision rule comprises:
A1 is included in the PassRoads tabulation, rejects this a1;
A1 is included in the TimePassRoads tabulation, rejects this a1.
For an a2 in the timelimitRoads tabulation, concrete decision rule comprises:
A2 is included in the PassRoads tabulation, rejects this a2;
A2 is included in the TimePassRoads tabulation, and both time periods are identical, then no longer reject this a2; If the time period difference is also deleted this a2.
By said method, obtain the afterwards pairing vPartRoad table of alwaysforbidRoads tabulation screening, and pairing vTimePartRoad shows after the timelimitRoads tabulation screening.
Step 305 is write down all traffic restricted information paths that this can replace above in vPartRoad table;
Write down all paths that it can replace above in the vTimePartRoad table.
Step 306 according to priority criteria, is done ordering to vPartRoad table and vTimePartRoad table.
Selected priority criteria can be: length u, and alternative number v.
Wherein, sequence length u is meant, the number of the limit sequence number that this comprised; Alternative former number v be meant in the alwaysforbidRoads that can the substitute tabulation in the vPartRoad table number, and in the timelimitRoads that can the substitute tabulation in the vTimePartRoad table number.
Check simplifying the result, comprising: the path is current to be checked, simplifies the result and comprises inspection.
The path is current to be checked, according to the friendship limit at road data crossing, specify traffic information, again in conjunction with simplifying destination file, checks that whether transitable path is under an embargo or hands over limit still can pass through.
Simplify the result and comprise inspection, only carry out the inspection of inner relation of inclusion simplifying resulting text.
Step 308 is converted to the appointment specification with described simplification result, i.e. the form of client's concrete needs.
Export the bark mark arrangement set after simplifying, specifically can be converted to " bark mark, period, bark mark, bark mark ... " form of gdf specification, perhaps be converted to other form.
The technology that is provided is provided, adopt short as far as possible bark mark sequence simplifying to express traffic restricted information, the traffic restricted information that comprises that permanent ban is current, the time period, no through traffic, the relation between the limit of P Passable can not become to impassability or go the long way round currently, not influence the traffic restriction situation between other limits.
Wherein, in the step 302, in the process of obtaining the sequence sets B that can pass through, as shown in Figure 6, specifically comprise:
Step 3021 begins the subgraph at a crossing is handled.Wherein, therefore subgraph when each subgraph is handled, should be interpreted as a directed networks figure Map to this subgraph for view picture directed networks figure.
Step 3022, each summit of traversal subgraph obtains one and enters crossing point and and withdraw from the crossing point.
Step 3023 is judged to enter crossing point and whether to withdraw between the point of crossing P Passable, if, commentaries on classics step 3024, otherwise commentaries on classics step 3022.
Step 3024 is judged to enter crossing point and withdraw from whether had clear and definite given channel between the point of crossing, if change step 3026, otherwise change step 3025.
Step 3025 obtains the shortest path of point-to-point transmission from the subgraph at crossing.
Step 3026 is charged to the sequence sets B that can pass through with the path that obtains as limit entry, and will gather as the restriction set of simplifying, and the result of simplification can not block any limit entry.Restriction is meant, do not allow passed through sequence in " restriction set " to become the sequence of impassability.
According to path be permanent current or the time period current, respectively they are charged to permanent restriction set PassRoads and time period restriction set TimePassRoads.
In the foregoing description,,, finally obtained each sequence among the sequence sets B that to pass through by traveling through each summit for the shortest path that from the subgraph of crossing, obtains point-to-point transmission at a crossing.
In the step 302, in the process of cross sequence set limit A, as shown in Figure 7, specifically comprise:
Step 302ii obtains a pair ofly entering crossing point and withdrawing from the crossing point.
Step 302iii judges to enter crossing point and withdraw from whether the traffic restriction is arranged between the point of crossing, if change step step 302iv, otherwise change step step 302ii.
Step 302iv obtains entering crossing point and withdraws from the crossing and put whole paths between these 2 from the subgraph of crossing.
Step 302v constitutes a sequence with the traffic restricted information that obtains, and charges to cross sequence set limit A.
According to handing over limit is permanent forbidden or the time period current, respectively they is charged to the current timelimitRoads of collection of permanent forbidden collection alwaysforbidRoads and time period.
Check simplifying the result, comprising: the path is current to be checked, simplifies the result and comprises inspection.
The path is current to be checked, according to the friendship limit at road data crossing, specify traffic information, again in conjunction with simplifying destination file, checks that whether transitable path is under an embargo or hands over limit still can pass through.
Simplify the result and comprise inspection, only carry out the inspection of inner relation of inclusion simplifying resulting text.
Accordingly, present embodiment provide a kind of in electronic chart the device of recording traffic restricted information, as shown in Figure 8, comprising:
Network chart administrative unit 401 is used to obtain or make up the directed networks figure Map at a crossing;
Sequence sets construction unit 402, be used to obtain the passed through sequence sets B of described directed networks figure Map, each passed through sequence b among the described sequence sets B that passes through represents, arrives the orderly combination of limit sequence number afterwards on one side in the past, while and preceding to after can pass through;
Obtain the cross sequence set limit A of described directed networks figure Map, each the limit sequence a among the described cross sequence set limit A represents, arrive the orderly combination of limit sequence number afterwards on one side in the past, while and preceding to after limit and pass through;
One side, one side, back, preceding one side and back all refer to any limit among the described directed networks figure on one side before described;
Traffic restricted information acquiring unit 403 is used for for a limit sequence a, is included among the sequence b that can pass through if judge this limit sequence a, then rejects this limit sequence a from described cross sequence set limit A; Remaining all limit sequence a collect M in the middle of forming a limit sequence among the cross sequence set limit A.
Use the technology that present embodiment provides, for all limit sequence a that write down among the cross sequence set limit A that mass of redundancy data is arranged, adopted the passed through sequence b among the sequence sets B that to pass through that it is screened, remove limit sequence number unnecessary among the limit sequence a, and removed some limit sequence a; Simplify the expression mode of traffic restricted information, reduced redundant data.
Device also comprises:
Sequencing unit is used for sorting according to preset priority standard each limit sequence to collection M in the middle of the described limit sequence;
Described priority criteria comprises: sequence length u or equivalent sequence number v; Wherein, sequence length u is meant the number of the limit sequence number that this limit sequence comprises; Equivalent sequence number v is meant in the middle of the limit sequence when at least one limit sequence that limit sequence and limit sequence among the collection M concentrate is of equal value the number of at least one limit sequence that described limit sequence is concentrated; Each described limit sequence all should a corresponding at least sequence length u and a sequence number v of equal value;
Sequence is plucked menu unit, be used for when each the described limit sequence that collects M in the middle of the limit sequence being sorted according to described equivalent sequence number v, v1+v2+......vi=C, wherein C is a definite value, i is the sequence number of limit sequence, and vi represents the equivalent sequence number of this limit sequence;
Among the collection M, choose i limit sequence and as a result of export in the middle of the limit sequence, a described i limit sequence satisfies: make the value minimum of i, and make the individual described limit sequence of i sequence length u with the value minimum.
The sequence split cells, the whole subsequences that are used for calculating each limit sequence of cross sequence set limit A a are put into one and hand over limit subsequence set A1;
A described limit sequence a is in described friendship limit subsequence set A1.
The arrangement set split cells, the sequence sets B that is used for passing through is split as two tabulations, PassRoads tabulation, TimePassRoads tabulation; Wherein, deposit the sequence of forever can passing through in the PassRoads tabulation, deposit the time segment sequence of can passing through in the TimePassRoads tabulation;
Cross sequence set limit A is split as two tabulations, alwaysforbidRoads tabulation, timelimitRoads tabulation; Wherein, deposit the current sequence of permanent restriction in the alwaysforbidRoads tabulation, deposited the current sequence of time segment restriction in the timelimitRoads tabulation.
Sequence is rejected the unit, is used for the sequence a1 for the timelimitRoads tabulation, when
A1 is included in the PassRoads tabulation, rejects this a1;
A1 is included in the TimePassRoads tabulation, rejects this a1;
For an a2 in the timelimitRoads tabulation, when:
A2 is included in the PassRoads tabulation, rejects this a2;
A2 is included in the TimePassRoads tabulation, and both place time periods are identical, no longer reject this a2; The time period difference is then rejected a2.
Verification unit is used for each sequence to collection M in the middle of the described limit sequence, travels through each limit sequence number of this sequence, judges on one side whether this sequence is the orderly combination of in the past arriving limit sequence number afterwards, while and preceding to after can pass through; If then reject this sequence, otherwise keep.
The present invention is mainly used in the map of navigation electronic, the embodiment that is provided has following beneficial effect, adopt the sequence of short as far as possible limit sequence number to express traffic restricted information, comprise permanent ban traffic information, time period no through traffic restricted information, simplify the expression way of traffic restricted information, reduced data redundancy; Simultaneously, whether destroy connected relation among original directed networks figure Map, guaranteed the quality of result data by the result data after judge simplifying; Above technological means and effect make the technical bottleneck problem when map datum generates link and solved navigation.
Should be noted that above embodiment is only unrestricted in order to technical scheme of the present invention to be described, all parameter values can be according to the actual conditions adjustment, and in this rights protection scope.Those of ordinary skill in the art should be appreciated that and can make amendment or be equal to replacement technical scheme of the present invention, and do not break away from the spiritual scope of technical solution of the present invention, and it all should be encompassed in the middle of the claim scope of the present invention.
Claims (12)
1. the method for a recording traffic restricted information in electronic chart is characterized in that, comprising:
Step 1 is obtained the directed networks figure at a crossing;
Step 2 is obtained the passed through sequence sets of described directed networks figure, the orderly combination that each the passed through sequence in the described sequence sets that passes through is made up of the limit sequence number among the described directed networks figure, expression in the past while to after can pass through;
Obtain the cross sequence set limit of described directed networks figure, the orderly combination that each limit sequence that described limit sequence is concentrated is made up of the limit sequence number among the described directed networks figure, expression in the past while to after limit and pass through;
Wherein, one side preceding first pairing limit of limit sequence number that is meant in the described orderly combination Yi Bian the back is meant last the pairing limit of limit sequence number in the described orderly combination, and all is any limits among the described directed networks figure;
Step 3 for a limit sequence, is included in the sequence of can passing through if judge this limit sequence, then concentrates from described limit sequence and rejects this limit sequence; Limit sequence concentrates remaining all limit sequences to form the middle collection of a limit sequence.
2. method according to claim 1 is characterized in that, after the described step 2, also comprises:
Calculate whole subsequences of each described limit sequence, put into one and hand over the set of limit subsequence;
Then in step 3, a described limit sequence is specially a subsequence in the set of described friendship limit subsequence.
3. method according to claim 2 is characterized in that, forms the middle collection of a limit sequence in the step 3 and also comprises afterwards:
Step 4 sorts to each limit sequence of concentrating in the middle of the described limit sequence according to the preset priority standard;
Described priority criteria comprises: sequence length u or equivalent sequence number v; Wherein, sequence length u is meant the number of the limit sequence number that this limit sequence comprises; Equivalent sequence number v is meant when at least one limit sequence that limit sequence concentrating in the middle of the limit sequence and limit sequence concentrate is of equal value the number of at least one limit sequence that described limit sequence is concentrated; Each described limit sequence all should a corresponding at least sequence length u and a sequence number v of equal value;
Step 5, when middle each the described limit sequence concentrated of described limit sequence being sorted according to described equivalent sequence number v, v1+v2+......vi=C, wherein C is a definite value, i is the sequence number of limit sequence, and vi represents the equivalent sequence number of this limit sequence;
Concentrate in the middle of described limit sequence, choose i limit sequence and as a result of export, a described i limit sequence satisfies: make the value minimum of i, and make the individual described limit sequence of i sequence length u with the value minimum.
4. method according to claim 1 is characterized in that, in the described step 2,
The described sequence of passing through is divided into forever can pass through sequence and the time segment sequence of can passing through, the then described sequence sets that passes through comprises first tabulation and second tabulation: the described sequence of forever can passing through is deposited in described first tabulation, and described second tabulates deposits the described time segment sequence of can passing through;
Described limit sequence is divided into current sequence of permanent restriction and the current sequence of time segment restriction, then described cross sequence set limit comprises the 3rd tabulation and the 4th tabulation: the current sequence of described permanent restriction is deposited in described the 3rd tabulation, and the current sequence of described time segment restriction is deposited in described the 4th tabulation.
5. method according to claim 4 is characterized in that,
For the sequence a1 in described the 3rd tabulation, when
A1 is included in first tabulation, rejects this a1;
A1 is included in second tabulation, rejects this a1;
For a sequence a2 in the 4th tabulation, when:
A2 is included in first tabulation, rejects this a2;
A2 is included in second tabulation, and both place time periods are identical, no longer reject this a2; The time period difference is then rejected a2.
6. method according to claim 1 is characterized in that, forms after the middle collection of a limit sequence, also comprises:
Each limit sequence to concentrating in the middle of the described limit sequence travels through each limit sequence number of this limit sequence, judges on one side whether this limit sequence is the orderly combination of in the past arriving limit sequence number afterwards, while and preceding to after can pass through; If then in the middle of described limit sequence, concentrate this limit sequence of rejecting, otherwise keep.
7. the device of a recording traffic restricted information in electronic chart is characterized in that, comprising:
The network chart administrative unit is used to obtain or make up the directed networks figure at a crossing;
The sequence sets construction unit is used to obtain the cross sequence set limit of described directed networks figure, the orderly combination that each limit sequence that described limit sequence is concentrated is made up of the limit sequence number among the directed networks figure, expression in the past while to after limit and pass through;
Wherein, one side preceding first pairing limit of limit sequence number that is meant in the described orderly combination Yi Bian the back is meant last the pairing limit of limit sequence number in the described orderly combination, and all is any limits among the described directed networks figure;
The traffic restricted information acquiring unit is used for for a limit sequence, is included in the sequence of can passing through if judge this limit sequence, then concentrates from described limit sequence and rejects this limit sequence; Limit sequence concentrates remaining all limit sequences to form the middle collection of a limit sequence.
8. device according to claim 7 is characterized in that, also comprises:
Sequencing unit is used for according to the preset priority standard each limit sequence of concentrating in the middle of the described limit sequence being sorted;
Described priority criteria comprises: sequence length u or equivalent sequence number v; Wherein, sequence length u is meant the number of the limit sequence number that this limit sequence comprises; Equivalent sequence number v is meant when at least one limit sequence that limit sequence concentrating in the middle of the limit sequence and limit sequence concentrate is of equal value the number of at least one limit sequence that described limit sequence is concentrated; Each described limit sequence all should a corresponding at least sequence length u and a sequence number v of equal value;
Sequence is plucked menu unit, be used for when middle each the described limit sequence concentrated of described limit sequence being sorted according to described equivalent sequence number v, v1+v2+......vi=C, wherein C is a definite value, i is the sequence number of limit sequence, and vi represents the equivalent sequence number of this limit sequence;
Concentrate in the middle of described limit sequence, choose i limit sequence and as a result of export, a described i limit sequence satisfies: make the value minimum of i, and make the individual described limit sequence of i sequence length u with the value minimum.
9. device according to claim 7 is characterized in that, also comprises:
The sequence split cells is used to calculate limit sequence and concentrates whole subsequences of each limit sequence to put into a friendship limit subsequence set;
A described limit sequence is specially a subsequence in the set of described friendship limit subsequence.
10. device according to claim 7 is characterized in that, also comprises:
The arrangement set split cells, be used for the described sequence of passing through is divided into forever can pass through sequence and the time segment sequence of can passing through, the then described sequence sets that passes through comprises first tabulation and second tabulation: the described sequence of forever can passing through is deposited in described first tabulation, and described second tabulates deposits the described time segment sequence of can passing through;
Described limit sequence is divided into current sequence of permanent restriction and the current sequence of time segment restriction, then described cross sequence set limit comprises the 3rd tabulation and the 4th tabulation: the current sequence of described permanent restriction is deposited in described the 3rd tabulation, and the current sequence of described time segment restriction is deposited in described the 4th tabulation.
11. device according to claim 7 is characterized in that,
Sequence is rejected the unit, is used for the sequence a1 for described the 3rd tabulation, when
A1 is included in first tabulation, rejects this a1;
A1 is included in second tabulation, rejects this a1;
For an a2 in the 4th tabulation, when:
A2 is included in first tabulation, rejects this a2;
A2 is included in second tabulation, and both place time periods are identical, no longer reject this a2; The time period difference is then rejected a2.
12. device according to claim 7 is characterized in that, also comprises:
Verification unit is used for each limit sequence of concentrating in the middle of the described limit sequence, travels through each limit sequence number of this limit sequence, judges on one side whether this limit sequence is the orderly combination of in the past arriving limit sequence number afterwards, while and preceding to after can pass through; If then in the middle of described limit sequence, concentrate this limit sequence of rejecting, otherwise keep.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100908699A CN101620803B (en) | 2009-08-11 | 2009-08-11 | Method and device for recording traffic restricted information on electronic map |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009100908699A CN101620803B (en) | 2009-08-11 | 2009-08-11 | Method and device for recording traffic restricted information on electronic map |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101620803A true CN101620803A (en) | 2010-01-06 |
| CN101620803B CN101620803B (en) | 2012-08-22 |
Family
ID=41514017
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009100908699A Active CN101620803B (en) | 2009-08-11 | 2009-08-11 | Method and device for recording traffic restricted information on electronic map |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101620803B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109557928A (en) * | 2019-01-17 | 2019-04-02 | 湖北亿咖通科技有限公司 | Automatic driving vehicle paths planning method based on map vector and grating map |
| CN114202924A (en) * | 2021-12-15 | 2022-03-18 | 北京百度网讯科技有限公司 | Method and device for identifying redundant traffic restriction information, electronic device and medium |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6324470B1 (en) * | 2000-03-07 | 2001-11-27 | Navigation Technologies Corporation | Method and system for representing restricted driving maneuvers |
| CN100535600C (en) * | 2005-08-25 | 2009-09-02 | 厦门雅迅网络股份有限公司 | Device for displaying road navigation track |
| CN101359434A (en) * | 2008-09-17 | 2009-02-04 | 覃征 | Process for constructing road net model for traffic navigation system and traffic emulation system |
| CN101458092B (en) * | 2008-09-26 | 2011-08-10 | 深圳市路畅科技有限公司 | Crossing steering forbidding identification input method in automatic navigation system |
| CN101488158A (en) * | 2009-02-13 | 2009-07-22 | 同济大学 | Road network modeling method based on road element |
-
2009
- 2009-08-11 CN CN2009100908699A patent/CN101620803B/en active Active
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109557928A (en) * | 2019-01-17 | 2019-04-02 | 湖北亿咖通科技有限公司 | Automatic driving vehicle paths planning method based on map vector and grating map |
| CN114202924A (en) * | 2021-12-15 | 2022-03-18 | 北京百度网讯科技有限公司 | Method and device for identifying redundant traffic restriction information, electronic device and medium |
| CN114202924B (en) * | 2021-12-15 | 2024-01-09 | 北京百度网讯科技有限公司 | Redundant traffic restriction information identification method and device, electronic equipment and medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101620803B (en) | 2012-08-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Friedrich et al. | Timetable-based transit assignment using branch and bound techniques | |
| Schrimpf et al. | Record breaking optimization results using the ruin and recreate principle | |
| Uppoor et al. | Large-scale urban vehicular mobility for networking research | |
| Kanoh | Dynamic route planning for car navigation systems using virus genetic algorithms | |
| CN108873905A (en) | Automatic driving vehicle control method, automatic driving vehicle and readable storage medium storing program for executing | |
| CN107196858A (en) | A kind of k solving the shortest path methods for considering polymorphic type constraint | |
| CN107195180A (en) | A kind of traffic trip track extraction method and device based on the alert data of electricity | |
| CN107798079A (en) | Section joining method and system based on track of vehicle data | |
| CN109341709A (en) | Route recommendation method, electronic equipment and computer readable storage medium | |
| CN108267150A (en) | It is a kind of to solve the layering rational method and system of route planning circuit | |
| CN102162734A (en) | Method for generating data in navigation electronic map | |
| CN109412954A (en) | Route determining methods, device and storage medium based on unordered joint constraint | |
| CN101620803B (en) | Method and device for recording traffic restricted information on electronic map | |
| Tachibana et al. | Metropolitan area network model design using regional railways information for beyond 5G research | |
| CN111008736A (en) | Opening decision method and system for new airline | |
| Popa et al. | On transport network reliability | |
| CN114462898A (en) | Road planning management method and system based on geographic information | |
| CN114298493A (en) | Road operation monitoring system, method, terminal and storage medium | |
| CN112748452B (en) | GPS track cleaning method based on road network data | |
| CN108665383A (en) | Big data management method of travelling and system | |
| CN114413923B (en) | Driving route recommendation method, device, storage medium and system | |
| CN112509332B (en) | Road condition determination method, device, medium and electronic equipment | |
| CN109711438A (en) | Bus traffic route acquisition methods, device and equipment | |
| CN102907053B (en) | Wavelength division network planning method and equipment | |
| Xia et al. | Problem decomposition for traffic diversions |
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 |