Vehicle information processing method and device

By calculating the relationship between vehicle motion distance and distance threshold, the problem of redundancy and missing vehicle information in vehicle-road collaboration server is solved, and the accurate storage and effective management of information are achieved.

CN111862599BActive Publication Date: 2024-11-19TENCENT TECHNOLOGY (SHENZHEN) CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202010567766.3
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2020-06-19
Publication Date
2024-11-19
Estimated Expiration
2040-06-19

AI Technical Summary

Technical Problem

When the vehicle-road collaboration server stores vehicle information, it is difficult to identify the vehicle that uploads the information, resulting in repeated storage of information of the same vehicle being mistaken for multiple vehicles, resulting in the problem of information redundancy or missing information.

Method used

By calculating the relationship between the vehicle's motion distance and the distance threshold, it is determined whether to replace the vehicle information stored in the storage space, avoid redundancy and missing, and ensure the accuracy and completeness of the information.

Benefits of technology

It effectively reduces the redundancy and missing rate of vehicle information, ensures the accuracy of stored information, and avoids the problem of old information being discarded in advance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN111862599B_ABST
    Figure CN111862599B_ABST
Patent Text Reader

Abstract

The embodiments of the present application provide a vehicle information processing method and device. The vehicle information processing method includes: obtaining a storage space corresponding to a target geographical area, the storage space being used to receive vehicle information within the target geographical area; if the storage space receives first vehicle information, determining the time interval between the time point when the first vehicle information is received and the time point when the second vehicle information is previously received; calculating the vehicle movement distance corresponding to the time interval based on the first vehicle information and the second vehicle information; determining whether to replace the second vehicle information stored in the storage space with the first vehicle information based on the relationship between the vehicle movement distance and the distance threshold. The technical solution of the embodiments of the present application can effectively process vehicle information and reduce the redundancy and missing rate of vehicle information.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of vehicle-road collaboration and safety assisted driving technology, and more specifically, to a vehicle information processing method and device. Background Art

[0002] Currently, in the field of vehicle-road collaboration, the vehicle-road collaboration server stores the detected vehicle information in a storage space, and each vehicle requests the vehicle information from the storage space of the vehicle-road collaboration server.

[0003] However, on the one hand, most vehicles are in motion, and a unit of storage space stores the information of one vehicle. The VIS server will discard certain information after storing it for a period of time; on the other hand, the VIS server cannot identify the vehicle that uploaded the information. This may cause the VIS server to repeatedly store information of the same vehicle at multiple different locations, thus mistakenly believing that it is information of multiple different vehicles, or to lack information of certain vehicles, thus causing the vehicle requesting information to fail to request valid information, resulting in information redundancy or information missing problems. Therefore, how to process the vehicle information stored in the VIS server to balance information redundancy and missing phenomena is one of the key issues facing VIS. Summary of the invention

[0004] The embodiments of the present application provide a vehicle information processing method and device, which can effectively process vehicle information at least to a certain extent and reduce the redundancy and missing rate of vehicle information.

[0005] Other features and advantages of the present application will become apparent from the following detailed description, or may be learned in part by the practice of the present application.

[0006] According to one aspect of an embodiment of the present application, a vehicle information processing method is provided, including: obtaining a storage space corresponding to a target geographical area, the storage space being used to receive vehicle information within the target geographical area; if the storage space receives first vehicle information, determining the time interval between a time point when the first vehicle information is received and a time point when the second vehicle information was previously received; calculating a vehicle movement distance corresponding to the time interval based on the first vehicle information and the second vehicle information; and determining whether to replace the second vehicle information stored in the storage space with the first vehicle information based on a relationship between the vehicle movement distance and a distance threshold.

[0007] According to one aspect of an embodiment of the present application, a vehicle information processing device is provided, including: an acquisition unit, configured to acquire a storage space corresponding to a target geographical area, the storage space being used to receive vehicle information within the target geographical area; a first determination unit, configured to determine the time interval between a time point when the first vehicle information is received and a time point when the second vehicle information is previously received if the storage space receives the first vehicle information; a calculation unit, configured to calculate a vehicle movement distance corresponding to the time interval based on the first vehicle information and the second vehicle information; and a second determination unit, configured to determine whether to replace the second vehicle information stored in the storage space with the first vehicle information based on a relationship between the vehicle movement distance and a distance threshold.

[0008] In some embodiments of the present application, based on the aforementioned scheme, the target geographical area includes multiple geographical grids, and the second determination unit is further configured to: determine the geographical grid where the vehicle sending the first vehicle information is located according to the position information in the first vehicle information, and determine the geographical grid where the vehicle sending the second vehicle information is located according to the position information in the second vehicle information; calculate the distance value between the geographical grid where the vehicle sending the first vehicle information is located and the geographical grid where the vehicle sending the second vehicle information is located, to obtain the distance threshold.

[0009] In some embodiments of the present application, based on the aforementioned scheme, the second determination unit is further configured to: calculate the distance values ​​between each pair of geographic grids in the multiple geographic grids included in the target geographic area to obtain at least one distance value; and average the sum of the at least one distance value to obtain the distance threshold.

[0010] In some embodiments of the present application, based on the aforementioned scheme, the target geographical area includes multiple geographical grids; the second determination unit is further configured as: if the vehicle movement distance is greater than the distance threshold, then when the storage space occupancy rate corresponding to the geographical grid where the vehicle sending the first vehicle information is located is greater than or equal to a first random number, the first vehicle information is used to replace the second vehicle information stored in the storage space; if the vehicle movement distance is less than or equal to the distance threshold, then when the ratio of the vehicle movement distance to the distance threshold is greater than or equal to a second random number, and the storage space occupancy rate corresponding to the geographical grid where the vehicle sending the first vehicle information is located is greater than or equal to the first random number, the first vehicle information is used to replace the second vehicle information stored in the storage space.

[0011] In some embodiments of the present application, based on the aforementioned scheme, the second determination unit includes: an acquisition subunit, configured to acquire the vehicle density corresponding to each geographic grid to obtain multiple vehicle densities; a first calculation subunit, configured to calculate the ratio between the vehicle density corresponding to the geographic grid where the vehicle sending the first vehicle information is located and the sum of the multiple vehicle densities, and use the ratio as the storage space occupancy corresponding to the geographic grid where the vehicle sending the first vehicle information is located.

[0012] In some embodiments of the present application, based on the aforementioned scheme, the acquisition subunit is configured to: obtain the vehicle flow and regional area corresponding to each geographic grid; calculate the ratio of the vehicle flow to the regional area, and use the ratio as the vehicle density of each geographic grid to obtain the multiple vehicle densities.

[0013] In some embodiments of the present application, based on the aforementioned scheme, the calculation unit is configured to: calculate the vehicle movement distance corresponding to the time interval based on the vehicle speed information and driving direction angle information in the first vehicle information, and the vehicle speed information and driving direction angle information in the second vehicle information.

[0014] In some embodiments of the present application, based on the aforementioned scheme, the second determination unit also includes: a determination subunit, configured to determine that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are not the same vehicle if the vehicle movement distance is greater than the distance threshold; a second calculation subunit, configured to calculate the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles if the vehicle movement distance is less than or equal to the distance threshold.

[0015] In some embodiments of the present application, based on the aforementioned scheme, the second calculation subunit is further configured to: use the ratio of the vehicle movement distance to the distance threshold as the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles.

[0016] In the technical solutions provided by some embodiments of the present application, since the vehicle-road cooperative server cannot identify the vehicle that sends the vehicle information, this may cause the vehicle-road cooperative server to repeatedly store the vehicle information of the same vehicle at multiple different locations, and mistakenly believe that this is the vehicle information of multiple different vehicles, resulting in information redundancy. Therefore, in order to avoid this problem, it is usually required that the vehicle movement distance of the same vehicle in the time interval between two adjacent vehicle information received in the storage space must be less than the distance threshold, otherwise, the same vehicle will be mistaken for two vehicles with a high probability. The technical solution of the embodiment of the present application is to determine whether to replace the second vehicle information stored in the storage space with the first vehicle information based on the relationship between the vehicle movement distance and the distance threshold in the time interval between the time point of receiving the first vehicle information and the time point of the second vehicle information received last time. In this way, the vehicle information is processed by judging the relationship between the vehicle movement distance and the distance threshold, taking into account the situation where multiple vehicle information of the same vehicle appears, which can effectively reduce the redundancy of the vehicle information. At the same time, the vehicle information is stored by replacement, which avoids the problem that the new vehicle information has not been uploaded and the old vehicle information has been discarded, which can effectively reduce the information loss rate.

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

[0018] The drawings herein are incorporated into the specification and constitute a part of the specification, showing embodiments consistent with the present application, and together with the specification, are used to explain the principles of the present application. Obviously, the drawings described below are only some embodiments of the present application, and for ordinary technicians in this field, other drawings can be obtained based on these drawings without creative work. In the drawings:

[0019] Figure 1 A schematic diagram showing an exemplary system architecture to which the technical solution of the embodiments of the present application can be applied;

[0020] Figure 2 A flow chart showing a vehicle information processing method according to an embodiment of the present application is shown;

[0021] Figure 3 A flow chart showing a vehicle information processing method according to an embodiment of the present application is shown;

[0022] Figure 4 A flow chart showing a vehicle information processing method according to an embodiment of the present application is shown;

[0023] Figure 5A flow chart showing a vehicle information processing method according to an embodiment of the present application is shown;

[0024] Figure 6 A flow chart showing a vehicle information processing method according to an embodiment of the present application is shown;

[0025] Figure 7 A flow chart showing a vehicle information processing method according to an embodiment of the present application is shown;

[0026] Figure 8 A flow chart showing a vehicle information processing method according to an embodiment of the present application is shown;

[0027] Fig. 9 A block diagram of a vehicle information processing device according to an embodiment of the present application is shown;

[0028] Fig.10 A schematic diagram of the structure of a computer system suitable for implementing an electronic device of an embodiment of the present application is shown. DETAILED DESCRIPTION

[0029] Example embodiments will now be described more fully with reference to the accompanying drawings. However, example embodiments can be implemented in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this application will be more comprehensive and complete and fully convey the concept of example embodiments to those skilled in the art.

[0030] In addition, described feature, structure or characteristic can be combined in one or more embodiments in any suitable manner. In the following description, many specific details are provided to provide a full understanding of the embodiments of the present application. However, those skilled in the art will appreciate that the technical scheme of the present application can be put into practice without one or more of the specific details, or other methods, components, devices, steps, etc. can be adopted. In other cases, known methods, devices, realizations or operations are not shown or described in detail to avoid blurring the various aspects of the application.

[0031] The block diagrams shown in the accompanying drawings are merely functional entities and do not necessarily correspond to physically independent entities. That is, these functional entities may be implemented in software form, or in one or more hardware modules or integrated circuits, or in different networks and / or processor devices and / or microcontroller devices.

[0032] The flowcharts shown in the accompanying drawings are only exemplary 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 can be decomposed, and some operations / steps can be combined or partially combined, so the actual execution order may change according to actual conditions.

[0033] It should be understood that in the present application, "at least one (item)" means one or more, and "plurality" means two or more. "And / or" is used to describe the association relationship of associated objects, indicating that three relationships may exist. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally indicates that the objects associated before and after are in an "or" relationship. "At least one of the following" or similar expressions refers to any combination of these items, including any combination of single or plural items. For example, at least one of a, b or c can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, c can be single or multiple.

[0034] First, the nouns involved in the embodiments of the present application are introduced:

[0035] Vehicle Infrastructure Cooperative Systems (IVICS) is a development direction of Intelligent Transportation Systems (ITS). The IVICS uses advanced wireless communications and new generation Internet technologies to implement all-round dynamic real-time information interaction between vehicles and roads, and conducts active vehicle safety control and road cooperative management based on the collection and integration of dynamic traffic information in all time and space, fully realizing the effective coordination of people, vehicles and roads, ensuring traffic safety, and improving traffic efficiency, thus forming a safe, efficient and environmentally friendly road traffic system.

[0036] The method provided in this application can be applied to Internet of Things systems such as Internet of Vehicles, Intelligent Transportation Systems, Vehicle-Road Collaboration Systems, and Safety Assisted Driving Systems. The method provided in this application can also be applied to products such as automotive cloud, Internet of Vehicles, Vehicle-Road Collaboration, Safety Assisted Driving, and Autonomous Driving. For example, the exemplary embodiments provided below in this application are applied to vehicle-road collaborative systems as an example.

[0037] Figure 1 A schematic diagram of a vehicle-road cooperative system architecture to which the technical solution of an embodiment of the present application can be applied is shown.

[0038] like Figure 1 As shown, the vehicle-road cooperative system 100 may include a vehicle 101, a vehicle-road cooperative server 102, and a roadside device 103. The vehicle 101 and the vehicle-road cooperative server 102 may be connected via a network, the vehicle-road cooperative server 102 may be connected via a network and the roadside device 103, and the vehicle 101 may also communicate with the roadside device 103.

[0039] The roadside equipment 103 (Road Side Unit, RSU) can be used to complete the task of sensing the surrounding environment of the area where the vehicle 101 is located. The roadside equipment 103 is a device installed on the side of the road and has a sensing function. The roadside equipment 103 can be a camera, a roadside radar, a roadside sensing unit, a pressure sensor, a temperature sensor, etc. Exemplarily, the roadside equipment 103 can provide road condition information for the vehicle-road cooperative system. The road condition information includes at least one of the real-time status information of traffic lights, traffic signs, vehicle distance information, road video information, vehicle pictures, vehicle license plates, vehicle driving status, and real-time road condition information. For example, the road condition information can be, traffic signs: speed limit signs, instruction signs; vehicle license plates: vehicle license plates are identified based on the camera; vehicle driving status: a vehicle is driving from east to west at a speed of 1 kilometer per hour; real-time road condition information: there are too many vehicles on a certain road section and the driving speed is too slow, which is a congested road section.

[0040] The vehicle-road cooperative server 102 is the control center of the vehicle-road cooperative system, and has at least one of the following functions: managing information in the vehicle-road cooperative system, assigning tasks to the vehicle 101 and the roadside equipment 103, scheduling resources of the vehicle-road cooperative system, and coordinating the work of the vehicle-road cooperative system. Exemplarily, the vehicle-road cooperative server 102 can provide the vehicle 101 with vehicle information of the vehicle-road cooperative system, and the vehicle information includes: the total number of vehicles, vehicle performance, vehicle motion parameters, etc. The vehicle-road cooperative server 102 is the executor of the technical solution of the embodiment of the present application.

[0041] An on-board unit (OBU) is provided inside the vehicle 101, and the on-board unit can receive the vehicle-road cooperative information acquired by the roadside device 103 through the vehicle wireless communication technology. The on-board unit mainly realizes data transmission with the roadside device 103 based on the V2X technology (vehicle to X; information exchange between vehicles and the outside world). A processing module can be provided inside the on-board unit.

[0042] V2X (Vehicle to X) communication technology is a key technology for future intelligent transportation systems. It enables real-time communication between vehicles, vehicles and base stations, base stations and base stations, and vehicles and roadside equipment, thereby obtaining a series of vehicle-road traffic information related to vehicle-road collaboration, such as real-time road conditions, road information, and pedestrian information, thereby improving driving safety, reducing congestion, improving traffic efficiency, and providing in-vehicle entertainment information.

[0043] It should be understood that Figure 1The number of vehicles 101, vehicle-road cooperative server 102, and roadside equipment 103 in the figure is only for illustration. According to the implementation requirements, there may be any number of vehicles 101, vehicle-road cooperative server 102, and roadside equipment 103. For example, the vehicle-road cooperative server 102 may be a server cluster composed of multiple servers.

[0044] In one embodiment of the present application, the vehicle-road cooperative server 102 can obtain a storage space corresponding to the target geographical area, which is a space in the vehicle-road cooperative server 102 used to store vehicle information of the target geographical area. If the storage space corresponding to the target geographical area in the vehicle-road cooperative server 102 receives the first vehicle information sensed by the roadside device 103, the vehicle-road cooperative server 102 can determine the time interval between the time point when the first vehicle information is received and the time point when the second vehicle information was previously received, and calculate the vehicle movement distance corresponding to the time interval based on the first vehicle information and the second vehicle information. After calculating the vehicle movement distance, the vehicle-road cooperative server 102 can determine whether to replace the second vehicle information stored in the storage space with the first vehicle information based on the relationship between the vehicle movement distance and the distance threshold.

[0045] It should be noted that the vehicle information processing method provided in the embodiment of the present application can be executed by the vehicle-road cooperative server 102, and accordingly, the vehicle information processing device can be set in the vehicle-road cooperative server 102. However, in other embodiments of the present application, the vehicle 101 can also have similar functions to the server, so as to execute the vehicle information processing solution provided in the embodiment of the present application.

[0046] It should be noted that this specification provides method operation steps as described in the embodiments or flow charts, but more or fewer operation steps may be included based on conventional or non-creative labor. The order of steps listed in the embodiments is only one way of executing the order of many steps and does not represent the only execution order. When the system or product in practice is executed, it can be executed in the order of the method shown in the embodiments or the drawings or in parallel (for example, in a parallel processor or multi-threaded processing environment).

[0047] Figure 2 A flowchart of a vehicle information processing method according to an embodiment of the present application is shown. The image processing method can be executed by a server, which can be Figure 1 The vehicle-road cooperative server 102 shown in Figure 2 As shown, the method includes:

[0048] Step S210, obtaining a storage space corresponding to a target geographical area, wherein the storage space is used to receive vehicle information within the target geographical area;

[0049] Step S220: if the storage space receives the first vehicle information, determine the time interval between the time point when the first vehicle information is received and the time point when the second vehicle information is previously received;

[0050] Step S230, calculating the vehicle movement distance corresponding to the time interval according to the first vehicle information and the second vehicle information;

[0051] Step S240: Determine whether to replace the second vehicle information stored in the storage space with the first vehicle information according to the relationship between the vehicle movement distance and the distance threshold.

[0052] These steps are described in detail below.

[0053] In step S210, a storage space corresponding to a target geographical area is obtained, where the storage space is used to receive vehicle information within the target geographical area.

[0054] Specifically, the storage space corresponding to the target geographical area is a space used to store vehicle information within the target geographical area. The execution entity can obtain the storage space corresponding to the target geographical area and use the storage space to store vehicle information within the target geographical area. That is to say, when a vehicle passes through the target geographical area, the vehicle information can be sent to the storage space corresponding to the target geographical area for storage.

[0055] The vehicle information within the target geographical area refers to the relevant information of the vehicles located within the target geographical area. The roadside equipment installed in the target geographical area can collect vehicle information and send the vehicle information to the vehicle-road cooperative server as the executor. The vehicles within the target geographical area can also send their own vehicle information to the vehicle-road cooperative server. The vehicle information can be all information related to the vehicle, which may include vehicle distance information, vehicle positioning position information, vehicle pictures, vehicle license plates, vehicle driving status (vehicle speed, vehicle driving direction), vehicle driver information, and at least one of the vehicle types.

[0056] It should be noted that the storage space corresponding to the target geographic area refers to the unit storage space, which is the space required to store the information of one vehicle. The size of the unit storage space is related to the size of the vehicle information to be stored. The unit storage space stores the vehicle information of one vehicle at a time, and the vehicle information of multiple vehicles in the target geographic area cannot be stored in the unit storage space at the same time.

[0057] Step S220: If the storage space receives the first vehicle information, determine the time interval between the time point when the first vehicle information is received and the time point when the second vehicle information was previously received.

[0058] Specifically, the executing entity can obtain vehicle information from the roadside equipment. Therefore, if the storage space receives the first vehicle information, the executing entity can determine the time interval between the time point when the first vehicle information is received and the time point when the second vehicle information was received previously. That is, the executing entity can determine the time interval between two adjacent receipts of vehicle information based on the time point when the storage space receives the first vehicle information and receives the second vehicle information.

[0059] Step S230: Calculate the vehicle movement distance corresponding to the time interval according to the first vehicle information and the second vehicle information.

[0060] It can be understood that the second vehicle information is information received and stored in the storage space before the storage space receives the first vehicle information, that is, the first vehicle information and the second vehicle information are information received twice adjacently. When the execution subject receives two adjacent vehicle information in the storage space, it can calculate the vehicle movement distance in the time interval between the two adjacent vehicle information, that is, the first vehicle information and the second vehicle information.

[0061] In one embodiment, the vehicle movement distance may be calculated based on the motion equation according to the first vehicle information and the second vehicle information. In this embodiment, step S230 specifically includes:

[0062] The vehicle movement distance corresponding to the time interval is calculated based on the vehicle speed information and the driving direction angle information in the first vehicle information and the vehicle speed information and the driving direction angle information in the second vehicle information.

[0063] In this embodiment, the execution entity can obtain the vehicle speed information and driving direction angle information in the first vehicle information, as well as the vehicle speed information and driving direction angle information in the second vehicle information, and identify the vehicle speed information and driving direction angle information in the second vehicle information as the vehicle speed and driving direction angle of vehicle A before the time interval, and identify the vehicle speed information and driving direction angle information in the first vehicle information as the vehicle speed and driving direction angle of vehicle A after the time interval, thereby using the basic motion equation to calculate the vehicle movement distance of vehicle A within the time interval.

[0064] It should be noted that vehicle A is a hypothetical vehicle for calculating the vehicle movement distance and does not actually represent any specific vehicle in the embodiments of the present application.

[0065] Step S240: Determine whether to replace the second vehicle information stored in the storage space with the first vehicle information according to the relationship between the vehicle movement distance and the distance threshold.

[0066] In the field of vehicle-road collaboration, the vehicle-road collaboration server can store the received vehicle information in the storage space. However, the vehicle-road collaboration server cannot identify the vehicle that sent the vehicle information. This may cause the vehicle-road collaboration server to repeatedly store the vehicle information of the same vehicle at multiple different locations, and mistakenly believe that this is the vehicle information of multiple different vehicles, resulting in information redundancy problems. Therefore, in order to avoid this problem, it is usually required that the vehicle movement distance of the same vehicle in the time interval between two adjacent vehicle information received in the storage space must be less than the distance threshold, otherwise, the same vehicle will be mistaken for two vehicles with a high probability. Among them, the distance threshold can be set according to the actual situation, and the embodiment of the present application is not specifically limited here.

[0067] Specifically in this step, after the first vehicle information and the second vehicle information are received in the storage space, the vehicle movement distance within the time interval for receiving the first vehicle information and the second vehicle information can be calculated. It is easy to understand that in the vehicle-road cooperative system, the vehicle movement distance of the same vehicle within the time interval between two adjacent vehicle information received in the storage space must be less than the distance threshold. However, in actual situations, the vehicle sending the first vehicle information and the vehicle sending the second vehicle information may be the same vehicle or different vehicles. Therefore, the vehicle movement distance calculated in step S230 and the distance threshold may have a relationship that the vehicle movement distance is greater than the distance threshold, or the vehicle movement distance is equal to the distance threshold, or the vehicle movement distance is less than the distance threshold. Therefore, the execution entity can determine whether to replace the second vehicle information stored in the storage space with the first vehicle information based on the relationship between the vehicle movement distance and the distance threshold.

[0068] In one embodiment, because in the vehicle-road cooperative system, the vehicle movement distance of the same vehicle within the time interval between two adjacent vehicle information received in the storage space must be less than the distance threshold, therefore, if the vehicle movement distance is greater than the distance threshold, it means that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are definitely not the same vehicle. Therefore, the first vehicle information can be used to replace the second vehicle information stored in the storage space. In this way, it can be ensured that the vehicle information stored in the storage space is not redundant, and the vehicle information can be stored in a replacement manner to avoid the problem of new vehicle information not being uploaded and the old vehicle information being discarded, thereby causing information missing.

[0069] The technical solution of the above embodiment determines whether to replace the second vehicle information stored in the storage space with the first vehicle information according to the relationship between the vehicle movement distance and the distance threshold. In this way, by judging whether to replace the information according to the relationship between the vehicle movement distance and the distance threshold, it can reduce the information redundancy caused by storing the same vehicle information multiple times in the storage space, and at the same time, by storing the vehicle information in a replacement manner, it can also reduce the information missing rate, avoiding the problem that the new vehicle information has not been uploaded and the old vehicle information has been discarded.

[0070] In one embodiment of the present application, the target geographical area may be divided into a plurality of geographical grids, a geographical grid being a small geographical area, and the vehicle is located in the geographical grid of the target geographical area, and the vehicle information corresponding to the vehicle in the corresponding geographical grid will be sent to the storage space corresponding to the target geographical area. Therefore, in one embodiment, the distance threshold may be determined directly according to the geographical grid, such as Figure 3 As shown, in this embodiment, steps S310 to S320 are also included, which are described in detail as follows:

[0071] Step S310: Determine the geographical grid where the vehicle sending the first vehicle information is located based on the position information in the first vehicle information, and determine the geographical grid where the vehicle sending the second vehicle information is located based on the position information in the second vehicle information.

[0072] As mentioned above, the vehicle information may include location information, which may be represented by GPS coordinates. Therefore, the executing entity may determine the geographic grid where the vehicle sending the first vehicle information is located based on the location information in the first vehicle information, and determine the geographic grid where the vehicle sending the second vehicle information is located based on the location information in the second vehicle information.

[0073] Step S320: Calculate the distance value between the geographical grid where the vehicle sending the first vehicle information is located and the geographical grid where the vehicle sending the second vehicle information is located to obtain the distance threshold.

[0074] After determining the geographical grid where the vehicle sending the first vehicle information is located and the geographical grid where the vehicle sending the second vehicle information is located, the distance value between the two geographical grids may be calculated, and the calculated distance is used as the distance threshold.

[0075] Among them, calculating the distance value between two geographic grids can be calculating the distance value between the geographic centers of the two geographic grids, or calculating the distance value between the northernmost point of one geographic grid and the northernmost point of another geographic grid, or other calculation methods, which are not specifically limited in the embodiments of the present application.

[0076] In one embodiment of the present application, the target geographical area may be divided into multiple geographical grids, and the distance threshold may be directly calculated based on the multiple geographical grids. In this embodiment, Figure 4 As shown, the method further includes steps S410 to S420, which are described in detail as follows:

[0077] Step S410: Calculate the distance value between any two geographic grids in the plurality of geographic grids included in the target geographic area to obtain at least one distance value.

[0078] The target geographical area includes multiple geographical grids, and at least one distance value can be obtained by calculating the distance values ​​between two geographical grids.

[0079] Among them, the method for calculating the distance value between each pair of geographic grids can be to calculate the distance value between the geographic centers of each pair of geographic grids, or to calculate the distance value between the northernmost point of one geographic grid and the northernmost point of another geographic grid, or other calculation methods, which are not specifically limited in the embodiments of the present application.

[0080] Step S420: average the sum of the at least one distance value to obtain the distance threshold.

[0081] After calculating and obtaining at least one distance value, the sum of the at least one distance value may be averaged to obtain an average value, and the average value is used as the distance threshold.

[0082] In one embodiment of the present application, the vehicle-road cooperative server as the execution subject can determine the storage space occupancy rate corresponding to each geographic grid. The storage space occupancy rate can be understood as the probability of being stored in the storage space. In other words, the larger the storage space occupancy rate corresponding to a geographic grid, the greater the probability that the vehicle information of the geographic grid is stored in the storage space. Therefore, when determining whether to use the first vehicle information to replace the second vehicle information, it can be further determined according to the storage space occupancy rate corresponding to each geographic grid, such as Figure 5 As shown, step S240 specifically includes steps S2401 and S2402, which are described in detail as follows:

[0083] Step S2401: If the vehicle movement distance is greater than the distance threshold, when the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located is greater than or equal to a first random number, the first vehicle information is used to replace the second vehicle information stored in the storage space.

[0084] Specifically, when the vehicle-road cooperative server determines that the vehicle movement distance is greater than the distance threshold, it can randomly generate a first random number ξ according to the uniform distribution U(0,1). 1, and the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located is greater than or equal to the first random number ξ 1 When the first vehicle information is used to replace the second vehicle information stored in the storage space.

[0085] On the contrary, if the vehicle-road cooperative server determines that the vehicle movement distance is greater than the distance threshold, it further determines that the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located is less than the first random number ξ 1 , the first vehicle information can be discarded.

[0086] Step S2402: If the vehicle movement distance is less than or equal to the distance threshold, then when the ratio of the vehicle movement distance to the distance threshold is greater than or equal to a second random number, and the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located is greater than or equal to the first random number, the first vehicle information is used to replace the second vehicle information stored in the storage space.

[0087] Here, if the vehicle-road cooperative server determines that the vehicle movement distance is less than or equal to the distance threshold, it can randomly generate a second random number ξ according to the uniform distribution U(0,1) 2 , and when the ratio of the vehicle movement distance to the distance threshold is greater than or equal to the second random number ξ 2 , and the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located is greater than or equal to the first random number ξ 1 When the first vehicle information is used to replace the second vehicle information stored in the storage space.

[0088] On the contrary, if the vehicle-road cooperative server determines that the vehicle movement distance is less than or equal to the distance threshold, it further determines that the ratio of the vehicle movement distance to the distance threshold is greater than or equal to the second random number ξ 2 , but the storage space occupancy rate of the geographic grid corresponding to the vehicle sending the first vehicle information is less than the first random number ξ 1 , the first vehicle information is discarded.

[0089] However, if the vehicle-road cooperative server determines that the vehicle movement distance is less than or equal to the distance threshold, and further determines that the ratio of the vehicle movement distance to the distance threshold is less than the second random number ξ 2In this case, the first vehicle information can be used to replace the second vehicle information stored in the storage space. This is because in this case, the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle located in the same geographic grid, and the storage space occupancy corresponding to the same geographic grid is the same. However, considering the real-time nature of the information, the new first vehicle information can replace the old second vehicle information.

[0090] In one embodiment of the present application, if the storage space occupancy rate corresponding to a geographic grid is large, the probability that the vehicle information of the geographic grid is stored in the storage space is large, and the storage space occupancy rate corresponding to the geographic grid can be determined according to the vehicle density of the geographic grid, such as Figure 6 As shown, the method further includes steps S610 to S620, which are described in detail as follows:

[0091] Step S610: Obtain the vehicle density corresponding to each geographic grid to obtain multiple vehicle densities.

[0092] Since the vehicles are in the geographic grid, each geographic grid must have a corresponding vehicle density. The vehicle density is a quantity used to measure the number of vehicles. The number of vehicles in each geographic grid is different, so the vehicle density corresponding to each geographic grid can be obtained to obtain multiple vehicle densities.

[0093] For the convenience of description, multiple geographic grids can be denoted as c 1 ,c 2 ,c 3 ,.....,c n , n represents the number of geographic grids, and the vehicle density corresponding to each geographic grid is denoted as ρ 1 ,ρ 2 ,ρ 3 ,.....,ρ n .

[0094] Step S620: Calculate the ratio of the vehicle density corresponding to the geographic grid where the vehicle sending the first vehicle information is located to the sum of the multiple vehicle densities, and use the ratio as the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located.

[0095] In order to calculate the storage space occupancy rate corresponding to the geographical grid where the vehicle sending the first vehicle information is located, the ratio between the geographical grid where the vehicle sending the first vehicle information is located and the sum of multiple vehicle densities can be calculated, and the calculated ratio can be used as the storage space occupancy rate corresponding to the geographical grid where the vehicle sending the first vehicle information is located.

[0096] Assume that the geographic grid where the vehicle sending the first vehicle information is located is ck , geographic grid c k The corresponding vehicle density is ρ k , the storage space occupancy w corresponding to the geographic grid where the vehicle sending the first vehicle information is located can be calculated k =ρ k / (ρ 1 +ρ 2 +ρ 3 +....+ρ n ).

[0097] In one embodiment of the present application, the vehicle density can be obtained based on the vehicle flow and area of ​​the geographic grid, such as Figure 7 As shown, step S610 specifically includes steps S6101 and S6102, which are described in detail as follows:

[0098] Step S6101, obtaining the vehicle flow and area corresponding to each geographic grid;

[0099] Step S6102: Calculate the ratio of the vehicle flow to the area of ​​the region, and use the ratio as the vehicle density of each geographic grid to obtain the multiple vehicle densities.

[0100] In this embodiment, the execution entity can obtain the vehicle flow and regional area corresponding to each geographical grid through the roadside equipment, and calculate the ratio of the vehicle flow to the regional area to obtain the vehicle density of each geographical grid.

[0101] In one embodiment of the present application, Figure 8 As shown, the method further includes steps S810 to S820, which are described in detail as follows:

[0102] Step S810: If the vehicle movement distance is greater than the distance threshold, it is determined that the vehicle sending the first vehicle information is not the same vehicle as the vehicle sending the second vehicle information.

[0103] As mentioned above, in the field of vehicle-road collaboration, the vehicle-road collaboration server can store the received vehicle information in the storage space. However, the vehicle-road collaboration server cannot identify the vehicle that sent the vehicle information. This may cause the vehicle-road collaboration server to repeatedly store the vehicle information of the same vehicle at multiple different locations, and mistakenly believe that this is the vehicle information of multiple different vehicles, resulting in information redundancy. Therefore, in order to avoid this problem, it is usually required that the vehicle movement distance of the same vehicle in the time interval between two adjacent vehicle information received in the storage space must be less than the distance threshold, otherwise, the same vehicle will be mistaken for two vehicles with a high probability.

[0104] Therefore, if the vehicle movement distance is greater than the distance threshold, it can be determined that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are not the same vehicle.

[0105] Step S820: If the vehicle movement distance is less than or equal to the distance threshold, calculate the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles.

[0106] If the vehicle movement distance is greater than the distance threshold, it can be determined that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are not the same vehicle. On the contrary, if the vehicle movement distance is less than or equal to the distance threshold, the vehicle sending the first vehicle information and the vehicle sending the second vehicle information may be the same vehicle or may not be the same vehicle. In this case, the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles can be calculated.

[0107] In one embodiment, calculating the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles includes:

[0108] The ratio of the vehicle movement distance to the distance threshold is used as the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles.

[0109] It should be explained that if the vehicle movement distance is less than or equal to the distance threshold, the vehicle sending the first vehicle information and the vehicle sending the second vehicle information may be the same vehicle or may not be the same vehicle. In this case, if the driving direction angle of the vehicle sending the first vehicle information is θ current , the driving direction angle of the vehicle sending the second vehicle information is θ past , then the vehicle sending the first vehicle information is equally likely to appear in a circle with the position of the vehicle sending the second vehicle information as the center and the angle difference as θ current -θ past In the fan-shaped area with an angle of |, the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles is the ratio of the vehicle movement distance to the distance threshold.

[0110] In order to verify the effect brought by the embodiment of the present application, the ratio of the vehicle information missing rate between the prior art and the technical solution of the embodiment of the present application, as well as the ratio of the vehicle information redundancy between the prior art and the technical solution of the embodiment of the present application were further statistically analyzed through experiments. As shown in Table 1, the experiment was repeated 10 times in total. The experimental results show that the vehicle information missing rate and vehicle information redundancy of the prior art are greater than the vehicle information missing rate and redundancy of the present application. The technical solution of the embodiment of the present application can effectively reduce the missing rate and redundancy of vehicle information.

[0111]

[0112] Table 1

[0113] The following describes an apparatus embodiment of the present application, which can be used to execute the vehicle information processing method in the above-mentioned embodiment of the present application. For details not disclosed in the apparatus embodiment of the present application, please refer to the above-mentioned embodiment of the vehicle information processing method of the present application.

[0114] Fig. 9 A block diagram of a vehicle information processing device according to an embodiment of the present application is shown, referring to Fig. 9 As shown, a vehicle information processing device 900 according to an embodiment of the present application includes: an acquisition unit 902 , a first determination unit 904 , a calculation unit 906 and a second determination unit 908 .

[0115] Among them, the acquisition unit 902 is configured to acquire the storage space corresponding to the target geographical area, and the storage space is used to receive the vehicle information within the target geographical area; the first determination unit 904 is configured to determine the time interval between the time point when the first vehicle information is received and the time point when the second vehicle information was previously received if the storage space receives the first vehicle information; the calculation unit 906 is configured to calculate the vehicle movement distance corresponding to the time interval based on the first vehicle information and the second vehicle information; the second determination unit 908 is configured to determine whether to replace the second vehicle information stored in the storage space with the first vehicle information based on the relationship between the vehicle movement distance and the distance threshold.

[0116] In some embodiments of the present application, the target geographical area includes multiple geographical grids, and the second determination unit 908 is further configured to: determine the geographical grid where the vehicle sending the first vehicle information is located based on the location information in the first vehicle information, and determine the geographical grid where the vehicle sending the second vehicle information is located based on the location information in the second vehicle information; calculate the distance value between the geographical grid where the vehicle sending the first vehicle information is located and the geographical grid where the vehicle sending the second vehicle information is located, to obtain the distance threshold.

[0117] In some embodiments of the present application, the second determination unit 908 is further configured to: calculate the distance value between each pair of the multiple geographic grids included in the target geographic area to obtain at least one distance value; and average the sum of the at least one distance value to obtain the distance threshold.

[0118] In some embodiments of the present application, the target geographical area includes multiple geographical grids; the second determination unit 908 is further configured as: if the vehicle movement distance is greater than the distance threshold, then when the storage space occupancy rate corresponding to the geographical grid where the vehicle sending the first vehicle information is located is greater than or equal to a first random number, the first vehicle information is used to replace the second vehicle information stored in the storage space; if the vehicle movement distance is less than or equal to the distance threshold, then when the ratio of the vehicle movement distance to the distance threshold is greater than or equal to a second random number, and the storage space occupancy rate corresponding to the geographical grid where the vehicle sending the first vehicle information is located is greater than or equal to the first random number, the first vehicle information is used to replace the second vehicle information stored in the storage space.

[0119] In some embodiments of the present application, the second determination unit 908 includes: an acquisition subunit, configured to acquire the vehicle density corresponding to each geographic grid to obtain multiple vehicle densities; a first calculation subunit, configured to calculate the ratio between the vehicle density corresponding to the geographic grid where the vehicle sending the first vehicle information is located and the sum of the multiple vehicle densities, and use the ratio as the storage space occupancy corresponding to the geographic grid where the vehicle sending the first vehicle information is located.

[0120] In some embodiments of the present application, the acquisition subunit is configured to: obtain the vehicle flow and regional area corresponding to each geographic grid; calculate the ratio of the vehicle flow to the regional area, and use the ratio as the vehicle density of each geographic grid to obtain the multiple vehicle densities.

[0121] In some embodiments of the present application, the calculation unit 906 is configured to calculate the vehicle movement distance corresponding to the time interval based on the vehicle speed information and driving direction angle information in the first vehicle information, and the vehicle speed information and driving direction angle information in the second vehicle information.

[0122] In some embodiments of the present application, the second determination unit 908 also includes: a determination subunit, configured to determine that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are not the same vehicle if the vehicle movement distance is greater than the distance threshold; a second calculation subunit, configured to calculate the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles if the vehicle movement distance is less than or equal to the distance threshold.

[0123] In some embodiments of the present application, the second calculation subunit is further configured to: use the ratio of the vehicle movement distance to the distance threshold as the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles.

[0124] Fig.10 A schematic diagram of the structure of a computer system suitable for implementing an electronic device of an embodiment of the present application is shown.

[0125] It should be noted that Fig.10 The computer system 1000 of the electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present application.

[0126] like Fig.10 As shown, the computer system 1000 includes a central processing unit (CPU) 1001, which can perform various appropriate actions and processes according to the program stored in the read-only memory (ROM) 1002 or the program loaded from the storage part 1008 to the random access memory (RAM) 1003, such as executing the method described in the above embodiment. In the RAM 1003, various programs and data required for system operation are also stored. The CPU 1001, the ROM 1002 and the RAM 1003 are connected to each other through the bus 1004. The input / output (I / O) interface 1005 is also connected to the bus 1004.

[0127] The following components are connected to the I / O interface 1005: an input section 1006 including a keyboard, a mouse, etc.; an output section 1007 including a cathode ray tube (CRT), a liquid crystal display (LCD), etc., and a speaker, etc.; a storage section 1008 including a hard disk, etc.; and a communication section 1009 including a network interface card such as a LAN (Local Area Network) card, a modem, etc. The communication section 1009 performs communication processing via a network such as the Internet. A drive 1010 is also connected to the I / O interface 1005 as needed. A removable medium 1011, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, etc., is installed on the drive 1010 as needed so that a computer program read therefrom is installed into the storage section 1008 as needed.

[0128] In particular, according to an embodiment of the present application, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present application includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program includes a computer program for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication section 1009, and / or installed from a removable medium 1011. When the computer program is executed by a central processing unit (CPU) 1001, various functions defined in the system of the present application are executed.

[0129] It should be noted that the computer-readable medium shown in the embodiment of the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, - but not limited to - an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium may be any tangible medium containing or storing a program, which may be used by an instruction execution system, device or device or used in combination with it. In the present application, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, wherein a computer-readable computer program is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than computer-readable storage media, which may send, propagate, or transmit programs for use by or in conjunction with an instruction execution system, apparatus, or device. The computer program contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, etc., or any suitable combination of the above.

[0130] The flowchart and block diagram in the accompanying drawings illustrate the possible architecture, functions and operations of the system, method and computer program product according to various embodiments of the present application. Wherein, each box in the flowchart or block diagram can represent a module, a program segment, or a part of the code, and the above-mentioned module, program segment, or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram or flowchart, and the combination of boxes in the block diagram or flowchart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0131] The units involved in the embodiments described in this application may be implemented by software or hardware, and the units described may also be set in a processor. The names of these units do not, in some cases, constitute limitations on the units themselves.

[0132] As another aspect, the present application also provides a computer-readable medium, which may be included in the electronic device described in the above embodiment; or may exist independently without being assembled into the electronic device. The above computer-readable medium carries one or more programs, and when the above one or more programs are executed by an electronic device, the electronic device implements the method described in the above embodiment.

[0133] It should be noted that, although several modules or units of the equipment for action execution are mentioned in the above detailed description, this division is not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more modules or units described above can be embodied in one module or unit. On the contrary, the features and functions of one module or unit described above can be further divided into being embodied by multiple modules or units.

[0134] Through the description of the above implementation methods, it is easy for those skilled in the art to understand that the example implementation methods described here can be implemented by software or by combining software with necessary hardware. Therefore, the technical solution according to the implementation methods of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a USB flash drive, a mobile hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the implementation methods of the present application.

[0135] Those skilled in the art will readily appreciate other embodiments of the present application after considering the specification and practicing the embodiments disclosed herein. The present application is intended to cover any variations, uses or adaptations of the present application, which follow the general principles of the present application and include common knowledge or customary technical means in the art that are not disclosed in the present application.

[0136] It should be understood that the present application is not limited to the precise structures that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present application is limited only by the appended claims.

Claims

1. A vehicle information processing method, It is characterized in that The method comprises: Acquire a storage space corresponding to a target geographical area, wherein the storage space is used to receive vehicle information within the target geographical area; If the storage space receives the first vehicle information, determining the time interval between the time point when the first vehicle information is received and the time point when the second vehicle information is previously received; Calculating the vehicle movement distance corresponding to the time interval according to the first vehicle information and the second vehicle information; wherein the vehicle information includes at least one of position information and vehicle driving state information; According to the relationship between the vehicle movement distance and the distance threshold, it is determined whether to replace the second vehicle information stored in the storage space with the first vehicle information.

2. The method according to claim 1, It is characterized in that The target geographical area includes a plurality of geographical grids, and the method further includes: Determine the geographical grid where the vehicle sending the first vehicle information is located according to the position information in the first vehicle information, and determine the geographical grid where the vehicle sending the second vehicle information is located according to the position information in the second vehicle information; The distance value between the geographical grid where the vehicle sending the first vehicle information is located and the geographical grid where the vehicle sending the second vehicle information is located is calculated to obtain the distance threshold.

3. The method according to claim 1, It is characterized in that The method further comprises: Calculate the distance value between any two geographic grids in the target geographic area to obtain at least one distance value; The sum of the at least one distance value is averaged to obtain the distance threshold.

4. The method according to claim 1, It is characterized in that The target geographical area includes a plurality of geographical grids; Determining whether to replace the second vehicle information stored in the storage space with the first vehicle information according to the relationship between the vehicle movement distance and the distance threshold includes: If the vehicle movement distance is greater than the distance threshold, then when the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located is greater than or equal to a first random number, the first vehicle information is used to replace the second vehicle information stored in the storage space; If the vehicle movement distance is less than or equal to the distance threshold, then when the ratio of the vehicle movement distance to the distance threshold is greater than or equal to a second random number, and the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located is greater than or equal to the first random number, the first vehicle information is used to replace the second vehicle information stored in the storage space.

5. The method according to claim 4, It is characterized in that The method further comprises: Obtain the vehicle density corresponding to each geographic grid to obtain multiple vehicle densities; The ratio between the vehicle density corresponding to the geographic grid where the vehicle sending the first vehicle information is located and the sum of the multiple vehicle densities is calculated, and the ratio is used as the storage space occupancy rate corresponding to the geographic grid where the vehicle sending the first vehicle information is located.

6. The method according to claim 5, It is characterized in that Get the vehicle density corresponding to each geographic grid and obtain multiple vehicle densities, including: Obtaining the traffic volume and area corresponding to each geographic grid; The ratio of the vehicle flow to the area of ​​the region is calculated, and the ratio is used as the vehicle density of each geographic grid to obtain the multiple vehicle densities.

7. The method according to claim 1, It is characterized in that Calculating the vehicle movement distance corresponding to the time interval according to the first vehicle information and the second vehicle information includes: The vehicle movement distance corresponding to the time interval is calculated based on the vehicle speed information and the driving direction angle information in the first vehicle information and the vehicle speed information and the driving direction angle information in the second vehicle information.

8. The method according to claim 1, It is characterized in that The method further comprises: If the vehicle movement distance is greater than the distance threshold, it is determined that the vehicle sending the first vehicle information is not the same vehicle as the vehicle sending the second vehicle information; If the vehicle movement distance is less than or equal to the distance threshold, the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles is calculated.

9. The method according to claim 8, It is characterized in that Calculating the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles, including: The ratio of the vehicle movement distance to the distance threshold is used as the probability that the vehicle sending the first vehicle information and the vehicle sending the second vehicle information are the same vehicle or different vehicles.

10. A vehicle information processing device, It is characterized in that The device comprises: An acquisition unit configured to acquire a storage space corresponding to a target geographical area, wherein the storage space is used to receive vehicle information within the target geographical area; a first determining unit configured to determine, if the storage space receives the first vehicle information, a time interval between a time point at which the first vehicle information is received and a time point at which the second vehicle information is previously received; A calculation unit, configured to calculate the vehicle movement distance corresponding to the time interval according to the first vehicle information and the second vehicle information; wherein the vehicle information includes at least one of position information and vehicle driving state information; The second determination unit is configured to determine whether to replace the second vehicle information stored in the storage space with the first vehicle information according to the relationship between the vehicle movement distance and the distance threshold.

11. An electronic device, It is characterized in that Include: one or more processors; A storage device for storing one or more computer programs, which, when executed by the one or more processors, enables the electronic device to implement the method described in any one of claims 1 to 9.

12. A computer-readable storage medium, It is characterized in that One or more programs are stored thereon, and when the one or more programs are executed by an electronic device, the electronic device implements the method described in any one of claims 1-9.

13. A computer program product, It is characterized in that The invention comprises a computer program, which implements the method according to any one of claims 1 to 9 when being executed by a processor.