CN111652434A

CN111652434A - Road network data processing method and device, electronic equipment and computer storage medium

Info

Publication number: CN111652434A
Application number: CN202010493225.0A
Authority: CN
Inventors: 林金柱
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Priority date: 2020-06-02
Filing date: 2020-06-02
Publication date: 2020-09-11
Anticipated expiration: 2040-06-02
Also published as: CN111652434B

Abstract

The application discloses a road network data processing method, a road network data processing device, electronic equipment and a computer storage medium, and relates to the technical field of computers with deep learning. The specific implementation scheme is as follows: acquiring information of at least one road from road network data; acquiring information of nodes with set labels included in the road according to the information of the road; and establishing a topological relation according to the information of the nodes with the set labels included in the road. According to the embodiment of the application, the traffic rule data can be reserved in the topological graph in the process of converting the road network data into the topological graph.

Description

Road network data processing method and device, electronic equipment and computer storage medium

Technical Field

The present application relates to the field of computer technologies, and in particular, to a road network data processing method and apparatus, an electronic device, and a computer storage medium.

Background

With the development of computer technology, people can use maps to navigate and inquire positions anytime and anywhere. When the vehicle is driven to go out, the route can be planned through the map. Traffic regulation data on roads is a factor to consider when using maps for route planning. However, when the initial road network data of the map is used for navigation and route planning, the traffic regulation data on the road may be between two end points of the road, and the traffic regulation data is easily lost.

Disclosure of Invention

The disclosure provides a road network data processing method, a road network data processing device, road network data processing equipment and a storage medium.

According to an aspect of the present disclosure, there is provided a road network data processing method, including:

acquiring information of at least one road from road network data;

acquiring information of nodes with set labels included in a road according to the information of the road;

and establishing a topological relation according to the information of the nodes with the set labels included in the road.

According to another aspect of the present disclosure, there is provided a road network data processing apparatus, including:

the road information acquisition module: the information acquisition module is used for acquiring information of at least one road from road network data;

a node information acquisition module: the method comprises the steps of obtaining information of nodes with set labels included in a road according to the information of the road;

a topological relation establishing module: the method is used for establishing the topological relation according to the information of the nodes with the set labels included in the road.

According to another aspect of the present disclosure, there is provided an electronic device including:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to cause the at least one processor to perform a method provided by any one of the embodiments of the present application.

According to another aspect of the present disclosure, there is provided a non-transitory computer readable storage medium storing computer instructions, wherein the computer instructions are configured to cause a computer to perform the method provided by any one of the embodiments of the present application.

According to the technology of the application, the problem that the data content of the set labels is lost due to the fact that the topological relation is established according to the road network data is solved, the accuracy of the topological relation when the topological relation is used for navigation and path planning is improved, and road calculation is improved.

It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present disclosure, nor do they limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description.

Drawings

The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:

FIG. 1 is a flow chart of a road network data processing method according to a first embodiment of the present application;

FIGS. 2A-2B are road and road topology illustration diagrams according to a second embodiment of the present application;

FIG. 3 is a schematic diagram of a road network data processing method according to a third embodiment of the present application;

FIG. 4 is a schematic diagram of a road network data processing method according to a fourth embodiment of the present application;

FIGS. 5A-5C are schematic views of road treatment according to a fifth embodiment of the present application;

FIG. 6 is a schematic diagram of a road network data processing device according to a sixth embodiment of the present application;

fig. 7 is a schematic diagram of a road network data processing apparatus according to a seventh embodiment of the present application;

FIG. 8 is a schematic diagram of a road network data processing device according to an eighth embodiment of the present application;

fig. 9 is a block diagram of an electronic device for implementing the road network data processing method according to the embodiment of the present application.

Detailed Description

The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

According to the embodiment of the application, when the road network data is converted according to the nodes with the setting labels in the roads, the road network data is firstly divided by the nodes with the setting labels, and then the road topological graph is generated according to the divided road network data, so that the data contained in the setting labels cannot be lost in the road topological graph.

The road network data processing method provided in the embodiment of the present application may be executed by a server or a terminal device.

As shown in fig. 1, a road network data processing method according to a first embodiment of the present application includes:

step 101: and obtaining information of at least one road from the road network data.

In this embodiment, the electronic device on which the road network data processing method operates may acquire information of at least one road in the road network data. The road network data may be road network data for map applications, and the road network data may include distribution, trend, intersection position, traffic rule, etc. of roads in a certain region, such as a country, a city, a cell. The road network data may be used to generate a topological graph, which may use vertices and edges to express links between roads and endpoints of roads.

In this embodiment, the information of the roads in the road network data includes the roads, end points at two ends of the roads, intermediate nodes between the end points at two ends of the roads, and setting labels carried by the nodes of the roads. The intermediate nodes may reflect shape information of the road, e.g., intermediate nodes at turns of the road.

Step 102: and acquiring information of the node with the set label included in the road according to the information of the road.

In this embodiment, the electronic device may acquire information of a node having a set tag included in a road according to information of the road acquired from the road network data.

In this embodiment, the setting tag may include traffic regulation data. Some of the nodes in the road may have traffic regulation data and another part of the nodes may not have traffic regulation data. For example, a node of an intersection position (an end point of a road) has traffic regulation data, and a part of nodes in the middle of the road has traffic regulation data, and the nodes in the middle of the part of the road are shape points of the road having the traffic regulation data. There are also some shape points located in the middle of the road, which do not have traffic regulation data. All the nodes with the setting labels are extracted, and the extracted nodes with the setting labels are used for generating vertexes in the road topological relation, so that all the nodes with the setting labels can be contained in the topological relation.

In this embodiment of the present application, acquiring information of a node having a set tag included in a road may include: the position information of the nodes of the road with traffic regulation data, the traffic regulation to be observed and the like are acquired. For example, the position of an intersection on a certain road in the map is a node a, which may be referred to as an end point, and left-turn and straight-going can be performed at the node a. A node B is arranged at a position, which is not at the intersection, in the middle of the road, the node B can only move straight and can not turn around, and the coordinates of the node B can be obtained.

In the road network data, the set label may include traffic regulation data. The nodes with set labels may include end points of the road and shape points between the end points of the road.

Step 103: and establishing a topological relation according to the information of the nodes with the set labels included in the road.

In this embodiment, the electronic device may establish a topological relation according to information of a node having a setting tag included in a road, and create a topological graph corresponding to the information of the node having the setting tag. The nodes with the set labels correspond to vertexes in the topological graph, and connecting lines between adjacent vertexes are edges in the topological graph and are used for representing roads between the adjacent vertexes.

In this embodiment, according to the node information with the setting label included in the road, the created topology map includes the node with the setting label, and may also include other intermediate nodes without the setting label. And the vertex in the topological relation only retains the coordinate information of the set label and the corresponding node of the vertex in the road network data, and the storage space occupied by the vertex in the electronic equipment is far smaller than that of the road network data.

In the embodiment of the application, the information of the nodes with the setting labels on the roads in the road network data is acquired, and then the road topology map is generated according to the nodes with the setting labels, so that the data included in the setting labels in the initial road network data can be retained in the road topology map. Under the condition that the data included in the setting label is related to map navigation, the accuracy of subsequent navigation and road calculation can be ensured.

In the embodiment of the present application, a topological relation is established according to information of nodes having set labels included in a road, specifically, the nodes may be connected to generate a road between the nodes. In an embodiment of the present application, for example, in the road network data processing method provided in the second embodiment of the present application, the flow steps include step 101, step 102, and step 103 in the road network data processing method shown in fig. 1. In step 103, the topological relation is established according to the information of the node with the setting label included in the road, which may be as shown in fig. 2A and fig. 2B, the node with the setting label is obtained according to the road information in the road network data shown in fig. 2A, and then the topological relation, that is, the topological graph, shown in fig. 2B is established according to the node with the setting label. As shown in fig. 2A, a road 201 includes a node having a setting label and a node not having a setting label, the node having a setting label includes an end point 202 of the road and a shape point 203 of the road having a setting label, and the node not having a setting label includes other shape points on the road except for the shape point 203 having a setting label. In the case where the road does not have other shape points, the adjacent nodes with set labels may be connected in a straight line to form a road topology as shown in fig. 2B, including two

sub-roads

205 and 206. As an example, the road network data processing method provided in the embodiment of the present application may be applied to OSM (open Map) data. The OSM is a world map that can be used by itself under an open licensing agreement. The method and the device can be applied to a scene of path planning by using OSM data. All traffic regulation data of the OSM are point-related, but there are many points having traffic regulation data belonging to the shape points of the road, not the end points, and these points having traffic regulation data are lost when used for route planning. The OSM data processing occupies large space of a memory and a disk, the data loading of one region may occupy more than 300G of the memory, and if the attributes of the shape points are all loaded in order to retain the traffic regulation data, the memory is greatly increased. Therefore, in the embodiment of the present application, for the end points of the sub-links, the setting tags may include traffic rule data, and then the end points of the sub-links of the generated topology map retain attribute information such as the traffic rule data, and the non-end points may retain only coordinate data, thereby saving memory and disk space.

In another embodiment, the road network data processing method includes the steps shown in fig. 1. On the basis, the method further comprises the following steps: and saving the information of the nodes with the set labels included in the road to a first set.

The present embodiment is different from the embodiment shown in fig. 1in that the present embodiment creates a first set according to nodes having setting labels, and adds the nodes having setting labels to the first set, thereby facilitating to directly and quickly take out the nodes from the set and create sub-roads.

In another embodiment, the road network data processing method includes the steps shown in fig. 1. On this basis, step 102 can also be realized by the following steps:

traversing nodes included in the road;

and constructing a sub-road by taking the nodes belonging to the first set as end points. Wherein the attribute information of the sub-link is the same as the attribute information of the link of the sub-link.

Traversing a link may include traversing each node on the link in an order extending from one end point of the link to another end point of the link, starting at the one end point of the link, until traversing to the other end point of the link. If the end points of the road are considered to be provided with the setting labels, the end points included by the road are traversed, and each node on the road can be traversed according to the extending sequence of the road from the node closest to one end point of the road until the node closest to the other end point of the road is traversed. The attribute information of the road may include, but is not limited to: road name, traffic direction, toll settings, etc.

It can be seen that, compared with the embodiment shown in fig. 1, the road network data processing method in this embodiment is a specific implementation manner for establishing a topological relation according to nodes including set labels in roads. As an implementation of the present embodiment, nodes on a road except for end points passing through both ends of the road may be referred to as shape points of the road. The shape points with set labels may be referred to as cross points. The first set may be referred to as a cross-point set. A plurality of sub-links may be constructed using the intersections as endpoints of the sub-links. According to the embodiment of the application, the sub-roads can be constructed by utilizing the nodes with the traffic rule data on the roads, and the traffic rule data is embodied in the topological relation, so that the route planning can be carried out by combining the traffic rule data in the subsequent navigation and route calculation operation, and the accuracy of navigation and route calculation is improved.

In another embodiment, the road network data processing method includes the steps shown in fig. 1. On this basis, step 102 may be implemented by:

traversing nodes included in the road;

and constructing a sub-road by taking the nodes belonging to the first set as end points, wherein the attribute information of the sub-road is the same as the attribute information of the road.

Further, wherein constructing sub-roads with nodes belonging to the first set as end points comprises:

repeating the step of constructing the sub-road for the nodes included in the road until the nodes included in the road are processed;

the step of constructing a sub-road comprises: taking one node belonging to the first set as a starting point, and taking a node which belongs to the first set and is adjacent to the starting point as an end point, and constructing a sub-road; updating the starting point and the ending point with neighboring nodes.

In the present embodiment, for example, if traversing the road a results in the nodes a1, a2, A3, a4, a5, a6, the nodes may be arranged in the order of location. Wherein a1, A3, a5, and a6 have traffic regulation data, and belong to a set of intersections. It is possible to first take a1 as a starting point, neglect it because a2 has no traffic regulation data, and then generate a sub-road a13 from a1 and A3 with A3 as an end point. Then, A3 is updated as the start point, which can be ignored since a4 has no traffic regulation data, and then a5 is used as the end point, and the sub-road a35 is generated from A3 and a 5. Similarly, the start and end points are updated again with a5 and S6, and a sub-link a56 is generated from a5 and a 6. Thus, this road a may generate three sub-roads. The topological relation further includes attribute information of the sub-link, and the attribute information of the sub-link may be the same as the attribute information of the link corresponding thereto.

Compared with the embodiment shown in fig. 1, the embodiment develops a specific implementation manner of establishing a topological relation according to nodes including set tags in a road. And on the basis of how to specifically establish the topological relation, further development reveals how to specifically establish the sub-road. In the above embodiment, each road can obtain one or more sub-roads, and if a certain area has multiple roads, the sub-roads of the roads can form the topological relation of the area, which is helpful for constructing the topological relation.

In another embodiment, the road network data processing method includes the steps shown in fig. 1. On the basis, according to the information of the nodes with the set labels included in the road, a topological relation is established, and the method further comprises the following steps:

storing traffic regulation data of the end points; and

coordinate information of the non-end points is saved.

As an example of the present embodiment, for example, referring to the above-described example, attribute information including coordinate information, traffic regulation data, and the like may be retained for the end points a1, A3, a5, and a6 of the respective sub-links of the link a. For the other non-endpoints A2 and A4, only the coordinate information may be retained. On the basis of the embodiment shown in fig. 1, the present embodiment expands how to establish endpoint information in a topological relation. By the method provided by the embodiment, on the basis of the embodiment shown in fig. 1, the amount of data required to be stored for generating the topological relation is further reduced, and the efficiency of generating the topological relation is improved.

In a third embodiment of the present application, a road network data processing method includes the steps shown in fig. 3:

step 301: and searching nodes with set labels of traffic rule data from the road network data, and storing the nodes as an intersection set.

In this embodiment, for example, all shape points of the road may be obtained by traversing first, including shape points with traffic regulation data (e.g., with intersection attribute) and shape points without intersection attribute. Then, points with traffic rule data are screened from the traversed shape points and stored in the intersection point set.

Step 302: the road is cut from the intersection point to form a plurality of Sub-roads (Sub-links).

In the present embodiment, for example, one road has end points B1, B2, intermediate nodes B3, B4, B5, B6 between end points B1, B2, where B4 and B6 have traffic regulation data. Then B4, B6 are intersections and may be saved into the intersection set. The road is cut for the first time from B4 to obtain a first sub-road B1-B4, then cut for the second time from B6 to obtain a second sub-road B4-B6, and finally, the road section left between B6 and B2 is made to travel for the third sub-road.

In the step 302, a thread pool technique may be introduced to process a plurality of tasks in batch, thereby accelerating the cutting efficiency.

Step 303: and outputting the sub-link of the cut road, wherein the non-end point data of the sub-link only retains the coordinate data, and the end point of the sub-link retains the traffic regulation data. In the data output process, the non-endpoint data only retains the coordinate data and the endpoint retains the complete attribute information in the output data, so that the disk storage space can be reduced, and the space when the data is loaded into the memory can be reduced.

In the fourth embodiment of the present application, the road network data processing method still includes the steps shown in fig. 3. On the basis of fig. 3, as shown in fig. 4, step 302 includes:

step 401: the shape point of each link is traversed. The shape point at one end of a road is taken as a start point (start).

Step 402: if the current shape point belongs to the intersection point, the starting end point and the intersection point are combined to generate a new sub-road (sublink). The properties of Sublink inherit from the current link.

Step 403: filling the shape points of the sub-roads.

Step 404: and updating the starting point and the end point. For example, the end point of the previous step is updated to the start point, and the unprocessed shape point adjacent to the new start point is updated to the end point.

Steps

402, 403 and 404 are then repeated until all shape points of the road have been processed, completing the cutting of the entire road (1 ink).

The road network data processing method provided in the fifth embodiment of the present application may include the flow steps of the road network data processing method in any of the foregoing embodiments. In this embodiment, a specific way of processing a road may be as shown in fig. 5A, where the road includes a plurality of shape points 501, 502, 503, and 504, and traversal is started with the shape point 501 at one end as a start point (start). If the shape point 502 belongs to the intersection set, that is, if the shape point 502 has traffic regulation data, the shape point 502 is taken as the end point (end) of the sub-link, and the start point and the end point are combined to generate a new sub-link. And then continuously traversing the shape point of the road, updating the starting point and the end point and generating a new sub-road. Until all the shape points in the road are traversed.

In this embodiment, the traffic regulation data may specifically include: traffic light information, no-go information, go-ahead information, etc.

A sixth embodiment of the present application provides a road network data processing apparatus, as shown in fig. 6, including:

the road information acquisition module 601: the information acquisition module is used for acquiring information of at least one road from road network data;

the node information obtaining module 602: the method comprises the steps of obtaining information of nodes with set labels included in a road according to the information of the road;

the topological relation establishing module 603: the method is used for establishing the topological relation according to the information of the nodes with the set labels included in the road.

In this embodiment, the specific processing of the road information obtaining module 601, the node information obtaining module 602, and the topological relation establishing module 603 of the road network data processing apparatus may refer to step 101, step 102, and step 103 in the corresponding embodiment of fig. 1.

As an example of the sixth embodiment of the present application, the nodes having setting labels included in the road include an end point and a first intermediate node of the road, and the setting labels of the end point and the first intermediate node include traffic regulation data.

As an example of the sixth embodiment of the present application, the topological relation establishing module 602 is further configured to:

and establishing a topological relation according to the end point of the road and the first intermediate node, wherein the topological relation comprises one or more sub-roads of the road.

As an example of the sixth embodiment of the present application, the node information obtaining module is further configured to:

and saving the information of the nodes with the set labels included in the road to a first set.

A seventh embodiment of the present application provides a road network data processing apparatus, which mainly includes a road information obtaining module 601, a node information obtaining module 602, and a topological relation establishing module 603 shown in fig. 6, where on this basis, as shown in fig. 7, the topological relation establishing module 602 further includes:

node traversal unit 701: the node is used for traversing the nodes included in the road;

sub-road construction unit 702: and the node is used for constructing a sub-road by taking the node belonging to the first set as an end point, wherein the attribute information of the sub-road is the same as the attribute information of the road.

In one embodiment, the sub-link construction unit is further configured to:

The road network data processing apparatus provided in the eighth embodiment of the present application includes a road information obtaining module 601, a node information obtaining module 602, and a topological relation establishing module 603 shown in fig. 6. On this basis, as shown in fig. 8, the topology relation establishing module 603 of the road network data processing apparatus according to this embodiment further includes:

the endpoint unit 801: for saving traffic regulation data for the endpoint; and

non-endpoint unit 802: for saving coordinate information of non-endpoints.

Fig. 9 is a block diagram of an electronic device according to the road network data processing method of the embodiment of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the present application that are described and/or claimed herein.

As shown in fig. 9, the electronic apparatus includes: one or more processors 901, memory 902, and interfaces for connecting the various components, including a high-speed interface and a low-speed interface. The various components are interconnected using different buses and may be mounted on a common motherboard or in other manners as desired. The processor may process instructions for execution within the electronic device, including instructions stored in or on the memory to display graphical information of a GUI on an external input/output apparatus (such as a display device coupled to the interface). In other embodiments, multiple processors and/or multiple buses may be used, along with multiple memories and multiple memories, as desired. Also, multiple electronic devices may be connected, with each device providing portions of the necessary operations (e.g., as a server array, a group of blade servers, or a multi-processor system). Fig. 9 illustrates an example of a processor 901.

Memory 902 is a non-transitory computer readable storage medium as provided herein. The memory stores instructions executable by at least one processor to cause the at least one processor to perform the method for processing road network data provided by the present application. The non-transitory computer readable storage medium of the present application stores computer instructions for causing a computer to perform the method of road network data processing provided herein.

The memory 902, which is a non-transitory computer readable storage medium, can be used to store non-transitory software programs, non-transitory computer executable programs, and modules, such as program instructions/modules corresponding to the method for road network data processing in the embodiment of the present application (for example, the road information acquisition module 601, the node information acquisition module 602, and the topological relation establishment module 603 shown in fig. 6). The processor 901 executes various functional applications of the server and data processing by running non-transitory software programs, instructions and modules stored in the memory 902, that is, implements the method of road network data processing in the above method embodiments.

The memory 902 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required for at least one function; the storage data area may store data created from use of the electronic device for the road network data processing, and the like. Further, the memory 902 may include high speed random access memory, and may also include non-transitory memory, such as at least one magnetic disk storage device, flash memory device, or other non-transitory solid state storage device. In some embodiments, memory 902 may optionally include memory located remotely from processor 901, which may be connected to road network data processing electronics over a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.

The electronic device of the road network data processing method may further include: an input device 903 and an output device 904. The processor 901, the memory 902, the input device 903 and the output device 904 may be connected by a bus or other means, and fig. 9 illustrates the connection by a bus as an example.

The input device 903 may receive input numeric or character information and generate key signal inputs related to user settings and function control of the electronic equipment for road network data processing, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, a pointing stick, one or more mouse buttons, a track ball, a joystick, or other input devices. The output devices 904 may include a display device, auxiliary lighting devices (e.g., LEDs), tactile feedback devices (e.g., vibrating motors), and the like. The display device may include, but is not limited to, a Liquid Crystal Display (LCD), a Light Emitting Diode (LED) display, and a plasma display. In some implementations, the display device can be a touch screen.

Various implementations of the systems and techniques described here can be realized in digital electronic circuitry, integrated circuitry, application specific ASICs (application specific integrated circuits), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

These computer programs (also known as programs, software applications, or code) include machine instructions for a programmable processor, and may be implemented using high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. As used herein, the terms "machine-readable medium" and "computer-readable medium" refer to any computer program product, apparatus, and/or device (e.g., magnetic discs, optical disks, memory, Programmable Logic Devices (PLDs)) used to provide machine instructions and/or data to a programmable processor, including a machine-readable medium that receives machine instructions as a machine-readable signal. The term "machine-readable signal" refers to any signal used to provide machine instructions and/or data to a programmable processor.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), the internet, and blockchain networks.

The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other.

According to the technical scheme of the embodiment of the application, the product can be helped to complete the conversion from the OSM to the four-dimensional data, and a complete road network topological relation is established on the basis of not losing the intersection data. Therefore, under the condition that the data is applied to the driving navigation service, the traffic rule induction broadcasting is accurate, the calculated road recall rate exceeds that of a third-party partner, and the partner is successfully replaced.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.

The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A road network data processing method comprises the following steps:

acquiring information of at least one road from road network data;

acquiring information of nodes with set labels included in the road according to the information of the road;

2. The method of claim 1, further comprising:

3. The method of claim 2, wherein establishing a topological relationship based on information about nodes with set labels included in the road comprises:

traversing nodes included in the road;

4. The method of claim 3, wherein constructing sub-roads using nodes belonging to the first set as end points comprises:

5. The method according to claim 3 or 4, wherein the establishing of the topological relation according to the information of the nodes with the set labels included in the road further comprises:

storing traffic regulation data of the end points; and

coordinate information of the non-end points is saved.

6. A road network data processing apparatus comprising:

a node information acquisition module: the information acquisition module is used for acquiring information of nodes with set labels included in the road according to the information of the road;

a topological relation establishing module: and the method is used for establishing a topological relation according to the information of the nodes with the set labels included in the road.

7. The apparatus of claim 6, wherein the node information obtaining module is further configured to:

8. The apparatus of claim 7, wherein the topological relation establishment module is further configured to:

a node traversing unit: the node is used for traversing the nodes included in the road;

a sub-road construction unit: and the node is used for constructing a sub-road by taking the node belonging to the first set as an end point, wherein the attribute information of the sub-road is the same as the attribute information of the road.

9. The apparatus of claim 6, wherein the sub-link construction unit is further configured to:

10. The apparatus of claim 9, wherein the topological relation establishment module further comprises:

an endpoint unit: for saving traffic regulation data for the endpoint; and

non-endpoint unit: for saving coordinate information of non-endpoints.

11. An electronic device, comprising:

at least one processor; and

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-5.

12. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-5.