CN101620803A - Method and device for recording traffic restricted information on electronic map - Google Patents

Abstract

The present invention provides a method and device for recording traffic restriction information in an electronic map. The method includes: obtaining a directed network diagram of an intersection; obtaining a passable sequence set of the directed network graph, and each passable sequence set in the passable sequence set A sequence is an ordered combination of edge numbers in a directed network graph, indicating that it is passable from the front side to the back side; to obtain the intersection sequence set of the directed network graph, each intersection sequence in the intersection sequence set is composed of The orderly combination of edge numbers in the network graph indicates that traffic is restricted from the front side to the back side; if it is determined that a traffic restriction sequence is included in a passable sequence, the traffic restriction sequence is removed from the traffic restriction sequence set. In the embodiment of the present invention, for the traffic restriction sequence with a large amount of redundant data, the passable sequence is used to screen it, the redundant edge sequence number in the traffic restriction sequence is removed, the representation of the traffic restriction information is simplified, and the redundancy is reduced data.

Description

A method and device for recording traffic restriction information in an electronic map

technical field

The invention relates to electronic map technology, in particular to a method and device for recording traffic restriction information in an electronic map.

Background technique

The electronic map is a description of the real world, but it is different from the real world. For example, a road in the real world is represented by two edges in the electronic navigation map, and a crossroad can be represented by multiple lines in the electronic navigation map. A directed graph representation of edges and vertices.

In the process of calculating the navigation route, traffic restriction information plays an important role. After the digitization of real roads, vector maps are used to represent navigation information. For traffic restriction information, for example, in the directed subgraph of intersections in navigation electronic maps, the sequence of edges is usually used to record traffic restriction information, including permanent prohibition and time period prohibition. pass.

In the process of implementing the present invention, the inventor found at least the following problems in the prior art: when using the sequence of edges to record traffic restriction information, it is necessary to record many edges involved or even the sequence number of each edge, resulting in a large amount of redundancy data, resulting in a waste of space in the electronic map storage medium, especially for mobile phone users; redundant data makes navigator manufacturers only use high-configuration hardware, otherwise accidents such as memory overflow will easily occur; due to traffic restrictions, information is calculated by navigation equipment The necessary basis for a feasible path, the above-mentioned redundancy affects the calculation speed of the device, makes the response of the navigation device slow, and causes a waste of computing resources.

Contents of the invention

The object of the present invention is to provide a method and device for recording traffic restriction information in an electronic map, which is used to eliminate redundant data of the traffic restriction information stored in the electronic map.

A method for recording traffic restriction information in an electronic map, comprising: Step 1, obtaining a directed network diagram of an intersection; Step 2, obtaining a passable sequence set of the directed network diagram, and the passable sequence set Each passable sequence is an ordered combination of edge sequence numbers in a directed network graph, indicating that it is passable from the front side to the back; obtain the intersection sequence set of the directed network graph, and the intersection sequence set in the directed network graph Each intersection sequence is an ordered combination composed of edge numbers in a directed network graph, which means that traffic is restricted from the front side to the back side; where the front side refers to the first side number in the ordered combination. The latter side refers to the side corresponding to the last side number in the ordered combination, and is any side in the directed network graph; step 3, for a sequence of intersections, if it is determined that the intersection If the restricted sequence is included in a traversable sequence, the crossed sequence is removed from the crossed sequence set; all remaining crossed sequences in the crossed sequence set form an intermediate set of crossed sequences.

Wherein, after the step 2, it also includes: calculating all subsequences of each of the intersection sequences, and putting them into a set of intersection subsequences; then in step 3, the intersection sequence is in the intersection sequence In the set of restricted subsequences.

A device for recording traffic restriction information in an electronic map, comprising: a network graph management unit, configured to obtain or construct a directed network graph of an intersection; a sequence set construction unit, configured to obtain the intersection limit of the directed network graph A sequence set, each intersection sequence in the intersection sequence set is an ordered combination of edge serial numbers in a directed network graph, indicating that traffic is restricted from the front side to the back side; wherein, the front side refers to the ordered The edge corresponding to the first edge sequence number in the combination, and the latter edge refers to the edge corresponding to the last edge sequence number in the ordered combination, and is any edge in the directed network graph; traffic restriction information The acquisition unit is configured to, for an intersection sequence, if it is determined that the intersection sequence is included in a passable sequence, then remove the intersection sequence from the intersection sequence set; all remaining intersection sequences in the intersection sequence set form An intermediate set of intersecting sequences.

The embodiment of the present invention has the following beneficial effects. For the intersection sequence with a large amount of redundant data, the passable sequence b is used to screen it, the redundant edge sequence number in the intersection sequence a is removed, and some intersection sequences are removed. Restriction sequence a; simplifies the representation of traffic restriction information and reduces redundant data.

Description of drawings

Fig. 1 is a directed graph of an intersection in the embodiment of the present invention;

Fig. 2 is a schematic flow diagram of the method of the embodiment of the present invention;

Fig. 3 is the second schematic flow diagram of the method of the embodiment of the present invention;

FIG. 4 is a schematic diagram of splitting a sequence into multiple subsequences according to an embodiment of the present invention;

Fig. 5 is a schematic flow chart of a method limited by road conditions according to an embodiment of the present invention;

FIG. 6 is a schematic flowchart of a method for obtaining a passable sequence set according to an embodiment of the present invention;

FIG. 7 is a schematic flowchart of a method for obtaining a cross-limit sequence set according to an embodiment of the present invention;

Fig. 8 is a schematic structural diagram of a device according to an embodiment of the present invention.

Detailed ways

In order to make the purpose, technical features and implementation effects of the present invention clearer, the technical solution of the present invention will be described in detail below in conjunction with the accompanying drawings and specific embodiments. In the embodiment provided by the present invention, by using the passable sequence corresponding to the passable information to screen the intersection sequence, the redundant data in the electronic map is reduced and resolved.

As shown in FIG. 1 , a side has a corresponding serial number, which is called the side serial number of the side, and each side refers to a line segment determined between two intersection points. On the road corresponding to side ①, if you see the "No left turn" sign and the "go straight" sign, it means that there is traffic restriction information: from side ① to side ⑧ is impassable, and it is expressed as several sequences in the following form in the electronic map:

(1)①--②--③--④--⑤--⑥--⑦--⑧

(2)①--②--③--⑨--⑩--⑥--⑦--⑧

 …

From side ① to side ④ is designated passable, it is expressed as several sequences in the following form, called passable information:

I ①--②--③--④

II ⑤--⑥--⑦--⑧

Traffic restriction information should not be a subsequence of certain passable information, otherwise it is called information conflict.

In the above representation, when using sequence (1) and (2) to record the traffic restriction information, it is found that the traffic restriction information can be expressed by using a subsequence of a certain sequence. For example, the traffic restriction information from ① to ⑧ may use the sequence ④--⑤ and sequence ⑨--⑩ can be used to express; through comparison, we can know that if the sequence (1) and (2) are used, there will be redundant data in the electronic map.

An embodiment of the present invention provides a method for recording traffic restriction information in an electronic map, as shown in FIG. 2 , including:

Step 101, obtaining a directed network graph of an intersection;

Step 102, obtain the passable sequence set B of the directed network graph, each passable sequence in the passable sequence set is an ordered combination of edge numbers in the directed network graph, representing the sequence from the front side to the back passable on one side;

Obtain the traffic restriction information sequence set A (hereinafter referred to as: the traffic restriction sequence set) of the directed network graph, and each traffic restriction information sequence (hereinafter referred to as: the traffic restriction sequence) in the described traffic restriction sequence set is generated by the directed network The orderly combination of edge numbers in the figure indicates that traffic is restricted from the front side to the back side;

Wherein, the former side refers to the side corresponding to the first side serial number in the ordered combination, and the latter side refers to the side corresponding to the last side serial number in the ordered combination, and both are the directed Any edge in the network graph;

Step 103, for a traffic sequence, if it is determined that the traffic sequence is included in a passable sequence, then remove the traffic sequence from the traffic sequence set; all remaining traffic sequences in the traffic sequence set form a traffic sequence. Restricted information sequence intermediate set M (hereinafter referred to as: cross-restricted sequence intermediate set).

Applying the technology provided in this embodiment, for each intersection sequence a recorded in the intersection sequence set A with a large amount of redundant data, the passable sequence b in the passable sequence set B is used to screen it, The redundant edge sequence numbers in the intersection sequence a and some intersection sequences a are removed; the representation of traffic restriction information is simplified, and redundant data is reduced.

After the step 102, it may also include: calculating all subsequences of each of the traffic restriction sequences, and putting them into a traffic restriction information subsequence set A1 (hereinafter referred to as: traffic restriction subsequence set A1);

Then in step 103, the one intersection sequence is in the intersection subsequence set A1.

In the above technical solution, after forming an intermediate set M of intersecting sequence, it also includes:

Step 104, sorting the crossing sequences in the intermediate set M of crossing sequences according to a predetermined priority standard;

The pre-priority criteria include: sequence length u or the number of equivalent sequences v; among them, the sequence length u refers to the number of edge sequence numbers contained in the sequence; the number of equivalent sequences v refers to the intermediate set of intersection sequences When a sequence in M is equivalent to at least one sequence in the intersection sequence set, the number of the at least one sequence; each of the intersection sequences should at least correspond to a sequence length u and a number of equivalent sequences v ;

Step 105, when sorting each of the intersection sequences according to the number v of the equivalent sequences, v1+v2+...vi=C, where C is a fixed value, and i is the value of the intersection sequence serial number, and in the formula, i also represents the number of all intersection sequences in the formula when the conditions are met, and vi represents the number of equivalent sequences of the intersection sequence;

In the intermediary set M of intersecting sequences, select i intersecting sequences as the result output, and the i intersecting sequences satisfy: make the value of i the smallest, and make the sum of the sequence length u of the i intersecting sequences The value is the smallest.

From the provided technical solution, it can be deduced that all the edge sequence sets expressing traffic restrictions in the navigation electronic map are calculated; all subsequences of these sequences are calculated; Assign different weights to each subsequence; select the subsequence set according to the weight value to replace the original edge sequence set expressing traffic restrictions; in this way, the traffic restriction information can be highly simplified while ensuring the correctness of the data expression, reducing data redundancy.

In the provided embodiment, both the passable sequence set B and the intersection sequence set A can be subdivided. If it is considered that some roads (corresponding to sides) are passed in different time periods, for example, some roads are between 20 o'clock in the evening and Two-way driving is possible between 8:00 am, and one-way driving is possible between 8:00 am and 20:00 pm. Then, the road is trafficable in different time periods, or called time-based traffic restrictions. Since a road is passable in different time periods, it is equivalent to restricting traffic in different time periods. Therefore, the edge numbers of the edges corresponding to these roads can be expressed in the sequence of the passable sequence set B, or in the traffic In the sequence of the restricted sequence set A.

The passable sequence set B includes: a first list, which is the PassRoads list, and a second list, which is the TimePassRoads list; the first list stores the permanent passable sequences, and the second list stores the time-period passable sequences .

The traffic limit sequence set A includes: a third list, namely the alwaysforbidRoads list, and a fourth list, namely the timelimitRoads list; the third list stores the permanent restricted traffic sequence, and the fourth list stores the time-segment restricted traffic sequence .

After forming an intersecting sequence intermediate set M, the intersecting sequence a in the intersecting sequence intermediate set M can be further screened to remove more redundant data, including:

Step 1031 , sort each crossing sequence in the intermediate set M of crossing sequences according to a predetermined priority standard.

The selected priority criteria may be: sequence length u, and number of equivalent sequences v.

The sequence length u refers to the number of edge numbers contained in the sequence; the number of equivalent sequences v refers to the number of existing sequences in the intermediate set M of intersecting sequences that can replace the old sequences in A.

First, sort the intersecting sequences according to the number v of equivalent sequences, such as sorting from large to small.

Step 1032, if both A and B are divided according to the time period, there should also be two lists in the intermediate set M of the cross-limit sequence, the one corresponding to A, the vPartRoad table corresponding to the alwaysforbidRoads list in C, and the timelimitRoads table in C The list corresponds to the vTimePartRoad table.

The selected priority criteria are still: the sequence length u, and the number v of equivalent sequences. at this time,

The sequence length u refers to the sequence belonging to the vPartRoad table and the vTimePartRoad table, and the number of edge sequence numbers contained in the sequence.

The number of equivalent sequences v refers to the number of sequences that belong to the vPartRoad table and are equivalent to (substitute) the sequences in the alwaysforbidRoads list; the number of sequences that belong to the vTimePartRoad table and are equivalent to (substitute) the timelimitRoads list.

Step 1033, check the intermediate set M of the intersecting limit sequence, including:

If the situation of traffic in different time periods is not considered, the intermediate set M of the intersection sequence and the set A of the intersection sequence are combined, and the least and shortest multiple sequences are selected from C as the simplified result output.

If the situation of traffic in different time periods is considered, the vCPartRoad table and vCTimePartRoad table are combined with alwaysforbidRoads and timelimitRoads respectively, and the least and shortest multiple sequences are selected from the vCPartRoad table and vCTimePartRoad table as the simplified result output.

Since v1+v2+...vi=C, where C is a fixed value, which can be specified in advance; v1>v2>...>vi is a natural number, so v1, v2,..... The larger the value of .vi, etc., the smaller i is, that is, "minimum". In an extreme case, when v1=C, then i=1; when v is the same, select the shortest sequence according to the sequence length u;

The least and the shortest are given priority to the former, but usually when u is small, v is also large and i is small, so the two goals of the least and the shortest can be achieved at the same time.

The technology provided by this embodiment uses the sequence length u and the number of equivalent sequences v to check the intermediate set M of the intersection sequence, which not only eliminates the redundant data of the traffic restriction information stored in the electronic map, but also ensures that The result set after eliminating redundant data can be relied upon to be free from errors and unusable data.

Combining the technologies provided above, this embodiment provides a preferred method for eliminating redundant data of traffic restriction information stored in an electronic map, as shown in FIG. 3 , including:

Step 201, acquire or construct a directed network graph Map of an intersection.

For a directed network graph Map, please refer to attached figure 1. A road in the figure is represented by two edges, so a directed network graph Map at an intersection may be a network topology graph composed of multiple edges and points.

Step 202, obtaining the passable sequence set B of the directed network map Map; obtaining the intersection sequence set A of the directed network map Map.

Each passable sequence b in the passable sequence set B represents an ordered combination of edge numbers from the front side to the back side, and the front side to the back side should be passable.

Each intersection sequence a in the intersection sequence set A represents an ordered combination of edge numbers from the front side to the back side, and the front side to the back side restricts passage;

The preceding side, the following side, the previous side and the following side all refer to any side in the directed network graph.

Among them, because no matter a crossing sequence a or a passable sequence b, they are all ordered combinations of edge sequence numbers.

Step 203, calculate all the subsequences of each intersection sequence a in the intersection sequence set A as a new intersection sequence a; in order to distinguish it from the intersection sequence set A, the set of these subsequences is called an intersection subsequence Set A1.

As shown in FIG. 4 , an embodiment of calculating a subsequence is specifically provided. In this embodiment, the binary tree algorithm is used to find the subsequences of the passable sequence b or the intersection sequence a from long to short; the two ends of the sequence can be segmented in a recursive manner to obtain a tree structure, that is, for each The sequence node is truncated to obtain the left and right child nodes, and the right child node will no longer generate the left child node.

Step 204, screen out the cross-restricted spare subsequences from the cross-restricted subsequence set A1.

For an intersection sequence a, if it is determined that the intersection sequence a is included in a passable sequence b, then the intersection sequence a is eliminated;

Judging that the intersection sequence a is included in a passable sequence b means that all the edge numbers in a are in b, and the order of these edge numbers is consistent and continuous with that in b. For example, a is ④--⑤, b is ②--③-④--⑤, since ④--⑤ are all in b, the order of ④--⑤ is consistent with that in b, and ④--⑤ is in the sequence is continuous, so it is determined that a is contained in b.

If the sequence in the cross-restricted subsequence set A1 is not included in the passable sequence set B, it is regarded as a cross-restricted standby subsequence. All remaining alternate subsequences in the cross-restricted subsequence set A1 form an intermediate set M of cross-restricted sequences.

Step 205, according to the intermediate set M of the intersecting sequence, generate an alternate subsequence set A2.

The intermediate set M of traffic restriction sequences is consistent with the sequences in the backup subsequence set A2, but in the backup subsequence set A2, all traffic restriction information that it can replace must be recorded on each traffic restriction backup subsequence.

The selected priority criteria may be: sequence length u, and number of equivalent sequences v.

The sequence length u refers to the number of edge numbers contained in the sequence; the number of equivalent sequences v refers to the number of existing sequences in the intermediate set M of intersecting sequences that can replace the old sequences in A.

Step 206, combining the spare subsequence set A2 with the intersecting sequence set A, and taking the least and shortest sequence set as the simplified result.

In step 207, the simplified result is converted into a specified specification, that is, a specific required format approved by the client.

Output the simplified edge number sequence set, which can be converted to the gdf specification "edge number, dot number, edge number, edge number..." format, or converted to other formats.

The above embodiments describe methods of acquiring traffic restriction information from which redundant data has been removed.

Furthermore, the navigation electronic map is a vector map, which corresponds to a directed network graph Map, from which multiple directed subgraphs of intersections can be obtained, and the simplification of traffic restriction information is mainly aimed at The unit extracts the path subsequence and replaces the method of intersection sequence. In practice, it is often necessary to consider that some road sections are time-limited. Therefore, for the formed intersection sequence set A and passable sequence set B, they can be further divided into two lists:

The cross-limit sequence set A can be divided into: alwaysforbidRoads list and timelimitRoads list.

Passable sequence set B can be divided into: PassRoads list and TimePassRoads list. As shown in Figure 5, including:

Step 301, acquiring or constructing a directed network graph Map of an intersection.

Specifically, you can refer to Figure 1 to construct a directed network graph Map. In a directed network map, a road is represented by two edges, so a directed network map of an intersection is a network topology map composed of multiple edges and points.

Step 302, obtaining the passable sequence set B of the directed network map Map; obtaining the intersection sequence set A of the directed network map Map.

The meaning of each passable sequence b in the passable sequence set B is an ordered combination of edge numbers from the front side to the back side, and the front side to the back side should be passable; the front side and the back side do not specifically refer to Two specific sides, but the title used to distinguish the two sides. The front side, the back side, the front side and the back side may be the same, for example, the front side and the front side refer to the same side, but not necessarily the same side.

Since no matter a intersection sequence a or a traversable sequence b, it is an ordered combination of edge sequence numbers; therefore, it is determined that the intersection sequence a is included in a traversable sequence b means:

(i) All edge numbers in a are in b;

(ii) The order of the edge numbers in a is consistent and continuous with that in b. For example, b is ①--②--③--④--⑤, a is ④--⑤, since ④--⑤ in a is satisfied in b, the order of ④--⑤ is consistent with that in b, and ④--⑤ are continuous, so it is determined that a is in b.

Each intersection sequence a in the intersection sequence set A represents an ordered combination of edge numbers from the front side to the back side, and traffic should be prohibited from the front side to the back side.

It should be noted that a road section may only be prohibited for a certain period of time. For example, some road sections only allow one-way driving between 6:00 am and 22:00 pm. Therefore, according to the above description, the traffic limit The sequence set A is divided into two categories, which are recorded in two lists, among which:

The permanent traffic restriction information is recorded in the alwaysforbidRoads list, and the time-segment traffic restriction information route is recorded in the timelimitRoads list.

Similarly, everything in the passable sequence set B is divided into two categories, which are recorded in two lists: permanent pass information is recorded in the PassRoads list, and time period pass information is recorded in the TimePassRoads list.

Step 303, calculate all subsequences of each sequence in A's alwaysforbidRoads list and timelimitRoads list.

As shown in FIG. 4 , an embodiment of calculating a subsequence is specifically provided. Find the subsequences of the passable sequence b or the intersection sequence a from long to short; you can recursively split the two ends of the sequence to obtain a tree structure, that is, truncate each sequence node to obtain the left and right subsequences node, the right child node no longer generates a left child node.

All subsequences in the alwaysforbidRoads list and the timelimitRoads list can be calculated respectively according to the above recursive method.

Step 304, filter the alwaysforbidRoads list and the timelimitRoads list. During the screening process:

For a1 in the alwaysforbidRoads list, the specific determination rules include:

a1 is included in the PassRoads list, remove this a1;

a1 is included in the TimePassRoads list, remove this a1.

For a2 in the timelimitRoads list, the specific judgment rules include:

a2 is included in the PassRoads list, remove this a2;

a2 is included in the TimePassRoads list, and the time period of the two is the same, then this a2 will not be removed; if the time period is different, this a2 will also be deleted.

Through the above method, the corresponding vPartRoad table after filtering the alwaysforbidRoads list and the corresponding vTimePartRoad table after filtering the timelimitRoads list are obtained.

Step 305, write down all traffic restriction information pathways that can be replaced above in the vPartRoad table;

Write down all the paths it can replace above in the vTimePartRoad table.

Step 306, sort the vPartRoad table and the vTimePartRoad table according to the priority standard.

The selected priority criteria can be: the length u, and the number v of alternatives.

Among them, the sequence length u refers to the number of the included edge sequence numbers; the original number of replaceable v refers to the number of replaceable alwaysforbidRoads in the vPartRoad table, and the replaceable timelimitRoads in the vTimePartRoad table the number of in the list.

In step 307, the vPartRoad table is combined with alwaysforbidRoads, and the vTimePartRoad table is combined with timelimitRoads to select the least and shortest fragment set as the simplified result.

Check the simplification result, including: path passing check, simplification result inclusion check.

Path traffic inspection, according to the traffic limit at the intersection of road data, the specified traffic information, and combined with the simplified result file, check whether the passable path is prohibited or the traffic limit is still passable.

The simplification result contains check, and only checks the internal containment relationship for the simplification result text.

Step 308, converting the simplified result into a specified specification, that is, a format specifically required by the customer.

Output the simplified edge number sequence set, which can be converted to the gdf specification "edge number, dot number, edge number, edge number..." format, or converted to other formats.

Apply the technology provided, use the shortest edge number sequence to simplify the expression of traffic restriction information, including permanent prohibition of passage, traffic restriction information of time period prohibition of passage, and will not change the relationship between passable edges into impassable or detour traffic without affecting traffic restrictions between other sides.

Wherein, in step 302, in the process of obtaining the passable sequence set B, as shown in FIG. 6 , it specifically includes:

Step 3021, start to process a subgraph of an intersection. Wherein, the sub-graph is relative to the entire directed network graph, so when processing each sub-graph, the sub-graph should be understood as a directed network graph Map.

Step 3022, traverse each vertex of the subgraph to obtain an entry intersection point and an exit intersection point.

Step 3023, judge whether it is possible to pass between the entry intersection point and the exit intersection point, if yes, go to step 3024, otherwise go to step 3022.

Step 3024, judge whether there is a clear designated path between the entry intersection point and the exit intersection point, if yes, go to step 3026, otherwise go to step 3025.

Step 3025, get the shortest path between two points from the intersection subgraph.

Step 3026, record the obtained path as a restriction item into the passable sequence set B, and use the set as a simplified restriction set, and the result of the simplification cannot block any restriction item. Restriction means that the passable sequences in the "restriction set" are not allowed to become impassable sequences.

According to whether the paths are permanent passage or time-segment passage, they are respectively recorded in the permanent restriction set PassRoads and the time-segment restriction set TimePassRoads.

In the above embodiment, for an intersection, the shortest path between two points is obtained from the intersection subgraph, and each sequence in the passable sequence set B is finally obtained by traversing each vertex.

In step 302, in the process of intersecting the sequence set A, as shown in Figure 7, specifically includes:

Step 302i, traverse the vertices in the subgraph of the directed network graph Map of an intersection.

Step 302ii, get a pair of entry intersection point and exit intersection point.

Step 302iii, judge whether there is traffic restriction between the entry point and the exit point, if yes, go to step 302iv, otherwise go to step 302ii.

In step 302iv, obtain all paths between the two points of the intersection point and the exit point from the intersection subgraph.

Step 302v, form a sequence with the obtained traffic restriction information, and record it into the traffic restriction sequence set A.

According to whether traffic restrictions are permanent prohibition or time-segment passage, they are respectively recorded in the permanent prohibition set alwaysforbidRoads and the time-segment passage set timelimitRoads.

Check the simplification result, including: path passing check, simplification result inclusion check.

Path traffic inspection, according to the traffic limit at the intersection of road data, the specified traffic information, and combined with the simplified result file, check whether the passable path is prohibited or the traffic limit is still passable.

The simplification result contains check, and only checks the internal containment relationship for the simplification result text.

Correspondingly, this embodiment provides a device for recording traffic restriction information in an electronic map, as shown in FIG. 8 , including:

A network graph management unit 401, configured to obtain or construct a directed network graph Map of an intersection;

The sequence set construction unit 402 is used to obtain the passable sequence set B of the directed network graph Map, and each passable sequence b in the passable sequence set B represents the number of edges from the front side to the back side. Sequential combination, and the front side to the back side can pass;

Obtain the intersection sequence set A of the directed network graph Map, each intersection sequence a in the intersection sequence set A represents an ordered combination of edge numbers from the front side to the back side, and the front side to the back side One side restricts traffic;

The front side, the back side, the front side and the back side all refer to any side in the directed network graph;

The traffic restriction information acquisition unit 403 is configured to, for a traffic restriction sequence a, if it is determined that the traffic restriction sequence a is included in a passable sequence b, then remove the traffic restriction sequence a from the traffic restriction sequence set A; All remaining intersecting sequences a in the restricted sequence set A form an intermediate set M of intersecting sequences.

Applying the technology provided in this embodiment, for all the intersection sequences a recorded in the intersection sequence set A with a large amount of redundant data, use the passable sequence b in the passable sequence set B to filter them, and remove The redundant edge sequence numbers in the intersection sequence a and some intersection sequences a are removed; the representation of traffic restriction information is simplified, and redundant data is reduced.

The device also includes:

A sorting unit, configured to sort each crossing sequence in the intermediate set M of crossing sequences according to a predetermined priority standard;

The priority criteria include: sequence length u or the number of equivalent sequences v; wherein, the sequence length u refers to the number of edge sequence numbers contained in the intersection sequence; the number of equivalent sequences v refers to the number of intersection When an intersecting sequence in the sequence intermediate set M is equivalent to at least one intersecting sequence in the intersecting sequence set, the number of at least one intersecting sequence in the intersecting sequence set; each of the intersecting sequences should be at least Corresponding to a sequence length u and an equivalent sequence number v;

A sequence extraction unit, configured to sort each of the intersecting sequences in the intermediate set M of intersecting sequences according to the number v of the equivalent sequences, v1+v2+...vi=C, where C is a fixed value, i is the serial number of the intersection sequence, and vi represents the number of equivalent sequences of the intersection sequence;

In the intermediary set M of intersecting sequences, select i intersecting sequences as the result output, and the i intersecting sequences satisfy: make the value of i the smallest, and make the sum of the sequence length u of the i intersecting sequences The value is the smallest.

The sequence splitting unit is used to calculate all the subsequences of each intersecting sequence a in the intersecting sequence set A and put them into an intersecting subsequence set A1;

The one intersection sequence a is in the intersection subsequence set A1.

The sequence set splitting unit is used to split the passable sequence set B into two lists, the PassRoads list and the TimePassRoads list; wherein, the PassRoads list stores permanent passable sequences, and the TimePassRoads list stores time-period passable sequences;

Split the traffic limit sequence set A into two lists, the alwaysforbidRoads list and the timelimitRoads list; among them, the alwaysforbidRoads list stores the permanent traffic restriction sequence, and the timelimitRoads list stores the time limit traffic sequence.

Sequence elimination unit, used for sequence a1 in the timelimitRoads list, when

a1 is included in the PassRoads list, remove this a1;

a1 is included in the TimePassRoads list, remove this a1;

For a2 in the timelimitRoads list, when:

a2 is included in the PassRoads list, remove this a2;

a2 is included in the TimePassRoads list, and both of them are in the same time period, so a2 will not be deleted; if the time period is different, a2 will be deleted.

The checking unit is used for traversing each sequence number of each edge number of the sequence in the intermediate set M of the intersection sequence, and judging whether the sequence is an ordered combination of edge numbers from the front side to the back side, and the front side to the back side One side is passable; if it is, the sequence is eliminated, otherwise it is kept.

The present invention is mainly used in navigation electronic maps, and the provided embodiments have the following beneficial effects. The shortest possible sequence of side numbers is used to express traffic restriction information, including permanent traffic prohibition information and time zone traffic restriction information, which simplifies traffic restrictions. The expression of information reduces data redundancy; at the same time, by judging whether the simplified result data destroys the connection relationship in the original directed network graph Map, the quality of the result data is ensured; the above technical means and effects make the map data The generation link solves the technical bottleneck problem when navigating.

It should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention rather than limit them, and all parameter values can be adjusted according to actual conditions, and are within the protection scope of this right. Those skilled in the art should understand that the technical solution of the present invention can be modified or equivalently replaced without departing from the spirit of the technical solution of the present invention, and all of them should be covered by the claims 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.

Images