A data processing system for obtaining road traffic status

Abstract

The present invention provides a data processing system for obtaining road traffic status, including: a target road identification list, a traffic signal operation log list, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: obtaining a second vehicle speed list corresponding to the target road identification list; obtaining a second parking duration list corresponding to the target road identification list; obtaining a road traffic status list according to the traffic signal operation log list, the second vehicle speed list, and the second parking duration list. It can be seen that, on the one hand, the present invention uses a wireless access point to obtain vehicle information in the road, and the cost of the wireless access point is relatively low, which is beneficial to saving resources. On the other hand, when obtaining the road traffic status, the vehicle information in the road is processed to obtain the second vehicle speed list and the second parking duration list, and then the road traffic status is obtained, which can improve the accuracy of obtaining the road traffic status.

Description

Technical Field

[0001] The present invention relates to the technical field of intelligent transportation, and particularly to a data processing system for obtaining road traffic states. Background Art

[0002] With the development of intelligent transportation systems, the traffic flow on roads is increasing. Accurately analyzing the traffic states of roads can provide traffic information needed by road traffic managers and travelers, and can also provide useful information for road construction planning, solving road congestion, and traffic police attendance.

[0003] To obtain the traffic states of roads, it is necessary to use a GPS positioning system and combine it with a device capable of obtaining vehicle identifiers. The device obtains unique vehicle identifiers and combines them with the GPS positioning system to obtain the running trajectories of vehicles. According to the running trajectories of all vehicles on the road, the traffic states of the road are obtained.

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

[0005] On the one hand, when obtaining the running trajectories of vehicles, the costs of the GPS positioning system and the device capable of obtaining vehicle identifiers are relatively high. Obtaining the running trajectories of all vehicles on the road requires multiple GPS positioning systems and devices capable of obtaining vehicle identifiers, which will cause waste of resources. On the other hand, when obtaining the traffic states of roads, there are influences from multiple factors such as time and vehicle speed. Only obtaining the traffic states of roads through the running trajectories of vehicles will result in relatively low accuracy in obtaining the traffic states of roads. Summary of the Invention

[0006] In view of the above technical problems, the technical solution adopted by the present invention is as follows:

[0007] A data processing system for obtaining road traffic states, comprising: a target road ID list A = {A 1 , ……, A i , ……, A m}, a traffic signal operation log list Z = {Z 1 , ……, Z i , ……, Z m}, a processor, and a memory storing a computer program, wherein A i is the i-th target road ID, i = 1 …… m, m is the number of target road IDs, Z i = {Z i1 , ……, Z ij , ……, Z in}, Z ij is in the j-th first time slice A iThe working status of the corresponding traffic signal lights, j = 1... n, where n is the number of the first time slices. When the computer program is executed by the processor, the following steps are implemented:

[0008] S100. Obtain, according to A, the corresponding second vehicle speed list V = {V 1 , ……, V i , ……, V m}, where V i = {V i1 , ……, V ij , ……, V in}, and V ij is the second vehicle speed corresponding to A in the first time slice corresponding to Z ij . i

[0009] S200. Obtain, according to A, the corresponding second parking duration list W = {W 1 , ……, W i , ……, W m}, where W i = {W i1 , ……, W ij , ……, W in}, and W ij is the second parking duration corresponding to A in the first time slice corresponding to Z ij . i

[0010] S300. Obtain, according to Z, V, and W, the road traffic status list TX = {TX 1 , ……, TX i , ……, TX m}, where the following steps are included in S300 to obtain TX ij , and TX ij is the road traffic status of the road corresponding to A in the first time slice corresponding to Z ij : i

[0011] S301. When Z ij is in the first working state and V ij < V 0 or W ij > W 0 , TX ij is the first road traffic status; otherwise, TX ij is the second road traffic status. V 0 is the first preset vehicle speed threshold, and W 0 is the first preset parking duration threshold.

[0012] S303. When Z ij is in the second working state and V​​​ij <V 1 or W ij >W 1 When, TX ij is the first road traffic state, otherwise, TX ij is the third road traffic state, V 1 is the second preset vehicle speed threshold, W 1 is the second preset parking duration threshold.

[0013] S305. According to TX i , obtain TX i ={TX i1 , ……, TX ij , ……, TX in}.

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

[0015] The present invention provides a data processing system for obtaining road traffic states, including: a target road identification list, a traffic signal operation log list, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: obtaining a second vehicle speed list corresponding to the target road identification list; obtaining a second parking duration list corresponding to the target road identification list; obtaining a road traffic state list according to the traffic signal operation log list, the second vehicle speed list, and the second parking duration list. It can be seen that, on the one hand, the present invention uses a wireless access point to obtain vehicle information in the road, and the cost of the wireless access point is relatively low, which is beneficial to saving resources. On the other hand, when obtaining the road traffic state, the vehicle information in the road is processed, the second vehicle speed list and the second parking duration list are obtained, and then the road traffic state is obtained, which can improve the accuracy of obtaining the road traffic state. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the following will briefly introduce the drawings required for the description of the embodiments. Obviously, the following drawings are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0017] Figure 1 It is a flowchart of a computer program executed by a data processing system for obtaining road traffic states provided by an embodiment of the present invention. DETAILED DESCRIPTION OF THE INVENTION

[0018] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative efforts shall fall within the protection scope of the present invention.

[0019] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above accompanying drawings are used to distinguish similar objects, and do not necessarily need to describe a specific order or sequence. It should be understood that such data used in appropriate cases can be interchanged so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or server including a series of steps or modules does not necessarily have to be limited to those steps or modules clearly listed, but may include other steps or modules not clearly listed or inherent to these processes, methods, products, or devices.

[0020] The present invention provides a data processing system for obtaining road traffic status, including: a target road ID list A = {A 1 , ……, A i , ……, A m}, a traffic signal operation log list Z = {Z 1 , ……, Z i , ……, Z m}, a processor, and a memory storing a computer program. Among them, A i is the i-th target road ID, i = 1 …… m, m is the number of target road IDs, Z i = {Z i1 , ……, Z ij , ……, Z in}, Z ij is the working status of the traffic signal corresponding to A i in the j-th first time slice, j = 1 …… n, n is the number of first time slices. When the computer program is executed by the processor, the following steps are implemented, as shown in Figure 1 :

[0021] S100. According to A, obtain the corresponding second vehicle speed list V = {V 1 , ……, V i , ……, V m}, V i = {V i1 , ……, V ij , ……, V in}, V ij For A in the first time slice corresponding to Z ij the corresponding first vehicle speed. i the corresponding second vehicle speed.

[0022] Specifically, the system further includes a list of wireless access point IDs corresponding to A.

[0023] Furthermore, the wireless access point ID is the unique identity of the wireless access point.

[0024] Specifically, in step S100, the following steps are further included:

[0025] S101. Obtain the current vehicle information set according to the list of wireless access point IDs.

[0026] Specifically, in step S101, the following steps are further included to obtain the optimal geographical location of the wireless access point:

[0027] S1. Obtain the list of wireless access point IDs F = {F 1 , ……, F i , ……, F m}, where F i is the wireless access point ID corresponding to A i .

[0028] S3. According to F, obtain the list of geographical locations of the wireless access points corresponding to F, U = {U 1 , ……, U i , ……, U m}, where U i = (UX i , UY i ), where UX i is the abscissa value corresponding to F i in the preset coordinate system, and UY i is the ordinate value corresponding to F i in the preset coordinate system; based on the preset conditions satisfied by UX i and UY i , obtain the optimal geographical location, where UX i and UY i satisfy the following preset conditions:

[0029] (UX i - UX i+1 ) 2 + (UY i - UY i+1 ) 2 = 4a 2 And when i = m, UX m+1 = UX 1 , UYm+1 = UY 1 , where a is the radius of the scanning area of the wireless access point.

[0030] Furthermore, the scanning area of the wireless access point is a circular area centered on the wireless access point. Among them, those skilled in the art know that any method of setting a preset coordinate system and obtaining geographical location coordinates in the prior art belongs to the protection scope of the present invention and will not be elaborated here.

[0031] As described above, the cost of the wireless access point is relatively low. By setting the geographical location coordinates of the wireless access point and using the wireless access point to obtain the current vehicle information and then obtain the second vehicle speed, resources can be saved, and it is ensured that the scanning ranges of any two wireless access points do not intersect, so that the vehicle information obtained by any two wireless access points is not repeated, which is beneficial to improving the processing efficiency of the processor and the accuracy of obtaining the road traffic status.

[0032] Specifically, in step S101, the following steps are further included:

[0033] S1011. According to F i , obtain the list of key device information H i corresponding to F i = {H i1 , ……, H ij , ……, H in}, H ij = {H 1 ij , ……, H x ij , ……, H p ij}, H x ij is the xth key device information corresponding to F i in the jth first time slice, where x = 1 …… p, and p is the number of key devices corresponding to F i in the jth first time slice.

[0034] Specifically, the key device information includes vehicle information and / or non-vehicle information.

[0035] Furthermore, the non-vehicle information includes: non-vehicle wifi name, non-vehicle wifi strength, and non-vehicle wifi time.

[0036] S1013. According to H ij , obtain the list of wifi names K ij corresponding to H ij = {K 1 ij , ……, K xij , ……, K p ij}}, K x ij is H x ij The corresponding Wi-Fi name, where the Wi-Fi name is an in-vehicle Wi-Fi name or a non-in-vehicle Wi-Fi name.

[0037] S1015. Process K ij to obtain the first keyword list K ij corresponding to K 0 ij ={K 01 ij , ……, K 0x ij , ……, K 0p ij}}, K 0x ij is the first keyword corresponding to K x ij where the first keyword is: words such as BMW, Mercedes-Benz, Audi, etc. Those skilled in the art know that any method of obtaining the first keyword according to the in-vehicle Wi-Fi name in the prior art falls within the protection scope of the present invention and will not be elaborated here.

[0038] S1017. When K 0x ij is the same as any preset keyword in the preset keyword list, obtain the key device information corresponding to K 0x ij and insert it into the current vehicle information set. Those skilled in the art know that the preset keywords that meet the actual requirements in the prior art fall within the protection scope of the present invention and will not be elaborated here.

[0039] As mentioned above, processing the key device information obtained from the wireless access point to obtain the key device information whose first keyword matches the preset keyword as the current vehicle information can be understood as obtaining the vehicle information of the vehicle with in-vehicle Wi-Fi, which can reduce the error caused by non-vehicle information during the data processing and improve the accuracy of obtaining the road traffic status.

[0040] S103. According to the current vehicle information set, obtain the current in-vehicle Wi-Fi strength list L ij ={L 1 ij , ……, L y ij , ……, L q ij}}, L yij = {L y1 i1 , ……, L yr ij , ……, L ys in}, L yr ij is the on-vehicle wifi strength of the y-th vehicle scanned by the r-th F i corresponding wireless access point, where r = 1... s, s is the number of scans of the wireless access point, and y = 1... q, q is the number of vehicles scanned by the F i corresponding wireless access point. Those skilled in the art know that any method of obtaining the on-vehicle wifi strength from the current vehicle information set in the prior art falls within the protection scope of the present invention and will not be elaborated here.

[0041] Specifically, the current vehicle information is the vehicle information at the current time point, where the value of the current time point is 1 day.

[0042] Specifically, the vehicle information includes the on-vehicle wifi name, the on-vehicle wifi strength, and the on-vehicle wifi time.

[0043] Furthermore, the on-vehicle wifi strength is the wireless network signal strength sent by the on-vehicle wifi to the wireless access point each time the wireless access point scans it.

[0044] Furthermore, the on-vehicle wifi time is the time when the wireless access point scans the on-vehicle wifi each time.

[0045] Specifically, the first time slice is the time interval between obtaining adjacent current vehicle information. Those skilled in the art know that any time interval that meets the actual requirements in the prior art falls within the protection scope of the present invention and will not be elaborated here.

[0046] Furthermore, the value range of the first time slice is 10 seconds - 20 seconds. The length of the time slice is relatively small, and the vehicle information on the road can be accurately and timely obtained.

[0047] S105. According to L y ij , obtain the vehicle distance list L' corresponding to L y ij = {L' y ij , ……, L' y1 i1 , ……, L' yr ij , ……, L' ys in}, L' yr ij is Lyr ij The corresponding vehicle position coordinates to F i The distance to the geographical location coordinates of the corresponding wireless access point, where L′ yr ij Meets the following conditions:

[0048] L′ yr ij = a×L yr ij / L 0 where L 0 is the preset in-vehicle wifi strength threshold. Those skilled in the art know that the values of the in-vehicle wifi strength threshold that meet the actual requirements in the prior art all fall within the protection scope of the present invention and will not be elaborated herein.

[0049] S107. According to L′ y ij , obtain L y ij The corresponding first vehicle speed M y ij , M y ij Meets the following conditions:

[0050] t is the time interval between the wireless access point scanning adjacent current vehicle information corresponding to F i Specifically, those skilled in the art know that any method for obtaining the time interval between the wireless access point scanning adjacent current vehicle information in the prior art falls within the protection scope of the present invention and will not be elaborated herein.

[0051]

[0052] S109. According to M y ij ij , obtain V ij , where V ij Meets the following conditions:

[0053]

[0054] As described above, processing the wireless network signal strength, obtaining the first vehicle speed of the current vehicle corresponding to the wireless access point, processing the first vehicle speed, obtaining the second vehicle speed corresponding to the road, and combining the second vehicle speed with the operating state of the traffic signal to judge the road traffic state are beneficial to improving the accuracy of obtaining the road traffic state.

[0055] S200. According to A, obtain the second parking duration list W = {W 1 , ……, W i , ……, Wm},W i = {W i1 , ..., W ij , ..., W in},W ij For Z ij The corresponding first time slice A i The corresponding second parking time.

[0056] Specifically, in step S200, the following steps are also included:

[0057] S201, according to L' y ij , get L y ij The corresponding first parking time N y ij , where N y ij Meet the following conditions:

[0058] N y ij =N 0 ×t,N 0 L′ y ij Middle L′ yr ij and L′ y(r+1) ij Same quantity.

[0059] S203, according to N y ij , get W ij , where W ij Meet the following conditions:

[0060]

[0061] In the above, the wireless network signal strength is processed to obtain the first parking time of the current vehicle corresponding to the wireless access point, the first parking time is processed to obtain the second parking time corresponding to the road, and the road traffic status is judged in combination with the second parking time and the operating status of the traffic light, which is conducive to improving the accuracy of obtaining the road traffic status.

[0062] S300, according to Z, V, W, obtain the road traffic status list TX = {TX 1 ,……,TX i ,……,TX m}, TX i ={TX i1 ,……,TX ij ,……,TX in}, TXij At Z ij In the first time slice corresponding to A i The road traffic status of the corresponding road.

[0063] Specifically, in step S300, the following steps are also included to obtain TX ij :

[0064] S301. When Z ij Is in the first working state and V ij < V 0 Or W ij > W 0 At this time, TX ij Is in the first road traffic status, otherwise, TX ij Is in the second road traffic status, V 0 Is the first preset vehicle speed threshold, W 0 Is the first preset parking duration threshold. Among them, those skilled in the art know that the values of the first preset vehicle speed threshold that meet the actual requirements and the values of the first preset parking duration threshold that meet the actual requirements in the prior art both fall within the protection scope of the present invention and will not be elaborated here.

[0065] Specifically, W 0 The value range of is 5 seconds - 10 seconds, to prevent the first preset parking duration threshold from being set too low or too high, thereby resulting in obtaining an incorrect road traffic status when the traffic signal is in the first working state.

[0066] Specifically, the first working state is that the traffic signal shows a green light.

[0067] Specifically, the first road traffic status is: the state of being impassable due to road congestion.

[0068] Specifically, the second road traffic status is: the unobstructed state.

[0069] S303. When Z ij Is in the second working state and V ij < V 1 Or W ij > W 1 At this time, TX ij Is in the first road traffic status, otherwise, TX ij Is in the third road traffic status, V 1 Is the second preset vehicle speed threshold, W 1 Is the second preset parking duration threshold. Among them, those skilled in the art know that the values of the second preset vehicle speed threshold that meet the actual requirements and the values of the second preset parking duration threshold that meet the actual requirements in the prior art both fall within the protection scope of the present invention and will not be elaborated here.

[0070] Specifically, W 1 has a value range of 7 seconds to 12 seconds; this prevents incorrect road traffic states from being obtained when the traffic signal is in the second working state due to the second preset parking duration threshold being set too low or too high.

[0071] Specifically, the second working state is when the traffic signal shows a non - green light.

[0072] Specifically, the third road traffic state is: a non - passable state caused by the traffic signal showing a non - green light.

[0073] In the above, when obtaining the road traffic state, the vehicle information on the road is processed to obtain the second vehicle speed list and the second parking duration list, and the second vehicle speed and the second parking time are combined with the operating state of the traffic signal corresponding to the road to determine the traffic state of the road, which can improve the accuracy of obtaining the road traffic state.

[0074] The present invention provides a data processing system for obtaining the road traffic state, including: a target road identification list, a traffic signal operation log list, a processor, and a memory storing a computer program. When the computer program is executed by the processor, the following steps are implemented: obtaining the second vehicle speed list corresponding to the target road identification list; obtaining the second parking duration list corresponding to the target road identification list; obtaining the road traffic state list according to the traffic signal operation log list, the second vehicle speed list, and the second parking duration list. It can be seen that, on the one hand, the present invention uses a wireless access point to obtain vehicle information on the road, and the cost of the wireless access point is relatively low, which is conducive to saving resources. On the other hand, when obtaining the road traffic state, the vehicle information on the road is processed to obtain the second vehicle speed list and the second parking duration list, and then the road traffic state is obtained, which can improve the accuracy of obtaining the road traffic state.

[0075] Although some specific embodiments of the present invention have been described in detail by way of examples, those skilled in the art should understand that the above examples are only for the purpose of illustration and not for the purpose of limiting the scope of the present 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 present invention. The scope of the present invention is defined by the appended claims.

Claims

1. A data processing system for obtaining road traffic status, characterized in that, The system includes: a list A of target road IDs = {A 1 , ……, A i , ……, A m}, a list Z of traffic signal operation logs = {Z 1 , ……, Z i , ……, Z m}, a list of wireless access point IDs corresponding to A, a processor, and a memory storing a computer program, where A i is the i-th target road ID, i = 1 …… m, m being the number of target road IDs, and Z i = {Z i1 , ……, Z ij , ……, Z in}, and Z ij is the working state of the traffic signal corresponding to A i in the j-th first time slice, j = 1 …… n, n being the number of first time slices. When the computer program is executed by the processor, the following steps are implemented: S100, according to A, obtain the second vehicle speed list V corresponding to A={V 1 , ..., V i , ..., V m },V i ={V i1 , ..., V ij , ..., V in },V ij For Z ij The corresponding first time slice A i The corresponding second vehicle speed; step S100 includes the following steps: S101. Obtain the current vehicle information set according to the list of wireless access point IDs; S103. Obtain the current in-vehicle Wi-Fi strength list L corresponding to the current vehicle information set in the j-th first time slice according to the current vehicle information set ij ={L 1 ij , ……, L y ij , ……, L q ij}}, L y ij ={L y1 i1 , ……, L yr ij , ……, L ys in}}, L yr ij is the in-vehicle Wi-Fi strength of the y-th vehicle scanned by the r-th wireless access point corresponding to F i , where r = 1... s, s is the number of times the wireless access point is scanned, y = 1... q, and q is the number of vehicles scanned by the wireless access point corresponding to F i The wireless access point ID corresponding to F i is the wireless access point ID corresponding to A i ; S105. Obtain, according to L y ij , the vehicle distance list L' corresponding to L y ij ={L' y ij , ……, L' y1 i1 , ……, L' yr ij , ……, L' ys in}, where L' yr ij is the distance from the vehicle position coordinate corresponding to L yr ij to the geographical position coordinate of the wireless access point corresponding to F i , and L' yr ij meets the following conditions: L′ yr ij =a×L yr ij / L 0 , where a is the radius of the scanning area of the wireless access point, and L 0 is the preset in-vehicle wifi strength threshold; S107. Obtain L according to L′ y ij and obtain the first vehicle speed M corresponding to L y ij where M meets the following conditions: y ij M y ij ​ , where t is F i The time interval between the wireless access point corresponding to scanning the information of adjacent current vehicles S109. Obtain V according to M y ij where V meets the following conditions: ij wherein V ij meets the following conditions: ； S200. Obtain, according to A, the second parking duration list W = {W 1 , ……, W i , ……, W m}, where W i = {W i1 , ……, W ij , ……, W in}, and W ij is the second parking duration corresponding to A in the first time slice corresponding to Z ij . i ​ S300. Obtain a list of road traffic states TX = {TX 1 , ……, TX i , ……, TX m}, where TX i = {TX i1 , ……, TX ij , ……, TX in}, and TX ij is the road traffic state of the road corresponding to A ij in the first time slice corresponding to Z i . Among them, the following steps are included in S300 to obtain TX ij : S301. When Z ij is in the first working state and V ij < V 0 or W ij > W 0 , TX ij is in the first road traffic state; otherwise, TX ij is in the second road traffic state, V 0 is the first preset vehicle speed threshold, and W 0 is the first preset parking duration threshold. S303. When Z ij is in the second working state and V ij < V 1 or W ij > W 1 , TX ij is in the first road traffic state; otherwise, TX ij is in the third road traffic state. V 1 is the second preset vehicle speed threshold, and W 1 is the second preset parking duration threshold.

2. The data processing system for obtaining road traffic status according to claim 1, characterized in that, The following steps are included in step S200: S201. Obtain L according to L′ y ij y ij and obtain the corresponding first parking duration N y ij where N y ij meets the following conditions:​ N y ij =N 0 ×t, N 0 is L' y ij in L' yr ij is the same quantity as L' y(r+1) ij the same quantity; S203. Obtain W according to N y ij where W ij satisfies the following conditions: ij ​ 。 3. The data processing system for obtaining road traffic status according to claim 1, characterized in that, The following steps are included in step S101 to obtain the geographical location coordinates of the wireless access point: S1. Obtain the list F of wireless access point IDs corresponding to A, where F = {F 1 , ……, F i , ……, F m}; S3. Obtain the list U = {U 1 , ……, U i , ……, U m} of the geographical locations of the wireless access points corresponding to F, where U i = (UX i , UY i ), where UX i is the abscissa value corresponding to F i in the preset coordinate system, and UY i is the ordinate value corresponding to F i in the preset coordinate system; obtain the optimal geographical location based on the preset conditions satisfied by UX i and UY i , where UX i and UY i satisfy the following preset conditions: (UX i -UX i+1 ) 2 +(UY i -UY i+1 ) 2 =4a 2 And when i = m, UX m+1 = UX 1 , UY m+1 = UY 1 .

4. The data processing system for obtaining road traffic status according to claim 1, characterized in that: The current vehicle information is the vehicle information at the current time point, where the value of the current time point is 1 day.

5. The data processing system for obtaining road traffic status according to claim 4, characterized in that, The vehicle information includes the in-vehicle wifi name, in-vehicle wifi strength, and in-vehicle wifi time.

6. The data processing system for obtaining road traffic status according to claim 5, characterized in that, The in-vehicle wifi strength is the wireless network signal strength sent by the in-vehicle wifi to the wireless access point each time the wireless access point scans the in-vehicle wifi.

7. The data processing system for obtaining road traffic status according to claim 5, characterized in that, The in-vehicle wifi time is the time when the wireless access point scans the in-vehicle wifi each time.

8. The data processing system for obtaining road traffic status according to claim 1, characterized in that, The first working state is that the traffic signal shows a green light.

9. The data processing system for obtaining road traffic status according to claim 1, characterized in that, The second working state is that the traffic signal shows a non-green light.

Images