A data processing system for obtaining vehicle queue length

Abstract

The application provides a kind of data processing system for obtaining vehicle queue length, the data processing system can obtain queue vehicle information list according to initial GPS data information list, obtain the first time distance coordinate and the second time distance coordinate corresponding to queue vehicle information, obtain the red light state start time point and the red light state end time point of target traffic signal lamp in target signal period corresponding to target traffic signal lamp, obtain vehicle queue length according to the first time distance coordinate, the second time distance coordinate, the red light state start time point and the red light state end time point;It is known that the application obtains vehicle queue length based on initial GPS data information, and GPS data is not affected by factors such as light, weather, shelter, etc., so obtaining vehicle queue length by the above method is conducive to improving the accuracy of obtaining vehicle queue length.

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to a data processing system for obtaining vehicle queue lengths. Background Technology

[0002] Vehicle queue length is an important indicator for measuring traffic flow efficiency and road capacity. Patent (application number: CN201410852721.5) provides a method and apparatus for obtaining vehicle queue length. The method detects whether the target virtual loop currently includes queued vehicle information through traffic video image information. If the queued vehicle information is included, it is determined whether the queued vehicle information is valid target vehicle information. If it is the target vehicle information, the vehicle queue length information is obtained based on the target vehicle information.

[0003] However, the above method also has the following technical problems:

[0004] The above method obtains vehicle queue length information based on video image information. However, the clarity of video images can be affected by various factors, such as lighting, weather, and obstructions. When the clarity of video images is affected, it may not be possible to correctly or completely identify all vehicles, thus failing to accurately obtain vehicle queue length information. Summary of the Invention

[0005] To address the aforementioned technical problems, the technical solution adopted by this invention is as follows:

[0006] This invention provides a data processing system for obtaining vehicle queue lengths. The system is used to obtain the vehicle queue lengths at a target intersection. The system includes a processor and a memory storing a computer program. When the processor executes the computer program, it performs the following steps:

[0007] S1. Obtain a queued vehicle information list based on the initial GPS data information list. The queued vehicle information list includes several queued vehicle information items, including: queued vehicle ID, the start time of the queued vehicle ID, the end time of the queued vehicle ID, and the latitude and longitude coordinates of the queued vehicle ID.

[0008] S2. Obtain the first and second time distance coordinates corresponding to the queued vehicle information. The horizontal axis of the first time distance coordinate is the start time of the queued vehicle ID in the queued vehicle information, and the horizontal axis of the second time distance coordinate is the end time of the queued vehicle ID in the queued vehicle information. The vertical axis of both the first and second time distance coordinates is the distance between the geographical location of the queued vehicle ID's latitude and longitude and the geographical location of the center point of the target intersection.

[0009] S3. Obtain the start time and end time of the red light state of the target traffic light in the target signal cycle.

[0010] S4. Obtain the vehicle queue length based on the first time distance coordinate, the second time distance coordinate, the start time of the red light state, and the end time of the red light state.

[0011] The present invention has at least the following beneficial effects:

[0012] This invention provides a data processing system for obtaining vehicle queue length. The system can obtain a queued vehicle information list based on an initial GPS data information list, obtain the first and second time distance coordinates corresponding to the queued vehicle information, obtain the start and end times of the red light state of the target traffic light within the target signal cycle, and obtain the vehicle queue length based on the first and second time distance coordinates, the start and end times of the red light state. It is evident that this invention obtains the vehicle queue length based on initial GPS data information. GPS data is unaffected by factors such as lighting, weather, and obstructions. Therefore, obtaining the vehicle queue length using the above method helps improve the accuracy of obtaining the vehicle queue length. Attached Figure Description

[0013] To more clearly illustrate the technical solutions in the embodiments of the present invention, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0014] Figure 1 This is a flowchart illustrating how a data processing system executes a computer program to obtain vehicle queue lengths, as provided in an embodiment of the present invention. Detailed Implementation

[0015] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0016] It should be noted that the terms "first," "second," etc., in the specification, claims, and accompanying drawings of this invention are used to distinguish similar tasks and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or server that comprises a series of steps or units is not necessarily limited to those explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or devices.

[0017] An embodiment of the present invention provides a data processing system for obtaining vehicle queue length. The data processing system is used to obtain the vehicle queue length at a target intersection. The data processing system includes a processor and a memory storing a computer program. When the computer program is executed by the processor, it performs the following steps, such as... Figure 1 As shown:

[0018] S1. Obtain a queued vehicle information list based on the initial GPS data information list. The queued vehicle information list includes several queued vehicle information items, including: queued vehicle ID, the start time of the queued vehicle ID, the end time of the queued vehicle ID, and the latitude and longitude coordinates of the queued vehicle ID.

[0019] Specifically, the initial GPS data information list includes several initial GPS data information. The initial GPS data information is the vehicle GPS data information received by the target server on that day. The vehicle GPS data information is the data information reported by the GPS in the vehicle to the target server, including: vehicle ID, latitude and longitude coordinates, and the generation time point corresponding to the latitude and longitude coordinates; the generation time point can be understood as the time point when the latitude and longitude coordinates are generated.

[0020] Specifically, step S1 includes the following steps S11-S14:

[0021] S11. Obtain the key vehicle dwelling information corresponding to the target road segment and the associated vehicle dwelling information list corresponding to the key vehicle dwelling information based on the initial GPS data information list. The key vehicle dwelling information includes: key vehicle ID, start dwelling time corresponding to the key vehicle ID, end dwelling time corresponding to the key vehicle ID, and dwelling latitude and longitude coordinates corresponding to the key vehicle ID. The associated vehicle dwelling information list includes several associated vehicle dwelling information entries, which include: associated vehicle ID, start dwelling time corresponding to the associated vehicle ID, end dwelling time corresponding to the associated vehicle ID, and dwelling latitude and longitude coordinates corresponding to the associated vehicle ID.

[0022] Specifically, the target road segment is the road segment between the target intersection and the designated intersection, and the designated intersection is the intersection adjacent to the target intersection.

[0023] Furthermore, vehicles in the target road segment will travel from the designated intersection to the target intersection.

[0024] Specifically, the key vehicle ID is the identification identifier of the key vehicle, which is the first vehicle to stop and wait to pass through the target intersection on the target road segment.

[0025] Specifically, the associated vehicle ID is the identification identifier of the associated vehicle. The associated vehicle is a vehicle that is parked in the target road segment and whose parking time is longer than that of the key vehicle.

[0026] Specifically, step S11 includes the following steps S111-S115:

[0027] S111. Obtain an initial vehicle stop information list based on the initial GPS data information list. The initial vehicle stop information list includes several initial vehicle stop information items, including: initial vehicle ID, start stop time corresponding to the initial vehicle ID, end stop time corresponding to the initial vehicle ID, and stop latitude and longitude coordinates corresponding to the initial vehicle ID. As those skilled in the art know, any method in the prior art for obtaining an initial vehicle stop information list based on the initial GPS data information list is within the protection scope of this invention, and will not be elaborated further here.

[0028] Specifically, the initial vehicle ID is the identifier of the initial vehicle, which is a vehicle that has stopped in the target road segment.

[0029] Specifically, the start time corresponding to the initial vehicle ID is the time when the initial vehicle corresponding to the initial vehicle ID begins to stop in the target road segment.

[0030] Specifically, the end time of the initial vehicle ID is the time when the initial vehicle with the initial vehicle ID ends its parking in the target road segment.

[0031] Specifically, the latitude and longitude coordinates of the initial vehicle ID are the latitude and longitude coordinates of the parking position of the initial vehicle when it stops in the target road segment.

[0032] S112. Obtain the initial parking distance corresponding to the initial vehicle parking information. The initial parking distance is the distance between the geographical location corresponding to the latitude and longitude coordinates of the parking in the initial vehicle parking information and the geographical location corresponding to the center point of the target intersection. As those skilled in the art know, any method for obtaining the distance between two geographical locations in the prior art is within the protection scope of this invention, and will not be described in detail here.

[0033] S113. Traverse the initial vehicle stopping information list. When the initial parking distance corresponding to the initial vehicle stopping information is less than the preset parking distance, use the initial vehicle stopping information as intermediate vehicle stopping information to obtain an intermediate vehicle stopping information list. The intermediate vehicle stopping information includes: intermediate vehicle ID, the start stopping time corresponding to the intermediate vehicle ID, the end stopping time corresponding to the intermediate vehicle ID, and the stopping latitude and longitude coordinates corresponding to the intermediate vehicle ID.

[0034] Specifically, the preset parking distance ranges from [5,7], and the unit of measurement for the preset parking distance is meters.

[0035] S114. Take the intermediate vehicle information corresponding to the smallest start dwell time among all intermediate vehicle IDs as the key vehicle dwell information.

[0036] S115. Traverse the initial vehicle stay information list. When the start stay time corresponding to the initial vehicle ID in the initial vehicle stay information is greater than the start stay time corresponding to the key vehicle ID, use the initial vehicle stay information as the associated vehicle stay information corresponding to the key vehicle stay information.

[0037] Through the above steps, initial vehicle dwell information is obtained based on the initial GPS data information list. When the initial parking distance corresponding to the initial vehicle dwell information is less than the preset parking distance, the initial vehicle dwell information is used as intermediate vehicle dwell information. The intermediate vehicle information corresponding to the smallest start dwell time among all intermediate vehicle IDs is used as key vehicle dwell information. When the start dwell time corresponding to the initial vehicle ID in the initial vehicle dwell information is greater than the start dwell time corresponding to the key vehicle ID, the initial vehicle dwell information is used as the associated vehicle dwell information corresponding to the key vehicle dwell information. Obtaining intermediate vehicle dwell information based on the initial parking distance corresponding to the initial vehicle dwell information, and obtaining key vehicle dwell information and associated vehicle dwell information based on intermediate vehicle dwell information, helps to improve the accuracy of obtaining key vehicle dwell information and associated vehicle dwell information.

[0038] S12. Traverse the list of associated vehicle stop information. When the intermediate distance difference corresponding to the associated vehicle stop information is less than the product of the intermediate time difference corresponding to the associated vehicle stop information and the preset vehicle buffer speed, use the associated vehicle stop information as the first candidate vehicle stop information corresponding to the key vehicle stop information to obtain the first candidate vehicle stop information list. The first candidate vehicle stop information includes: the first candidate vehicle ID, the start stop time corresponding to the first candidate vehicle ID, the end stop time corresponding to the first candidate vehicle ID, and the stop latitude and longitude coordinates corresponding to the first candidate vehicle ID. The intermediate distance difference corresponding to the associated vehicle stop information is the difference between the distance between the geographical location corresponding to the stop latitude and longitude coordinates of the associated vehicle ID and the geographical location corresponding to the center point of the target intersection, minus the distance between the geographical location corresponding to the stop latitude and longitude coordinates of the key vehicle ID and the geographical location corresponding to the center point of the target intersection. The intermediate time difference corresponding to the associated vehicle stop information is the difference between the start stop time corresponding to the associated vehicle ID and the start stop time corresponding to the key vehicle ID.

[0039] Specifically, the preset vehicle buffer speed ranges from [4, 6], and the unit of measurement for the preset vehicle buffer speed is meters per second.

[0040] Through the above steps, when the intermediate distance difference corresponding to the associated vehicle stopping information is not less than the product of the intermediate time difference corresponding to the associated vehicle stopping information and the preset vehicle buffer speed, it indicates that although the vehicle corresponding to the associated vehicle stopping information is stopped in the target road segment, it is not going to pass through the target intersection. When the intermediate distance difference corresponding to the associated vehicle stopping information is less than the product of the intermediate time difference corresponding to the associated vehicle stopping information and the preset vehicle buffer speed, it indicates that the vehicle corresponding to the associated vehicle stopping information is stopped in the target road segment and waiting to pass through the target intersection. Therefore, when the intermediate distance difference corresponding to the associated vehicle stopping information is less than the product of the intermediate time difference corresponding to the associated vehicle stopping information and the preset vehicle buffer speed, the associated vehicle stopping information is used as the first candidate vehicle stopping information corresponding to the key vehicle stopping information. This can filter out vehicle information that is stopped in the target road segment but is not going to pass through the target intersection. Further obtaining queuing vehicle information based on the first candidate vehicle stopping information is beneficial to improving the accuracy of obtaining queuing vehicle information, and thus, is beneficial to improving the accuracy of obtaining vehicle queue length.

[0041] S13. Obtain a second candidate vehicle stop information list based on the first candidate vehicle stop information list and the key vehicle stop information. The second candidate vehicle stop information list includes several second candidate vehicle stop information entries. Specifically, when the start stop time corresponding to the first candidate vehicle ID in the first candidate vehicle stop information is greater than the start stop time corresponding to the key vehicle ID and less than the end stop time corresponding to the key vehicle ID, the difference between the end stop time and the start stop time corresponding to the first candidate vehicle ID is less than the difference between the start stop time and the end stop time corresponding to the key vehicle ID, and the distance between the geographical location corresponding to the stop latitude and longitude coordinates of the first candidate vehicle ID and the geographical location corresponding to the center point of the target intersection is greater than the distance between the geographical location corresponding to the stop latitude and longitude coordinates of the key vehicle ID and the geographical location corresponding to the center point of the target intersection, the first candidate vehicle stop information is used as the second candidate vehicle stop information. The second candidate vehicle stop information includes: the second candidate vehicle ID, the start stop time corresponding to the second candidate vehicle ID, the end stop time corresponding to the second candidate vehicle ID, and the stop latitude and longitude coordinates corresponding to the second candidate vehicle ID.

[0042] Through the above steps, when the start time of the first candidate vehicle ID in the first candidate vehicle stop information is greater than the start time of the key vehicle ID but less than the end time of the key vehicle ID, the difference between the end time and the start time of the first candidate vehicle ID is less than the difference between the start time and the end time of the key vehicle ID, and the distance between the geographical location of the first candidate vehicle ID's stop latitude and longitude coordinates and the geographical location of the center point of the target intersection is greater than the distance between the geographical location of the key vehicle ID's stop latitude and longitude coordinates and the geographical location of the center point of the target intersection, it indicates that the vehicle corresponding to the first candidate vehicle stop information and the vehicle corresponding to the key vehicle stop information are in the same batch queuing to pass through the target intersection. Therefore, further obtaining queuing vehicle information based on the second candidate vehicle stop information is beneficial to improving the accuracy of obtaining queuing vehicle information, and thus, to improving the accuracy of obtaining the vehicle queue length.

[0043] S14. All second candidate vehicle stop information in the key vehicle stop information and second candidate vehicle stop information lists shall be used as queued vehicle information.

[0044] S2. Obtain the first and second time distance coordinates corresponding to the queued vehicle information. The horizontal axis of the first time distance coordinate is the start time of the queued vehicle ID in the queued vehicle information, and the horizontal axis of the second time distance coordinate is the end time of the queued vehicle ID in the queued vehicle information. The vertical axis of both the first and second time distance coordinates is the distance between the geographical location of the queued vehicle ID's latitude and longitude and the geographical location of the center point of the target intersection.

[0045] S3. Obtain the start time and end time of the red light state of the target traffic light in the target signal cycle. The target traffic light is the traffic light in the target intersection that controls whether vehicles in the target road segment can pass through the target intersection. The target cycle corresponding to the target traffic light is the signal cycle in which the start time of the key vehicle ID is located among several signal cycles of the target traffic light.

[0046] Specifically, the signal cycle of the target traffic light is the length of time from the start of a fixed state of the target traffic light to its return to that state in a complete signal cycle.

[0047] S4. Obtain the vehicle queue length based on the first time distance coordinate, the second time distance coordinate, the start time of the red light state, and the end time of the red light state.

[0048] Specifically, step S4 includes the following steps S41-S44:

[0049] S41. When neither the start time nor the end time of the red light state is NULL, obtain the third time distance coordinate corresponding to the start time of the red light state and the fourth time distance coordinate corresponding to the end time of the red light state. The horizontal axis of the third time distance coordinate is the start time of the red light state, and the vertical axis of the third time distance coordinate is 0. The horizontal axis of the fourth time distance coordinate is the end time of the red light state, and the vertical axis of the fourth time distance coordinate is 0.

[0050] S42. Using the least squares method, fit the third time distance coordinates and the first time distance coordinates corresponding to all queuing vehicle information to obtain the first fitted straight line.

[0051] S43. Using the least squares method, fit the fourth time distance coordinate and the second time distance coordinate corresponding to all queuing vehicle information to obtain the second fitted straight line.

[0052] S44. The ordinate of the intersection of the first and second fitted lines is taken as the vehicle queue length.

[0053] Through the above steps, the first and second time distance coordinates are obtained. When the start and end times of the red light are not NULL, the third and fourth time distance coordinates are obtained. The third time distance coordinate and the first time distance coordinate corresponding to all queued vehicles are fitted using the least squares method to obtain the first fitted line. The fourth time distance coordinate and the second time distance coordinate corresponding to all queued vehicles are fitted using the least squares method to obtain the second fitted line. The ordinate of the intersection of the first and second fitted lines is taken as the vehicle queue length, which helps to improve the accuracy of obtaining the vehicle queue length.

[0054] Specifically, step S4 also includes the following steps S10-S20:

[0055] S10. When the start time of the red light state is NULL or the end time of the red light state is NULL, obtain the third and fourth fitted lines. The third fitted line is obtained by fitting the first time distance coordinates corresponding to all queued vehicle information according to the least squares method, and the fourth fitted line is obtained by fitting the second time distance coordinates corresponding to all queued vehicle information according to the least squares method.

[0056] S20. The ordinate of the intersection point of the third and fourth fitted lines is taken as the vehicle queue length.

[0057] By following the steps above, when the start time of the red light state is NULL or the end time of the red light state is NULL, the third and fourth fitted lines are obtained. The ordinate of the intersection of the third and fourth fitted lines is used as the vehicle queue length. Even if the start time or end time of the red light state cannot be obtained, the vehicle queue length can still be obtained, which helps to improve the accuracy of obtaining the vehicle queue length.

[0058] This invention provides a data processing system for obtaining vehicle queue length. The system can obtain a queued vehicle information list based on an initial GPS data information list, obtain the first and second time distance coordinates corresponding to the queued vehicle information, obtain the start and end times of the red light state of the target traffic light within the target signal cycle, and obtain the vehicle queue length based on the first and second time distance coordinates, the start and end times of the red light state. It is evident that this invention obtains the vehicle queue length based on initial GPS data information. GPS data is unaffected by factors such as lighting, weather, and obstructions. Therefore, obtaining the vehicle queue length using the above method helps improve the accuracy of obtaining the vehicle queue length.

[0059] While specific embodiments of the invention have been described in detail by way of examples, those skilled in the art should understand that the examples are for illustrative purposes only and are not intended to limit the scope of the invention. Those skilled in the art should also understand that various modifications can be made to the embodiments without departing from the scope and spirit of the invention.

Claims

1. A data processing system for obtaining vehicle queue length, the data processing system being used to obtain the vehicle queue length at a target intersection, the data processing system comprising: A processor and a memory storing a computer program, characterized in that, when the computer program is executed by the processor, the following steps are performed: S1. Obtain a queued vehicle information list based on the initial GPS data information list. The queued vehicle information list includes several queued vehicle information entries, which include: queued vehicle ID, the start time corresponding to the queued vehicle ID, the end time corresponding to the queued vehicle ID, and the latitude and longitude coordinates of the stop corresponding to the queued vehicle ID; including: S11. Obtain the key vehicle stopping information and the associated vehicle stopping information list corresponding to the target road segment based on the initial GPS data information list; the key vehicle is the first vehicle to stop in the target road segment and wait to pass through the target intersection; the associated vehicle is the vehicle that stops in the target road segment and whose stopping time is greater than the stopping time of the key vehicle. S12. When the intermediate distance difference corresponding to the associated vehicle stop information is less than the product of the intermediate time difference corresponding to the associated vehicle stop information and the preset vehicle buffer speed, the associated vehicle stop information is used as the first candidate vehicle stop information corresponding to the key vehicle stop information; the intermediate distance difference corresponding to the associated vehicle stop information is the difference between the distance between the geographical location corresponding to the latitude and longitude coordinates of the associated vehicle ID in the associated vehicle stop information and the geographical location corresponding to the center point of the target intersection, minus the distance between the geographical location corresponding to the latitude and longitude coordinates of the key vehicle ID and the geographical location corresponding to the center point of the target intersection; the intermediate time difference corresponding to the associated vehicle stop information is the difference between the start stop time corresponding to the associated vehicle ID in the associated vehicle stop information and the start stop time corresponding to the key vehicle ID. S13. When the start time of the first candidate vehicle ID in the first candidate vehicle stop information is greater than the start time of the key vehicle ID and less than the end time of the key vehicle ID, the difference between the end time of the first candidate vehicle ID and the start time of the first candidate vehicle ID is less than the difference between the start time of the key vehicle ID and the end time of the key vehicle ID, and the distance between the geographical location of the stop latitude and longitude coordinates of the first candidate vehicle ID and the geographical location of the center point of the target intersection is greater than the distance between the geographical location of the stop latitude and longitude coordinates of the key vehicle ID and the geographical location of the center point of the target intersection, the first candidate vehicle stop information is used as the second candidate vehicle stop information. S14. Treat the key vehicle stop information and all second candidate vehicle stop information as queued vehicle information. S2. Obtain the first time distance coordinate and the second time distance coordinate corresponding to the queued vehicle information. The horizontal axis of the first time distance coordinate corresponding to the queued vehicle information is the start time of the queued vehicle ID in the queued vehicle information. The horizontal axis of the second time distance coordinate corresponding to the queued vehicle information is the end time of the queued vehicle ID in the queued vehicle information. The vertical axis of the first time distance coordinate and the second time distance coordinate corresponding to the queued vehicle information is the distance between the geographical location corresponding to the latitude and longitude of the queued vehicle ID in the queued vehicle information and the geographical location corresponding to the center point of the target intersection. S3. Obtain the start time and end time of the red light state of the target traffic light in the target signal cycle; S4. Obtain the vehicle queue length based on the first time distance coordinate, the second time distance coordinate, the start time of the red light state, and the end time of the red light state.

2. The data processing system for obtaining vehicle queue length according to claim 1, characterized in that, Step S4 includes the following steps S41-S44: S41. When neither the start time nor the end time of the red light state is NULL, obtain the third time distance coordinate corresponding to the start time of the red light state and the fourth time distance coordinate corresponding to the end time of the red light state. S42. Fit the first fitted straight line by fitting the third time distance coordinate and the first time distance coordinate corresponding to all queuing vehicle information according to the least squares method. S43. Fit the second fitted line by fitting the fourth time distance coordinate and the second time distance coordinate corresponding to all queuing vehicle information using the least squares method. S44. The ordinate of the intersection of the first and second fitted lines is taken as the vehicle queue length.

3. The data processing system for obtaining vehicle queue length according to claim 2, characterized in that, The horizontal axis of the third time distance coordinate is the starting time of the red light state, and the vertical axis of the third time distance coordinate is 0.

4. The data processing system for obtaining vehicle queue length according to claim 2, characterized in that, The horizontal axis of the fourth time distance coordinate is the time when the red light state ends, and the vertical axis of the fourth time distance coordinate is 0.

5. The data processing system for obtaining vehicle queue length according to claim 1, characterized in that, Step S4 also includes the following steps S10-S20: S10. When the start time of the red light state is NULL or the end time of the red light state is NULL, obtain the third and fourth fitted lines. S20. The ordinate of the intersection point of the third and fourth fitted lines is taken as the vehicle queue length.

6. The data processing system for obtaining vehicle queue length according to claim 5, characterized in that, In step S10, a third fitted line is obtained by fitting the first time distance coordinates corresponding to all queued vehicle information using the least squares method, and a fourth fitted line is obtained by fitting the second time distance coordinates corresponding to all queued vehicle information using the least squares method.

7. The data processing system for obtaining vehicle queue length according to claim 1, characterized in that, The initial GPS data information list includes several initial GPS data information, which are the vehicle GPS data information received by the target server on that day.

8. The data processing system for obtaining vehicle queue length according to claim 7, characterized in that, The vehicle GPS data information is the data reported by the vehicle's GPS to the target server, including: vehicle ID, latitude and longitude coordinates, and the corresponding generation time of the latitude and longitude coordinates.

Images