Vehicle map representation method, device, equipment and medium for representing real neighborhood

Abstract

The present application discloses a vehicle map representation method, device, computer equipment and computer-readable storage medium for representing a real neighborhood. The method comprises: dividing an original map into multiple grids according to a preset accuracy; determining whether there is a direct road between any two grids according to the original map; if there is a direct road, determining the practical distance between the two grids according to the length of the direct road between the two grids and the road speed; if there is no direct road, determining the practical distance between the two grids according to the straight-line geometric distance and the non-road speed between the two grids, wherein the non-road speed is determined according to the terrain between the two grids; determining and storing the adjacent grids of each grid to form a vehicle map with a practical distance, so as to replace the geometric distance with the practical distance in the map, so that the distance displayed on the map during navigation is more in line with the actual distance that the vehicle has to travel between the two areas.

Description

Technical Field

[0001] The present application relates to the technical field of big data analysis for intelligent transportation networks, and in particular to a method, device, computer equipment, and computer-readable storage medium for representing a vehicle map that represents a real neighborhood. Background Art

[0002] When existing maps indicate the distance between two places, they usually only show the straight-line physical geometric distance between the two places. However, when actually traveling from one point on the map to another point, it is not a straight-line geometric distance, but is severely restricted by the traffic convenience between the two points, especially in the use scenario of vehicles. For example, if there is a river without a bridge between the two places or a valley between the two places, the vehicle cannot pass directly when driving, and the vehicle needs to detour a long distance, so the actual driving distance of the vehicle is much greater than the straight-line geometric distance shown on the map. When the vehicle's fuel or power is limited, the driver will estimate the distance the vehicle can travel based on the fuel or power. This may happen when using existing maps for navigation. According to the straight-line geometric distance between the two places shown on the map, the vehicle's fuel is sufficient to reach the destination, but when actually driving, the actual distance the vehicle travels is much greater than the straight-line geometric distance shown on the map, resulting in the vehicle's fuel being unable to reach the destination, causing trouble and inconvenience to the driver's travel and causing user complaints.

[0003] Moreover, the straight-line geometric distance between two places shown on existing maps cannot provide users with the most intelligent navigation service. For example, a vehicle needs to refuel in area A, and there are gas stations in areas B and C. The straight-line geometric distance from area A to area B on the map is 30 kilometers, and the straight-line geometric distance from area A to area C on the map is 40 kilometers. The existing map will recommend that the vehicle refuel in area B because the straight-line geometric distance in area B is closer. However, the vehicle actually needs to travel 50 kilometers from area A to area B, and only 45 kilometers from area A to area C. This will affect the operating efficiency of the vehicle and increase the cost of the vehicle going to the gas station. Summary of the invention

[0004] The main purpose of the present application is to provide a method, device, computer equipment and computer-readable storage medium for representing a real neighborhood in a vehicle map, aiming to solve the technical problem that maps in the prior art usually only show the straight-line geometric distance between two places and cannot reflect the actual distance between the two places.

[0005] In a first aspect, the present application provides a method for representing a real neighborhood map for a vehicle, the method comprising the following steps:

[0006] Divide the original map into multiple grids according to the preset accuracy;

[0007] Determine whether there is a direct road between any two grids according to the original map;

[0008] If there is a direct road, the practical distance between the two grids is determined according to the length of the direct road between the two grids and the road speed;

[0009] If there is no directly connected road, determining the practical distance between the two grids according to the straight-line geometric distance between the two grids and the non-road speed, wherein the non-road speed is determined according to the terrain between the two grids;

[0010] The neighboring grids of each grid are determined and stored to form a vehicle map with practical distances.

[0011] In some embodiments, if there is a direct road, determining the practical distance between the two grids according to the length of the direct road between the two grids and the road speed includes:

[0012] The practical distance between two grids is obtained by dividing the length of the direct road by the road speed;

[0013] The road speed includes: the design speed of the directly connected road or the average driving speed of the vehicle.

[0014] In some embodiments, if there is no directly connected road, determining the practical distance between the two grids according to the straight-line geometric distance between the two grids and the non-road speed includes:

[0015] The practical distance between the two grids is obtained by dividing the straight-line geometric distance between the two grids by the non-road speed.

[0016] In some embodiments, the method for representing a vehicle map showing a real neighborhood further includes:

[0017] When there is no direct road between the two grids, determining whether there is an available road between the two grids according to the original map;

[0018] If there is an available road between the two grids, the length of the available road and the distance of the non-road between the two grids are normalized, and the preset algorithm is called to calculate the shortest practical distance between the two grids;

[0019] The preset algorithms include: Dijkstra algorithm, Floyd algorithm or Bellmanford algorithm.

[0020] In some embodiments, determining and storing adjacent grids of each grid to form a vehicle map with practical distances includes:

[0021] A practical distance threshold is preset, and each grid determines and stores a grid whose practical distance to itself is less than the practical distance threshold as an adjacent grid to form the vehicle map with practical distance, or;

[0022] Each grid determines and stores a second preset number of grids which have the shortest practical distance to itself as adjacent grids to form the vehicle map with the practical distance.

[0023] In some embodiments, the determining and storing of adjacent grids of each grid to form a vehicle map with practical distances further includes:

[0024] The practical distance data in the vehicle map having the practical distance is refreshed at preset time intervals.

[0025] In some embodiments, the determining and storing of adjacent grids of each grid to form a vehicle map with practical distances further includes:

[0026] Determining a practical distance between two grids according to the vehicle map having practical distances;

[0027] Determine the real-time number of vehicles on the road between two grids;

[0028] If the real-time number of vehicles between two grids exceeds a preset number, the practical distance between the two grids is multiplied by a preset practical distance coefficient to obtain the final practical distance between the two grids when the real-time number of vehicles exceeds the preset number.

[0029] In a second aspect, the present application further provides a vehicle map display device for representing a real neighborhood, the device comprising:

[0030] A division module, which is used to divide the original map into multiple grids according to a preset accuracy;

[0031] A first determination module, which is used to determine whether there is a direct road between any two grids according to the original map;

[0032] a second determination module, configured to determine the practical distance between the two grids according to the length of the direct road between the two grids and the road speed if there is a direct road, and to determine the practical distance between the two grids according to the straight-line geometric distance between the two grids and the non-road speed if there is no direct road, wherein the non-road speed is determined according to the terrain between the two grids;

[0033] The storage module is used to determine and store the adjacent grids of each grid to form a vehicle map with practical distances.

[0034] In some embodiments, the second determination module is further used to: obtain a practical distance between two grids by dividing the length of the direct road by the road speed;

[0035] The road speed includes: the design speed of the directly connected road or the average driving speed of the vehicle.

[0036] In some embodiments, the second determining module is further configured to:

[0037] The practical distance between the two grids is obtained by dividing the straight-line geometric distance between the two grids by the non-road speed.

[0038] In some embodiments, the vehicle map display device representing the real neighborhood is further used for:

[0039] When there is no direct road between the two grids, determining whether there is an available road between the two grids according to the original map;

[0040] If there is an available road between the two grids, the length of the available road and the distance of the non-road between the two grids are normalized, and the preset algorithm is called to calculate the shortest practical distance between the two grids;

[0041] The preset algorithms include: Dijkstra algorithm, Floyd algorithm or Bellmanford algorithm.

[0042] In some embodiments, the storage module is further used for:

[0043] A practical distance threshold is preset, and each grid determines and stores a grid whose practical distance to itself is less than the practical distance threshold as an adjacent grid to form the vehicle map with practical distance, or;

[0044] Each grid determines and stores a second preset number of grids which have the shortest practical distance to itself as adjacent grids to form the vehicle map with the practical distance.

[0045] In some embodiments, the storage module is further used for:

[0046] The practical distance data in the vehicle map having the practical distance is refreshed at preset time intervals.

[0047] In some embodiments, the vehicle map display device representing the real neighborhood is further used for:

[0048] Determining a practical distance between two grids according to the vehicle map having practical distances;

[0049] Determine the real-time number of vehicles on the road between two grids;

[0050] If the real-time number of vehicles between two grids exceeds a preset number, the practical distance between the two grids is multiplied by a preset practical distance coefficient to obtain the final practical distance between the two grids when the real-time number of vehicles exceeds the preset number.

[0051] In a third aspect, the present application also provides a computer device, comprising a processor, a memory, and a computer program stored in the memory and executable by the processor, wherein when the computer program is executed by the processor, the steps of the vehicle map representation method for representing a real neighborhood as described above are implemented.

[0052] In a fourth aspect, the present application further provides a computer-readable storage medium having a computer program stored thereon, wherein when the computer program is executed by a processor, the steps of the above-mentioned method for representing a real neighborhood in a vehicle map are implemented.

[0053] The present application provides a vehicle map representation method, device, computer equipment and computer-readable storage medium that represent a real neighborhood, which divides an original map into multiple grids according to a preset accuracy; determines whether there is a direct road between any two grids according to the original map; if there is a direct road, determines the practical distance between the two grids according to the length of the direct road between the two grids and the road speed; if there is no direct road, determines the practical distance between the two grids according to the straight-line geometric distance and the non-road speed between the two grids, wherein the non-road speed is determined according to the terrain between the two grids; determines and stores the adjacent grids of each grid to form a vehicle map with a practical distance, so as to replace the geometric distance with the practical distance in the map, so that the distance displayed on the map during navigation is more in line with the actual distance that the vehicle has to travel between the two areas, thereby improving the accuracy of the distance displayed on the map. BRIEF DESCRIPTION OF THE DRAWINGS

[0054] In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings required for use in the description of the embodiments will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying any creative work.

[0055] Figure 1 A schematic diagram of a flow chart of a method for representing a real neighborhood in a vehicle map provided in an embodiment of the present application;

[0056] Figure 2 This is a schematic diagram of the grid divided according to the original map;

[0057] Figure 3 This is a schematic diagram of the direct road between two grids;

[0058] Figure 4 A schematic diagram of available roads between two grids;

[0059] Figure 5 A schematic block diagram of a vehicle map display device for displaying a real neighborhood provided in an embodiment of the present application;

[0060] Figure 6 The present invention is a block diagram showing the structure of a computer device according to an embodiment of the present application.

[0061] The realization of the purpose, functional features and advantages of this application will be further explained in conjunction with embodiments and with reference to the accompanying drawings. DETAILED DESCRIPTION

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

[0063] The flowcharts shown in the accompanying drawings are only examples and do not necessarily include all the contents and operations / steps, nor must they be executed in the order described. For example, some operations / steps may also be decomposed, combined or partially merged, so the actual execution order may change according to actual conditions.

[0064] The embodiment of the present application provides a method, device, computer device and computer readable storage medium for representing a real neighborhood map for a vehicle. The method for representing a real neighborhood map for a vehicle can be applied to a computer device, which can be an electronic device such as a vehicle-mounted computer, a terminal, etc.

[0065] In conjunction with the accompanying drawings, some embodiments of the present application are described in detail below. In the absence of conflict, the following embodiments and features in the embodiments can be combined with each other.

[0066] Please refer to Figure 1 , Figure 1 A flowchart of a method for representing a vehicle map showing a real neighborhood provided in an embodiment of the present application.

[0067] like Figure 1 As shown, the method includes steps S1 to S5.

[0068] Step S1: Divide the original map into multiple grids according to a preset accuracy.

[0069] Characteristically, from a mathematical point of view, the map plane is composed of an infinite number of points, and an infinite number of points is not operational. Figure 2 As shown, in the embodiment of the present application, the original map is divided into multiple grids by a pooling algorithm, and all points in the grid can be represented by the entire grid, or all points in the grid can be represented by one point in the grid. In the embodiment of the present application, all points in the grid are represented by the entire grid.

[0070] Specifically, the grid division scale in the embodiment of the present application is 50 meters, that is, one grid represents all points within a range of 50 square meters on the map. And the smaller the scale of the divided grid, the fewer points a grid represents, so the finer the grid division, the higher the accuracy represented.

[0071] Step S2: Determine whether there is a direct road between any two grids according to the original map.

[0072] Characteristic, such as Figure 3 As shown, the roads in the original map can be mapped to the divided grids to determine whether there is a direct road between the two grids. For example, if there is a continuous and uninterrupted road between grid a and grid b, and it passes through grid a and grid b at the same time, it can be determined that there is a direct road between grid a and grid b. If the road is interrupted in the middle, or passes through grid a but not grid b, it is determined that there is no direct road between grid a and grid b.

[0073] Step S3: If there is a direct road, the practical distance between the two grids is determined according to the length of the direct road between the two grids and the road speed.

[0074] Specifically, first determine the length of the direct road between grid a and grid b, and then obtain the road speed. The road speed can be the design speed of the direct road or the average driving speed of the vehicle using the map. Divide the length of the direct road by the road speed to obtain the practical distance between the two grids. In terms of physical quantity, the practical distance is actually the time required from grid a to grid b, but because it is related to the vehicle speed or the road design speed, it can accurately reflect the actual distance from grid a to grid b.

[0075] Step S4: if there is no directly connected road, determining the practical distance between the two grids according to the straight-line geometric distance between the two grids and the non-road speed, wherein the non-road speed is determined according to the terrain between the two grids;

[0076] Specifically, the practical distance between the two grids is obtained by dividing the geometric distance between the two grids by the non-road speed. The geometric distance represents the straight-line connection distance between the two grids. The non-road speed is determined based on the terrain between the two grids. For example, when the terrain between the areas represented by the two grids is mountainous, the non-road speed can be set to 30 kilometers per hour. When the terrain is a desert, the non-road speed can be set to 40 kilometers per hour. By setting the non-road speed related to the terrain, the practical distance can be connected to the distance detoured by the terrain and assigned to the speed, thereby realizing the association between the practical distance and the actual distance that the vehicle will travel.

[0077] The above non-road speed setting is only used as an example, and the specific non-road speed can be set according to specific needs.

[0078] As a preferred embodiment, Figure 4 As shown in the figure, when there is no direct road between two grids, it is determined whether there is an available road between the two grids according to the original map. For example, although a road does not directly connect grid a and grid b, but there is a road passing through the grids adjacent to grid a and grid b, it can be considered that there is an available road between grid a and grid b.

[0079] If there is an available road between the two grids, the length of the available road is determined, and the non-road distance from grid a to the available road and the non-road distance from grid b to the available road are determined based on the original map. Then the available road length and non-road distance between the two grids are normalized, and the preset algorithm is called to calculate the shortest usable distance between the two grids. The preset algorithms include: Dijkstra algorithm, Floyd algorithm or Belmanford algorithm.

[0080] Step S5: determine and store the adjacent grids of each grid to form a vehicle map with practical distances.

[0081] In some embodiments, a practical distance threshold is preset, and each grid determines the grids whose practical distance from itself is less than the practical distance threshold, and these grids are stored as adjacent grids in the form of an adjacency list or an adjacency matrix. The adjacency list contains the practical distances between each grid with an adjacency relationship, so the adjacency lists of all points can be collected to form a map with practical distance information. For example, the practical distance threshold to be stored is set to 5 kilometers, and when the grid is stored, only the grids with a practical distance within 5 kilometers from itself are stored as adjacent grids.

[0082] In some embodiments, each grid determines the first second preset number of grids with the shortest practical distance to itself as adjacent street grids, and stores these grids in the form of an adjacency list to form the map with practical distance information. For example, each grid stores the first 10 grids with the closest practical distance to itself as adjacent grids. The grids with the longest practical distance can also be stored. The specific storage quantity or the farthest or closest can be set according to actual needs.

[0083] Furthermore, after the map with practical distances is formed, the map with practical distances is refreshed at preset intervals to refresh the practical distances between grids, so as to ensure the real-time performance of the practical distance data.

[0084] As a preferred implementation, when using a map with practical distance, after inputting the starting point to the end point, the map determines the grids where the two positions are located according to the starting point and the end point, and then determines the use distance between the two grids. And determine the real-time measurement number between the two grids. If the number of vehicles between the two grids exceeds the preset number, it is determined that there are many vehicles in the interval from the starting point to the end point, which will affect the driving condition of the vehicle. Then, the practical distance between the two grids is multiplied by the preset practical distance coefficient (for example, the coefficient can be 1.2), and the final practical distance between the two grids is obtained when the real-time number of vehicles exceeds the preset number, thereby determining the final use distance from the starting point to the end point.

[0085] By using the vehicle map representation method for representing the real neighborhood in the present application, the original straight-line physical geometric distance of the map can be replaced by the practical distance in the map. This ensures that the practical distance displayed during map navigation has a strong correlation with the distance that the vehicle will travel, improves the perfection of the map function, and also improves the operating efficiency and user experience of the vehicle using the map with the practical distance.

[0086] Please refer to Figure 5 , Figure 5 A schematic block diagram of a vehicle map display device showing a real neighborhood provided in an embodiment of the present application.

[0087] like Figure 5 As shown, the device includes: a division module, a first determination module, a second determination module and a storage module.

[0088] A division module, which is used to divide the original map into multiple grids according to a preset accuracy;

[0089] A first determination module, which is used to determine whether there is a direct road between any two grids according to the original map;

[0090] a second determination module, configured to determine the practical distance between the two grids according to the length of the direct road between the two grids and the road speed if there is a direct road, and to determine the practical distance between the two grids according to the straight-line geometric distance between the two grids and the non-road speed if there is no direct road, wherein the non-road speed is determined according to the terrain between the two grids;

[0091] The storage module is used to determine and store the adjacent grids of each grid to form a vehicle map with practical distances.

[0092] The second determination module is further used to: obtain a practical distance between two grids by dividing the length of the direct road by the road speed;

[0093] The road speed includes: the design speed of the directly connected road or the average driving speed of the vehicle.

[0094] Wherein, the second determining module is further used for:

[0095] The practical distance between the two grids is obtained by dividing the straight-line geometric distance between the two grids by the non-road speed.

[0096] The vehicle map display device showing the real neighborhood is also used for:

[0097] When there is no direct road between the two grids, determining whether there is an available road between the two grids according to the original map;

[0098] If there is an available road between the two grids, the length of the available road and the distance of the non-road between the two grids are normalized, and the preset algorithm is called to calculate the shortest practical distance between the two grids;

[0099] The preset algorithms include: Dijkstra algorithm, Floyd algorithm or Bellmanford algorithm.

[0100] Wherein, the storage module is also used for:

[0101] A practical distance threshold is preset, and each grid determines and stores a grid whose practical distance to itself is less than the practical distance threshold as an adjacent grid to form the vehicle map with practical distance, or;

[0102] Each grid determines and stores a second preset number of grids which have the shortest practical distance to itself as adjacent grids to form the vehicle map with the practical distance.

[0103] Wherein, the storage module is also used for:

[0104] The practical distance data in the vehicle map having the practical distance is refreshed at preset time intervals.

[0105] The vehicle map display device showing the real neighborhood is also used for:

[0106] Determining a practical distance between two grids according to the vehicle map having practical distances;

[0107] Determine the real-time number of vehicles on the road between two grids;

[0108] If the real-time number of vehicles between two grids exceeds a preset number, the practical distance between the two grids is multiplied by a preset practical distance coefficient to obtain the final practical distance between the two grids when the real-time number of vehicles exceeds the preset number.

[0109] It should be noted that those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described devices and modules and units can refer to the corresponding processes in the aforementioned embodiments and will not be repeated here.

[0110] The vehicle map display device for representing a real neighborhood provided in the above embodiment can be implemented in the form of a computer program. The computer program can be used in Figure 6 Runs on the computer device shown.

[0111] See also Figure 6 , Figure 6 A schematic block diagram of the structure of a computer device provided in an embodiment of the present application. The computer device may be a terminal.

[0112] like Figure 6 As shown, the computer device includes a processor, a memory, and a network interface connected via a system bus, wherein the memory may include a non-volatile storage medium and an internal memory.

[0113] The non-volatile storage medium can store an operating system and a computer program. The computer program includes program instructions, and when the program instructions are executed, the processor can execute any vehicle map representation method that represents a real neighborhood.

[0114] The processor is used to provide computing and control capabilities and support the operation of the entire computer equipment.

[0115] The internal memory provides an environment for the operation of a computer program in a non-volatile storage medium. When the computer program is executed by a processor, the processor can execute any vehicle map representation method that represents a real neighborhood.

[0116] The network interface is used for network communication, such as sending assigned tasks, etc. Those skilled in the art will understand that Figure 6The structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the computer device to which the solution of the present application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0117] It should be understood that the processor may be a central processing unit (CPU), and the processor may also be other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0118] An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored. The computer program includes program instructions. The method implemented when the program instructions are executed can refer to the various embodiments of the present application.

[0119] The computer-readable storage medium may be an internal storage unit of the computer device described in the foregoing embodiment, such as a hard disk or memory of the computer device. The computer-readable storage medium may also be an external storage device of the computer device, such as a plug-in hard disk, a smart memory card (SmartMedia Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), etc., equipped on the computer device.

[0120] It should be noted that, in this article, the terms "include", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or system. In the absence of further restrictions, an element defined by the sentence "comprises a ..." does not exclude the existence of other identical elements in the process, method, article or system including the element.

[0121] The serial numbers of the embodiments of the present application are for description only and do not represent the advantages and disadvantages of the embodiments. The above description is only a specific implementation mode 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 various equivalent modifications or replacements within the technical scope disclosed in the present application, and these modifications or replacements should be included in the protection scope of the present application. Therefore, the protection scope of the present application shall be based on the protection scope of the claims.

Claims

1. A method for representing a real neighborhood map for a vehicle, characterized in that: include: Divide the original map into multiple grids according to the preset accuracy; Determine whether there is a direct road between any two grids according to the original map; If there is a direct road, the practical distance between the two grids is determined according to the length of the direct road between the two grids and the road speed; If there is no directly connected road, determining the practical distance between the two grids according to the straight-line geometric distance between the two grids and the non-road speed, wherein the non-road speed is determined according to the terrain between the two grids; Determining and storing the neighboring grids of each grid to form a vehicle map with practical distances; Wherein, if there is a direct road, determining the practical distance between the two grids according to the length of the direct road between the two grids and the road speed includes: The practical distance between two grids is obtained by dividing the length of the direct road by the road speed; The road speed includes: the design speed of the directly connected road or the average driving speed of the vehicle; Wherein, if there is no directly connected road, determining the practical distance between the two grids according to the straight-line geometric distance between the two grids and the non-road speed includes: The practical distance between the two grids is obtained by dividing the straight-line geometric distance between the two grids by the non-road speed.

2. The method for representing a real neighborhood map for a vehicle according to claim 1, characterized in that: Also includes: When there is no direct road between the two grids, determining whether there is an available road between the two grids according to the original map; If there is an available road between the two grids, the length of the available road and the distance of the non-road between the two grids are normalized, and the preset algorithm is called to calculate the shortest practical distance between the two grids; The preset algorithms include: Dijkstra algorithm, Floyd algorithm or Bellmanford algorithm.

3. The method for representing a real neighborhood map for a vehicle according to claim 1, characterized in that: The step of determining and storing adjacent grids of each grid to form a vehicle map with practical distances includes: A practical distance threshold is preset, and each grid determines and stores a grid whose practical distance to itself is less than the practical distance threshold as an adjacent grid to form the vehicle map with practical distance, or; Each grid determines and stores a second preset number of grids which have the shortest practical distance to itself as adjacent grids to form the vehicle map with the practical distance.

4. The method for representing a real neighborhood map for a vehicle according to claim 1, characterized in that: The step of determining and storing adjacent grids of each grid to form a vehicle map with practical distances further includes: The practical distance data in the vehicle map having the practical distance is refreshed at preset time intervals.

5. The method for representing a real neighborhood map for a vehicle according to claim 1, characterized in that: The step of determining and storing adjacent grids of each grid to form a vehicle map with practical distances further includes: Determining a practical distance between two grids according to the vehicle map having practical distances; Determine the real-time number of vehicles on the road between two grids; If the real-time number of vehicles between two grids exceeds a preset number, the practical distance between the two grids is multiplied by a preset practical distance coefficient to obtain the final practical distance between the two grids when the real-time number of vehicles exceeds the preset number.

6. A vehicle map display device for representing a real neighborhood, characterized in that: include: A division module, which is used to divide the original map into multiple grids according to a preset accuracy; A first determination module, which is used to determine whether there is a direct road between any two grids according to the original map; a second determination module, configured to determine the practical distance between the two grids according to the length of the direct road between the two grids and the road speed if there is a direct road, and to determine the practical distance between the two grids according to the straight-line geometric distance between the two grids and the non-road speed if there is no direct road, wherein the non-road speed is determined according to the terrain between the two grids; A storage module, which is used to determine and store adjacent grids of each grid to form a vehicle map with practical distances; Wherein, the second determining module is further used for: The practical distance between two grids is obtained by dividing the length of the direct road by the road speed; The road speed includes: the design speed of the directly connected road or the average driving speed of the vehicle; Wherein, the second determining module is further used for: The practical distance between the two grids is obtained by dividing the straight-line geometric distance between the two grids by the non-road speed.

7. A computer device, characterized in that: The computer device includes a processor, a memory, and a computer program stored in the memory and executable by the processor, wherein when the computer program is executed by the processor, the steps of a vehicle map representation method for representing a real neighborhood as described in any one of claims 1 to 5 are implemented.

8. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, wherein when the computer program is executed by a processor, the steps of a vehicle map representation method for representing a real neighborhood as claimed in any one of claims 1 to 5 are implemented.

Images