Data processing method and device, equipment, medium and program product

By dividing the three-dimensional map at 3 to 5 levels and using memory-mapped database storage, the problem of low loading and querying efficiency in point cloud data in autonomous driving scenarios is solved, and more efficient data processing is achieved.

CN119088889APending Publication Date: 2024-12-06TENCENT TECHNOLOGY (SHENZHEN) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202310661565.3
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2023-06-05
Publication Date
2024-12-06

AI Technical Summary

Technical Problem

The existing two-dimensional map storage method is not suitable for autonomous driving scenarios, especially in terms of point cloud data loading and query efficiency.

Method used

Three-dimensional maps are used to divide 3 to 5 levels, and the raster index and point cloud data are stored in a memory-mapped database to improve query efficiency.

Benefits of technology

It adapts to the point cloud data loading and query needs of autonomous driving scenarios, improving the real-time and efficiency of data processing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119088889A_ABST
    Figure CN119088889A_ABST
Patent Text Reader

Abstract

The invention provides a data processing method and device, equipment, a medium and a program product, and relates to the field of automatic driving, and the method comprises the steps: carrying out the N-level division of a three-dimensional map of a geographic object; wherein N is larger than or equal to 3 and smaller than or equal to 5, N is a positive integer, and the bottommost layer in the N division layers of the three-dimensional map is a grid layer; determining an index of the grid for any one of the grids of the three-dimensional map; and storing the index of the grid and the point cloud data in the grid to a corresponding memory mapping database so as to be suitable for an automatic driving scene.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of the present application relate to the field of autonomous driving, and in particular to a data processing method, device, equipment, medium and program product. Background Art

[0002] The positioning and mapping process in the field of autonomous driving is crucial. The positioning and mapping process is that the user terminal locates the current location coordinates of the vehicle and sends the location coordinates to the corresponding server. The server obtains the point cloud data of the area to which the location coordinates belong from the point cloud data it stores, and returns the obtained point cloud data to the user terminal so that the user terminal can load the point cloud data on the map.

[0003] The current point cloud data storage method is based on a two-dimensional map, which includes dividing the two-dimensional map into 19 layers and storing the regional data on the 19 layers in a MySQL database. However, this method is not suitable for autonomous driving scenarios. Summary of the invention

[0004] The embodiments of the present application provide a data processing method, apparatus, device, medium and program product suitable for autonomous driving scenarios.

[0005] In a first aspect, an embodiment of the present application provides a data processing method, comprising: dividing a three-dimensional map of a geographic object into N levels; wherein 3≤N≤5, and N is a positive integer, and the lowest level of the N division levels of the three-dimensional map is a grid layer; for any grid in each grid of the three-dimensional map, determining the index of the grid; and storing the grid index and the point cloud data in the grid in a corresponding memory-mapped database.

[0006] In the second aspect, an embodiment of the present application provides a data processing device, including: a division module, a determination module and a storage module; the division module is used to divide the three-dimensional map of the geographic object into N levels; wherein, 3≤N≤5, and N is a positive integer, and the lowest level of the N division levels of the three-dimensional map is the grid layer; for any grid in each grid of the three-dimensional map, the determination module is used to determine the index of the grid; the storage module is used to store the index of the grid and the point cloud data in the grid to the corresponding memory-mapped database.

[0007] In a third aspect, an embodiment of the present application provides an electronic device, comprising: a processor and a memory, the memory being used to store a computer program, the processor being used to call and run the computer program stored in the memory, and executing the method in the first aspect or its various implementations.

[0008] In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium for storing a computer program, wherein the computer program enables a computer to execute the method in the first aspect or its various implementations.

[0009] In a fifth aspect, an embodiment of the present application provides a computer program product, comprising computer program instructions, which enable a computer to execute a method as in the first aspect or its various implementations.

[0010] In a sixth aspect, an embodiment of the present application provides a computer program, which enables a computer to execute the method in the first aspect or its various implementations.

[0011] Through the technical solution provided by the embodiment of the present application, since the server divides the three-dimensional map into 3 to 5 layers, the division levels are relatively few, and for the three-dimensional map in the autonomous driving scene, its main purpose is to realize the loading of point cloud data, so as to realize autonomous driving based on the map after loading the point cloud data. In this case, there is no need to divide the three-dimensional map into more layers. Based on this, this division of the three-dimensional map into fewer layers can be adapted to the autonomous driving scene. And because the server stores the index of the grid and the point cloud data in the grid in the memory-mapped database, the memory-mapped database has the characteristics of high query efficiency, and the autonomous driving scene often has high real-time requirements. Based on this, this data storage method is also adapted to the autonomous driving scene. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work.

[0013] Figure 1 Provide a schematic diagram for the division of map areas;

[0014] Figure 2 A schematic diagram of an application scenario provided for an embodiment of the present application;

[0015] Figure 3 A flowchart of a data processing method provided in an embodiment of the present application;

[0016] Figure 4 A schematic diagram of a coordinate system provided for an embodiment of the present application;

[0017] Figure 5 A flowchart of another data processing method provided in an embodiment of the present application;

[0018] Figure 6A schematic diagram of a data processing device 600 provided in an embodiment of the present application;

[0019] Figure 7 It is a schematic block diagram of an electronic device 700 provided in an embodiment of the present application. DETAILED DESCRIPTION

[0020] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present invention.

[0021] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects, and are not necessarily used to describe a specific order or sequence. It should be understood that the data used in this way can be interchangeable where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product, or server that includes a series of steps or units is not necessarily limited to those steps or units clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products, or devices.

[0022] Before introducing the technical solution of this application, the relevant knowledge of the technical solution of this application will be explained below:

[0023] 1. Autonomous driving means that the vehicle can drive itself without the operation of the driver. It is the capability of the vehicle.

[0024] The levels of autonomous driving include:

[0025] Level 0 autonomous driving: unmanned driving. The throttle, brakes, and steering are all controlled by the driver. It is the most common driving method, including cruise control. Only a fixed speed can be set. The vehicle will not automatically adjust the speed, such as acceleration / deceleration or the driver's operation needs.

[0026] Level 1 autonomous driving: driving control is the main focus, with system assistance at appropriate times. The driver still controls the vehicle, but the system will intervene at certain times, such as the Electronic Stability Program (ESP) or the Anti-lock Brake System (ABS), which is mainly used to improve driving safety.

[0027] L2 autonomous driving: Partial automation, the driver still needs to focus on the road conditions. L2 autonomous driving can be said to be the mainstream of major car manufacturers. If L1 autopilot assists the accelerator and brakes, L2 adds it to the steering wheel, and the speed and steering of the vehicle can be controlled under certain conditions.

[0028] Level 3 autonomous driving: conditional automatic control. The system can automatically control the vehicle under most road conditions, and the driver does not need to focus on road conditions.

[0029] Level 4 autonomous driving: highly automated, and also has interfaces such as a steering wheel to provide timely driving control.

[0030] Level 5 autonomous driving: fully automated, humans become complete passengers.

[0031] 2. Universal Transverse Mercator Grid System (UTM) Coordinate System

[0032] 1. Projection band distribution

[0033] (1) Longitude zones: numbered 1-60, with 58 zones spanning 6 degrees from east to west. Figure 1 A schematic diagram of the map area division is shown below: Figure 1 As shown, the map of the earth can be divided into 60 map areas in longitude. In other words, the map of the earth includes 60 longitude bands (ie, longitude zones).

[0034] (2) Latitude zones: numbered CX (excluding I and O, a total of 20 zones), each zone has a north-south span of 8 degrees.

[0035] (3) A, B, Y, and Z cover the Antarctic and Arctic regions.

[0036] (4) N is the first northern latitude. The letters after N are all northern latitudes, and the letters before N are all southern latitudes.

[0037] (5) The starting distribution zone is 180 degrees, from west to east.

[0038] The calculation formula for the longitude band is: longitude band = floor (longitude / 6) + 31, where the floor function means rounding down.

[0039] 2. UTM coordinate representation format

[0040] The general form of UTM coordinates is, for example: 11U 358657mE 5885532mN

[0041] Among them, 11 means it is located in the longitude zone 11;

[0042] U means it is located in the latitude U zone;

[0043] 358657mE means the east position is 358657 meters (meter, m);

[0044] 5885532mN means the north position is 5885532m.

[0045] The UTM easting and northing positions are defined as follows:

[0046] East position: Each longitude zone has a central meridian. For example, if the longitude range of zone 11 is 120W-114W, then its central meridian is 117W. The distance from the point east of the central meridian to the central meridian is positive, and the distance from the point west of the central meridian to the central meridian is negative. The east position of a point is the distance from the point to the central meridian plus 500,000m.

[0047] For example: The east position of a point 8m east of the central meridian is: 500000+8=500008m

[0048] The eastward position of a point 350m west of the central meridian is: 500000-350=499650m

[0049] North position: The north position in the northern hemisphere is the distance from the point to the equator. The north position in the southern hemisphere is 10000000m minus the distance from the point to the equator.

[0050] For example: The north position of a point 34m north of the equator is: 34m

[0051] The south position of a point 34m south of the equator is: 10000000-34=9999966m

[0052] 3. Memory Map Principle: Memory mapping is to map physical memory into the address space of the process, so that these applications can directly use the input and output address space. It can be seen that when using memory-mapped files to process files stored on disk, the application does not need to perform input / output (I / O) operations on the files. This means that when processing files, there is no need to apply for and allocate cache for the files. All file cache operations are directly managed by the system. Since the steps of loading file data into memory, writing data back from memory to file, and releasing memory blocks are eliminated, memory-mapped files can play a very important role in processing files with large amounts of data.

[0053] It should be understood that a database that adopts the memory mapping principle can be called a memory-mapped database.

[0054] 4. Key-value database is a database that stores data in key-value pairs, where each key corresponds to a unique value.

[0055] 5. Lightning Memory-Mapped Database (LMDB) is a high-performance, lightweight key-value database. It is based on memory-mapped files technology and maps data directly to the virtual memory space of the process, thereby reducing the file I / O overhead. LMDB is mainly used in embedded applications, cache systems, and scenarios with high requirements for low latency and high concurrency performance.

[0056] The following is a description of the technical problems to be solved by the embodiments of the present application, as well as the inventive concepts and application scenarios:

[0057] As mentioned above, the point cloud data storage method currently provided is based on a two-dimensional map, including: dividing the two-dimensional map into 19 levels, and storing the regional data on the 19 levels in a MySQL database. However, this method is not suitable for autonomous driving scenarios.

[0058] Among them, the reasons why the currently provided method is not suitable for autonomous driving scenarios include: first, the main purpose of the current two-dimensional map is to achieve visualization. Specifically, the multiple levels of division of the two-dimensional map are conducive to users to view the map data at each level by zooming in and out of the map on the terminal device. However, for the three-dimensional map in the autonomous driving scenario, its main purpose is to realize the loading of point cloud data, so as to realize autonomous driving based on the map after loading the point cloud data. Therefore, in the autonomous driving scenario, there is no need to divide the three-dimensional map into more levels. Secondly, the autonomous driving scenario has high requirements for the query efficiency of point cloud data. If the MySQL database is used for data storage, it cannot meet the requirement of high query efficiency.

[0059] Based on this, an embodiment of the present application proposes to divide the three-dimensional image into N levels, where 3≤N≤5 and N is a positive integer, and store the point cloud data in each grid at the bottom layer of the N division levels in a memory-mapped database.

[0060] For example, Figure 2 A schematic diagram of an application scenario provided in an embodiment of the present application, such as Figure 2 As shown, the user terminal 210 is connected to the server 120, wherein the user terminal 210 may be installed with a client, but is not limited thereto. The user terminal 210 and the server 120 may be directly or indirectly connected via wired or wireless communication, which is not limited in this application.

[0061] In some possible implementations, the user terminal 210 includes but is not limited to a mobile phone, a computer, an intelligent voice interaction device, a smart home appliance, a vehicle-mounted terminal, an aircraft, etc.

[0062] In some possible implementations, server 220 can be an independent physical server, a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDNs), and big data and artificial intelligence platforms.

[0063] It should be understood that Figure 2 The application scenario shown includes a user terminal and a server. In fact, it can include other numbers of user terminals and servers, and this application does not limit this. In addition, Figure 2 This is only an exemplary application scenario of the technical solution of the present application. In fact, the application scenario of the technical solution of the present application may only include a server.

[0064] The technical solution of this application will be described in detail below:

[0065] Figure 3 A flowchart of a data processing method provided in an embodiment of the present application, the method can be applied to a server, the server can be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, CDN, and big data and artificial intelligence platforms. Figure 3 As shown, the method includes:

[0066] S310: Divide the three-dimensional map of the geographic object into N levels; wherein 3≤N≤5, and N is a positive integer, and the lowest level of the N levels of division of the three-dimensional map is a grid layer;

[0067] In some possible implementations, the geographic object may be the earth, the moon, or other geographic objects, which is not limited in the embodiments of the present application.

[0068] In other words, the server can divide the three-dimensional map of the geographic object into 3, 4 or 5 levels.

[0069] In some implementations, the server may divide the three-dimensional map into M1 map areas; respectively divide the M1 map areas into M2 map sub-areas; respectively divide the M2 map sub-areas into M3 tiles; respectively divide the M3 tiles into M4 grids; wherein M1, M2, M3 and M4 are all positive integers greater than 1. In other words, the server may divide the three-dimensional map into M1 map areas; divide each map area into M2 map sub-areas; divide each map sub-area into M3 tiles; and divide each tile into M4 grids.

[0070] For example, suppose the server divides the three-dimensional map of geographic objects into 60 map areas (i.e., 60 longitude bands) according to the UTM coordinate system; and divides each map area into multiple map sub-areas of 10,000 meters * 10,000 meters; and then divides each map sub-area into 10,000 tiles of 100 meters * 100 meters; finally, according to the different positioning accuracy requirements of autonomous driving, the server can divide each tile into a grid of 1 meter * 1 meter * 1 meter, or a grid of 0.5 meters * 0.5 meters * 0.5 meters, or a grid of 0.1 meters * 0.1 meters * 0.1 meters, and so on.

[0071] In some implementations, the server may divide the three-dimensional map into M5 map areas; each of the M5 map areas may be divided into M6 tiles; each of the M6 ​​tiles may be divided into M7 grids; wherein M5, M6, and M7 are all positive integers greater than 1. In other words, the server may divide the three-dimensional map into M5 map areas; each of the map areas may be divided into M6 tiles; and each of the tiles may be divided into M7 grids.

[0072] For example, suppose the server divides the three-dimensional map of geographic objects into 60 map areas (i.e., 60 longitude bands) according to the UTM coordinate system; and divides each map area into 100m*100m tiles; finally, according to the different positioning accuracy requirements of autonomous driving, the server can divide each tile into a grid of 1m*1m*1m, or a grid of 0.5m*0.5m*0.5m, or a grid of 0.1m*0.1m*0.1m, and so on.

[0073] In some implementations, the server may divide the three-dimensional map into M8 map areas; respectively divide the M8 map areas into M9 map sub-areas; respectively divide the M9 map sub-areas into M10 tiles; respectively divide the M10 map sub-areas into M11 sub-tiles; respectively divide the M11 sub-tiles into M12 grids; wherein M8, M9, M10, M11, and M12 are all positive integers greater than 1. In other words, the server may divide the three-dimensional map into M8 map areas; divide each map area into M9 map sub-areas; divide each map sub-area into M10 tiles; divide each tile into M11 sub-tiles; and divide each sub-tile into M12 grids.

[0074] For example, suppose that the server divides the three-dimensional map of geographic objects into 60 map areas (i.e., 60 longitude bands) according to the UTM coordinate system; and divides each map area into multiple map sub-areas of 10,000 meters * 10,000 meters; each map sub-area is then divided into 10,000 tiles of 100 meters * 100 meters, and the tiles are then divided into multiple sub-tiles of 10 meters * 10 meters. Finally, according to the different positioning accuracy requirements of autonomous driving, the server can divide each sub-tile into a grid of 1 meter * 1 meter * 1 meter, or a grid of 0.5 meters * 0.5 meters * 0.5 meters, or a grid of 0.1 meters * 0.1 meters * 0.1 meters, and so on.

[0075] It should be understood that any area located in the (i+1)th division level among the N division levels belongs to a certain area in the (i)th division level, where i=1, 2, ...N.

[0076] It should be understood that in the above examples, when the server performs the map area, map sub-area and tile division, and sub-tile division, it performs hierarchical division on two dimensions in the three-dimensional map, which are the two dimensions represented by the x-axis and the y-axis. Figure 4 As shown, the x-axis points to the east and the y-axis points to the north. When the server performs grid division, it performs hierarchical division on the three dimensions of the three-dimensional map. The three dimensions are represented by the x-axis, the y-axis, and the z-axis, where the z-axis represents the height.

[0077] S320: For any grid among the grids of the three-dimensional map, determine the index of the grid;

[0078] In the embodiment of the present application, the server may determine the index of the grid in any of the following implementable ways, but is not limited thereto:

[0079] In a first implementation mode, S320 may include:

[0080] S320-1A: Use the coordinates of the preset points of the grid as the index of the grid.

[0081] In some implementations, the preset point of the grid is any one of the eight vertices of the grid, for example, it may be the lower left vertex of the grid.

[0082] For example, assuming that the server divides each tile into a 0.5m*0.5m*0.5m grid based on the height dimension, and assuming that the lower left corner vertex of a grid is (50.5, 60.0, 0), the index of the grid may be (50.5, 60.0, 0).

[0083] In a second implementation mode, S320 may include:

[0084] S320-1B: Determine the index of the region to which the grid belongs in the first N-1 division levels and the coordinates of the preset point in the grid;

[0085] In some possible implementations, for any division level other than the first division level among the first N-1 division levels, the index of the area to which the division level belongs can be the index of the area to which the division level belongs within the upper-layer area to which the area belongs, or can be the index of the area to which the upper-layer area belongs. The embodiments of the present application do not impose any restrictions on this.

[0086] For example, suppose the server divides the three-dimensional map of geographic objects into 60 map areas (i.e., 60 longitude zones) according to the UTM coordinate system; and divides each map area into multiple 10,000m*10,000m map sub-areas; and then divides each map sub-area into 10,000 100m*100m tiles. Finally, according to the different positioning accuracy requirements of autonomous driving, the server can divide each tile into a 1m*1m*1m grid, or a 0.5m*0.5m*0.5m grid, or a 0.1m*0.1m*0.1m grid, etc., based on the height dimension. Among them, the first division level is the map area layer, the second division level is the map sub-area layer, the third division level is the tile layer, and the fourth division level is the grid layer. For any tile in the third division level, its index can be the index of the tile in the map sub-region to which the tile belongs, such as tile-1-3. Assuming that the index encoding method of the tile in the map sub-region is: the first dimension after the tile indicates the tile number along the x-axis, and the second dimension indicates the tile number along the y-axis. Based on this, tile-1-3 indicates that the tile is the first tile along the x-axis and the third tile along the y-axis in the map sub-region to which it belongs. Alternatively, for any tile in the third division level, its index can be the index of the tile in the map region to which the tile belongs, such as 7552,25499, where 7552 indicates that the tile is the 7552nd tile along the x-axis and the 25499th tile along the y-axis in the map region to which it belongs.

[0087] In some implementations, the preset point of the grid is any one of the eight vertices of the grid, for example, it may be the lower left vertex of the grid.

[0088] S320-2B: Generate an index of the grid based on the index of the area to which the grid belongs at the first N-1 division levels and the coordinates of the preset points in the grid.

[0089] In the embodiment of the present application, the server may generate the index of the grid in any of the following achievable ways, but is not limited thereto:

[0090] In some implementations, S320-2B may include:

[0091] S320-2B-1A: Combine the index of the area to which the grid belongs at the first N-1 division levels and the coordinates of the preset point in the grid to obtain the index of the grid.

[0092] In an embodiment of the present application, the server may combine the index of the area to which the grid belongs at the first N-1 division levels and the coordinates of the preset points in the grid according to a first preset combination rule, wherein the first preset combination rule may be as follows, but is not limited thereto:

[0093] In some possible implementations, the first preset combination rule is that the index of the area to which the grid belongs in the first N-1 division levels is in front, and the coordinates of the preset point in the grid are in the back, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in order of the division levels from top to bottom.

[0094] For example, the index of a grid is: zone-49-76-254-tile-1-3-60.5-70.0-30.0.

[0095] Among them, zone-49-76-254-tile-1-3 is the index of the zone to which the grid belongs in the first three division levels, zone-49 is the index of the map area to which the grid belongs, 76-254 is the index of the map sub-area to which the grid belongs, tile-1-3 is the index of the tile to which the grid belongs. 60.5-70.0-30.0 are the coordinates of the lower left corner vertex of the grid.

[0096] In some possible implementations, the first preset combination rule is that the coordinates of the preset point in the grid are at the back, and the indexes of the areas to which the grid belongs in the first N-1 division levels are at the back, wherein the indexes of the areas to which the grid belongs in the first N-1 division levels are arranged in order of the division levels from bottom to top.

[0097] For example, a grid might have the index: 60.5-70.0-30.0-tile-1-3-76-254-zone-49.

[0098] Among them, 60.5-70.0-30.0 are the coordinates of the lower left vertex of the grid. tile-1-3-76-254-zone-49 are the indexes of the regions to which the grid belongs in the first three division levels, zone-49 is the index of the map region to which the grid belongs, 76-254 is the index of the map sub-region to which the grid belongs, and tile-1-3 is the index of the tile to which the grid belongs.

[0099] In some possible implementations, the first preset combination rule is that the index of the area to which the grid belongs in the first N-1 division levels is in front, and the coordinates of the preset point in the grid are in the back, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in order of the division levels from bottom to top.

[0100] For example, a grid might have the following index: tile-1-3-76-254-zone-49-60.5-70.0-30.0.

[0101] Among them, tile-1-3-76-254-zone-49 is the index of the area to which the grid belongs in the first three division levels, zone-49 is the index of the map area to which the grid belongs, 76-254 is the index of the map sub-area to which the grid belongs, tile-1-3 is the index of the tile to which the grid belongs. 60.5-70.0-30.0 are the coordinates of the lower left corner vertex of the grid.

[0102] In some possible implementations, the first preset combination rule is that the coordinates of the preset point in the grid are at the back, and the indexes of the areas to which the grid belongs in the first N-1 division levels are at the back, wherein the indexes of the areas to which the grid belongs in the first N-1 division levels are arranged in order of the division levels from top to bottom.

[0103] For example, the index of a raster is: 60.5-70.0-30.0-zone-49-76-254-tile-1-3.

[0104] Among them, 60.5-70.0-30.0 are the coordinates of the lower left vertex of the grid. zone-49-76-254-tile-1-3 are the indexes of the zones to which the grid belongs in the first three division levels, zone-49 is the index of the map zone to which the grid belongs, 76-254 is the index of the map sub-zone to which the grid belongs, and tile-1-3 is the index of the tile to which the grid belongs.

[0105] In some other possible implementations, S320-2B may include:

[0106] S320-2B-1B: Generate an index of the grid based on the index of the area to which the grid belongs in the first N-1 division levels, the coordinates of the preset points in the grid, and the division granularity of the grid.

[0107] In an embodiment of the present application, the server may combine the index of the area to which the grid belongs at the first N-1 division levels, the coordinates of the preset points in the grid, and the division granularity of the grid according to a second preset combination rule, wherein the second preset combination rule may be as follows, but is not limited thereto:

[0108] In some possible implementations, the second preset combination rule is that the index of the area to which the grid belongs in the first N-1 division levels comes first, the division granularity of the grid comes second, and the preset point coordinates in the grid come last, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in order of the division levels from top to bottom.

[0109] For example, the index of a raster is: zone-49-76-254-tile-1-3-0.5m-60.5-70.0-30.0.

[0110] Among them, zone-49-76-254-tile-1-3 is the index of the area to which the grid belongs in the first three division levels, zone-49 is the index of the map area to which the grid belongs, 76-254 is the index of the map sub-area to which the grid belongs, tile-1-3 is the index of the tile to which the grid belongs, 0.5m represents the division granularity of the grid, and 60.5-70.0-30.0 are the coordinates of the lower left corner vertex of the grid.

[0111] In some possible implementations, the second preset combination rule is that the index of the area to which the grid belongs in the first N-1 division levels comes first, the preset point coordinates in the grid come second, and the division granularity of the grid comes last, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in order of the division levels from top to bottom.

[0112] For example, the index of a grid is: zone-49-76-254-tile-1-3-60.5-70.0-30.0-0.5m.

[0113] Among them, zone-49-76-254-tile-1-3 is the index of the area to which the grid belongs in the first three division levels, zone-49 is the index of the map area to which the grid belongs, 76-254 is the index of the map sub-area to which the grid belongs, tile-1-3 is the index of the tile to which the grid belongs, 60.5-70.0-30.0 are the coordinates of the lower left corner vertex of the grid, and 0.5m indicates the division granularity of the grid.

[0114] In some possible implementations, the second preset combination rule is that the coordinates of the preset point in the grid come first, followed by the division granularity of the grid, and the index of the area to which the grid belongs in the first N-1 division levels comes last, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in order of the division levels from top to bottom.

[0115] For example, the index of a raster is: 60.5-70.0-30.0-0.5m-zone-49-76-254-tile-1-3.

[0116] Among them, 60.5-70.0-30.0 are the coordinates of the lower left vertex of the grid, 0.5m represents the division granularity of the grid, zone-49-76-254-tile-1-3 is the index of the area to which the grid belongs in the first three division levels, zone-49 is the index of the map area to which the grid belongs, 76-254 is the index of the map sub-area to which the grid belongs, and tile-1-3 is the index of the tile to which the grid belongs.

[0117] In some possible implementations, the second preset combination rule is that the coordinates of the preset point in the grid come first, the index of the area to which the grid belongs in the first N-1 division levels comes second, and the division granularity of the grid comes last, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in order of the division levels from top to bottom.

[0118] For example, the index of a raster is: 60.5-70.0-30.0-zone-49-76-254-tile-1-3-0.5m.

[0119] Among them, 60.5-70.0-30.0 are the coordinates of the lower left vertex of the grid. zone-49-76-254-tile-1-3 are the indexes of the zones to which the grid belongs in the first three division levels, zone-49 is the index of the map zone to which the grid belongs, 76-254 is the index of the map sub-zone to which the grid belongs, tile-1-3 is the index of the tile to which the grid belongs, and 0.5m indicates the division granularity of the grid.

[0120] In some possible implementations, the second preset combination rule is that the division granularity of the grid comes first, the second preset combination rule is that the preset point coordinates in the grid come second, and the index of the area to which the grid belongs in the first N-1 division levels comes last, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in order of the division levels from top to bottom.

[0121] For example, a raster might have the index: 0.5m-60.5-70.0-30.0-zone-49-76-254-tile-1-3.

[0122] Among them, 0.5m represents the grid division granularity, 60.5-70.0-30.0 is the coordinate of the lower left vertex of the grid. zone-49-76-254-tile-1-3 is the index of the zone to which the grid belongs in the first three division levels, zone-49 is the index of the map area to which the grid belongs, 76-254 is the index of the map sub-area to which the grid belongs, and tile-1-3 is the index of the tile to which the grid belongs.

[0123] In some possible implementations, the second preset combination rule is that the division granularity of the grid comes first, followed by the index of the area to which the grid belongs to the first N-1 division levels, and the second preset combination rule is that the preset point coordinates in the grid come last, wherein the index of the area to which the grid belongs to the first N-1 division levels is arranged in order of the division levels from top to bottom.

[0124] For example, a grid might have an index of: 0.5m-zone-49-76-254-tile-1-3-60.5-70.0-30.0.

[0125] Among them, 0.5m represents the division granularity of the grid, zone-49-76-254-tile-1-3 is the index of the area to which the grid belongs in the first three division levels, zone-49 is the index of the map area to which the grid belongs, 76-254 is the index of the map sub-area to which the grid belongs, tile-1-3 is the index of the tile to which the grid belongs, and 60.5-70.0-30.0 are the coordinates of the lower left vertex of the grid.

[0126] It should be understood that in these possible implementations, the indexes of the regions to which the grid belongs at the first N-1 division levels may also be arranged in order of the division levels from bottom to top.

[0127] S330: Storing the index of the grid and the point cloud data in the grid into a corresponding memory-mapped database.

[0128] In some implementable embodiments, the storage granularity of point cloud data can be map sub-areas, tiles, sub-tiles, grids, etc., which are not limited in the embodiments of the present application. In other words, if the storage granularity of point cloud data is map sub-areas, then each map sub-area corresponds to a memory-mapped database. If the storage granularity of point cloud data is tiles, then each tile corresponds to a memory-mapped database. If the storage granularity of point cloud data is sub-tiles, then each sub-tile corresponds to a memory-mapped database. If the storage granularity of point cloud data is grids, then each grid corresponds to a memory-mapped database.

[0129] In some implementations, if the storage granularity of the point cloud data is a map sub-region, the server may store the index of the grid and the point cloud data in the grid in a memory-mapped database corresponding to the map sub-region to which the grid belongs.

[0130] For example, assuming that the index of a grid is zone-49-76-254-tile-1-3-0.5m-60.5-70.0-30.0, and the map sub-area to which the grid belongs is the map sub-area corresponding to index 76-254, then the server can store the point cloud data in the grid into the memory-mapped database corresponding to the map sub-area.

[0131] In some implementations, if the storage granularity of the point cloud data is a tile, the server may store the index of the grid and the point cloud data in the grid into a memory-mapped database corresponding to the tile to which the grid belongs.

[0132] For example, assuming that the index of a grid is zone-49-76-254-tile-1-3-0.5m-60.5-70.0-30.0, and the tile to which the grid belongs is the tile corresponding to the index tile-1-3, then the server can store the point cloud data in the grid into the memory-mapped database corresponding to the tile.

[0133] In some implementations, if the storage granularity of the point cloud data is a sub-tile, the server may store the index of the grid and the point cloud data within the grid in a memory-mapped database corresponding to the sub-tile to which the grid belongs.

[0134] For example, assuming that the index of a grid is zone-49-76-254-tile1-1-3-tile2-1-1-0.5m-60.5-70.0-30.0, and the sub-tile to which the grid belongs is the sub-tile corresponding to the index tile2-1-1, then the server can store the point cloud data in the grid into the memory-mapped database corresponding to the sub-tile.

[0135] In some implementations, if the storage granularity of the point cloud data is a grid, the server may store the index of the grid and the point cloud data in the grid into a memory-mapped database corresponding to the grid.

[0136] In some implementations, the memory-mapped database may be a LMDB database, but is not limited thereto.

[0137] It should be understood that the LMDB database is a key-value database, so the server can use the index of the grid as the key and store the point cloud data in the grid as the value in a memory-mapped database.

[0138] For example, assuming that the index of a grid is zone-49-76-254-tile-1-3-0.5m-60.5-70.0-30.0, the point cloud data in the grid can be stored as follows: zone-49-76-254-tile-1-3-0.5m-60.5-70.0-30.0: point cloud data in the grid.

[0139] It should be understood that a point cloud is a set of discrete points that are irregularly distributed in space and express the spatial structure and surface properties of a three-dimensional object or scene. A point cloud refers to the geometry of a large number of three-dimensional points. Each point in the point cloud has at least three-dimensional position information. Depending on the application scenario, it may also have additional attributes such as color, material or other information such as reflectivity. Usually, each point in a point cloud has the same number of additional attributes. For example, a point cloud obtained according to the principle of laser measurement includes three-dimensional coordinates (XYZ) and laser reflection intensity (reflectance); a point cloud obtained according to the principle of photogrammetry includes three-dimensional coordinates (XYZ) and color information (RGB, red, green and blue); a point cloud obtained by combining the principles of laser measurement and photogrammetry includes three-dimensional coordinates (XYZ), laser reflection intensity (reflectance) and color information (RGB).

[0140] Based on this, point cloud data may include, but is not limited to: each point in the point cloud has at least three-dimensional position information and, depending on the application scenario, may also have additional attributes such as color, material or other information such as reflectivity.

[0141] For example, if a point cloud is obtained based on the laser measurement principle in an autonomous driving scenario, the point cloud data may include: the three-dimensional coordinates (XYZ) of the point and the laser reflection intensity (reflectance).

[0142] For example, if a point cloud is obtained based on the principle of photogrammetry in an autonomous driving scenario, the point cloud data may include: the three-dimensional coordinates (XYZ) and color information (RGB, red, green, and blue) of the point.

[0143] For example, if a point cloud is obtained by combining laser measurement and photogrammetry principles in an autonomous driving scenario, the point cloud data may include: the three-dimensional coordinates of the point (XYZ), laser reflection intensity (reflectance), and color information (RGB).

[0144] It should be understood that in the embodiments of the present application, point cloud data is also referred to as point cloud feature data.

[0145] In an embodiment of the present application, the server can divide the three-dimensional map of the geographic object into N levels; wherein 3≤N≤5, and N is a positive integer, and the lowest level of the N division levels of the three-dimensional map is the grid layer; for any grid in each grid of the three-dimensional map, determine the index of the grid; and store the index of the grid and the point cloud data in the grid in the corresponding memory-mapped database. On the one hand, since the server divides the three-dimensional map into 3 to 5 levels, the division levels are relatively small, and for the three-dimensional map in the autonomous driving scene, its main purpose is to realize the loading of point cloud data, so as to realize autonomous driving based on the map after loading the point cloud data. In this case, there is no need to divide the three-dimensional map into more levels. Based on this, this division of the three-dimensional map into fewer levels can be adapted to the autonomous driving scene. On the other hand, since the server stores the index of the grid and the point cloud data in the grid in the memory-mapped database, the memory-mapped database has the characteristics of high query efficiency, and the autonomous driving scene often has high real-time requirements. Based on this, this data storage method is also adapted to the autonomous driving scene.

[0146] Figure 5 A flowchart of another data processing method provided in an embodiment of the present application, such as Figure 5 As shown, after S330, the data processing method further includes:

[0147] S340: Obtain a query request; wherein the query request includes coordinates to be queried;

[0148] In some implementations, the server obtains the query request from the user terminal.

[0149] In some possible implementations, the user terminal may locate the coordinates of the current location of the vehicle, and send the coordinates of the location as coordinates to be queried in a query request to the server.

[0150] In some possible implementations, the user terminal may locate the vehicle in real time, and when the location coordinates of the vehicle change, the user terminal may send a query request to the server.

[0151] In other possible implementations, the user terminal may periodically locate the vehicle, and when the location coordinates of the vehicle change, the user terminal may send a query request to the server. The positioning period of the user terminal may be 2 seconds, 3 seconds, etc., which is not limited in the present embodiment.

[0152] S350: Determine the grid to which the coordinates to be queried belong and the corresponding memory mapping database;

[0153] In some implementations, the coordinate to be queried may be a three-dimensional coordinate, wherein two of the coordinates may be longitude and latitude coordinates, and the other coordinate may be an altitude coordinate; or, wherein the two-dimensional coordinate may be a UTM coordinate, and the other coordinate may be an altitude coordinate. In other words, the coordinate to be queried includes longitude and latitude coordinates and altitude coordinates, or, the coordinate to be queried includes UTM coordinates and altitude coordinates.

[0154] It should be understood that the server determining the grid to which the to-be-queried coordinates belong may also be understood as determining the index of the grid to which the to-be-queried coordinates belong.

[0155] In some implementations, if the coordinates to be queried include longitude and latitude coordinates, the longitude and latitude coordinates are converted into UTM coordinates to obtain the converted coordinates corresponding to the coordinates to be queried, and the grid to which the converted coordinates belong is determined. For example, the original coordinates of point A are: (longitude and latitude coordinates, altitude coordinates), and the converted coordinates of point A are: (UTM coordinates, altitude coordinates).

[0156] It should be understood that the conversion method of longitude and latitude coordinates to UTM coordinates will not be described in detail in the embodiments of the present application.

[0157] Based on this, the following takes the case where the coordinates to be queried are: (UTM coordinates, height coordinates) as an example to illustrate the method of determining the grid to which the coordinates to be queried belong:

[0158] As described above, in some implementations, the server may use the preset point coordinates of the grid as the index of the grid. In this case, the server may determine the grid to which the coordinate to be queried belongs based on the relationship between the coordinate to be queried and the preset point coordinates of each grid.

[0159] For example, suppose the coordinates to be queried are (11U 755248.91mE 2549995.93mN 37.0m), where 11U755248.91mE2549995.93mN is the UTM coordinate, 11 indicates that it is located in the longitude zone 11; U indicates that it is located in the latitude zone U; 755248.91mE indicates that the east position is 755248.91m; 2549995.93mN indicates that the north position is 2549995.93m, and 37.0 is the altitude coordinate. Assuming that the grid division granularity is 0.5 meters, and the preset point of each grid is the lower left corner point of the grid, it can be seen that the grid to which the coordinates to be queried belong is the grid with the preset point coordinates of (755248.5, 2549995.5, 37.0).

[0160] As described above, in some implementable methods, the server may combine the index of the area to which the grid belongs in the first N-1 division levels and the coordinates of the preset points in the grid to generate the index of the grid. In this case, the server may determine the grid to which the coordinate to be queried belongs based on the relationship between the coordinate to be queried, the division granularity of each of the first N-1 division levels, and the coordinate to be queried and the coordinates of the preset points of each grid. Among them, for any other division level except the first division level in the first N-1 division levels, the index of the area to which the division level belongs may be the index within the area of ​​the previous level to which the area belongs.

[0161] For example, suppose the coordinates to be queried are (11U 755248.91mE 2549995.93mN 37.0m), where 11U755248.91mE2549995.93mN is the UTM coordinate, 11 indicates that it is located in the longitude zone 11; U indicates that it is located in the latitude zone U; 755248.91mE indicates that the east position is 755248.91m; 2549995.93mN indicates that the north position is 2549995.93m, and 37.0 is the altitude coordinate. Assume that the server divides the three-dimensional map of geographic objects into 60 map areas (i.e., 60 longitude bands) according to the UTM coordinate system; and divides each map area into multiple 10,000m*10,000m map sub-areas; and then divides each map sub-area into 10,000 tiles of 100m*100m; finally, according to the different positioning accuracy requirements of autonomous driving, the server can divide each tile into a 0.5m*0.5m*0.5m grid based on the height dimension. Then the server can first determine that the index of the map area where the coordinates to be queried are located is zone-11; then calculate 755248.91 / 10000=75.524891, round it down to get 75, and calculate 2549995.93 / 10000=254.999593, round it down to get 254. Based on this, it can be determined that the index of the map sub-area where the coordinates to be queried are located is 75-254; then calculate 755248.91 / 100=7552.4891, Round it down to 7552, and calculate 2549995.93 / 100=25499.9593, round it down to 25499. Based on this, it can be determined that the index of the tile where the coordinate to be queried is located is 7552-25499; finally, assuming that the grid division granularity is 0.5 meters, and the preset point of each grid is the lower left corner of the grid, it can be seen that the grid to which the coordinate to be queried belongs is the grid with the preset point coordinates of (755248.5, 2549995.5, 37.0). Based on this, the server can combine the index of the area to which the coordinate to be queried belongs in the first N-1 division levels and the preset point coordinates in the grid to which the coordinate to be queried belongs according to the first preset combination rule to obtain the index of the grid to which the coordinate to be queried belongs. For example, the first preset combination rule is that the index of the area to which the grid belongs in the first N-1 division levels is in front, and the preset point coordinates in the grid are in the back, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in the order of the division levels from top to bottom. Based on this, the index of the grid to which the coordinate to be queried belongs can be: zone-11-76-254-tile-7552-25499-755248.5, 2549995.5, 37.0.

[0162] As described above, in some possible implementations, the server may combine the index of the area to which the grid belongs in the first N-1 division levels and the coordinates of the preset points in the grid to generate the index of the grid. In this case, the server may determine the grid to which the coordinate to be queried belongs based on the relationship between the coordinate to be queried, the division granularity of each of the first N-1 division levels, and the coordinate to be queried and the coordinates of the preset points of each grid. Among them, for any other division level except the first division level in the first N-1 division levels, the index of the area to which the division level belongs may be the index of the area to which the division level belongs within the upper layer area to which the area belongs.

[0163] For example, suppose the coordinates to be queried are (11U 755248.91mE 2549995.93mN 37.0m), where 11U755248.91mE2549995.93mN is the UTM coordinate, 11 indicates that it is located in the longitude zone 11; U indicates that it is located in the latitude zone U; 755248.91mE indicates that the east position is 755248.91m; 2549995.93mN indicates that the north position is 2549995.93m, and 37.0 is the altitude coordinate. Assume that the server divides the three-dimensional map of geographic objects into 60 map areas (i.e., 60 longitude bands) according to the UTM coordinate system; and divides each map area into multiple 10,000m*10,000m map sub-areas; and then divides each map sub-area into 10,000 tiles of 100m*100m; finally, according to the different positioning accuracy requirements of autonomous driving, the server can divide each tile into a 0.5m*0.5m*0.5m grid based on the height dimension. Then the server can first determine that the index of the map area where the coordinates to be queried are located is zone-11; then calculate 755248.91 / 10000=75.524891, round it down to get 75, and calculate 2549995.93 / 10000=254.999593, round it down to get 254. Based on this, it can be determined that the index of the map sub-area where the coordinates to be queried are located is 75-254; then calculate 524891 / 100=5248.9 1, round it down to 5248, and calculate 999593 / 100=9995.93, round it down to 9995. Based on this, it can be determined that the index of the tile where the coordinate to be queried is located is 5248-9995; finally, assuming that the grid division granularity is 0.5 meters, and the preset point of each grid is the lower left corner of the grid, it can be seen that the grid to which the coordinate to be queried belongs is the grid with the preset point coordinates of (755248.5, 2549995.5, 37.0). Based on this, the server can combine the index of the area to which the coordinate to be queried belongs in the first N-1 division levels and the preset point coordinates in the grid to which the coordinate to be queried belongs according to the above-mentioned first preset combination rule to obtain the index of the grid to which the coordinate to be queried belongs. For example, the first preset combination rule is that the index of the area to which the grid belongs in the first N-1 division levels is in front, and the preset point coordinates in the grid are in the back, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in the order of the division levels from top to bottom. Based on this, the index of the grid to which the coordinate to be queried belongs can be: zone-11-76-254-tile-5248-9995-755248.5, 2549995.5, 37.0.

[0164] As described above, in some implementable methods, the server may combine the index of the region to which the grid belongs in the first N-1 division levels, the division granularity of the grid, and the coordinates of the preset points in the grid to generate the index of the grid. In this case, the server may determine the grid to which the coordinate to be queried belongs based on the relationship between the coordinate to be queried, the division granularity of each of the first N-1 division levels, the division granularity of the grid, the coordinate to be queried, and the coordinates of the preset points of each grid. Among them, for any other division level except the first division level in the first N-1 division levels, the index of the region to which the division level belongs may be the index within the region of the previous level to which the region belongs.

[0165] For example, suppose the coordinates to be queried are (11U 755248.91mE 2549995.93mN 37.0m), where 11U755248.91mE2549995.93mN is the UTM coordinate, 11 indicates that it is located in the longitude zone 11; U indicates that it is located in the latitude zone U; 755248.91mE indicates that the east position is 755248.91m; 2549995.93mN indicates that the north position is 2549995.93m, and 37.0 is the altitude coordinate. Assume that the server divides the three-dimensional map of geographic objects into 60 map areas (i.e., 60 longitude bands) according to the UTM coordinate system; and divides each map area into multiple 10,000m*10,000m map sub-areas; and then divides each map sub-area into 10,000 tiles of 100m*100m; finally, according to the different positioning accuracy requirements of autonomous driving, the server can divide each tile into a 0.5m*0.5m*0.5m grid based on the height dimension. Then the server can first determine that the index of the map area where the coordinates to be queried are located is zone-11; then calculate 755248.91 / 10000=75.524891, round it down to get 75, and calculate 2549995.93 / 10000=254.999593, round it down to get 254. Based on this, it can be determined that the index of the map sub-area where the coordinates to be queried are located is 75-254; then calculate 755248.91 / 100=7552.4891, Round it down to 7552, and calculate 2549995.93 / 100=25499.9593, round it down to 25499. Based on this, it can be determined that the index of the tile where the coordinate to be queried is located is 7552-25499; finally, assuming that the grid division granularity is 0.5 meters, and the preset point of each grid is the lower left corner of the grid, it can be seen that the grid to which the coordinate to be queried belongs is the grid with the preset point coordinates of (755248.5, 2549995.5, 37.0). Based on this, the server can combine the index of the area to which the coordinate to be queried belongs in the first N-1 division levels, the division granularity of the grid, and the preset point coordinates in the grid to which the coordinate to be queried belongs according to the second preset combination rule to obtain the index of the grid to which the coordinate to be queried belongs. For example, the second preset combination rule is that the first preset combination rule is that the index of the area to which the grid belongs in the first N-1 division levels is first, the division granularity in the grid is second, and the preset point coordinates in the grid are last, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in the order of the division levels from top to bottom. Based on this, the index of the grid to which the coordinate to be queried belongs can be: zone-11-76-254-tile-7552-25499-0.5m-755248.5, 2549995.5, 37.0.

[0166] As described above, in some implementable methods, the server may combine the index of the area to which the grid belongs in the first N-1 division levels, the division granularity of the grid, and the coordinates of the preset points in the grid to generate the index of the grid. In this case, the server may determine the grid to which the coordinate to be queried belongs based on the relationship between the coordinate to be queried, the division granularity of each of the first N-1 division levels, the division granularity of the grid, the coordinate to be queried, and the coordinates of the preset points of each grid. Among them, for any other division level except the first division level in the first N-1 division levels, the index of the area to which the division level belongs may be the index of the area to which the division level belongs within the upper layer area to which the area belongs.

[0167] For example, suppose the coordinates to be queried are (11U 755248.91mE 2549995.93mN 37.0m), where 11U755248.91mE2549995.93mN is the UTM coordinate, 11 indicates that it is located in the longitude zone 11; U indicates that it is located in the latitude zone U; 755248.91mE indicates that the east position is 755248.91m; 2549995.93mN indicates that the north position is 2549995.93m, and 37.0 is the altitude coordinate. Assume that the server divides the three-dimensional map of geographic objects into 60 map areas (i.e., 60 longitude bands) according to the UTM coordinate system; and divides each map area into multiple 10,000m*10,000m map sub-areas; and then divides each map sub-area into 10,000 tiles of 100m*100m; finally, according to the different positioning accuracy requirements of autonomous driving, the server can divide each tile into a 0.5m*0.5m*0.5m grid based on the height dimension. Then the server can first determine that the index of the map area where the coordinates to be queried are located is zone-11; then calculate 755248.91 / 10000=75.524891, round it down to get 75, and calculate 2549995.93 / 10000=254.999593, round it down to get 254. Based on this, it can be determined that the index of the map sub-area where the coordinates to be queried are located is 75-254; then calculate 524891 / 100=5248.9 1, round it down to 5248, and calculate 999593 / 100=9995.93, round it down to 9995. Based on this, it can be determined that the index of the tile where the coordinate to be queried is located is 5248-9995; finally, assuming that the grid division granularity is 0.5 meters, and the preset point of each grid is the lower left corner of the grid, it can be seen that the grid to which the coordinate to be queried belongs is the grid with the preset point coordinates of (755248.5, 2549995.5, 37.0). Based on this, the server can combine the index of the area to which the coordinate to be queried belongs in the first N-1 division levels, the division granularity of the grid, and the preset point coordinates in the grid to which the coordinate to be queried belongs according to the second preset combination rule to obtain the index of the grid to which the coordinate to be queried belongs. For example, the first preset combination rule is that the index of the area to which the grid belongs in the first N-1 division levels is in front, and the preset point coordinates in the grid are in the back, wherein the index of the area to which the grid belongs in the first N-1 division levels is arranged in the order of the division levels from top to bottom. Based on this, the index of the grid to which the coordinate to be queried belongs can be: zone-11-76-254-tile-5248-9995-0.5m-755248.5, 2549995.5, 37.0.

[0168] In some implementations, if the storage granularity of the point cloud data is a map sub-region, the service may first determine the map sub-region where the coordinates to be queried are located, wherein the process of determining the map sub-region is as described above, and the embodiments of the present application will not be repeated. Further, the server may determine the memory-mapped database corresponding to the map sub-region.

[0169] S360: Reading point cloud data in the grid corresponding to the coordinates to be queried from the memory mapping database corresponding to the coordinates to be queried, and returning the point cloud data in the grid corresponding to the coordinates to be queried.

[0170] In some implementations, the server may read the point cloud data in the grid corresponding to the coordinates to be queried from the corresponding memory-mapped database through the index of the grid corresponding to the coordinates to be queried.

[0171] In some possible implementations, after acquiring the point cloud data in the grid corresponding to the coordinates to be queried, the user terminal may load the point cloud data into a map.

[0172] In some possible implementations, the server may also determine an adjacent grid of the grid corresponding to the coordinates to be queried, obtain point cloud data in the adjacent grid, and return the point cloud data in the adjacent grid.

[0173] In some implementations, after the user terminal obtains the point cloud data in the adjacent grid, it may load the point cloud data in the adjacent grid into the map.

[0174] In some possible implementations, the server may also determine the tile to which the grid corresponding to the coordinates to be queried belongs, obtain the point cloud data in the tile, and return the point cloud data in the tile.

[0175] In some implementations, after obtaining the point cloud data in the tile, the user terminal may load the point cloud data in the tile into a map.

[0176] In an embodiment of the present application, the server can read the point cloud data in the grid corresponding to the coordinates to be queried from the memory-mapped database corresponding to the coordinates to be queried, and return the point cloud data in the grid corresponding to the coordinates to be queried. Since the memory-mapped database has the characteristic of high query efficiency, it can improve the query efficiency of point cloud data, thereby meeting the real-time requirements of autonomous driving scenarios.

[0177] The preferred embodiments of the present application are described in detail above in conjunction with the accompanying drawings. However, the present application is not limited to the specific details in the above embodiments. Within the technical concept of the present application, the technical solution of the present application can be subjected to a variety of simple modifications, and these simple modifications all belong to the protection scope of the present application. For example, the various specific technical features described in the above specific embodiments can be combined in any suitable manner without contradiction. In order to avoid unnecessary repetition, the present application will not further explain various possible combinations. For another example, the various different embodiments of the present application can also be arbitrarily combined, as long as they do not violate the ideas of the present application, they should also be regarded as the contents disclosed in the present application.

[0178] It should also be understood that in the various method embodiments of the present application, the size of the serial numbers of the above-mentioned processes does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0179] The method provided in the embodiment of the present application is described above, and the device provided in the embodiment of the present application is described below.

[0180] Figure 6 A schematic diagram of a data processing device 600 provided in an embodiment of the present application is shown as follows: Figure 6 As shown, the device 600 includes: a division module 610, a determination module 620 and a storage module 630; the division module 610 is used to divide the three-dimensional map of the geographic object into N levels; wherein, 3≤N≤5, and N is a positive integer, and the bottom layer of the N division levels of the three-dimensional map is the grid layer; for any grid in each grid of the three-dimensional map, the determination module 620 is used to determine the index of the grid; the storage module 630 is used to store the index of the grid and the point cloud data in the grid into the corresponding memory mapping database.

[0181] In some possible implementations, the determination module 620 is specifically used to: determine the index of the area to which the grid belongs in the first N-1 division levels and the coordinates of the preset points in the grid; and generate the index of the grid based on the index of the area to which the grid belongs in the first N-1 division levels and the coordinates of the preset points in the grid.

[0182] In some implementations, the determination module 620 is specifically used to: combine the index of the area to which the grid belongs at the first N-1 division levels and the coordinates of the preset point in the grid to obtain the index of the grid.

[0183] In some implementations, the determination module 620 is specifically used to generate an index of the grid based on the index of the region to which the grid belongs at the first N-1 division levels, the coordinates of the preset points in the grid, and the division granularity of the grid.

[0184] In some implementations, the determination module 620 is specifically used to combine the index of the area to which the grid belongs at the first N-1 division levels, the coordinates of the preset point in the grid, and the division granularity of the grid to obtain the index of the grid.

[0185] In some possible implementations, the division module 610 is specifically used to: divide the three-dimensional map into M1 map areas; divide the M1 map areas into M2 map sub-areas respectively; divide the M2 map sub-areas into M3 tiles respectively; divide the M3 tiles into M4 grids respectively; wherein M1, M2, M3 and M4 are all positive integers greater than 1.

[0186] In some implementations, the storage module 630 is specifically used to store the index of the grid and the point cloud data in the grid into a memory-mapped database corresponding to the map sub-region to which the grid belongs.

[0187] In some possible implementations, the device 600 also includes: an acquisition module 640 and a read return module 650, wherein, after the storage module 630 stores the index of the grid and the point cloud data in the grid to the corresponding memory-mapped database, the acquisition module 640 is used to obtain a query request; wherein the query request includes the coordinates to be queried; the determination module 620 is also used to determine the grid to which the coordinates to be queried belong and the corresponding memory-mapped database; the read return module 650 is used to: read the point cloud data in the grid corresponding to the coordinates to be queried from the memory-mapped database corresponding to the coordinates to be queried, and return the point cloud data in the grid corresponding to the coordinates to be queried.

[0188] In some implementations, the determination module 620 is specifically used to: if the coordinates to be queried include longitude and latitude coordinates, convert the longitude and latitude coordinates into UTM coordinates, obtain the converted coordinates corresponding to the coordinates to be queried, and determine the grid to which the converted coordinates belong.

[0189] It should be understood that the device embodiment and the method embodiment may correspond to each other, and similar descriptions may refer to the method embodiment. To avoid repetition, they will not be described here. Specifically, Figure 6 The device 600 shown may perform Figure 3 , Figure 5 The corresponding method embodiments, and the aforementioned and other operations and / or functions of each module in the device 600 are respectively to implement Figure 3 , Figure 5 For the sake of brevity, the corresponding processes in each method are not repeated here.

[0190] The above describes the device 600 of the embodiment of the present application from the perspective of the functional module in conjunction with the accompanying drawings. It should be understood that the functional module can be implemented in hardware form, can be implemented by instructions in software form, and can also be implemented by a combination of hardware and software modules. Specifically, the steps of the method embodiment in the embodiment of the present application can be completed by the hardware integrated logic circuit and / or software form instructions in the processor, and the steps of the method disclosed in the embodiment of the present application can be directly embodied as a hardware decoding processor to perform, or a combination of hardware and software modules in the decoding processor to perform. Optionally, the software module can be located in a mature storage medium in the field such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, an electrically erasable programmable memory, a register, etc. The storage medium is located in a memory, and the processor reads the information in the memory, and completes the steps in the above method embodiment in conjunction with its hardware.

[0191] Figure 7 It is a schematic block diagram of an electronic device 700 provided in an embodiment of the present application.

[0192] like Figure 7 As shown, the electronic device 700 may include:

[0193] The memory 710 and the processor 720, the memory 710 is used to store the computer program and transmit the program code to the processor 720. In other words, the processor 720 can call and run the computer program from the memory 710 to implement the method in the embodiment of the present application.

[0194] For example, the processor 720 may be configured to execute the above method embodiments according to instructions in the computer program.

[0195] In some embodiments of the present application, the processor 720 may include but is not limited to:

[0196] General-purpose processor, digital signal processor (DSP), application-specific integrated circuit (ASIC), field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware components, etc.

[0197] In some embodiments of the present application, the memory 710 includes but is not limited to:

[0198] Volatile memory and / or non-volatile memory. Among them, the non-volatile memory can be read-only memory (ROM), programmable ROM (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM) or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example and not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link DRAM (SLDRAM), and direct RAM bus random access memory (DR RAM).

[0199] In some embodiments of the present application, the computer program may be divided into one or more modules, which are stored in the memory 710 and executed by the processor 720 to complete the method provided by the present application. The one or more modules may be a series of computer program instruction segments capable of completing specific functions, and the instruction segments are used to describe the execution process of the computer program in the electronic device.

[0200] like Figure 7 As shown, the electronic device may also include:

[0201] The transceiver 730 may be connected to the processor 720 or the memory 710 .

[0202] The processor 720 may control the transceiver 730 to communicate with other devices, specifically, to send information or data to other devices, or to receive information or data sent by other devices. The transceiver 730 may include a transmitter and a receiver. The transceiver 730 may further include an antenna, and the number of antennas may be one or more.

[0203] It should be understood that the various components in the electronic device are connected via a bus system, wherein the bus system includes not only a data bus but also a power bus, a control bus and a status signal bus.

[0204] The present application also provides a computer storage medium on which a computer program is stored, and when the computer program is executed by a computer, the computer can perform the method of the above method embodiment. In other words, the present application embodiment also provides a computer program product containing instructions, and when the instructions are executed by a computer, the computer can perform the method of the above method embodiment.

[0205] When software is used for implementation, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on a computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium. For example, the computer instructions can be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (digital subscriber line, DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integration. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a digital video disc (digital video disc, DVD)), or a semiconductor medium (e.g., a solid state drive (solid state disk, SSD)), etc.

[0206] Those of ordinary skill in the art will appreciate that the modules and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0207] In the several embodiments provided in the present 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 only schematic. For example, the division of the module is only a logical function division. There may be other division methods in actual implementation, such as multiple modules 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 through some interfaces, indirect coupling or communication connection of devices or modules, which can be electrical, mechanical or other forms.

[0208] The modules described as separate components may or may not be physically separated, and the components displayed as modules may or may not be physical modules, that is, they may be located in one place, or they may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the scheme of this embodiment. For example, each functional module in each embodiment of the present application may be integrated into a processing module, or each module may exist physically separately, or two or more modules may be integrated into one module.

[0209] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any technician familiar with the technical field can easily think of changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A data processing method, characterized in that: include: Dividing the three-dimensional map of the geographic object into N levels; wherein 3≤N≤5, and N is a positive integer, and the lowest level of the N levels of division of the three-dimensional map is a grid layer; For any one of the grids of the three-dimensional map, the index of the grid is determined; and the index of the grid and the point cloud data in the grid are stored in a corresponding memory-mapped database.

2. The method according to claim 1, characterized in that The determining the index of the grid comprises: Determine the index of the area to which the grid belongs at the first N-1 division levels and the coordinates of the preset points in the grid; The index of the grid is generated based on the index of the area to which the first N-1 division levels of the grid belong and the coordinates of the preset points in the grid.

3. The method according to claim 2, characterized in that The step of generating the index of the grid based on the index of the area to which the grid belongs at the first N-1 division levels and the coordinates of the preset points in the grid comprises: The index of the grid in the area to which the first N-1 division levels belong and the coordinates of the preset points in the grid are combined to obtain the index of the grid.

4. The method according to claim 3, characterized in that: The step of generating the index of the grid based on the index of the area to which the grid belongs at the first N-1 division levels and the coordinates of the preset points in the grid comprises: The index of the grid is generated based on the index of the area to which the grid belongs at the first N-1 division levels, the coordinates of the preset points in the grid and the division granularity of the grid.

5. The method according to claim 4, characterized in that The generating the index of the grid based on the index of the area to which the grid belongs at the first N-1 division levels, the coordinates of the preset points in the grid and the division granularity of the grid comprises: The index of the grid in the area to which the first N-1 division levels belong, the coordinates of the preset points in the grid and the division granularity of the grid are combined to obtain the index of the grid.

6. The method according to any one of claims 1 to 5, characterized in that: The dividing of the three-dimensional map of the geographic object into N levels includes: Dividing the three-dimensional map into M1 map areas; Dividing the M1 map areas into M2 map sub-areas respectively; Divide the M2 map sub-areas into M3 tiles respectively; Divide the M3 tiles into M4 grids respectively; Among them, M1, M2, M3 and M4 are all positive integers greater than 1.

7. The method according to claim 6, characterized in that The storing the index of the grid and the point cloud data in the grid into a corresponding memory-mapped database includes: The index of the grid and the point cloud data in the grid are stored in a memory-mapped database corresponding to the map sub-region to which the grid belongs.

8. The method according to any one of claims 1 to 5, characterized in that: After storing the index of the grid and the point cloud data in the grid into the corresponding memory-mapped database, the method further includes: Obtaining a query request; wherein the query request includes coordinates to be queried; Determine the grid to which the coordinates to be queried belong and the corresponding memory-mapped database; The point cloud data in the grid corresponding to the coordinates to be queried is read from the memory mapping database corresponding to the coordinates to be queried, and the point cloud data in the grid corresponding to the coordinates to be queried is returned.

9. The method according to claim 8, characterized in that Determining the grid to which the coordinates to be queried belong includes: If the coordinates to be queried include longitude and latitude coordinates, the longitude and latitude coordinates are converted into Universal Transverse Mercator Grid System UTM coordinates to obtain the converted coordinates corresponding to the coordinates to be queried, and the grid to which the converted coordinates belong is determined.

10. A data processing device, characterized in that: include: Divide modules, determine modules and store modules; The division module is used to divide the three-dimensional map of the geographic object into N levels; wherein 3≤N≤5, and N is a positive integer, and the lowest level of the N division levels of the three-dimensional map is a grid layer; For any one of the grids of the three-dimensional map, the determination module is used to determine the index of the grid; the storage module is used to store the index of the grid and the point cloud data in the grid into a corresponding memory-mapped database.

11. An electronic device, characterized in that: include: A processor and a memory, the memory being used to store a computer program, and the processor being used to call and run the computer program stored in the memory to execute the method according to any one of claims 1 to 9.

12. A computer-readable storage medium, characterized in that: Used to store a computer program, wherein the computer program causes a computer to execute the method according to any one of claims 1 to 9.

13. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the method according to any one of claims 1 to 9 is implemented.