Road network updating method and device, electronic equipment and storage medium

Abstract

The embodiment of the invention provides a road network updating method and device, electronic equipment and a storage medium. The road network updating method comprises the following steps: in response to the change of the traffic state of any road represented by traffic characteristic data, acquiring a to-be-updated road vector set of which the traffic state is changed from pre-acquired road network topological characteristics of a target area, and updating the road network according to the to-be-updated road vector set and the changed traffic state, and generating sub-topology features corresponding to the to-be-updated road vector set. The sub-topology features are generated only according to the changed roads, and compared with direct generation of all road network topology features in the target area, the calculation amount is reduced. And replacing a feature corresponding to the sub-topological feature in the road network topological feature with the sub-topological feature, and only updating the sub-topological feature corresponding to the target area. The calculation amount is reduced, the timeliness of the road network is ensured, and the accuracy of execution results of various tasks by using the road network is improved.

Description

Technical Field

[0001] The embodiments of the present application relate to the field of data processing technology, and in particular to a road network updating method, device, electronic device, and storage medium. Background Art

[0002] A road network is a network of roads within a specific area. It is used in tasks such as route planning, distance calculation, and arrival time prediction. The accuracy of the road network plays a crucial role in these tasks.

[0003] In existing technologies, due to factors such as the large volume of road network data and the complexity of its data types, the interval between updates is long. Furthermore, each update requires processing all data in the network, making it impossible to update only the parts with changes. This inability to update the road network in a timely manner during practical applications reduces the accuracy of the results of various tasks using the road network. Summary of the Invention

[0004] To overcome the problems existing in the related art, the embodiments of the present application provide a road network updating method, device, electronic device and storage medium.

[0005] According to a first aspect of an embodiment of the present application, a road network updating method is provided, the method comprising:

[0006] Obtaining traffic characteristic data of at least one road in the target area according to a preset detection cycle;

[0007] In response to a change in the traffic characteristic data, a set of road vectors to be updated corresponding to the changed traffic characteristic data is obtained from the pre-acquired road network topology features; the change in the traffic characteristic data represents the traffic state of any road;

[0008] Generate a sub-topology feature corresponding to the updated road according to the road vector set to be updated and the changed traffic feature data;

[0009] The sub-topology feature corresponding to the road vector set to be updated is used to replace the corresponding sub-topology feature in the road network topology feature to obtain an updated road network topology feature.

[0010] According to a second aspect of an embodiment of the present application, a road network updating device is provided, the device comprising:

[0011] A data acquisition module is used to acquire traffic characteristic data of at least one road in the target area according to a preset detection cycle;

[0012] A module for obtaining data to be updated is configured to obtain, in response to a change in the traffic characteristic data, a set of road vectors to be updated corresponding to the changed traffic characteristic data from pre-acquired road network topology features; a change in the traffic characteristic data represents the traffic status of any road;

[0013] An update feature generation module is used to generate a sub-topology feature corresponding to the updated road according to the road vector set to be updated and the changed traffic feature data;

[0014] The feature updating module is configured to replace the corresponding sub-topology feature in the road network topology feature with the sub-topology feature corresponding to the road vector set to be updated, so as to obtain the updated road network topology feature.

[0015] According to a third aspect of an embodiment of the present application, an electronic device is provided, comprising a memory, a processor, and a computer program stored on the memory and executable on the processor, wherein the computer program is executed by the processor to enable the electronic device to execute the method described in the first aspect.

[0016] According to a fourth aspect of the embodiments of the present application, a computer-readable storage medium is provided, on which a computer program is stored, and the program is executed by a processor to implement the method described in the first aspect.

[0017] According to a fifth aspect of the embodiments of the present application, a computer program product is provided, comprising instructions, which, when executed on a computer, cause the computer to execute the method described in the first aspect.

[0018] The technical solutions provided by the embodiments of the present application may have the following beneficial effects:

[0019] In an embodiment of the present application, road topology features for each region of the road network can be pre-acquired, taking regions within the road network as units. For each region, traffic characteristic data for each road can be periodically detected. In response to a change in the traffic status of any road represented by the traffic characteristic data, indicating a change in the road network within the target region, a set of road vectors to be updated whose traffic status has changed can be obtained from the pre-acquired road network topology features of the target region. Based on the set of road vectors to be updated and the changed traffic status, sub-topology features corresponding to the set of road vectors to be updated are generated. Because sub-topology features are generated based only on the changed roads, the computational effort is reduced compared to directly generating the entire road network topology features within the target region. Furthermore, by replacing the features corresponding to the sub-topology features in the road network topology features with sub-topology features, only the sub-topology features corresponding to the target region can be updated. Thus, using this technical solution, sub-topology features associated with detected roads with changed traffic status are generated. Compared to generating the entire topology features within the target region, this not only reduces the computational effort but also helps ensure the timeliness of the road network, thereby improving the accuracy of the results of various tasks performed using the road network.

[0020] It should be understood that the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the present application. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the embodiments of the present application. It should be understood that for those skilled in the art, other drawings can be obtained based on these drawings without inventive work.

[0022] Figure 1 A schematic diagram of a scenario corresponding to the road network updating method provided in an embodiment of the present application;

[0023] Figure 2 A flowchart of a road network updating method provided in an embodiment of the present application;

[0024] Figure 3A and Figure 3B A schematic diagram of a road network for a road network updating method according to an embodiment of the present application;

[0025] Figure 4 A schematic diagram of a road network updating device provided in an embodiment of the present application;

[0026] Figure 5 This is a schematic diagram of an exemplary structure of an electronic device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0027] The technical solutions of the embodiments of the present application are described below in conjunction with the drawings in the embodiments of the present application.

[0028] The terms used in the following embodiments of the present application are for the purpose of describing specific embodiments and are not intended to limit the technical solutions of the present application. As used in the specification and appended claims of this application, the singular expressions "a," "an," "above," "the," and "this" are intended to include plural expressions as well, unless the context clearly indicates otherwise.

[0029] It should also be understood that although the terms first, second, etc. may be used to describe a certain type of object in the following embodiments, the object should not be limited to these terms. These terms are used to distinguish specific implementation objects of the type of object.

[0030] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in the embodiments of the present application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with the relevant laws, regulations and standards of the relevant countries and regions, and provide corresponding operation entrances for users to choose to authorize or refuse.

[0031] The following is an explanation of the relevant technologies involved in the embodiments of this application.

[0032] Road network: A road system within a certain area is composed of various roads that are interconnected and interwoven into a network. These roads can be highways, urban roads, rural roads, etc., and each road is connected to form a road network. The road network needs to be labeled with the corresponding roads and intersections.

[0033] Vector data: refers to the data of map elements presented in vector format. Vector data can include the geometric features and semantic features of the represented map elements. Geometric features can include features such as the shape, size, curvature and direction of the map element; semantic features can include features such as the color, line type and type of the map element. Vector data can describe the location and shape of geographic features and is suitable for expressing objects with boundaries, such as roads and plots of land. Vector data can be scaled and translated without losing accuracy due to zooming in and out. Vector data supports geospatial analysis, such as buffer analysis, overlay analysis, network analysis, etc., and provides support for decisions such as urban planning and traffic management.

[0034] Topological features: These are geometric or spatial properties that remain unchanged under continuous deformation of a geometric image or space. In this application, topological features represent the left-right relationship between corresponding elements of each road, the direction of extension of the road corresponding to the intersection, and the length of the corresponding road, based on the road network data within the target area.

[0035] The tasks related to instant delivery usually include order management, rider scheduling, route planning, real-time monitoring of user interactions, and data analysis and optimization. For example, order management: responsible for receiving user orders and handling order status changes, such as order acceptance, delivery, completion, etc. Rider scheduling: dispatching riders for delivery based on order requirements, rider location, road conditions and other information. Route planning: accessing the road network in the corresponding area, planning delivery routes for riders, and calculating distances and estimated arrival times. Real-time monitoring: monitoring order delivery status, rider location, changes in road conditions, etc. User interaction: providing a user-side interface to display order status, estimated arrival time and other information, where users can cancel, modify, and perform other operations. Data analysis and optimization: collecting and analyzing delivery data, optimizing route planning algorithms, and improving delivery efficiency and service quality.

[0036] Route planning and distance measurement rely on accurate road networks. In existing technologies, road network data usually includes road information, traffic restrictions, and real-time traffic conditions. These data are used to plan delivery routes for riders and calculate distances and estimated arrival times. These functions are usually implemented on the server side, using algorithms to process road network data and real-time traffic information. However, due to the large amount of road network data and the complexity of data types, the road network update intervals in current related technologies are relatively long. As a result, in actual applications, road network data often cannot reflect the actual conditions of the road in a timely manner, such as temporary congestion and road closures, thereby reducing the accuracy of path planning and distance measurement.

[0037] Under real-time traffic conditions, frequent road network updates place higher demands on server processing power and computing resources. However, existing technologies often struggle to achieve efficient computing and resource utilization while ensuring computational accuracy, resulting in slower service response times and increased operating costs. Faced with emergencies such as temporary road congestion and road closures, static road network data cannot meet application requirements. Existing technologies lack the ability to perceive and adjust in real time and dynamically, and are unable to provide riders or users with the most reasonable path planning capabilities in terms of time and space, affecting user experience and delivery efficiency.

[0038] In view of this, an embodiment of the present application proposes a road network updating method to solve the problem in the prior art that road network data cannot be updated in a timely manner.

[0039] The road network update method provided in the embodiment of the present application can be run on the server corresponding to the instant delivery related tasks. Figure 1The figure shows an application scenario diagram used in an embodiment of the present application, including a client 101 and a server 102. The client is used to run an application corresponding to instant delivery, specifically, a mobile application, a web version of a task page, a desktop application, or a mini-program integrated in other platforms (such as an e-commerce platform, a social platform). Users initiate delivery requests through applications on these devices, such as ordering, shopping, express delivery, etc., and can view information such as order status, delivery person location, and estimated delivery time on the application interface. In addition, the client can also receive notifications such as real-time traffic conditions and order changes pushed by the server.

[0040] The server handles the logic and data management associated with instant delivery tasks. Specifically, the server can be one or more server clusters deployed in the cloud. The server receives delivery requests from clients and intelligently assigns delivery tasks to couriers based on information such as current road network conditions, driver location, and order priority. The server also monitors delivery progress in real time, updates order status, and communicates with clients in real time to ensure users have access to the latest delivery information.

[0041] Regarding road network updates, the server regularly updates and maintains a detailed road network database based on real-time data (such as traffic accidents, road closures, and construction information). This database contains a variety of information, including the road's location, direction, length, traffic conditions, speed limits, and traffic light distribution. It serves as the foundation for delivery route planning and real-time navigation.

[0042] The client sends a delivery request to the server through wireless communication (such as 4G / 5G, Wi-Fi, etc.), including the starting point, end point, product information, user requirements, etc. After receiving the request, the server processes the order, including but not limited to order confirmation, delivery person assignment, route planning, etc., and sends the processing results (such as delivery person information, estimated delivery time, etc.) back to the client. During the delivery process, the server will dynamically adjust the delivery route according to the real-time road conditions and the real-time location of the delivery person, and push updated information on the delivery progress and estimated delivery time to the user through the client. At the same time, the server can also receive real-time feedback from the client (such as user cancellation of order, modification of delivery address, etc.), and perform corresponding order processing and notify the delivery person accordingly.

[0043] In the above operating environment, the embodiment of the present application provides the following Figure 2 Please refer to the road network update method shown in Figure 2 , the road network updating method comprises the following steps:

[0044] In step S201, traffic characteristic data of at least one road in a target area is obtained according to a preset detection cycle.

[0045] For example, the preset detection period is set to one minute in the embodiment of the present application. Specifically, a period of one minute can be determined by those skilled in the art based on actual circumstances. Traffic characteristic data for roads within the corresponding target area is obtained every one minute. The traffic characteristic data can be obtained by obtaining traffic data for each road within the target area, or based on information such as event markers related to road traffic in the target area, such as information on road closures and congestion caused by events such as concerts, exams, marathons, and conferences. The traffic characteristic data can be used as a weight to measure whether a road is congested or the degree of congestion.

[0046] In step S202, in response to a change in the traffic characteristic data, a set of to-be-updated road vectors corresponding to the changed traffic characteristic data is obtained from the pre-acquired road network topology features.

[0047] Among them, changes in traffic characteristic data represent the traffic status of any road.

[0048] For example, if the acquired traffic characteristic data differs from the existing traffic characteristic data or the traffic characteristic data acquired during the previous detection cycle, it indicates that the traffic status of a road in the target area has changed. Specifically, after acquiring the communication characteristic data, features related to the traffic status of the road can be extracted from the traffic characteristic data, such as marking the corresponding road as closed or open. After extracting the relevant features, they are compared with the existing traffic characteristic data or the key features acquired during the previous detection cycle. If a change occurs, it indicates that the road needs to be updated. Failure to update will affect the accuracy of tasks such as path planning and estimated arrival time based on the road network topology features.

[0049] Therefore, it is necessary to obtain the changed road vector set to be updated from the pre-acquired road network topology features, where the pre-acquired road network topology features are the characteristic structures used to characterize the relationships between all roads and the traffic data in the target area, which may specifically include the geometric information of the roads (such as length, width, direction), topological relationships (such as intersections, connection relationships between road sections), etc.

[0050] The location information corresponding to the changed traffic characteristic data can be used to search for roads corresponding to the location information in the road network topology features as roads to be updated, wherein the traffic characteristic data corresponding to the roads to be updated are the road vector sets to be updated.

[0051] In step S203, the updated sub-topological features corresponding to the roads to be updated are generated according to the road vector set to be updated and the changed traffic feature data.

[0052] Exemplarily, after determining the road vector set to be updated, the changed traffic characteristic data is used as the new vector set of the road to be updated, and then the sub-topological features of the road to be updated are generated based on the new vector set of the road to be updated, wherein the road to be updated is part of all roads in the target area, and the corresponding sub-topological features are part of the corresponding road network topological features in the target area. Since the corresponding topological features of all roads in the target area are not regenerated according to the changed traffic characteristic data after the change, but the corresponding sub-topological features are generated according to the changed roads, in comparison, the usage of computing resources is reduced, the efficiency of sub-topological feature generation is improved, and the timeliness of the update of road network topological features is ensured.

[0053] In step S204, the sub-topology feature corresponding to the road vector set to be updated is used to replace the corresponding sub-topology feature in the road network topology feature to obtain an updated road network topology feature.

[0054] For example, after generating the sub-topology features, the generated sub-topology features need to replace the non-updated topology features in the road network topology features, so as to update the road network topology features in the target area. The sub-topology features of the road vector set to be updated are compared with the corresponding sub-topology features in the road network topology feature database to ensure the consistency of the two in terms of spatial position, geometric shape and attribute information. The sub-topology features of the road vector set to be updated are directly replaced with the corresponding positions in the road network topology feature database. Furthermore, detailed information of each replacement can be recorded during the replacement process, including the replacement time, data versions before and after the replacement, etc., to facilitate subsequent data tracing and version management.

[0055] You can verify whether the replaced sub-topology features maintain the original topological relationships, such as whether the connection relationships between roads and the settings of intersections are still correct. Check whether the replaced road network topology feature data is consistent with other related data (such as traffic flow data, road monitoring data, etc.).

[0056] As can be seen, using the embodiments of the present application, the road topology features of each area in the road network can be pre-acquired, taking the areas included in the road network as units. For each area, the traffic characteristic data of each road can be periodically detected. In response to the traffic characteristic data indicating a change in the traffic state of any road, it indicates that the road network in the target area has changed. Then, a set of road vectors to be updated with the changed traffic state can be obtained from the pre-acquired road network topology features of the target area. Based on the set of road vectors to be updated and the changed traffic state, sub-topology features corresponding to the set of road vectors to be updated are generated. Since the sub-topology features are generated only based on the changed roads, the computational complexity is reduced compared to directly generating the entire road network topology features within the target area. Furthermore, by replacing the features corresponding to the sub-topology features in the road network topology features with the sub-topology features, only the sub-topology features corresponding to the target area can be updated. As can be seen, using this technical solution, based on the detected roads with changed traffic state, sub-topology features related to the road are generated. Compared to generating the entire topology features within the target area, not only the computational complexity is reduced, but it also helps ensure the timeliness of the road network, thereby improving the accuracy of the execution results of various tasks using the road network.

[0057] In some embodiments, the traffic characteristic data of each road in the target area can be constructed using a contraction hierarchy (CH) to construct the corresponding road network topology features. The contraction hierarchy algorithm is a path planning technology based on node contraction, which is applied to the fast path planning problem in the road network. The core idea is to build a hierarchical structure by iteratively contracting unimportant nodes in the graph. Contracting a node means removing the node from its adjacent points and connecting the path that originally passed through the node through shortcut edges when necessary. In this way, the complexity of the graph can be greatly reduced and the efficiency of path query can be improved.

[0058] The generation of sub-topological features in S203 in the above step can also be achieved in the following way: replacing the data in the road vector set to be updated with the changed traffic feature data to obtain an updated vector set; constructing the dependency relationship between the intersections in the updated vector set based on the intersection position of any road section corresponding to the updated vector set and the traffic feature data of the road section, wherein the dependency relationship between any two intersections represents the traffic weight from one intersection to another intersection; based on the dependency relationship between the intersections, adding shortcut edges between the intersection passed by the shortest section between any two intersections and the target intersection between any two intersections to generate the sub-topological features corresponding to the updated road to be updated.

[0059] For example, first, the data of the corresponding road in the road vector set to be updated can be replaced based on the changed traffic characteristic data (such as traffic flow, average speed, congestion level, etc.). This step ensures that the data of the road vector set is consistent with the latest traffic characteristics. The location information of all intersections is extracted from the updated road vector set. Based on the traffic characteristic data of the road section (such as travel time, congestion level, etc.), the traffic weight between any two intersections is calculated. The traffic weight can be a comprehensive indicator that reflects the degree of traffic congestion from one intersection to another. Based on the intersection location and traffic weight, the dependency relationship between each intersection is constructed. This dependency relationship can be represented by the edges and weights in a directed weighted graph, where the edges represent the road sections and the weights represent the traffic weights.

[0060] Specifically, the traffic characteristic data of the corresponding road sections of any two adjacent intersections are extracted from the update vector set. These data may include traffic flow, average speed, vehicle queue length, etc. The weight of the road section is calculated based on the extracted traffic characteristic data. The weight calculation can adopt different methods according to actual needs, but it should generally be able to reflect the congestion level of the road section. For example, the inverse of the average speed can be used as part of the weight, because the slower the speed, the higher the congestion level. Specifically, based on the traffic characteristic data of at least one sub-segment, the weight of the corresponding sub-segment is calculated; the average of the weights of each sub-segment is calculated to obtain the weight of the road section.

[0061] For example, Figure 3A As shown in FIG, a schematic diagram of a part of the road network in the target area includes intersection 1, intersection 2, intersection 3, intersection 4 and intersection 5, where the roads between adjacent intersections are road segments. Figure 4 Section 1 between intersection 2 and intersection 5 can be divided into at least one subsection (section 1 is used as an example for this description; this division method can be applied to other sections, not shown in the figure). The weight corresponding to each subsection is calculated separately, and the average of the weights of each subsection is calculated to obtain the weight of the section. To ensure that the weights of different sections are comparable, the calculated weights may need to be standardized. The standardization method can be selected based on the actual situation, such as linear transformation, normalization, etc.

[0062] According to the road connection information in the update vector set, determine which intersections are adjacent. Figure 3B As shown in the figure, it is the dependency relationship between the various road sections related to intersection 2, where intersection 1 and intersection 2, intersection 1 and intersection 3 include corresponding intersections (the content shown by the fence in the figure). Vehicles in sections 1 and 2 pass through intersection 2 and merge into intersection 1, which will generate a dependency relationship on the traffic feature data corresponding to intersection 1. Figure 3A and Figure 3BConstruct a topology map of the intersections and road segments in the map. Draw a directional line segment for each pair of adjacent intersections in the map. This line segment should clearly point from one intersection to the other, indicating the dependency and direction of travel between them. Label the directional line segments with directions, which can be achieved with arrows or other graphical elements. Integrate the data: Integrate the calculated segment weights and the added directional line segments into the update vector set to form a complete initial road network topology.

[0063] The initial road network topology features are all the features corresponding to the updated vector set. The initial road network topology features include various information. In the shortest path calculation and estimated arrival time, etc., it is necessary to search the corresponding road sections in the initial road network topology features. In order to improve the efficiency of searching for road sections, shortcut edges can be added to the initial road network topology features to improve the efficiency of searching for road sections.

[0064] Specifically, the intersections are prioritized using the intersection feature data of each intersection to obtain an ordered intersection set; the intersections in the ordered intersection set are traversed to calculate the shortest path between the first intersection and the second intersection, where the first intersection is any intersection and the second intersection is all intersections sorted after the first intersection; if a road section intersects with a third intersection, a shortcut edge is added between the third intersection and the second intersection, and the weight of the shortcut edge is determined by the weight of the edge from the first intersection to the third intersection and then to the second intersection, and a mapping relationship between the shortcut edge and the first intersection is constructed; after traversing all the intersections in the ordered intersection set, the topological features are obtained.

[0065] When prioritizing intersections, the ranking can be based on characteristics such as traffic flow, road grade, intersection size, out-degree and in-degree, edge quotient, complexity quotient, and hierarchical depth. The out-degree of an intersection refers to the number of other intersections or roads that can be directly reached from the intersection; the in-degree refers to the number of other intersections or roads that can enter the intersection. These two metrics reflect the connectivity and accessibility of an intersection within the transportation network. The edge quotient considers factors such as the land development surrounding the intersection, the density of activities, and the concentration of pedestrian and vehicle traffic, reflecting the intersection's influence and economic value on the surrounding area. The complexity quotient can include factors such as traffic flow, the number of traffic conflict points, traffic organization methods, and signal control complexity. This metric reflects the complexity and management difficulty of an intersection in traffic operations. The intersection network hierarchical depth measures the hierarchical position or importance of an intersection within the transportation network. For example, in a multi-level traffic network, intersections at different levels may have different traffic functions and roles. The relative position and importance of intersections in the network can be evaluated through hierarchical depth measurement.

[0066] The above process of adding shortcut edges is explained with a specific example. Assume there is a directed graph G, which contains 5 nodes (A, B, C, D, E) and several edges, each of which has a weight (representing a cost such as distance or time). The goal is to build a CH graph to quickly query the shortest path between any two points. When shrinking node A, calculate the shortest path between node A and all other unshrinkable nodes (B, C, D, E). Suppose it is found that there are direct edges from A to B and A to C, and the shortest paths from A to D and A to E all pass through B (i.e. ABD and ABE). After A is shrunk, in order to maintain the shortest path information, shortcut edges are added between B and D and between B and E, with weights equal to the total weight of the ABD and ABE paths, respectively. Mark node A as processed and ignore it from the search.

[0067] At this point, the only nodes left in the directed graph are C, D, and E, which have not yet been contracted, and the shortcut edge added by contracting A. Compute the shortest paths between node B and C, D, and E (note that A is now ignored). Assume that a direct edge is found from B to C. The shortest path from B to D still passes through the previously added shortcut (i.e., B-shortcut-D). The shortest path from B to E may pass through C or another shortcut. As needed, add new shortcut edges between C and D, between C and E (if BCE is the shorter path), or between the shortcut and E. Mark node B as processed. Continue contracting the remaining nodes.

[0068] After generating the corresponding sub-topology feature, you need to replace it with the original road network topology feature of the target area. As mentioned above, the structure of the initial road network topology feature of the updated sub-topology feature is identical to that of the corresponding position of the unupdated road network topology feature in the target area, with only the corresponding shortcut edges being different. Therefore, when replacing the corresponding sub-topology feature, you only need to replace the corresponding shortcut edges.

[0069] Specifically, traverse the directed weighted graph corresponding to the road network topology feature corresponding to the target area, and find the intersection (node ​​in the directed weighted graph) corresponding to the position in the self-topology flow feature. This can be achieved by comparing the coordinates of the road vector set with the coordinates of the intersection in the directed weighted graph. For each filtered intersection, find the shortcut edges associated with it, and determine which shortcut edges need to be updated. For example, shortcut edges may be stored as special edges of the graph, or associated with intersections by establishing a mapping relationship. The sub-topology feature contains a directed weighted graph of the updated shortcut edge information. It is necessary to find the corresponding new shortcut edges in the sub-topology feature based on the shortcut edges to be updated. Finally, the queried new shortcut edges are used to replace the old shortcut edges in the road network topology feature. This requires modifying or updating the data structure related to the shortcut edges.

[0070] Because there are associations between intersections in the road network topology features, when selecting at least one intersection corresponding to the road vector set to be updated from the road network topology features of the target area, the selected intersections can be used as a benchmark, and all intersections within a preset range corresponding to the intersection locations can be used as intersections corresponding to the roads to be updated. This avoids the situation where intersections with existing associations are not selected due to changes in traffic characteristics, which in turn causes the generated sub-topology features to fail to reflect the road network characteristics of the physical world. Specifically, a sub-target area corresponding to the location corresponding to the road vector set to be updated is matched in the target area; and intersections within a preset range of the location in the sub-target area are used as at least one intersection corresponding to the road vector set to be updated, where the range corresponding to the preset range is larger than the range of the sub-target area.

[0071] Before acquiring the traffic status characteristics of each road in the target area according to a preset detection cycle, the above embodiment needs to determine whether the update cycle of the target area's road network topology characteristics has arrived. The road network topology characteristics in the target area are those that regenerate corresponding road network topology characteristics based on all data in the area at a fixed period. Therefore, if the update cycle of the target area's road network topology characteristics has arrived, the corresponding road network topology characteristics are regenerated based on all data in the area. If the update cycle of the target area's road network topology characteristics has not arrived, the method described in the above embodiment is used to periodically update and detect whether the traffic characteristic data in the target area has changed.

[0072] The process of generating the corresponding road network topology features based on the data in the target area is the same as the process of generating the sub-topology features in the above embodiment, and will not be repeated here. In addition, in the embodiment of the present application, when generating the road network topology features in the target area, the target area can be divided according to the region or geographical location to obtain the corresponding target area. If the target area initially divided according to the formation region or geographical location is large, and the problem of large amount of data when generating the road network topology features occurs, the target area can be further divided into at least one sub-area within a second preset range, and the sub-road network topology features in the corresponding sub-area are generated respectively in units of sub-areas, and finally the sub-road network topology features in each sub-area are combined to obtain the road network topology features in the target area.

[0073] As can be seen, the embodiments of the present application propose a road network update method. Taking the regions included in the road network as units, the road topology features of each region in the road network can be pre-acquired. For each region, the traffic characteristic data of each road can be periodically detected. In response to a change in the traffic status of any road represented by the traffic characteristic data, indicating that the road network within the target region has changed, a vector set of roads to be updated with the changed traffic status can be obtained from the pre-acquired road network topology features of the target region. Based on the road vector set to be updated and the changed traffic status, sub-topology features corresponding to the road vector set to be updated are generated. Because sub-topology features are generated only based on the changed roads, the computational effort is reduced compared to directly generating the entire road network topology features within the target region. Furthermore, by replacing the features corresponding to the sub-topology features in the road network topology features with the sub-topology features, only the sub-topology features corresponding to the target region can be updated. As can be seen, using this technical solution, sub-topology features associated with detected roads with changed traffic status are generated. Compared to generating the entire topology features within the target region, this not only reduces the computational effort but also helps ensure the timeliness of the road network, thereby improving the accuracy of the results of various tasks performed using the road network.

[0074] The above implementation steps can also implement corresponding functions through software modules. Corresponding to the above road network updating method, the embodiment of the present application can also provide a road network updating device.

[0075] like Figure 4 As shown, a road network updating device is provided, which may include a data acquisition module 41, a data acquisition module 42 for updating, a feature generation module 43 and a feature update module 44. The road network updating device may be used to perform the above Figure 2 operation of part or all of the electronic equipment in the system.

[0076] For example: a data acquisition module 41 is used to acquire the traffic characteristic data of at least one road in the target area according to a preset detection cycle; a data acquisition module 42 is used to acquire a road vector set to be updated corresponding to the changed traffic characteristic data in the pre-acquired road network topology feature in response to a change in the traffic characteristic data; a change in the traffic characteristic data represents the traffic status of any road; a feature generation module 43 is used to generate a sub-topology feature corresponding to the updated road to be updated based on the road vector set to be updated and the changed traffic characteristic data; an update feature module 44 is used to replace the corresponding sub-topology feature in the road network topology feature with the sub-topology feature corresponding to the road vector set to be updated to obtain an updated road network topology feature.

[0077] Optionally, the update feature generation module 43 is specifically used to: replace the data in the road vector set to be updated with the changed traffic feature data to obtain an updated vector set; construct the dependency relationship between the intersections in the updated vector set based on the intersection position of any road section corresponding to the updated vector set and the traffic feature data of the road section, wherein the dependency relationship between any two intersections represents the traffic weight from one intersection to another intersection; according to the dependency relationship between the intersections, add a shortcut edge between the intersection passed by the shortest section between any two intersections and the target intersection of the any two intersections to generate the sub-topological feature corresponding to the updated road to be updated.

[0078] Optionally, the update feature generation module 43 is further specifically used to: calculate the weights of the corresponding sections of any two adjacent intersections based on the update vector set, and the weights are used to characterize the congestion levels of the corresponding sections; add directional line segments of any two adjacent intersections, and the directional line segments characterize the dependency relationship between the two intersections, and the direction of the directional line segments is used to characterize the travel direction of the section between the intersections.

[0079] Optionally, the generating and updating feature module 43 is further configured to: calculate the weight of the corresponding sub-road section according to the traffic feature data of the at least one sub-road section; and calculate the average of the weights of the sub-road sections to obtain the weight of the road section.

[0080] Optionally, the intersection also includes intersection feature data, and the generation and update feature module 43 is specifically used to: use the intersection feature data of each intersection to prioritize the intersections to obtain an ordered intersection set; traverse the intersections in the ordered intersection set to calculate the shortest path between the first intersection and the second intersection, where the first intersection is any intersection and the second intersection is all intersections sorted after the first intersection; if the road section intersects with the third intersection, a shortcut edge is added between the third intersection and the second intersection, and the weight of the shortcut edge is determined by the weight of the edge from the first intersection to the third intersection and then to the second intersection, and a mapping relationship between the shortcut edge and the first intersection is constructed; after traversing all intersections in the ordered intersection set, the topological feature is obtained.

[0081] Optionally, the update feature module 44 is specifically used to screen at least one intersection corresponding to the road vector set to be updated in the road network topology feature; determine the mapping relationship between the at least one intersection and the shortcut edge in the road network topology feature, and the shortcut edge to be updated corresponding to each intersection; query the new shortcut edge corresponding to the shortcut edge to be updated in the sub-topology feature; replace the target shortcut edge with the new shortcut edge to obtain the updated road network topology feature.

[0082] Optionally, the update feature module 44 is further specifically used to match a sub-target area corresponding to the position corresponding to the road vector set to be updated in the target area; and use an intersection within a first preset range of the position in the sub-target area as at least one intersection corresponding to the road vector set to be updated, and the range corresponding to the first preset range is larger than the range of the sub-target area.

[0083] Optionally, before acquiring the data module 41, the device is also used to: detect whether the update time corresponding to the current update cycle has been reached according to the preset update cycle of the road network topology feature; if the preset update time of the road network topology feature has been reached, obtain information on all roads in the target area and regenerate the road network topology feature; if the preset update time of the road network topology feature has not been reached, obtain the traffic feature data of at least one road in the target area according to the preset detection cycle, and the duration of the preset detection cycle is less than the duration of the update cycle.

[0084] Optionally, the device is further used to: divide the target area into multiple sub-areas according to a second preset range; and for any sub-area, generate the road network topology characteristics based on the traffic characteristic data of each road section included in the sub-area.

[0085] As can be seen, the road topology features of each region in the road network can be pre-acquired, using the regions included in the road network as units. For each region, the traffic characteristic data of each road can be periodically detected. In response to a change in the traffic status of any road represented by the traffic characteristic data, indicating a change in the road network within the target region, a set of road vectors to be updated with the changed traffic status can be obtained from the pre-acquired road network topology features of the target region. Based on the set of road vectors to be updated and the changed traffic status, sub-topology features corresponding to the set of road vectors to be updated are generated. Since sub-topology features are generated only based on the changed roads, the computational effort is reduced compared to directly generating the entire road network topology features within the target region. Furthermore, by replacing the features corresponding to the sub-topology features in the road network topology features with sub-topology features, only the sub-topology features corresponding to the target region can be updated. As can be seen, using this technical solution, sub-topology features associated with detected roads with changed traffic status are generated. Compared to generating the entire topology features within the target region, this not only reduces the computational effort but also helps ensure the timeliness of the road network, thereby improving the accuracy of the results of various tasks performed using the road network.

[0086] It is understandable that Figure 4 The division of each module is only a division of logical functions. In actual implementation, the functions of the above modules can be integrated into the hardware entity of the electronic device for implementation.

[0087] Please refer to Figure 5 , Figure 5 An electronic device is provided. The embodiment of the present disclosure also provides an electronic device for executing the above-mentioned road network updating method. Figure 5 , which shows a schematic diagram of an electronic device provided by some embodiments of the present disclosure. Figure 5 As shown, the electronic device includes: a processor 500, a memory 501, a bus 502 and a communication interface 503, wherein the processor 500, the communication interface 503 and the memory 501 are connected via the bus 502; the memory 501 stores a computer program that can be run on the processor 500, and the processor 500 executes the aforementioned Figure 2 A road network updating method is provided by any of the illustrated embodiments.

[0088] The memory 501 may include high-speed random access memory (RAM) and may also include non-volatile memory, such as at least one disk storage. The system network element and at least one other network element are connected via at least one communication interface 503 (which may be wired or wireless), and may use the Internet, a wide area network, a local area network, a metropolitan area network, etc.

[0089] The bus 502 may be an ISA bus, a PCI bus, or an EISA bus. The bus may be divided into an address bus, a data bus, a control bus, etc. The memory 501 is used to store programs. The processor 500 executes the program after receiving the execution instruction. Figure 2 Any of the illustrated embodiments discloses that the road network updating method may be applied to the processor 500 or implemented by the processor 500 .

[0090] The processor 500 may be an integrated circuit chip with signal processing capabilities. During implementation, each step of the above method can be completed by hardware integrated logic circuits or software instructions in the processor 500. The above processor 500 may be a general-purpose processor, including a processor (Central Processing Unit, referred to as CPU), a network processor (Network Processor, NP), etc.; it can also be a digital signal processor (Digital Signal Processor, DSP), an application-specific integrated circuit (Application-Specific Integrated Circuit, ASIC), a field programmable gate array (Field Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The various methods, steps and logic block diagrams disclosed in the embodiments of the present disclosure can be implemented or executed. The general-purpose processor can be a microprocessor or the processor can also be any conventional processor, etc. The steps of the method disclosed in conjunction with the embodiments of the present disclosure can be directly embodied as being executed by a hardware decoding processor, or can be executed by a combination of hardware and software modules in the decoding processor. The software module can be located in a storage medium well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, etc. The storage medium is located in memory 501, and processor 500 reads information in memory 501 and, in conjunction with its hardware, completes the steps of the above method.

[0091] The electronic device provided by the embodiment of the present disclosure and the road network update method provided by the embodiment of the present disclosure are based on the same inventive concept and have the same beneficial effects as the methods adopted, operated or implemented by them.

[0092] A computer-readable storage medium is also provided in an embodiment of the present application. The computer-readable storage medium stores instructions for updating the road network. When the computer-readable storage medium is executed on a computer, the computer executes some or all of the steps in the method described in the above-mentioned embodiment.

[0093] An embodiment of the present application also provides a computer program product including instructions for updating a road network. When the computer program product is run on a computer, the computer executes part or all of the steps in the method described in the aforementioned embodiment.

[0094] Those skilled in the art will clearly understand that, for the convenience and brevity of description, the specific working processes of the systems, devices and units described above can refer to the corresponding processes in the aforementioned method embodiments and will not be repeated here.

[0095] In the several embodiments provided in this application, it should be understood that the disclosed systems, devices and methods can be implemented in other ways. For example, the device embodiments described above are merely schematic. For example, the division of the units is merely a logical function division. In actual implementation, there may be other division methods, such as multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be an indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.

[0096] The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed across multiple network units. Some or all of these units may be selected to achieve the purpose of this embodiment according to actual needs.

[0097] In addition, the functional units in the various embodiments of the present application may be integrated into a single processing unit, or each unit may exist physically separately, or two or more units may be integrated into a single unit. The aforementioned integrated units may be implemented in the form of hardware or software functional units.

[0098] If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present application, or the part that contributes to the prior art, or all or part of the technical solution can be embodied in the form of a software product, which is stored in a storage medium and includes several instructions for enabling a computer device (which can be a personal computer, a smart phone or a network device, etc.) to execute all or part of the steps of the method described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk.

[0099] Although the optional embodiments of the present application have been described, those skilled in the art may make additional changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiment and all changes and modifications that fall within the scope of the present application.

[0100] The specific implementation methods described above further illustrate the purpose, technical solutions and beneficial effects of this application in detail. It should be understood that the above description is only the specific implementation method of this application and is not intended to limit the scope of protection of this application. Any modifications, equivalent replacements, improvements, etc. made on the basis of the technical solutions of this application should be included in the scope of protection of the present invention.

Claims

1. A road network updating method, characterized in that: The method comprises: Obtaining traffic characteristic data of at least one road in the target area according to a preset detection cycle; In response to a change in the traffic characteristic data, a set of road vectors to be updated corresponding to the changed traffic characteristic data is obtained from the pre-acquired road network topology features; the change in the traffic characteristic data represents the traffic state of any road; Generate a sub-topology feature corresponding to the updated road according to the road vector set to be updated and the changed traffic feature data; The sub-topology feature corresponding to the road vector set to be updated is used to replace the corresponding sub-topology feature in the road network topology feature to obtain an updated road network topology feature.

2. The method according to claim 1, characterized in that The step of generating, based on the road vector set to be updated and the changed traffic feature data, a corresponding sub-topology feature of the road to be updated after the update, includes: Replacing the data in the to-be-updated road vector set with the changed traffic characteristic data to obtain an updated vector set; Constructing a dependency relationship between intersections in the update vector set based on the intersection position of any road segment corresponding to the update vector set and the traffic characteristic data of the road segment, wherein the dependency relationship between any two intersections represents the traffic weight from one intersection to another intersection; According to the dependency relationship between the intersections, a shortcut edge is added between an intersection passed by the shortest section between any two intersections and a target intersection among the any two intersections to generate a sub-topological feature corresponding to the updated road.

3. The method according to claim 2, characterized in that The step of constructing a dependency relationship between intersections in the update vector set according to the intersection position of any road section corresponding to the update vector set and the traffic characteristic data of the road section includes: Calculating weights of corresponding road sections of any two adjacent intersections based on the updated vector set, wherein the weights are used to characterize the congestion levels of the corresponding road sections; Add directional line segments of any two adjacent intersections, where the directional line segments represent a dependency relationship between the two intersections, and the directions of the directional line segments are used to represent the travel direction of the road segment between the intersections.

4. The method according to claim 3, characterized in that The updated vector set includes traffic characteristic data of at least one sub-segment included in a road segment between any two adjacent intersections. The weights of the corresponding road segments of any two adjacent intersections are calculated based on the updated vector set, including: Calculating a weight of a corresponding sub-segment according to the traffic characteristic data of the at least one sub-segment; The average of the weights of the sub-segments is calculated to obtain the weight of the segment.

5. The method according to claim 2, characterized in that The intersection also includes intersection feature data, and according to the dependency relationship between the intersections, a shortcut edge is added between the intersection passed by the shortest section between any two intersections and a target intersection among the any two intersections to generate a sub-topological feature corresponding to the updated road, including: Using the intersection feature data of each intersection to prioritize the intersections, a set of ordered intersections is obtained; Traversing the intersections in the ordered intersection set, calculating the shortest path between a first intersection and a second intersection, where the first intersection is any intersection and the second intersection is all intersections sorted after the first intersection; If the road segment intersects the third intersection, a shortcut edge is added between the third intersection and the second intersection. The weight of the shortcut edge is determined by the weight of the edge from the first intersection to the third intersection and then to the second intersection, and a mapping relationship between the shortcut edge and the first intersection is established. After traversing all the intersections in the ordered intersection set, the topological feature is obtained.

6. The method according to claim 5, characterized in that The replacing corresponding sub-topology features in the road network topology features with sub-topology features corresponding to the road vector set to be updated to obtain updated road network topology features includes: Selecting at least one intersection corresponding to the road vector set to be updated from the road network topology features; A mapping relationship between the at least one intersection and the shortcut edge in the road network topology feature, and determining the shortcut edge to be updated corresponding to each intersection; Querying the sub-topology feature for a new shortcut edge corresponding to the shortcut edge to be updated; The target shortcut edge is replaced by the new shortcut edge to obtain an updated road network topology feature.

7. The method according to claim 1, characterized in that Before acquiring the traffic characteristic data of at least one road in the target area according to the preset detection cycle, the method further includes: According to the preset update cycle of the road network topology feature, detecting whether the update time corresponding to the current update cycle has arrived; If the preset update time of the road network topology feature is reached, information of all roads in the target area is obtained and the road network topology feature is regenerated; If the preset update time of the road network topology feature has not been reached, the traffic feature data of at least one road in the target area is obtained according to the preset detection cycle, and the duration of the preset detection cycle is less than the duration of the update cycle.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: The computer program is executed by the processor to enable the electronic device to perform the method according to any one of claims 1 to 7.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: The program is executed by a processor to implement the method according to any one of claims 1 to 7.

10. A computer program product, characterized in that The method comprises instructions, which, when executed on a computer, cause the computer to perform the method according to any one of claims 1 to 7.

Images