CN111800465A

CN111800465A - Vehicle message processing method, device, medium and electronic equipment

Info

Publication number: CN111800465A
Application number: CN202010490558.8A
Authority: CN
Inventors: 侯琛
Original assignee: Tencent Technology Shenzhen Co Ltd
Current assignee: Tencent Technology Shenzhen Co Ltd
Priority date: 2020-06-02
Filing date: 2020-06-02
Publication date: 2020-10-20

Abstract

The embodiment of the application provides a vehicle message processing method and device. The method comprises the following steps: the method comprises the steps of obtaining vehicle information of a reference vehicle associated with a target vehicle, and obtaining a first vehicle information set comprising first vehicle information, wherein the first vehicle information comprises information storage time and information labels, and the information labels are used for identifying the reference vehicles corresponding to the vehicle information; according to the message storage time, selecting a first vehicle message with the message storage time later than a tolerance time point from the first vehicle message set to obtain a second vehicle message set comprising a second vehicle message, wherein the tolerance time point is used for judging whether the vehicle message is effective or not; and selecting second vehicle messages with different message labels from the second vehicle message set according to the message labels to obtain the reference vehicle messages corresponding to the target vehicle. The technical scheme of the embodiment of the application can ensure the accuracy of the vehicle message.

Description

Vehicle message processing method, device, medium and electronic equipment

Technical Field

The application relates to the technical field of computers and safe auxiliary driving, in particular to a vehicle message processing method and device, a computer readable medium and electronic equipment.

Background

In a general traffic scenario, such as a scenario of a multi-vehicle travel section, a target vehicle may need to acquire vehicle travel parameters of a reference vehicle other than itself, and the vehicle travel parameters of the reference vehicle are generally stored in a server in a manner of actively uploading vehicle messages to the server by itself. However, how to guarantee the accuracy of the vehicle message is an urgent technical problem to be solved.

Disclosure of Invention

The embodiment of the application provides a vehicle message processing method and device, a computer readable medium and electronic equipment, so that the accuracy of the vehicle message can be ensured at least to a certain extent.

Other features and advantages of the present application will be apparent from the following detailed description, or may be learned by practice of the application.

According to an aspect of an embodiment of the present application, there is provided a method for processing a vehicle message, including: obtaining vehicle information of a reference vehicle associated with a target vehicle to obtain a first vehicle information set, wherein the first vehicle information set comprises first vehicle information, the first vehicle information comprises information storage time and information labels, and the information labels are used for identifying the reference vehicles corresponding to the vehicle information; according to the message storage time, selecting a first vehicle message with the message storage time later than a tolerance time point from the first vehicle message set to obtain a second vehicle message set, wherein the second vehicle message set comprises a second vehicle message, and the tolerance time point is used for judging whether the vehicle message is effective or not; and selecting second vehicle messages with different message labels from the second vehicle message set according to the message labels to obtain the reference vehicle messages corresponding to the target vehicle.

According to an aspect of an embodiment of the present application, there is provided a vehicle message processing apparatus, including: the vehicle information acquisition device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring vehicle information of a reference vehicle associated with a target vehicle to obtain a first vehicle information set, the first vehicle information set comprises first vehicle information, the first vehicle information comprises information storage time and information labels, and the information labels are used for identifying the reference vehicles corresponding to the vehicle information; the first selection unit is used for selecting a first vehicle message with message storage time later than a tolerance time point from the first vehicle message set according to the message storage time to obtain a second vehicle message set, wherein the second vehicle message set comprises a second vehicle message, and the tolerance time point is used for judging whether the vehicle message is valid or not; and the second selecting unit is used for selecting second vehicle messages with different message labels from the second vehicle message set according to the message labels to obtain the reference vehicle messages corresponding to the target vehicle.

In some embodiments of the present application, based on the foregoing solution, the first selecting unit is configured to: determining a request time when a target vehicle requests to acquire a reference vehicle message and a tolerance time length for keeping the validity of the vehicle message; determining the tolerant time point based on the request time and the tolerant time length; and determining the first vehicle message in the first vehicle message set, of which the message storage time is later than the tolerance time point, as a second vehicle message, so as to obtain the second vehicle message set.

In some embodiments of the present application, based on the foregoing scheme, the tolerated time length is determined by: acquiring the driving parameters of the target vehicle and the driving safety distance of the location of the target vehicle; and calculating the tolerance time length through a basic motion equation based on the running parameters of the target vehicle and the driving safety distance of the target vehicle.

In some embodiments of the present application, based on the foregoing scheme, the second selecting unit is configured to: grouping all second vehicle messages in the second vehicle message set to obtain at least one second vehicle message subset, wherein any one second vehicle message subset comprises at least one second vehicle message with the same message label; and determining the second vehicle message with the latest message storage time in each second vehicle message subset as the reference vehicle message corresponding to the target vehicle.

In some embodiments of the present application, based on the foregoing solution, the apparatus further includes: and the sending unit is used for sending the reference vehicle message corresponding to the target vehicle after selecting second vehicle messages with different message labels from the second vehicle message set and obtaining the reference vehicle message corresponding to the target vehicle.

In some embodiments of the present application, based on the foregoing solution, the apparatus further includes: a sending unit, configured to, after selecting second vehicle messages with different message labels from the second vehicle message set and obtaining reference vehicle messages corresponding to the target vehicle, calculate an invalid ratio of the vehicle messages in the first vehicle message set based on the number of the vehicle messages in the first vehicle message set and the number of the reference vehicle messages corresponding to the target vehicle; and when the invalid rate of the vehicle messages in the first vehicle message set is not higher than a preset threshold value, sending a reference vehicle message corresponding to the target vehicle.

In some embodiments of the present application, based on the foregoing solution, the first vehicle message set includes N first vehicle messages, where N is a positive integer greater than 1, and the N first vehicle messages are respectively stored in N storage spaces correspondingly, and the obtaining unit is configured to: and respectively acquiring first vehicle messages from the N storage spaces to obtain the first vehicle message set.

In some embodiments of the present application, based on the foregoing solution, the first vehicle message set includes N first vehicle messages, where N is a positive integer greater than 1, and the N first vehicle messages are respectively stored in S storage spaces, where one storage space stores at least one first vehicle message, and the obtaining unit is configured to: and respectively acquiring first vehicle messages from the S storage spaces to obtain the first vehicle message set.

In some embodiments of the present application, based on the foregoing solution, the storage space is provided in a message queue telemetry transmission server.

According to an aspect of embodiments of the present application, there is provided a computer-readable medium, on which a computer program is stored, which, when executed by a processor, implements a method of processing a vehicle message as described in the above embodiments.

According to an aspect of an embodiment of the present application, there is provided an electronic device including: one or more processors; a storage device for storing one or more programs which, when executed by the one or more processors, cause the one or more processors to implement the method of processing vehicle messages as described in the embodiments above.

In the technical scheme provided by some embodiments of the application, a first vehicle message set including a first vehicle message is obtained first, then a second vehicle message set including a second vehicle message is selected from the first vehicle message set according to a criterion that the message storage time is later than a tolerance time point, and on the basis, the second vehicle messages with different message labels are selected from the second vehicle message set based on a principle that the message labels are different from each other, so that valid vehicle messages are determined. On one hand, the vehicle message is determined according to the standard that the message storage time is later than the tolerance time point, so that the real-time performance of the vehicle message can be guaranteed, on the other hand, the non-repeatability of the vehicle message can be guaranteed by determining the vehicle message based on the principle that the message labels are different from each other, and therefore the accuracy of the vehicle message can be guaranteed by the technical scheme provided by some embodiments of the application.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application. It is obvious that the drawings in the following description are only some embodiments of the application, and that for a person skilled in the art, other drawings can be derived from them without inventive effort. In the drawings:

FIG. 1 shows a schematic diagram of an exemplary system architecture to which aspects of embodiments of the present application may be applied;

FIG. 2 illustrates an application scenario diagram implementing a processing method for vehicle messages according to one embodiment of the present application;

FIG. 3 shows a flow diagram of a method of processing a vehicle message according to one embodiment of the present application;

FIG. 4 shows a schematic diagram of a vehicle message storage approach according to one embodiment of the present application;

FIG. 5 illustrates a detailed flow diagram for obtaining a second set of vehicle messages according to one embodiment of the present application;

FIG. 6 illustrates a flow diagram of a method of determining a length of a tolerated time according to one embodiment of the present application;

FIG. 7 illustrates a detailed flow diagram for obtaining a reference vehicle message corresponding to the target vehicle according to one embodiment of the present application;

FIG. 8 illustrates a flowchart of a method after obtaining a reference vehicle message corresponding to the target vehicle, in accordance with one embodiment of the present application;

FIG. 9 illustrates a schematic diagram of cloud-based determination of valid vehicle messages according to one embodiment of the present application;

FIG. 10 shows a block diagram of a processing device of a vehicle message according to an embodiment of the present application;

FIG. 11 illustrates a schematic structural diagram of a computer system suitable for use in implementing the electronic device of an embodiment of the present application.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art.

Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the application. One skilled in the relevant art will recognize, however, that the subject matter of the present application can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the application.

The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.

The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.

It is noted that the terms first, second and the like in the description and claims of the present application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the objects so used are interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in other sequences than those illustrated or described herein.

Fig. 1 shows a schematic diagram of an exemplary system architecture to which the technical solution of the embodiments of the present application can be applied.

As shown in fig. 1, the system architecture may include a terminal device (e.g., one or more of a smartphone 101, a tablet computer 102, and a portable computer 103 shown in fig. 1, but may also be a desktop computer, etc.), a network 104, and a server 105. The network 104 serves as a medium for providing communication links between terminal devices and the server 105. Network 104 may include various connection types, such as wired communication links, wireless communication links, and so forth.

It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation. For example, server 105 may be a server cluster comprised of multiple servers, or the like.

In an embodiment of the present application, a terminal device 101 shown in fig. 1 sends a request for obtaining a reference vehicle message to a server 105, and after receiving the request, the server 105 first obtains a first vehicle message set including the first vehicle message, and then selects a second vehicle message set including a second vehicle message from the first vehicle message set according to a criterion that a message storage time is later than a tolerance time point, on the basis of which, based on a principle that message tags are different from each other, the second vehicle message with message tags different from each other is selected from the second vehicle message set, so as to determine a valid vehicle message.

It should be noted that the processing method of the vehicle message provided in the embodiment of the present application is generally executed by the server 105, and accordingly, the processing determination device of the vehicle message is generally disposed in the server 105. However, in other embodiments of the present application, the terminal device may also have a similar function as the server, so as to execute the processing scheme of the vehicle message provided by the embodiments of the present application.

It should be further noted that, in addition to being executed by the aforementioned server 105 or terminal device, the processing method of the vehicle message provided in the embodiment of the present application may also be executed by a cloud server having a cloud computing function.

Specifically, the cloud computing (cloud computing) is a computing mode, which distributes computing tasks on a resource pool formed by a large number of computers, so that various application systems can acquire computing power, storage space and information services as required. The network that provides the resources is referred to as the "cloud". Resources in the cloud can be infinitely expanded to users, and can be acquired at any time, used as required and expanded at any time. The cloud computing resource pool mainly comprises computing equipment (which is a virtualization machine and comprises an operating system), storage equipment and network equipment.

Fig. 2 shows an application scenario diagram implementing a processing method of a vehicle message according to an embodiment of the present application.

As shown in fig. 2, in the link area 200, the vehicle a may be a target vehicle, the vehicles B, C, D, E, F and G may be reference vehicles, the positions B, B1 and B2 are the traveling positions of the vehicle B at different historical times, the position D, D1 is the traveling position of the vehicle D at different historical times, the position G, G1 is the traveling position of the vehicle G at different historical times, and the positions C, E and F are the traveling positions of the vehicles C, E and F at different historical times, respectively.

When the server receives a request for acquiring the vehicle message of the reference vehicle sent by the target vehicle A, the server firstly acquires a first vehicle message set comprising the first vehicle message, then selects a second vehicle message set comprising the second vehicle message from the first vehicle message set according to the standard that the message storage time is later than the tolerance time point, and selects the second vehicle message with different message labels from the second vehicle message set on the basis of the principle that the message labels are different from each other, thereby determining the effective vehicle message.

In one embodiment of the present application, the server may send the determined valid vehicle message to the target vehicle, and the target vehicle may analyze vehicle conditions of the current road segment (the vehicle conditions may include the number of reference vehicles and the driving condition of each reference vehicle) according to the valid vehicle message, thereby determining its own vehicle driving policy, and improving the safety of vehicle driving.

It should be noted that the vehicle message of the reference vehicle may include the driving parameter, the attribute parameter, and the positioning parameter of the reference vehicle.

Further, the running parameters may include speed, direction, acceleration, and the like of the vehicle running. The attribute parameters may include the type of vehicle (e.g., truck or automobile), license plate number, weight, length, width, and height, among others. The positioning parameters may include positioning coordinates of the vehicle, and the like.

The implementation details of the technical solution of the embodiment of the present application are set forth in detail below:

FIG. 3 shows a flow diagram of a method of processing a vehicle message according to one embodiment of the present application. The vehicle message processing method may be executed by a device having a computing processing function, such as the server 105 shown in fig. 1, the terminal device shown in fig. 1, or a cloud server having a cloud computing function. Referring to fig. 3, the method for processing the vehicle message at least includes steps 310 to 350, which are described in detail as follows:

in step 310, vehicle messages of a reference vehicle associated with a target vehicle are acquired, and a first vehicle message set is obtained, where the first vehicle message set includes the first vehicle message, the first vehicle message includes a message storage time and a message tag, and the message tag is used to identify the reference vehicle corresponding to the vehicle message.

In an embodiment of the present application, the first vehicle message set may include N first vehicle messages, where the N first vehicle messages may be respectively stored in N storage spaces correspondingly, and after receiving a request for obtaining a vehicle message of a reference vehicle sent by a target vehicle, obtain the first vehicle message from the N storage spaces respectively, so as to obtain the first vehicle message set.

In this embodiment, each of the N storage spaces can only store one vehicle message, and therefore, when the first vehicle message is acquired, the vehicle message needs to be acquired from each storage space.

In a specific implementation manner of an embodiment of the present application, each storage space may be bound to a unique GPS positioning coordinate, and when a reference vehicle travels to a GPS positioning coordinate, a vehicle message of its own vehicle at the GPS positioning coordinate may be uploaded to the storage space bound to the GPS positioning coordinate.

In order to make the concrete implementation better understood by those skilled in the art, the following description will be made with reference to fig. 4.

FIG. 4 shows a schematic diagram of a vehicle message storage approach according to one embodiment of the present application.

As shown in fig. 4, in the link area 400, vehicle messages are uploaded in the vehicle test vehicle B, vehicle test vehicle C, vehicle test vehicle D, vehicle test vehicle E, vehicle test vehicle F, and vehicle test vehicle G areas 400, respectively.

In road segment area 400, there are 9 GPS locations included, including GPS1 through GPS9, wherein one GPS location defines one geographic grid area within road segment area 400, wherein one grid area may house one reference vehicle.

Further, one GPS location is bound with one storage space, and storage spaces 1 to 9 are bound with GPS1 to GPS9, so that when a reference vehicle enters a grid area corresponding to one GPS location and uploads a new vehicle message of its own to the storage space corresponding to the GPS location, old vehicle messages uploaded by other reference vehicles historically stored in the storage space can be covered, for example, in storage space 2 corresponding to GPS2, vehicle message E of reference vehicle E will cover vehicle message D1 corresponding to reference vehicle D, and in storage space 7 corresponding to GPS7, vehicle message B of reference vehicle B will cover vehicle message B1 corresponding to reference vehicle B.

In the application, the advantage that only one vehicle message can be stored in one storage space is that the redundancy degree of the vehicle message in the storage space can be reduced, and the storage resource is saved.

In an embodiment of the present application, the first vehicle message set may include N first vehicle messages, and the N first vehicle messages may be stored in S storage spaces, respectively, where at least one first vehicle message is stored in one storage space, and after receiving a request for obtaining a vehicle message of a reference vehicle sent by a target vehicle, the first vehicle messages are obtained from the S storage spaces, respectively, so as to obtain the first vehicle message set.

In this embodiment, S is a positive integer smaller than N, and each of the S storage spaces may store one or more vehicle messages, where it should be noted that a plurality in this application refers to two or more. Therefore, when the first vehicle message is acquired, one or more vehicle messages need to be acquired from each storage space.

In a specific implementation of an embodiment of the present application, each storage space may be bound to a unique GPS location coordinate.

It should be noted that a GPS position fix may define a geographic range that may accommodate at least two vehicles.

When the reference vehicle travels to a GPS location fix, its own vehicle message at the GPS location fix may be uploaded to the memory space bound to the GPS location fix. It should be noted that the number of vehicle messages stored in the storage space may be limited, that is, when the number of vehicle messages stored in the storage space reaches an upper limit, the vehicle message stored in the storage space first may be overwritten by the newly stored vehicle message.

Similarly, the advantage that only a limited number of vehicle messages can be stored in one storage space is that the redundancy degree of the vehicle messages in the storage space can be reduced, and the storage resources are saved.

In the present application, in the two embodiments described above, the storage space may be disposed in a message queue Telemetry transport server, i.e., an mqtt (message Queuing Telemetry transport) server.

The message queue telemetry transport server is a server of the ISO standard messaging protocol, may connect sensors through unreliable networks, and may operate on top of the TCP/IP internet protocol.

The storage space is arranged in the message queue telemetry transmission server, and the vehicle message of the reference vehicle can be uploaded to the message queue telemetry transmission server. All important vehicle messages uploaded by the reference vehicle can be received, and the vehicle messages are received through the message queue telemetry transmission server with strong confidentiality.

In one embodiment of the present application, the N first vehicle messages may also be stored in one storage space.

In this application, the message storage time may refer to a time when the reference vehicle uploads the first vehicle message to the storage space.

In the present application, the message tag may be used to identify a reference vehicle to which the vehicle message corresponds. Specifically, the message label may refer to the license plate number of the reference vehicle corresponding to the first vehicle message, or may refer to another number of the reference vehicle corresponding to the first vehicle message.

Continuing to refer to fig. 3, in step 330, according to the message storage time, a first vehicle message with a message storage time later than a tolerance time point is selected from the first vehicle message set, so as to obtain a second vehicle message set, where the second vehicle message set includes a second vehicle message, and the tolerance time point is used for determining whether the vehicle message is valid.

In an embodiment of the present application, selecting a first vehicle message from the first vehicle message set, which has a message storage time later than a tolerance time point, according to the message storage time, and obtaining a second vehicle message set may be performed according to the steps shown in fig. 5:

referring to fig. 5, a detailed flow diagram of obtaining a second set of vehicle messages is shown, according to an embodiment of the present application. Specifically, the method comprises steps 331 to 333:

in step 331, a request time when the target vehicle requests to retrieve the reference vehicle message and a tolerated length of time to maintain validity of the vehicle message are determined.

In this application, specifically, for example, when the target vehicle requests the acquisition of the vehicle message of the reference vehicle at 5/20/00/2020, the request time is 00/5/20/2020.

In the application, the tolerant time length refers to the upper limit of storage delay for keeping the validity of the vehicle message stored in the storage space, and if the tolerant time length is 10 seconds, the vehicle message is considered to be invalid when the storage time of the vehicle message exceeds 10 seconds from the uploading to the storage space.

In a specific implementation of an embodiment of the present application, the length of the tolerated time may be determined by the steps shown in fig. 6.

Referring to fig. 6, a flowchart of a method for determining a tolerable length of time according to an embodiment of the present application is shown, which specifically includes steps 3311 to 3312:

step 3311, obtaining the driving parameters of the target vehicle and the driving safety distance of the target vehicle.

In this application, the target vehicle may transmit the driving parameters of the target vehicle and the driving safety distance of the location of the target vehicle while transmitting the request for obtaining the vehicle message of the reference vehicle, so as to obtain the driving parameters of the target vehicle and the driving safety distance of the location of the target vehicle.

Specifically, the running parameters may include a running speed and an acceleration of the target vehicle at the time of the request for the vehicle message of the reference vehicle.

Specifically, the driving safety distance may refer to a driving safety distance at which the target vehicle is located when the vehicle message of the reference vehicle is requested to be acquired, which may be obtained from a traffic management department or the internet.

Step 3312, calculating the tolerance time length by a basic equation of motion based on the driving parameters of the target vehicle and the driving safety distance of the target vehicle.

Specifically, in the present application, the tolerance time length can be calculated by the following basic equation of motion:

L＝vΔt+5aΔt²

wherein L represents a driving safety distance of a location where the target vehicle is located when the target vehicle requests to acquire the vehicle message of the reference vehicle; v represents the traveling speed of the target vehicle at the time of requesting acquisition of the vehicle message of the reference vehicle; Δ t represents the tolerated length of time; a represents the acceleration of the target vehicle at the time of request for acquisition of the vehicle message of the reference vehicle.

In a specific implementation of an embodiment of the present application, the length of the tolerated time may also be determined based on historical experience.

With continued reference to fig. 5, in step 332, the tolerated time point is determined based on the request time and the tolerated time length.

In a specific implementation of an embodiment of the present application, the tolerance time point may be determined by the following formula:

T＝t-Δt

wherein T represents a tolerated time point; t represents a request time when the target vehicle requests to acquire the vehicle message of the reference vehicle; Δ t represents the tolerated length of time.

With continued reference to fig. 5, in step 333, the first vehicle message in the first vehicle message set, whose message storage time is later than the tolerance time point, is determined as the second vehicle message, resulting in the second vehicle message set.

In this application, if the message storage time of the first vehicle message in the first vehicle message set is earlier than or equal to the tolerance time point, it indicates that the storage time of the first vehicle message in the storage space exceeds the tolerance time length, that is, exceeds the upper limit of the storage delay for maintaining the validity of the vehicle message stored in the storage space, and further indicates that the first vehicle message is not valid.

Based on the information, the first vehicle message in the first vehicle message set, the message storage time of which is later than the tolerance time point, is determined as the second vehicle message, and the second vehicle message has the timeliness of maintaining the validity of the vehicle message.

With continued reference to fig. 3, in step 350, according to the message tags, second vehicle messages with different message tags are selected from the second vehicle message set, so as to obtain reference vehicle messages corresponding to the target vehicle.

In an embodiment of the present application, selecting second vehicle messages with different message labels from the second vehicle message set according to the message labels, and obtaining the reference vehicle message corresponding to the target vehicle may be performed according to the steps shown in fig. 7.

Referring to fig. 7, a detailed flow chart for obtaining a reference vehicle message corresponding to the target vehicle according to an embodiment of the present application is shown. Specifically, the method comprises steps 351 to 352:

step 351, grouping all the second vehicle messages in the second vehicle message set to obtain at least one second vehicle message subset, wherein any one of the second vehicle message subsets comprises at least one second vehicle message with the same message label.

And step 352, determining the second vehicle message with the latest message storage time in each second vehicle message subset as the reference vehicle message corresponding to the target vehicle.

In the present application, it should be understood to those skilled in the art that the message tag may be used to identify the reference vehicle to which the vehicle message corresponds.

In the present application, it should be understood to those skilled in the art that one reference vehicle message is an element of the second set of vehicle messages, and the second set of vehicle messages is a subset of the first set of vehicle messages, so that any one reference vehicle message is essentially a second vehicle message of the second set of vehicle messages, and is also a first vehicle message of the first set of vehicle messages.

In the present application, it should be understood to those skilled in the art that there may be at least two second vehicle messages having the same message label in the second set of vehicle messages.

Based on this, all the second vehicle messages in the second vehicle message set can be grouped according to the message tags corresponding to the second vehicle messages to obtain at least one second vehicle message subset, wherein any one second vehicle message subset comprises at least one second vehicle message with the same message tag, and then the second vehicle message with the latest message storage time in each second vehicle message subset is determined as the reference vehicle message to obtain the valid vehicle message.

For example, referring to fig. 4, since the reference vehicles to which vehicle message B and vehicle message B2 correspond are both reference vehicle B, vehicle message B and vehicle message B2 belong to the same second subset of vehicle messages, vehicle message B may be determined to be a reference vehicle message if the message storage times for vehicle message B2 and vehicle message B are 00 min 00 s/05 s/00 s/20/2020.

In this embodiment, since the target vehicle needs to refer to only one vehicle message corresponding to the vehicle and having the strongest timeliness, the second vehicle message having the latest message storage time in each second vehicle message subset is determined as the reference vehicle message, which not only guarantees timeliness of the vehicle messages, but also guarantees non-repeatability of the vehicle messages.

In the present application, in step 352, any one of the second vehicle messages in each of the second vehicle message subsets may be determined as the reference vehicle message, so as to obtain the valid vehicle message.

In an embodiment of the application, after second vehicle messages with different message labels are selected from the second vehicle message set to obtain reference vehicle messages corresponding to the target vehicle, the reference vehicle messages corresponding to the target vehicle may be sent to the target vehicle.

In an embodiment of the present application, after selecting second vehicle messages with different message labels from the second vehicle message set to obtain reference vehicle messages corresponding to the target vehicle, the steps shown in fig. 8 may be further performed.

Referring to fig. 8, a flowchart of a method after obtaining a reference vehicle message corresponding to the target vehicle is shown, according to an embodiment of the present application. Specifically, the method comprises steps 370 to 390:

step 370, calculating the invalid ratio of the vehicle messages in the first vehicle message set based on the number of the vehicle messages in the first vehicle message set and the number of the reference vehicle messages corresponding to the target vehicle.

In the present application, the invalid rate of the vehicle messages in the first set of vehicle messages can be calculated by the following formula:

wherein P represents the invalid rate of the vehicle messages in the first set of vehicle messages; n represents the number of all vehicle messages in the storage space (i.e., the first number of vehicle messages); x represents the number of valid vehicle messages (i.e., the number of reference vehicle messages) in the memory space.

And step 390, when the invalid rate of the vehicle messages in the first vehicle message set is not higher than a predetermined threshold, sending the reference vehicle message corresponding to the target vehicle.

In this application, the predetermined threshold may be determined according to a historical traffic accident rate of the target vehicle, for example, the predetermined threshold may be equal to the historical traffic accident rate of the target vehicle, and specifically, the historical traffic accident rate may be obtained from a traffic control department.

In the present application, the predetermined threshold may also be set according to actual needs.

In the application, after the target vehicle acquires the reference vehicle messages (i.e., the valid vehicle messages), the vehicle conditions of the current road section (which may include the number of reference vehicles and the driving conditions of each reference vehicle, and whether a safety risk will be formed to the target vehicle itself) may be analyzed according to the valid vehicle messages, so as to determine the vehicle driving strategy of the target vehicle itself, and improve the driving safety of the vehicle.

In this application, when the invalidation ratio of the vehicle messages in the first set of vehicle messages is higher than a predetermined threshold, then the reference vehicle message in the set of reference vehicle messages is not sent to the target vehicle.

For example, when the predetermined threshold is a historical traffic accident rate of the target vehicle, the invalidation rate of the vehicle messages in the first set of vehicle messages is not higher than the predetermined threshold, that is, the invalidation rate of the vehicle messages in the first set of vehicle messages is not higher than the historical traffic accident rate.

On the one hand, the target vehicle requests the acquisition of the vehicle message of the reference vehicle in order to evaluate the driving risk of the driving location thereof for guiding itself to avoid the traffic accident history. On the other hand, driving risk estimation is essentially an estimation based on vehicle messages of a reference vehicle, the accuracy of which is related to the quality of the acquired vehicle messages of the reference vehicle. To ensure that the estimated driving risk of the target vehicle is beneficial for reducing the traffic accident rate, the estimated error rate should be less than the historical traffic accident rate, otherwise such risk estimation would not have a positive impact on reducing the traffic accident rate. In the application, the historical traffic accident rate of the target vehicle is set as the preset threshold value, so that the estimated error rate of the driving risk of the target vehicle is smaller than the historical traffic accident rate, and the determined vehicle driving strategy of the target vehicle is favorable for reducing the historical traffic accident rate of the target vehicle.

It will be appreciated that vehicle messages with too high an invalidation rate may not assist the target vehicle in determining a better vehicle driving strategy.

Based on this, only when the invalid rate of the vehicle messages in the first vehicle message set is not higher than the predetermined threshold, the reference vehicle messages in the reference vehicle message set are sent to the target vehicle, so that the obtaining rate of the valid vehicle messages can be improved, the integrity and the reliability of the vehicle messages are improved, and the target vehicle can be assisted to determine a better vehicle driving strategy. And when the invalid rate of the vehicle messages in the first vehicle message set is higher than the preset threshold value, the reference vehicle messages in the reference vehicle message set are not sent to the target vehicle, so that the transmission of useless messages can be reduced, and the consumption of network resources can be reduced.

In the embodiment of determining valid vehicle messages in a scene of a multi-vehicle driving road section, a fusion car cloud, a regional cloud and a marginal cloud can be further built to determine valid vehicle messages about a reference vehicle for a target vehicle in an internet of vehicles through a cloud vehicle system, and as shown in fig. 9, a schematic diagram of determining valid vehicle messages based on a cloud according to an embodiment of the present application is shown. The system consists of a cloud and a vehicle network. Wherein, in this scheme, the vehicle can be in real time with the vehicle message upload of self to the car high in the clouds, each technical scheme in this application can be carried out to the car high in the clouds.

Specifically, on one hand, the vehicle cloud acquires the vehicle message uploaded by the reference vehicle in real time, on the other hand, after receiving a request sent by the target vehicle for acquiring the vehicle message uploaded by the reference vehicle, the vehicle cloud first acquires a first vehicle message set including the first vehicle message (note that the first vehicle message may be the vehicle message uploaded by the reference vehicle acquired by the vehicle cloud in real time), and then selects a second vehicle message set including the second vehicle message from the first vehicle message set according to a criterion that the message storage time is later than the tolerance time point, on the basis, based on a principle that message tags are different from each other, the reference vehicle message set including the reference vehicle message is selected from the second vehicle message set, and further, the valid vehicle message is determined.

In addition, the inventors of the present application performed experiments by using the effective message determination scheme of the prior art and the effective message determination scheme proposed in the present application, and obtained the experimental results as shown in table 1.

Order of experiment	Prior art efficient message acquisition rate	Obtaining rate of effective message in this application
			First experiment	74％	93％
Second experiment	73％	92％
			Third experiment	76％	95％
Fourth experiment	77％	96％
			Fifth experiment	71％	92％
The sixth experiment	75％	94％
			The seventh experiment	79％	98％
The eighth experiment	72％	92％
			The ninth experiment	72％	91％
The tenth experiment	74％	93％

TABLE 1

As shown in table 1, by applying the technical solution provided by the present application to a scene where an effective message is determined, compared with the prior art, the technical solution of the present application can improve the obtaining rate of the effective message, and further ensure the accuracy of the vehicle message.

The following describes embodiments of the apparatus of the present application, which may be used to perform the method for processing the vehicle message in the above embodiments of the present application. For details that are not disclosed in the embodiments of the apparatus of the present application, please refer to the embodiments of the method for processing the vehicle message described above in the present application.

FIG. 10 shows a block diagram of a processing device of a vehicle message according to one embodiment of the present application.

Referring to fig. 10, a vehicle message processing apparatus 1000 according to an embodiment of the present application includes: an acquisition unit 1001, a first selection unit 1002, and a second selection unit 1103.

The obtaining unit 1001 is configured to obtain a vehicle message of a reference vehicle associated with a target vehicle, to obtain a first vehicle message set, where the first vehicle message set includes a first vehicle message, the first vehicle message includes a message storage time and a message tag, and the message tag is used to identify the reference vehicle corresponding to the vehicle message; a first selecting unit 1002, configured to select, according to the message storage time, a first vehicle message from the first vehicle message set, where the message storage time is later than a tolerance time point, to obtain a second vehicle message set, where the second vehicle message set includes a second vehicle message, and the tolerance time point is used to determine whether the vehicle message is valid; a second selecting unit 1103, configured to select, according to the message tags, second vehicle messages with different message tags from the second vehicle message set, so as to obtain reference vehicle messages corresponding to the target vehicle.

In some embodiments of the present application, based on the foregoing solution, the first selecting unit 1002 is configured to: determining a request time when a target vehicle requests to acquire a reference vehicle message and a tolerance time length for keeping the validity of the vehicle message; determining the tolerant time point based on the request time and the tolerant time length; and determining the first vehicle message in the first vehicle message set, of which the message storage time is later than the tolerance time point, as a second vehicle message, so as to obtain the second vehicle message set.

In some embodiments of the present application, based on the foregoing solution, the second selecting unit 1103 is configured to: grouping all second vehicle messages in the second vehicle message set to obtain at least one second vehicle message subset, wherein any one second vehicle message subset comprises at least one second vehicle message with the same message label; and determining the second vehicle message with the latest message storage time in each second vehicle message subset as the reference vehicle message corresponding to the target vehicle.

In some embodiments of the present application, based on the foregoing solution, the first vehicle message set includes N first vehicle messages, where N is a positive integer greater than 1, and the N first vehicle messages are respectively stored in N storage spaces correspondingly, and the obtaining unit 1001 is configured to: and respectively acquiring first vehicle messages from the N storage spaces to obtain the first vehicle message set.

In some embodiments of the present application, based on the foregoing solution, the first vehicle message set includes N first vehicle messages, where N is a positive integer greater than 1, and the N first vehicle messages are respectively stored in S storage spaces, where one storage space stores at least one first vehicle message, and the obtaining unit 1001 is configured to: and respectively acquiring first vehicle messages from the S storage spaces to obtain the first vehicle message set.

It should be noted that the computer system 1100 of the electronic device shown in fig. 11 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.

As shown in fig. 11, a computer system 1100 includes a Central Processing Unit (CPU)1101, which can perform various appropriate actions and processes, such as performing the methods described in the above embodiments, according to a program stored in a Read-Only Memory (ROM) 1102 or a program loaded from a storage section 1108 into a Random Access Memory (RAM) 1103. In the RAM 1103, various programs and data necessary for system operation are also stored. The CPU 1101, ROM 1102, and RAM 1103 are connected to each other by a bus 1104. An Input/Output (I/O) interface 1105 is also connected to bus 1104.

The following components are connected to the I/O interface 1105: an input portion 1106 including a keyboard, mouse, and the like; an output section 1107 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, a speaker, and the like; a storage section 1108 including a hard disk and the like; and a communication section 1109 including a network interface card such as a LAN (Local area network) card, a modem, or the like. The communication section 1109 performs communication processing via a network such as the internet. A driver 1110 is also connected to the I/O interface 1105 as necessary. A removable medium 1111 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1110 as necessary, so that a computer program read out therefrom is mounted into the storage section 1108 as necessary.

In particular, according to embodiments of the application, the processes described above with reference to the flow diagrams may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication portion 1109 and/or installed from the removable medium 1111. When the computer program is executed by a Central Processing Unit (CPU)1101, various functions defined in the system of the present application are executed.

It should be noted that the computer readable medium shown in the embodiments of the present application may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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 Disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. Each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in the embodiments of the present application may be implemented by software, or may be implemented by hardware, and the described units may also be disposed in a processor. Wherein the names of the elements do not in some way constitute a limitation on the elements themselves.

As another aspect, the present application also provides a computer-readable medium, which may be contained in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by an electronic device, cause the electronic device to implement the method described in the above embodiments.

It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the application. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments 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 disk, a removable 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 embodiments of the present application.

Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the embodiments disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains.

It will be understood that the present application is not limited to the precise arrangements 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 application is limited only by the appended claims.

Claims

1. A method for processing a vehicle message, the method comprising:

obtaining vehicle information of a reference vehicle associated with a target vehicle to obtain a first vehicle information set, wherein the first vehicle information set comprises first vehicle information, the first vehicle information comprises information storage time and information labels, and the information labels are used for identifying the reference vehicles corresponding to the vehicle information;

according to the message storage time, selecting a first vehicle message with the message storage time later than a tolerance time point from the first vehicle message set to obtain a second vehicle message set, wherein the second vehicle message set comprises a second vehicle message, and the tolerance time point is used for judging whether the vehicle message is effective or not;

and selecting second vehicle messages with different message labels from the second vehicle message set according to the message labels to obtain the reference vehicle messages corresponding to the target vehicle.

2. The method of claim 1, wherein selecting a first vehicle message from the first set of vehicle messages having a message storage time later than a tolerance time point based on the message storage time to obtain a second set of vehicle messages comprises:

determining a request time when a target vehicle requests to acquire a reference vehicle message and a tolerance time length for keeping the validity of the vehicle message;

determining the tolerant time point based on the request time and the tolerant time length;

and determining the first vehicle message in the first vehicle message set, of which the message storage time is later than the tolerance time point, as a second vehicle message, so as to obtain the second vehicle message set.

3. The method of claim 2, wherein the tolerated time length is determined by:

acquiring the driving parameters of the target vehicle and the driving safety distance of the location of the target vehicle;

and calculating the tolerance time length through a basic motion equation based on the running parameters of the target vehicle and the driving safety distance of the target vehicle.

4. The method according to claim 1, wherein the selecting, according to the message tag, second vehicle messages with message tags different from each other from the second vehicle message set to obtain the reference vehicle message corresponding to the target vehicle comprises:

grouping all second vehicle messages in the second vehicle message set to obtain at least one second vehicle message subset, wherein any one second vehicle message subset comprises at least one second vehicle message with the same message label;

and determining the second vehicle message with the latest message storage time in each second vehicle message subset as the reference vehicle message corresponding to the target vehicle.

5. The method according to claim 1, wherein after selecting second vehicle messages with mutually different message labels from the second vehicle message set to obtain the reference vehicle message corresponding to the target vehicle, the method further comprises:

and sending a reference vehicle message corresponding to the target vehicle.

6. The method according to claim 1, wherein after selecting second vehicle messages with mutually different message labels from the second vehicle message set to obtain the reference vehicle message corresponding to the target vehicle, the method further comprises:

calculating the invalid rate of the vehicle messages in the first vehicle message set based on the number of the vehicle messages in the first vehicle message set and the number of the reference vehicle messages corresponding to the target vehicle;

and when the invalid rate of the vehicle messages in the first vehicle message set is not higher than a preset threshold value, sending a reference vehicle message corresponding to the target vehicle.

7. The method according to claim 1, wherein the first vehicle message set includes N first vehicle messages, where N is a positive integer greater than 1, the N first vehicle messages are respectively stored in N storage spaces, and the obtaining the first vehicle message set includes:

and respectively acquiring first vehicle messages from the N storage spaces to obtain the first vehicle message set.

8. The method of claim 1, wherein the first set of vehicle messages includes N first vehicle messages, N being a positive integer greater than 1, the N first vehicle messages being respectively stored in S storage spaces, wherein at least one first vehicle message is stored in one storage space, and the obtaining the first set of vehicle messages includes:

and respectively acquiring first vehicle messages from the S storage spaces to obtain the first vehicle message set.

9. The method of claim 7 or 8, wherein the storage space is provided in a message queue telemetry transport server.

10. A vehicle message processing apparatus, comprising:

the vehicle information acquisition device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring vehicle information of a reference vehicle associated with a target vehicle to obtain a first vehicle information set, the first vehicle information set comprises first vehicle information, the first vehicle information comprises information storage time and information labels, and the information labels are used for identifying the reference vehicles corresponding to the vehicle information;

the first selection unit is used for selecting a first vehicle message with message storage time later than a tolerance time point from the first vehicle message set according to the message storage time to obtain a second vehicle message set, wherein the second vehicle message set comprises a second vehicle message, and the tolerance time point is used for judging whether the vehicle message is valid or not;

and the second selecting unit is used for selecting second vehicle messages with different message labels from the second vehicle message set according to the message labels to obtain the reference vehicle messages corresponding to the target vehicle.