Method and apparatus for updating map data

By analyzing vehicle driving data, the restriction sign information in the map data was identified and corrected, which solved the problem of untimely updates to height and width restriction information, improved the accuracy and update efficiency of map data, and reduced costs.

CN115080579BActive Publication Date: 2025-11-07BEIJING BAIDU NETCOM SCI & TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202210699654.2
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-06-20
Publication Date
2025-11-07
Estimated Expiration
2042-06-20

Smart Images

  • Figure CN115080579B_ABST
    Figure CN115080579B_ABST
Patent Text Reader

Abstract

The present disclosure provides a method and device for updating map data, relates to the technical field of data processing, and particularly relates to intelligent transportation. The implementation scheme is as follows: determining positions of a plurality of candidate road junctions in map data representing a geographical area, wherein the plurality of candidate road junctions are road junctions including restriction sign information in the map data; obtaining driving data of a plurality of vehicles, wherein the driving data of each vehicle includes a driving track of the vehicle in the geographical area; in response to the driving data of at least part of the vehicles in the plurality of vehicles satisfying a preset condition within a preset distance range of a candidate road junction, determining the candidate road junction as a first target road junction; and performing a correction operation on the restriction sign information at at least one first target road junction.
Need to check novelty before this filing date? Find Prior Art

Description

TECHNICAL FIELD

[0001] The present disclosure relates to the technical field of data processing, in particular to intelligent transportation, and specifically to a method and device for updating map data, an electronic device, a computer readable storage medium and a computer program product. BACKGROUND

[0002] Height limit and width limit are important elements for identifying whether a vehicle can normally pass on a logistics map. Height limit posts are usually set up in urban dense areas or at community entrances, village entrances and under bridges to prevent some high trucks from driving and causing traffic pressure, and to reduce the impact on citizens' travel, etc. Similarly, low-grade roads also have signs to prevent large trucks from entering and crushing the road. The logistics map product uses conventional collection methods to collect the signs set up in the field and make a logistics map. When planning a route for a truck user in advance, such roads are avoided.

[0003] However, with the continuous changes in the real world, height limit and width limit information also change synchronously. For example, with the continuous development and increment of China's railway lines, highways and other high-grade roads, railways are laid on some rural and town roads, elevated roads are added in cities, and ground roads form culverts and overpasses. At the same time, some historical restriction signs no longer exist or are not accurate. If these two types of scenarios are not updated in time, it will have the following effects: the planned route does not match the actual passability, causing the truck to be unable to pass, to turn around, return and find a new route; the truck is planned to avoid the originally passable road, which increases the driving cost and may lead to other accidents on small and broken roads.

[0004] Related technologies collect height limit and width limit information in the field, and collection vehicles cover the city to find new additions, identify signs, and then extract them for professional mapping operations. However, this collection method has limited data and high cost, and cannot cover a large number of newly added railways or low-grade rural roads in a short period of time, so it cannot obtain actual restriction sign information.

[0005] The methods described in this section can not have been previously conceived or made. Unless otherwise indicated, it should not be assumed that any of the methods described in this section require that they be performed in a particular order. Similarly, it should not be assumed that any of the issues identified in this section are known or even addressed in the prior art. SUMMARY

[0006] The present disclosure provides a method and device for updating map data, an electronic device, a computer readable storage medium and a computer program product.

[0007] According to an aspect of the present disclosure, a method for updating map data is provided, including: determining positions of a plurality of candidate road junctions in map data representing a geographic region, wherein the plurality of candidate road junctions are road junctions in the map data including limit sign information; obtaining driving data of a plurality of vehicles, wherein the driving data of each vehicle includes a driving trajectory of the vehicle within the geographic region; determining a first target road junction from the plurality of candidate road junctions in response to driving data of at least some of the plurality of vehicles satisfying a preset condition within a preset distance range of a candidate road junction; and performing a correction operation on the limit sign information at the at least one first target road junction.

[0008] According to another aspect of the present disclosure, an apparatus for updating map data is provided, including: a first determining unit configured to determine positions of a plurality of candidate road junctions in map data representing a geographic region, wherein the plurality of candidate road junctions are road junctions in the map data including limit sign information; an obtaining unit configured to obtain driving data of a plurality of vehicles, wherein the driving data of each vehicle includes a driving trajectory of the vehicle within the geographic region; a second determining unit configured to determine a first target road junction from the plurality of candidate road junctions in response to driving data of at least some of the plurality of vehicles satisfying a preset condition within a preset distance range of a candidate road junction; and a correction unit configured to perform a correction operation on the limit sign information at the at least one first target road junction.

[0009] According to another aspect of the present disclosure, an electronic device is provided, including: at least one processor; and a memory communicatively connected with the at least one processor; wherein the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor to enable the at least one processor to perform the above method.

[0010] According to another aspect of the present disclosure, a non-transitory computer readable storage medium storing computer instructions is also provided, wherein the computer instructions are used to cause a computer to perform the above method.

[0011] According to another aspect of the present disclosure, a computer program product including a computer program is also provided, wherein the computer program, when executed by a processor, implements the above method.

[0012] According to one or more embodiments of the present disclosure, a first target road intersection where the limit sign information is likely to be incorrect can be obtained through analysis of the driving data of a plurality of vehicles, and then a correction operation is performed on the limit sign information of the first target road intersection. The first target road intersection where the limit sign information is likely to be incorrect is determined through the driving data of a plurality of vehicles, which narrows down the range of candidate road intersections whose limit sign information needs to be updated, thereby eliminating the need to update the limit sign information of each road intersection on the map, and greatly reducing the cost of updating the map.

[0013] It should be understood that the matters described in this section are not intended to identify key or essential features of the embodiments of the present disclosure, nor are they used to limit the scope of the present disclosure. Other features of the present disclosure will become apparent from the following description. BRIEF DESCRIPTION OF DRAWINGS

[0014] The accompanying drawings illustrate exemplary embodiments and together with the description, serve to explain exemplary implementations of the embodiments. The illustrated embodiments are not intended to be limiting of the scope of the claims. In all the drawings, like reference numerals refer to like parts throughout the various figures. The drawings are intended to facilitate understanding of examples of the embodiments, however, the embodiments are not limited to the disclosed examples. In the drawings:

[0015] Figure 1 A schematic diagram of an exemplary system in which the various methods described herein can be implemented according to embodiments of the present disclosure is shown;

[0016] Figure 2 A flowchart of a method for updating map data according to embodiments of the present disclosure is shown;

[0017] Figure 3 A flowchart of a method for updating map data according to another embodiment of the present disclosure is shown;

[0018] Figure 4 A scenario diagram illustrating a method of implementing embodiments of the present disclosure is shown;

[0019] Figure 5 A flowchart of a method for determining position information of a plurality of road intersections in map data according to embodiments of the present disclosure is shown;

[0020] Figure 6 A structural block diagram of an apparatus for updating map data according to embodiments of the present disclosure is shown;

[0021] Figure 7 A structural block diagram of an exemplary electronic device that can be used to implement embodiments of the present disclosure is shown. DETAILED DESCRIPTION

[0022] Exemplary embodiments of the present disclosure are described herein below with reference to the accompanying drawings, in which various specific details are set forth to assist in understanding the present disclosure. It will be apparent, however, to one of ordinary skill in the art that various changes and modifications can be made to the embodiments described herein without departing from the scope of the present disclosure. Also, descriptions of well-known functions and constructions are omitted for clarity and conciseness.

[0023] In the present disclosure, the terms "first", "second", and the like are used to describe various elements only for the purpose of distinguishing one element from another, and do not intend to limit the positions, sequence, or importance of the elements. In some examples, a first element and a second element can refer to the same instance of the element, and in some cases, they can refer to different instances of the element based on the context of the description.

[0024] The terms used in the description of various examples in the present disclosure are only for the purpose of describing particular examples and are not intended to be limiting. Unless specifically defined otherwise, an element can be one or more than one, if the number of elements is not specifically limited. Also, the term "and / or" used in the present disclosure encompasses any one of the listed items and all possible combinations of the listed items.

[0025] Embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings.

[0026] Figure 1 A schematic diagram of an example system 100 in which various methods and apparatus described herein can be implemented according to embodiments of the present disclosure is shown. Referring to Figure 1 The system 100 includes one or more client devices 101, 102, 103, 104, 105, and 106, a server 120, and one or more communication networks 110 coupling the one or more client devices to the server 120. The client devices 101, 102, 103, 104, 105, and 106 can be configured to execute one or more application programs.

[0027] In embodiments of the present disclosure, the server 120 can run one or more services or software applications that enable execution of a method for updating map data.

[0028] In certain embodiments, the server 120 can also provide other services or software applications that can include non-virtual environments and virtual environments. In certain embodiments, these services can be provided as web-based services or cloud services, for example, to users of the client devices 101, 102, 103, 104, 105, and / or 106 under a software as a service (SaaS) model.

[0029] InFigure 1 In the illustrated configuration, the server 120 can include one or more components that implement functionality performed by the server 120. These components can include software components that are executable by one or more processors, hardware components, or a combination thereof. Users operating the client devices 101, 102, 103, 104, 105, and / or 106 can in turn utilize one or more client applications to interact with the server 120 to utilize the services provided by these components. It should be understood that various different system configurations are possible, which can differ from the system 100. Thus, Figure 1 is one example of a system for implementing the various methods described herein and is not intended to be limiting.

[0030] The client devices 101, 102, 103, 104, 105, and / or 106 can be used by users to obtain updated map data, or upload relevant data (e.g., vehicle parameters, driving data, etc. mentioned below). The client devices can provide an interface that enables a user of the client device to interact with the client device. The client devices can also output information to the user via the interface. Although Figure 1 Only six client devices are depicted, but one of skill in the art will appreciate that the present disclosure can support any number of client devices.

[0031] The client devices 101, 102, 103, 104, 105, and / or 106 can include various types of computer devices, such as portable handheld devices, general purpose computers (such as personal computers and laptop computers), workstation computers, wearable devices, smart screen devices, self-service kiosk devices, service robots, gaming systems, thin clients, various messaging devices, sensors or other sensing devices, and the like. These computer devices can run various types and versions of software applications and operating systems, such as MICROSOFT Windows, APPLE iOS, UNIX-like operating systems, Linux or Linux-like operating systems (such as GOOGLE Chrome OS); or include various mobile operating systems, such as MICROSOFT Windows Mobile OS, iOS, Windows Phone, Android. Portable handheld devices can include cellular telephones, smartphones, tablet computers, personal digital assistants (PDAs), and the like. Wearable devices can include head-mounted displays (such as smart glasses) and other devices. Gaming systems can include various handheld gaming devices, Internet-enabled gaming devices, and the like. The client devices can be capable of executing various different applications, such as various Internet-related applications, communication applications (such as email applications), short message service (SMS) applications, and can use various communication protocols.

[0032] Network(s) 110 can be any type of network familiar to those skilled in the art that can support data communications using any of a variety of available protocols, including without limitation TCP / IP, SNA, IPX, etc. As an example only, one or more of networks 110 can be a LAN, an Ethernet network, a Token Ring network, a WAN, the Internet, a virtual network, a virtual private network (VPN), an intranet, an extranet, a public switched telephone network (PSTN), an infra-red network, a wireless network (e.g., a Bluetooth network, a WIFI network), and / or any combination of these and / or other networks.

[0033] Server 120 can include one or more general purpose computers, special purpose server computers (e.g., PC (personal computer) servers, UNIX servers, mid-range servers, mainframe computers), server clusters, or any other appropriate arrangement and / or combination. Server 120 can include one or more virtual machines running virtual operating systems, or other computing architectures involving virtualization (e.g., one or more flexible pools of logical storage devices that can be virtualized to maintain virtual storage devices for servers). In various embodiments, server 120 can be adapted to run one or more services or software applications described below.

[0034] Computing units in server 120 can run one or more operating systems, including any of the operating systems described above, as well as any commercially available server operating systems. Server 120 can also be running one or more additional server applications, and / or any of a variety of hosted services, including HTTP servers, FTP servers, CGI servers, JAVA servers, database servers, etc.

[0035] In some embodiments, server 120 can include one or more applications to analyze and consolidate data feeds and / or event updates from users of client devices 101, 102, 103, 104, 105, and / or 106. Server 120 can also include one or more applications to display the data feeds and / or real-time events via one or more display devices of client devices 101, 102, 103, 104, 105, and / or 106.

[0036] In some embodiments, the server 120 can be a server of a distributed system, or a server incorporating a blockchain. The server 120 can also be a cloud server, or an intelligent cloud computing server or intelligent cloud host incorporating artificial intelligence technology. The cloud server is a host product in the cloud computing service system, to solve the defects of large management difficulty and weak business scalability in traditional physical host and virtual private server (VPS, Virtual Private Server) services.

[0037] The system 100 can also include one or more databases 130. In certain embodiments, these databases can be used to store data and other information. For example, one or more of the databases 130 can be used to store information such as audio files and video files. The databases 130 can reside at various locations. For example, databases used by the server 120 can be local to the server 120, or can be remote from the server 120 and can communicate with the server 120 via a network- or private- based connection. The databases 130 can be of different types. In certain embodiments, databases used by the server 120 may, for example, be relational databases. One or more of these databases can store, update, and retrieve data to and from the databases in response to commands.

[0038] In certain embodiments, one or more of the databases 130 can also be used by applications to store application data. Databases used by applications can be databases of different types, such as key-value stores, object stores, or regular stores supported by file systems.

[0039] Figure 1 The system 100 can be configured and operated in various ways to enable the various methods and apparatuses described in accordance with the present disclosure to be applied.

[0040] Figure 2 A schematic diagram of a method 200 for updating map data according to an embodiment of the present disclosure is shown, as Figure 2 The method 200 includes:

[0041] Step 201, determining positions of a plurality of candidate road junctions in map data representing a geographical area, wherein the plurality of candidate road junctions are road junctions in the map data that include information of a restriction sign;

[0042] Step 202, obtaining driving data of a plurality of vehicles, wherein the driving data of each vehicle includes a driving trajectory of the vehicle within the geographical area;

[0043] In step 203, in response to the driving data of at least part of the plurality of vehicles satisfying a preset condition within a preset distance range of a candidate road intersection, the candidate road intersection is determined as a first target road intersection; and

[0044] In step 204, a correction operation is performed on the restriction sign information at the at least one first target road intersection.

[0045] According to the method of the embodiments of the present disclosure, by analyzing the driving data of the plurality of vehicles, the first target road intersection with the possible incorrect restriction sign information is obtained, and then the correction operation is performed on the restriction sign information of the first target road intersection. The first target road intersection with the possible incorrect restriction sign information is determined by the driving data of the plurality of vehicles, which narrows the range of the candidate road intersections that need to update the restriction sign information, so that it is not necessary to update the restriction sign information of each road intersection on the map, and the cost of updating the map is greatly reduced.

[0046] In step 201, the map data can be used to represent a specific geographic area. The above-mentioned map data can be, for example, the map data stored in the navigation App installed on the client device, or the map data downloaded by the client device from the related database 130 via the server 120. The related navigation App will update the map data periodically, for example, it can periodically download the updated map data from the related database 130. The map data generally includes path data of roads, POI (Point of Interest) data, etc., and the POI data records the position information of the related interest points. The plurality of candidate road intersections can be selected from a plurality of road intersections, and the road intersections can be obtained by processing and calculating the path data of the roads, the specific process will be described below, and will not be repeated here. In addition, the map data also includes a plurality of restriction sign information, which represents the width limit sign or height limit sign in the geographic area. The width limit sign or height limit sign is generally set near the intersection of the road, so in the map data, each of the plurality of restriction sign information matches the data information of one of the road intersections in the map.

[0047] In step 202, the driving data of the plurality of vehicles can be obtained from the related navigation App at the end of each vehicle. The navigation App will record the driving data of the vehicle in the actual driving process when the vehicle drives into the geographic area, which includes but is not limited to the driving trajectory, driving speed, driving state, etc. of the vehicle in the geographic area. In this embodiment, the driving data at least includes the driving trajectory of the vehicle in the geographic area.

[0048] In step 203, the preset distance range of the candidate road intersection can be, for example, a range of 20m, 30m or 40m of the candidate road intersection. The above-mentioned preset condition can be, for example, that the driving trajectory of the vehicle appears abnormal, such as turning around, sudden stopping, etc. The satisfaction of these preset conditions means that the driver of the vehicle finds that there is a difference between the limit signs and the expected limit signs when driving near the road intersection, so the candidate road intersection can be a target road intersection that needs to update and correct the limit sign information.

[0049] In step 204, the correction operation can first determine the corrected limit sign information. The corrected limit sign information can be obtained by collecting real scene road images and then analyzing the images, or by further analyzing the trajectories of multiple vehicles and the related parameters of multiple vehicles. In some other embodiments, it can also be obtained through other channels, for example, it can be downloaded from a related database.

[0050] Figure 3 A schematic diagram of a method 300 for updating map data according to another embodiment of the present disclosure is shown, as shown in Figure 3 The method 300 includes:

[0051] Step 301, obtaining map data and position information of multiple limit signs in a geographical area;

[0052] Step 302, determining position information of multiple road intersections in the map data;

[0053] Step 303, for each limit sign of the multiple limit signs, in response to the position of the limit sign matching a position of one road intersection of the multiple road intersections, determining the road intersection as a candidate road intersection;

[0054] Step 304, obtaining driving data of multiple vehicles, wherein the driving data of each vehicle includes a driving trajectory of the vehicle in the geographical area;

[0055] Step 305, in response to the driving trajectory of at least part of the driving data of the multiple vehicles in a preset distance range of one candidate road intersection existing a turn-back, determining the candidate road intersection as a first target road intersection;

[0056] Step 306, obtaining vehicle parameters of the multiple vehicles, wherein the vehicle parameters include a height and / or a width of the vehicle; and

[0057] Step 307, for each of the at least one first target road intersection: determining the revised limit sign information of the first target road intersection according to the vehicle parameters of the at least one target vehicle, wherein the at least one target vehicle is a vehicle whose driving trajectory within a preset distance range of the first target road intersection exists a U-turn;

[0058] Step 308, in response to the driving trajectory of all vehicles in the driving data of the plurality of vehicles within a preset distance range of a candidate road intersection not existing a U-turn, determining the candidate road intersection as a second target road intersection.

[0059] Step 309, performing a deletion operation on the limit sign information corresponding to the at least one second target road intersection.

[0060] For the original map data, it is possible that the plurality of limit signs information is not included, and therefore, the positions of the plurality of limit signs need to be obtained from other channels (for example, a related database) and then matched with the positions of the plurality of road intersections respectively, so as to determine which road intersection each limit sign belongs to.

[0061] In step 301, the map data of the geographical region to be updated and the position information of the plurality of limit signs in the geographical region can be obtained from different databases respectively.

[0062] In step 302, the road intersections formed between the plurality of roads can be determined by analyzing and calculating the overpass or intersection relationship between the plurality of roads in the map data, and then the position information of the road intersections is obtained. The position information of the plurality of limit signs and the position information of the road intersections can be represented in the form of position coordinates, and if the two kinds of position coordinates are represented in different forms in the data, the expression forms of the two kinds of position coordinates can be further unified to facilitate the subsequent matching process of the two.

[0063] In step 303, the matching of the position of the restriction sign and the position of the road intersection can refer to the distance between the two positions being less than a preset distance, which can be, for example, 5 m, 10 m, 15 m, etc. When the distance between a certain restriction sign position and a road intersection position is less than the preset distance, it is determined that the restriction sign and the road intersection are matched. The matched restriction sign information can be stored in the map data together with the position information of the road intersection, becoming part of the map data. Subsequently, the road intersections where there are matched restriction signs are determined as candidate road intersections, which are road intersections that can need to be updated with restriction sign information in the future. The map data is generally separate from the position information of the restriction signs, so the two data need to be fused first in order to determine the first target road intersection in the future.

[0064] In step 304, the plurality of vehicles are vehicles that have actually traveled in the geographical area historically, for example, vehicles that have actually traveled in the day, three days, or a week before the map data is updated, and the above-mentioned travel trajectories are historical data information of these vehicles. These travel trajectories can be obtained, for example, through the navigation App installed on the vehicle end. When the vehicle enters the geographical area and moves in the area, the navigation App can obtain the running trajectory of the vehicle, and upload the running trajectory data of the vehicle to the relevant server 120 or database 130.

[0065] In step 305, the presence of a turnaround in the travel trajectory indicates that the vehicle has a U-turn behavior within a preset distance range of the candidate road intersection, which can prove that the driver of the vehicle has found a width or height limit sign that does not match the original data. Figure 4 A scenario diagram for implementing the method of the embodiment of the present disclosure is shown. As shown in Figure 4 A certain candidate road intersection 403 is formed by the intersection of road 401 and road 402, and road 401 is above road 402, to determine the restriction sign 404 formed in the driving direction of road 402. For example, the driver knows from the navigation App or previous experience that the height limit of the bridge at the candidate road intersection is 4 m, so the driver thinks that the truck he drives, which is 3.5 m high, can pass through the tunnel of the bridge smoothly, but due to construction or other reasons, the height limit of the bridge at the candidate road intersection changes to 3 m, causing the truck to be unable to pass through. At this time, the driver discovers a new restriction sign 5 meters away from the road intersection, and thus performs a U-turn of the vehicle (the travel trajectory of the vehicle is shown by the arrow in the figure), so the travel trajectory of the truck appears to be a turnaround.

[0066] In some embodiments, the determining of the first target road intersection in step 305 can be achieved by other manners, in other words, the preset condition can be other than the condition related to the driving trajectory.

[0067] In some embodiments, the driving data of each vehicle further comprises a planned trajectory of the vehicle in the geographical area, which is planned by the navigation application, and the preset condition is related to the planned trajectory. In response to the driving data of at least some of the plurality of vehicles satisfying the preset condition within the preset distance range of a candidate road intersection, the determining of the candidate road intersection as the first target road intersection further comprises: in response to the driving trajectory of at least some of the plurality of vehicles within the preset distance range of a candidate road intersection being different from the planned trajectory, the determining of the candidate road intersection as the first target road intersection.

[0068] The planned trajectory can be a trajectory of a recommended route before the vehicle actually drives, which is recommended by the navigation application installed in the vehicle. Therefore, the planned trajectory is not the driving trajectory of the vehicle actually driving. It can be understood that when the driver of the vehicle is aware of the existence of a candidate road intersection with a restriction sign different from the restriction sign information recorded in the original map data, he will consciously bypass the candidate road intersection, resulting in the actual driving trajectory of the vehicle being different from the planned trajectory recommended by the navigation application. When the server 120 determines that the two trajectories are different near the candidate road intersection (for example, the recommended planned trajectory passes through the candidate road intersection, while the actual driving trajectory does not pass through the candidate road intersection), the candidate road intersection is determined as the target road intersection for which information correction needs to be performed subsequently.

[0069] By analyzing the difference between the actual driving route of the vehicle and the navigation route, the first target road intersection is determined, so that the determination of the first target road intersection is more accurate, and the candidate road intersection is prevented from being determined as the first target road intersection due to other reasons.

[0070] In some embodiments, the driving data of each vehicle further comprises a driving speed of the vehicle in the geographical area, and the preset condition is related to the driving speed. In response to the driving data of at least some of the plurality of vehicles satisfying the preset condition within the preset distance range of a candidate road intersection, the determining of the candidate road intersection as the first target road intersection further comprises: in response to the driving speed of at least some of the plurality of vehicles within the preset distance range of a candidate road intersection being less than a threshold speed, the determining of the candidate road intersection as the first target road intersection.

[0071] When the driver of the vehicle drives near a certain candidate road intersection, he can not find the restriction sign, but he can find that the tunnel height of the bridge of the candidate road intersection is different from the restriction sign information recorded in the original map data through observation, and he will consciously reduce the speed or even stop, so that the driving speed of the vehicle in the preset distance range of the candidate road intersection is less than the threshold speed, which can be 2 m / s, 1 m / s, 0.5 m / s, etc. When the relevant server 120 determines that the above driving speed is lower than the threshold speed, it is determined that the candidate road intersection is the target road intersection that needs to be corrected in information subsequently.

[0072] In combination with the driving speed of the vehicle, the first target road intersection is determined, so that the determination of the first target road intersection is more accurate.

[0073] It needs to be explained that, although in the process of determining the first target road intersection in the above embodiment, as long as part of the driving data of the plurality of vehicles meets the preset condition, the corresponding candidate road intersection is determined as the first target road intersection, in some other embodiments, in order to improve the updating data accuracy and avoid misidentifying the first target road intersection, it can also be provided that only when a certain proportion (for example: 30%, 50% or 70%) of the driving data of the plurality of vehicles meets the preset condition at the same time, the corresponding candidate road intersection is determined as the first target road intersection.

[0074] In step 306, the vehicle parameters of the plurality of vehicles can still be obtained by the vehicle-side navigation App. Before the vehicle drives, the driver can input the parameters of the vehicle, such as the height and width of the vehicle, into the navigation App, and the navigation App will plan the recommended driving path of the vehicle according to the restriction sign information in the map data and the height and width of the vehicle.

[0075] In step 307, the corrected restriction sign information can be obtained by analyzing the height and width of the vehicle. In some embodiments, the minimum height and / or width existing in the vehicle parameters of at least one target vehicle is determined, and then the minimum height and / or width is determined as the corrected restriction sign information of the candidate road intersection. For example: for a certain first target road intersection, a 5m high and 4m wide truck simultaneously exists U-turn behavior, and a 3m truck directly passes, it is suspected that the height limit at this position is below 4m, then the correction result of the restriction sign information corresponding to the first target road intersection can be determined as 4m.

[0076] Using the height and width parameters of the vehicle itself to determine the corrected restriction sign information avoids manual collection and reduces the cost of updating the map data.

[0077] Similar to the description in step 305, the process of determining the revised restriction sign information in step 307 can also be applied to the case where the form data is a planned driving trajectory or driving speed.

[0078] In some other embodiments, the step 306 and step 307 can also determine the revised restriction sign information in other ways. In some embodiments, an image or laser point cloud of the restriction sign at the at least one first target road intersection can be acquired; and then the image is recognized or the laser point cloud is analyzed to determine the revised restriction sign information at the at least one first target road intersection. The image or laser point cloud of the restriction sign can be acquired by manual collection or obtained through other channels (for example, the database of the relevant map information data collection department). Through image recognition or analysis of laser point cloud, the digital information on the restriction sign can be directly read to directly determine the revised restriction sign information. The image or laser point cloud is used to verify the height limit or width limit information, so as to improve the accuracy of the revised restriction sign information.

[0079] In the step 308 and step 309, at least one second target road intersection can also be additionally determined from the plurality of candidate road intersections. The second target road intersection is a candidate road intersection whose corresponding restriction sign information needs to be deleted. For example: for a second target road intersection, the restriction sign information recorded in the original map data can be 3m, but there is a 5m high truck that successfully passes through the tunnel of the second target road intersection in the navigation map, so the suspected height limit setting at this position has been removed, and the restriction sign information of the second target road intersection recorded in the map data can be deleted.

[0080] Figure 5 A flowchart of a method 500 of determining position information of a plurality of road intersections in map data according to an embodiment of the present disclosure is shown in FIG. 5, which includes the following steps: Figure 5

[0081] Step 501, determining path data of a plurality of highways and a plurality of railways in the map data;

[0082] Step 502, determining a plurality of first intersections between the plurality of highways and a plurality of second intersections between the plurality of highways and the plurality of railways according to the path data; and

[0083] Step 503, determining a set of the plurality of first intersections and the plurality of second intersections as the plurality of road intersections.

[0084] ​In step 501, the road data in the map data includes the route data of multiple highways and multiple railways. This route data includes not only the location information of the highways or railways, but also their elevation information. By comparing the elevation information, it can be determined whether intersecting roads have an interchange relationship. An interchange relationship refers to two roads intersecting, with one road situated on top of the other. Only in this case will a bridge with a tunnel appear, thus generating a restriction sign.

[0085] In step 502, there are two possible scenarios for a restriction sign to appear. One is when multiple highways intersect, and the other is when a highway and a railway intersect. It is understood that in the second scenario, the railway must be above the highway for a restriction sign to appear. Multiple first intersections can be determined by analyzing and calculating the path data of multiple highways, multiple railways, and the height information relationships between them.

[0086] By identifying multiple road intersections based on the above scenarios, we can avoid identifying road intersections that would not normally have restriction signs as candidate road intersections, thereby improving the accuracy of subsequent map data updates.

[0087] According to another aspect of this disclosure, an apparatus for updating map data is also provided. Figure 6 A structural block diagram of an apparatus 600 for updating map data according to an embodiment of the present disclosure is shown. Figure 6 As shown, the device 600 includes: a first determining unit 610 configured to determine the locations of multiple candidate road intersections in map data representing a geographic area, wherein the multiple candidate road intersections are road intersections in the map data that include restriction sign information; an acquiring unit 620 configured to acquire driving data of multiple vehicles, wherein the driving data of each vehicle includes the driving trajectory of the vehicle within the geographic area; a second determining unit 630 configured to determine the candidate road intersection as a first target road intersection in response to at least a portion of the driving data of the multiple vehicles satisfying a preset condition within a preset distance range of a candidate road intersection; and a correction unit 640 configured to perform a correction operation on the restriction sign information at at least one first target road intersection.

[0088] Figure 6 Each unit of the device 600 shown can be connected to a reference. Figure 2 The steps in method 200 correspond to each other, and therefore, the operations, features, and advantages described above for method 200 also apply to apparatus 600 and its constituent units. For the sake of brevity, some operations, features, and advantages will not be repeated here.

[0089] In the technical solutions of the present disclosure, the collection, storage, use, processing, transmission, provision and disclosure of user personal information comply with relevant laws and regulations and do not violate public order and good customs.

[0090] According to embodiments of the present disclosure, an electronic device, a readable storage medium and a computer program product are also provided.

[0091] Reference Figure 7 will now be described with reference to the structure block diagram of the electronic device 700 that can be a server or a client of the present disclosure, which is an example of a hardware device that can be applied to aspects of the present disclosure. The electronic device is intended to represent a variety of forms of digital electronic computing devices such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computing devices. The electronic device can also represent a variety of 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 intended to limit implementations of the present disclosure described and / or claimed in this document.

[0092] As shown in Figure 7 , the electronic device 700 includes a computing unit 701 that can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 702 or a computer program loaded into a random access memory (RAM) 703 from a storage unit 708. In the RAM 703, various programs and data required for the operation of the electronic device 700 can also be stored. The computing unit 701, the ROM 702, and the RAM 703 are connected to each other through a bus 704. An input / output (I / O) interface 705 is also connected to the bus 704.

[0093] A plurality of components in the electronic device 700 are connected to the I / O interface 705, including: an input unit 706, an output unit 707, a storage unit 708, and a communication unit 709. The input unit 706 can be any type of device that can input information to the electronic device 700, and can receive inputted digital or character information, and generate key signal inputs related to user settings and / or function controls of the electronic device, and can include, but is not limited to, a mouse, a keyboard, a touch screen, a track pad, a track ball, a joystick, a microphone, and / or a remote controller. The output unit 707 can be any type of device that can present information, and can include, but is not limited to, a display, a speaker, a video / audio output terminal, a vibrator, and / or a printer. The storage unit 708 can include, but is not limited to, a magnetic disk, an optical disk. The communication unit 709 allows the electronic device 700 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks, and can include, but is not limited to, a modem, a network card, an infrared communication device, a wireless communication transceiver, and / or a chipset, such as a Bluetooth™ device, an 802.11 device, a WiFi device, a WiMax device, a cellular communication device, and / or the like.

[0094] The computing unit 701 can be various general and / or special purpose processing components having processing and computing capabilities. Some examples of the computing unit 701 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various special-purpose artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, a digital signal processor (DSP), and any appropriate processor, controller, microcontroller, etc. The computing unit 701 performs various methods and processes described above, such as the method for updating map data. For example, in some embodiments, the method for updating map data can be implemented as a computer software program that is tangibly embodied in a machine-readable medium, such as the storage unit 708. In some embodiments, part or all of the computer program can be loaded and / or installed onto the electronic device 700 via the ROM 702 and / or the communication unit 709. When the computer program is loaded onto the RAM 703 and executed by the computing unit 701, one or more steps of the method for updating map data described above can be performed. Alternatively, in other embodiments, the computing unit 701 can be configured to perform the method for updating map data by any other appropriate means, such as by means of firmware.

[0095] The various embodiments of the systems and techniques described above can be implemented in digital electronic circuitry, integrated circuitry, a field programmable gate array (FPGA), an application specific integrated circuit (ASIC), a system on a chip (SOC), a complex programmable logic device (CPLD), computer hardware, firmware, software, and / or combinations thereof. These various embodiments can include implementation in one or more computer programs that are executable and / or interpretable on a programmable system including at least one programmable processor, which can be special or general purpose, coupled to receive data and instructions from, and to transmit data and instructions to, a storage system, at least one input device, and at least one output device.

[0096] Program code for carrying out methods of the present disclosure can be written in any combination of one or more programming languages. The program code can be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the program code, when executed by the processor or controller, produces the functions / operations specified in the flowcharts and / or the block diagrams. The program code can be executed entirely on a machine, partially on a machine, partially on a machine as a stand-alone software package, or entirely on a remote machine or server.

[0097] In the context of the present disclosure, a machine-readable medium can be a tangible medium that contains or stores a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium can be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium can include but is not limited to an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of the machine-readable storage medium will include one or more lines of electrical conductors, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or Flash memory), optical fibers, portable compact disc read-only memories (CD-ROMs), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.

[0098] 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 the user and a keyboard and a pointing device (e.g., a mouse or a trackball) by which the user can provide input to the computer. Other kinds of devices can be used to provide for interaction with a user as well; 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 can be received in any form, including acoustic, speech, or tactile input.

[0099] 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 a local area network (LAN), a wide area network (WAN), and the Internet.

[0100] The computer system can 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 is generally established by computer programs running on the respective computers and having a client-server relationship to each other. The servers can be cloud servers, servers of a distributed system, or servers combined with a blockchain.

[0101] It should be understood that the various forms of flow shown above can be re-ordered, added to, or deleted from without departing from the scope of the present disclosure. For example, the steps recited in the present disclosure can be performed in parallel, in series, or in a different order, as long as the desired results of the technology disclosed in the present disclosure are achieved, which is not limited herein.

[0102] While embodiments or examples of this disclosure have been described with reference to the figures, it will be understood that the methods, systems, and devices described above are merely exemplary embodiments or examples, and the scope of the application is not limited to these embodiments or examples. Various elements of the embodiments or examples can be omitted or substituted by equivalents thereof. Furthermore, the steps can be performed in a different order than described in the disclosure. Further, various elements of the embodiments or examples can be combined in various ways. It is important that as technology evolves, many of the elements described herein can be substituted by equivalents which serve the same function.

Claims

1. A method for updating map data, comprising: determining positions of a plurality of candidate road junctions in map data representing a geographical area, wherein the plurality of candidate road junctions are road junctions in the map data that include restriction sign information; obtaining driving data of a plurality of vehicles, wherein the driving data of each vehicle includes a driving trajectory of the vehicle within the geographical area; determining a first target road junction as a candidate road junction in response to driving data of at least some of the plurality of vehicles satisfying a predetermined condition within a predetermined distance range of the candidate road junction; and performing a correction operation on the restriction sign information at at least one first target road junction, wherein the determining positions of a plurality of candidate road junctions in map data representing a geographical area comprises: obtaining the map data and position information of a plurality of restriction signs within the geographical area; determining position information of a plurality of road junctions in the map data, comprising: determining position information and height information of a plurality of highways and a plurality of railways in the map data; determining a plurality of first junctions between the plurality of highways and a plurality of second junctions between the plurality of highways and the plurality of railways according to the position information and the height information, wherein the plurality of first junctions have a flyover relationship between highways and the plurality of second junctions have a flyover relationship with the railways above the highways; and determining a set of the plurality of first junctions and the plurality of second junctions as the plurality of road junctions; for each of the plurality of restriction signs, determining a road junction as a candidate road junction in response to a distance between a position of the restriction sign and a position of the road junction being less than a predetermined interval distance.

2. The method of claim 1, wherein, The determining a first target road junction as a candidate road junction in response to driving data of at least some of the plurality of vehicles satisfying a predetermined condition within a predetermined distance range of the candidate road junction comprises: determining a first target road junction as a candidate road junction in response to a driving trajectory of at least some of the plurality of vehicles within a predetermined distance range of the candidate road junction having a U-turn.

3. The method of claim 1, wherein, The driving data of each vehicle further includes a planned trajectory of the vehicle within the geographical area planned by a navigation application, wherein the determining a first target road junction as a candidate road junction in response to driving data of at least some of the plurality of vehicles satisfying a predetermined condition within a predetermined distance range of the candidate road junction further comprises: determining a first target road junction as a candidate road junction in response to a driving trajectory of at least some of the plurality of vehicles within a predetermined distance range of the candidate road junction being different from a planned trajectory.

4. The method of claim 1, wherein, The travel data of each vehicle further comprises a travel speed of the vehicle within the geographical area, wherein the candidate road intersection is determined as the first target road intersection in response to the travel data of at least part of the vehicles in the plurality of vehicles within a preset distance range of the candidate road intersection satisfying a preset condition, and the determining further comprises: the travel speed of at least part of the vehicles in the plurality of vehicles within a preset distance range of the candidate road intersection is less than a threshold speed, the candidate road intersection is determined as the first target road intersection.

5. The method of any one of claims 1-4, wherein, The modifying the restriction sign information at the at least one first target road intersection comprises: obtaining vehicle parameters of the plurality of vehicles, wherein the vehicle parameters comprise a height and / or a width of the vehicle; and for each of the at least one first target road intersection: determining the modified restriction sign information of the first target road intersection according to vehicle parameters of at least one target vehicle, wherein the at least one target vehicle is a vehicle whose travel trajectory within a preset distance range of the first target road intersection exists a U-turn.

6. The method of claim 5, wherein, The determining the modified restriction sign information of the first target road intersection according to vehicle parameters of at least one target vehicle comprises: determining a minimum height and / or width existing in the vehicle parameters of the at least one target vehicle; and determining the minimum height and / or width as the modified restriction sign information of the candidate road intersection.

7. The method of any one of claims 1-4, wherein, The modifying the restriction sign information at the at least one first target road intersection further comprises: obtaining an image or a laser point cloud of the restriction sign at the at least one first target road intersection; and performing image recognition on the image or analyzing the laser point cloud to determine the modified restriction sign information at the at least one first target road intersection.

8. The method of any one of claims 1-4, further comprising: determining a second target road intersection in response to the travel trajectory of all vehicles in the plurality of vehicles within a preset distance range of the candidate road intersection not existing a U-turn; and deleting the restriction sign information corresponding to the at least one second target road intersection.

9. An apparatus for updating map data, comprising: a first determining unit configured to determine positions of a plurality of candidate road intersections in map data representing a geographical area, wherein the plurality of candidate road intersections are road intersections in the map data comprising restriction sign information; an obtaining unit configured to obtain travel data of a plurality of vehicles, wherein the travel data of each vehicle comprises a travel trajectory of the vehicle within the geographical area; a second determining unit configured to determine a first target road intersection in response to travel data of at least part of the vehicles in the plurality of vehicles within a preset distance range of a candidate road intersection satisfying a preset condition; and a modifying unit configured to modify the restriction sign information at the at least one first target road intersection. The correction unit is configured to perform a correction operation on the restriction sign information at the at least one first target road intersection, The method comprises: obtaining the map data and position information of a plurality of restriction signs in the geographic region; determining position information of a plurality of road intersections in the map data, comprising: determining position information and height information of a plurality of highways and a plurality of railways in the map data; determining a plurality of first intersections between the plurality of highways and a plurality of second intersections between the plurality of highways and the plurality of railways according to the position information and the height information, wherein the plurality of first intersections have a flyover relationship between highways, and the plurality of second intersections have a flyover relationship with the railways above the highways; and determining a set of the plurality of first intersections and the plurality of second intersections as the plurality of road intersections; for each of the plurality of restriction signs, in response to a distance between a position of the restriction sign and a position of one of the plurality of road intersections being less than a preset interval distance, determining the road intersection as a candidate road intersection.

10. An electronic device comprising: at least one processor; and a memory communicatively connected to the at least one processor; wherein the memory stores instructions executable by the at least one processor, the instructions being executed by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-8.

11. A non-transitory computer readable storage medium having stored thereon computer instructions, wherein, The computer instructions are used to enable the computer to perform the method of any one of claims 1-8.

12. A computer program product comprising a computer program, wherein, The computer program, when executed by a processor, implements the method of any one of claims 1-8.

Citation Information

Patent Citations

  • Vehicle navigation path generation method and apparatus, and electronic equipment

    CN113324555A

  • Recognition method and device of redundant traffic restriction information, electronic equipment and medium

    CN114202924A