Judgment method, system and device of intersection congestion degree grade, medium and product
By acquiring and analyzing vehicle trajectory data, calculating the delay time of a single vehicle and the delay time of the import road, combined with the intersection saturation, the problem of insufficient accuracy in the judgment of congestion at intersections in the existing technology is solved, and the effective congestion at intersections is achieved Assessment and accurate judgment of intersection congestion levels.
Patent Information
- Application Number
- CN202410960795.4
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-17
- Publication Date
- 2024-11-12
AI Technical Summary
In the prior art, the method of judging intersection congestion cannot be effectively applied to intersections, and there is a lack of detailed threshold setting and formula reference, resulting in insufficient accuracy in engineering applications.
By obtaining multiple sets of vehicle trajectory data at the current intersection, calculating the delay time of a single vehicle, obtaining the delay time of the imported road, and combining the saturation of the intersection, the congestion level is determined, including smooth, basic smooth, mild congestion, moderate congestion, and severe Congestion.
It improves the accuracy of judging the congestion level of intersections, making it suitable for calculating congestion at intersections, and provides clear thresholds and formula references, which improves the guidance of engineering applications.
Smart Images

Figure CN118942243A_ABST
Abstract
Description
Technical Field
[0001] The present application relates to the field of information technology, and in particular to a method, system, device, medium and product for determining the congestion level of an intersection. Background Art
[0002] Patent document 1 (CN114333326A) determines at least one of the target traffic parameters of the continuous congestion parameter of the entrance road and the continuous congestion parameter of the exit road of the intersection based on the road network topology map, and uses the target traffic parameter to determine the congestion detection result of the intersection. The continuous congestion parameter mainly refers to the average speed, congestion mileage, and congestion index.
[0003] Patent document 2 (CN116665436A) calculates the vehicle speed variation coefficient and lane change frequency based on radar trajectory data, and calculates the traffic operation efficiency based on the traffic flow per minute, and then calculates the congestion degree of the road section through the traffic flow disturbance perception index per minute and the traffic operation efficiency.
[0004] However, the inventors found that there are at least the following technical problems in the related art:
[0005] Although Patent Document 1 determines the congestion of an intersection through continuous congestion parameters of the entrance and exit lanes of the intersection, the continuous congestion parameter is solved based on at least one parameter of the average speed, congestion mileage, and congestion index. There is no detailed explanation in the patent on how these three traffic indicators are involved in solving the continuous congestion parameter. Therefore, in the actual engineering guidance application, there is a lack of reference to relevant threshold settings and relevant formulas.
[0006] Patent Document 2 also uses vehicle trajectory data to calculate congestion, which is similar to the data source format used in this patent, but only describes the method for determining the congestion of a road section, and cannot be extended to the calculation logic of the congestion of an intersection. The reason is that according to the "Road Traffic Congestion Evaluation Method", the methods for determining the congestion on a road section and the congestion at an intersection are completely different. The congestion on a road section is mainly based on the average travel speed, while the congestion at an intersection is mainly determined based on the maximum average vehicle delay or the maximum queue time index. Therefore, the road section congestion method in this patent is not applicable to intersection congestion. Summary of the invention
[0007] One purpose of the present application is to provide a method for determining the congestion level of an intersection, at least to solve the problem of how to improve the accuracy of determining the congestion level of an intersection under the premise of being applicable to calculating the congestion level of an intersection.
[0008] To achieve the above objectives, some embodiments of the present application provide the following aspects:
[0009] In a first aspect, some embodiments of the present application further provide a method for determining the congestion level of an intersection, including:
[0010] Get multiple sets of vehicle trajectory data at the current intersection;
[0011] Based on the multiple sets of vehicle trajectory data, obtaining multiple sets of single vehicle delay time data;
[0012] Based on multiple groups of single vehicle delay time data, multiple groups of import lane delay time data are obtained;
[0013] Obtaining the saturation of the current intersection;
[0014] Based on the saturation of the current intersection and the multiple groups of entrance road delay time data, the congestion level of the current intersection is obtained; wherein the congestion level of the current intersection includes unblocked, basically unblocked, slightly congested, moderately congested, and severely congested.
[0015] In a second aspect, some embodiments of the present application further provide a system for determining a congestion level at an intersection, the system comprising:
[0016] A vehicle trajectory data acquisition module, which is configured to acquire multiple sets of vehicle trajectory data at a current intersection;
[0017] A single vehicle delay time data acquisition module, configured to acquire multiple sets of single vehicle delay time data based on the multiple sets of vehicle trajectory data;
[0018] An import lane delay time data acquisition module, which is configured to acquire multiple sets of import lane delay time data based on multiple sets of single vehicle delay time data;
[0019] A saturation acquisition module of a current intersection, configured to acquire the saturation of the current intersection;
[0020] A module for acquiring the congestion level of a current intersection is configured to acquire the congestion level of the current intersection based on the saturation of the current intersection and the multiple sets of entrance road delay time data; wherein the congestion levels of the current intersection include unimpeded, basically unimpeded, slightly congested, moderately congested, and severely congested.
[0021] In a third aspect, some embodiments of the present application further provide an electronic device, comprising: one or more processors; and a memory storing computer program instructions, wherein the computer program instructions, when executed, cause the processor to perform the steps of the method described above.
[0022] In a fourth aspect, some embodiments of the present application further provide a computer-readable medium having computer program instructions stored thereon, wherein the computer program instructions can be executed by a processor to implement the method as described above.
[0023] In a fifth aspect, some embodiments of the present application further provide a computer program product, comprising a computer program / instruction, which implements the steps of the method described above when executed by a processor.
[0024] Compared with the related art, in the solution provided by the embodiment of the present application, multiple groups of vehicle trajectory data of the current intersection are obtained, multiple groups of single vehicle delay time data are obtained based on the multiple groups of single vehicle delay time data, multiple groups of entrance road delay time data are obtained, the saturation of the current intersection is obtained, and the congestion level of the current intersection is obtained based on the saturation of the current intersection and the multiple groups of entrance road delay time data; wherein the congestion level of the current intersection includes unblocked, basically unblocked, slightly congested, moderately congested, Severe congestion. Through the above configuration, the present application obtains multiple groups of vehicle trajectory data at the current intersection, obtains multiple groups of single vehicle delay time data based on the multiple groups of vehicle trajectory data, obtains multiple groups of entrance road delay time data based on the multiple groups of single vehicle delay time data, obtains the saturation of the current intersection, and obtains the congestion level of the current intersection according to the saturation of the current intersection and the multiple groups of entrance road delay time data, so that it can be used to calculate the congestion of the intersection while also improving the accuracy of judging the congestion level of the intersection. BRIEF DESCRIPTION OF THE DRAWINGS
[0025] One or more embodiments are exemplarily described by pictures in the corresponding drawings, and these exemplified descriptions do not constitute limitations on the embodiments. Elements with the same reference numerals in the drawings represent similar elements, and unless otherwise stated, the figures in the drawings do not constitute proportional limitations.
[0026] Figure 1 It is a flowchart of the main steps of a method for determining the congestion level of an intersection according to an embodiment of the present application;
[0027] Figure 2 A schematic diagram of data frequency reduction in one implementation of an embodiment of the present application;
[0028] Figure 3 A data processing diagram of an implementation method of an embodiment of the present application;
[0029] Figure 4 It is a schematic diagram of the main components of a system for determining the level of congestion at an intersection according to an embodiment of the application;
[0030] Figure 5 is a schematic diagram of an exemplary structure of a processor and a memory according to the present application;
[0031] Figure 6is a schematic diagram of an exemplary structure of an electronic device according to the present application;
[0032] Figure 7 This is a schematic diagram of obtaining multiple groups of vehicle trajectory data at a current intersection according to an implementation of an embodiment of the present application. DETAILED DESCRIPTION
[0033] In order to make the purpose, technical solution and advantages of the embodiments of the present application clearer, the technical solution in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.
[0034] Here we first explain some terms involved in this application.
[0035] 1. RSU: Road Side Unit abbreviation, road side unit;
[0036] 2. Cloud control platform: The cloud control platform consists of a cloud control basic platform and cloud control applications, forming a "1+N" topology structure consisting of "1" cloud control basic platform and "N" cloud control application platforms supported by the cloud control basic platform;
[0037] 3. Intersection: The intersection of two or more roads;
[0038] 4. Stop line: A solid white line across the front of an intersection (mainly a traffic light intersection), indicating the position of vehicles waiting for the release of the traffic signal. There may be multiple stop lines at an intersection;
[0039] 5.uuid: the unique identifier of vehicle trajectory data in the cloud control platform;
[0040] 6.Geometry: A spatial attribute in map data that records the longitude and latitude of points, lines, or surfaces that represent the shape of spatial objects.
[0041] See attached Figure 1 , Figure 1 FIG. 1 is a flow chart of the main steps of a method for determining the level of congestion at an intersection according to an embodiment of the present application. Figure 1 As shown, the method for determining the congestion level of an intersection in the embodiment of the present application mainly includes the following steps S101 to S105:
[0042] Step S101: Acquire multiple groups of vehicle trajectory data at the current intersection.
[0043] In this embodiment, multiple groups of vehicle trajectory data at the current intersection are obtained through the road test perception device.
[0044] In one embodiment, see the attached Figure 7 , Figure 7 This is a schematic diagram of obtaining multiple groups of vehicle trajectory data at the current intersection in one implementation of an embodiment of the present application, such as Figure 7 As shown, the cloud control platform collects multiple sets of vehicle trajectory data at the current intersection in real time through the road test intelligent system.
[0045] Step S102: Based on the multiple sets of vehicle trajectory data, multiple sets of single vehicle delay time data are obtained.
[0046] In this embodiment, multiple sets of single vehicle delay time data are obtained based on the multiple sets of vehicle trajectory data.
[0047] In one implementation, before step S102, step S106 may be further included:
[0048] Step S106: pre-processing the multiple groups of vehicle trajectory data; wherein the pre-processing includes data frequency reduction processing, data cleaning processing and data smoothing processing.
[0049] It should also be noted that in order to ensure the accuracy of traffic index calculation, the vehicle trajectory data needs to be preprocessed before the data is input into the algorithm, including:
[0050] 1. Data downsampling: Get all vehicle trajectory data of a uuid from the streaming data every second, sort the vehicle trajectory data by timestamp, and take the last data of the sorted vehicle trajectory data as the downsampled data within that second. In this way, the 10hz vehicle trajectory data is downscaled to 1hz. Due to data delay or accumulation, the data received in one second may not be exactly 10. In this case, the first data after sorting is also taken, such as Figure 2 shown.
[0051] 2. Data cleaning: Get the vehicle trajectory data after frequency reduction. After accumulating a calculation cycle, for the vehicle trajectory data under a uuid, if one or more of the following conditions are met:
[0052] 3.a) The total amount of data is less than or equal to 1;
[0053] 4.b) There are one or more trajectory points with an instantaneous speed greater than 50m / s;
[0054] 5. The vehicle trajectory data of the uuid is deleted and is not used as valid data in the calculation.
[0055] 6. Data smoothing: Due to errors in vehicle trajectory data, the longitude and latitude of the vehicle trajectory points may deviate from the actual vehicle position, and it is necessary to smooth the vehicle trajectory data after frequency reduction within a calculation cycle. In this application, the Kalman filter algorithm is used to smooth the vehicle trajectory points under a single uuid. Kalman filtering is a linear quadratic estimation algorithm used for state estimation of linear dynamic systems. It has strong real-time performance and high fusion accuracy, and is widely used in the field of autonomous driving. This application will not go into details about the use of Kalman filtering.
[0056] Step S103: Based on the multiple sets of single vehicle delay time data, multiple sets of entrance lane delay time data are obtained.
[0057] In this embodiment, multiple sets of entrance lane delay time data are obtained based on multiple sets of single vehicle delay time data.
[0058] In one implementation, step S103 may further include steps S1031 to S1033:
[0059] Step S1031: Obtain the free flow speed data of the road section corresponding to the current intersection.
[0060] Step S1032: Based on the multiple groups of vehicle trajectory data and the free flow speed data of the corresponding road sections, multiple groups of static delay times and multiple groups of travel delay times are obtained.
[0061] Step S1033: Based on the multiple groups of static delay times and the multiple groups of driving delay times, the delay time data of the single vehicle is obtained.
[0062] In one implementation, the calculation process of the delay time of a single vehicle is as follows:
[0063] 1. Input the free flow speed of the road section free_speed, initialize the static delay time t_stat ic = 0, the vehicle travel distance di stance = 0, and initialize the travel speed set run_speed;
[0064] 2. Extract the vehicle trajectory data of a vehicle and sort it in ascending order by timestamp;
[0065] 3. Divide the vehicle trajectory data into a group every 5 seconds and traverse it;
[0066] 4. Calculate the average speed of the trajectory points in the current window. If the average speed is less than 1 m / s, t_stat i c+=5s, otherwise go to (5);
[0067] 5. Connect the current window track points into a track line through longitude and latitude, such as Figure 3As shown, the length l of the trajectory line is calculated, di stance + = l, and the average speed is added to run_speed;
[0068] 6. After the traversal is completed, the mean value v of the elements in run_speed is calculated, and the vehicle travel delay run_de l ay is calculated according to the following formula. If the calculated result of run_de l ay is less than 0, it is taken as 0;
[0069]
[0070] 7. Output vehicle static delay t_stat i c, running delay run_de lay and delay time de lay_time = t_stat i c + run_de lay.
[0071] In one implementation, the calculation process of the entry delay time is as follows:
[0072] 1. Initialize the static total delay sum_static = 0, the running total delay sum_run_delay and the total delay time sum_dealy_time = 0;
[0073] 2. Group the vehicle trajectory data on the road section within a unit time by uuid;
[0074] 3. Traverse the grouped vehicle trajectory data;
[0075] 4. Calculate the vehicle static delay t_static, running delay run_delay and delay time delay_time, sum_static + = t_static, sum_run_delay + = run_delay, sum_delay_time + = delay_time;
[0076] 5. After the traversal is completed, determine whether sum_delay_time is greater than the unit time. If so, take the unit time length;
[0077] 6. Output sum_delay_time, sum_run_delay, and sum_static.
[0078] Step S104: Obtain the saturation of the current intersection.
[0079] In this embodiment, the saturation of the current intersection is obtained.
[0080] In one implementation, step S104 may further include steps S1041 to S1042:
[0081] Step S1041: Acquire the traffic flow data of the current intersection and the maximum traffic flow data of the current intersection.
[0082] Step S1042: Based on the traffic flow data and the maximum traffic flow data, obtain the saturation of the current intersection.
[0083] In this embodiment, the saturation of the current intersection is equal to the traffic flow data divided by the maximum traffic flow data.
[0084] Step S105: Based on the saturation of the current intersection and the multiple groups of entrance road delay time data, the congestion level of the current intersection is obtained.
[0085] In this embodiment, the congestion level of the current intersection includes unblocked, basically unblocked, slightly congested, moderately congested, and severely congested.
[0086] In one implementation, step S105 may further include steps S1051 to S1054:
[0087] Step S1051: Determine whether the saturation of the current intersection is less than a first preset threshold, if not, execute step S1053, if yes, execute step S1052.
[0088] Step S1052: determining that the congestion level of the current intersection is unblocked.
[0089] Step S1053: the maximum value among the multiple groups of entrance delay time data is selected as the delay time of the intersection.
[0090] Step S1054: Based on the delay time of the intersection, obtain the congestion level of the current intersection.
[0091] In one implementation, the first preset threshold may be set to 0.1.
[0092] It should also be noted that: 1. Input the intersection saturation and initialize the entrance road congestion degree set S; 2. Determine whether the saturation is less than or equal to 0.1. If so, output the intersection congestion as unblocked; if not, proceed to step 3; 3. Divide the vehicle trajectory data in the calculation window into several groups in chronological order, and each group has the same time interval; 4. Traverse the grouped vehicle trajectory data and calculate the delay time of each entrance road; 5. For each group of data, take the maximum value of the delay time of all entrance roads as the delay time of the intersection, determine the congestion level of the current group according to the threshold in Table 1, and add it to the set S;
[0093] Congestion level Smooth Basic smooth Mild congestion Moderate congestion Severe congestion Import delay time (s) [0,25) [25,55) [55,100] [100,145) ≥145
[0094] Table 1
[0095] In one implementation, when the number of congestion levels of the current intersection is greater than a second preset threshold, the congestion level of the current intersection is raised by one level. The second preset threshold can be set to 1. In one example, if the congestion levels of the current intersection in five unit times are respectively light congestion, basically unblocked, light congestion, basically unblocked, and basically unblocked, the congestion level of the current intersection is raised to moderate congestion.
[0096] Based on the above steps S101 to S105, multiple groups of vehicle trajectory data of the current intersection are obtained; based on the multiple groups of vehicle trajectory data, multiple groups of single vehicle delay time data are obtained; based on the multiple groups of single vehicle delay time data, multiple groups of entrance road delay time data are obtained; the saturation of the current intersection is obtained; based on the saturation of the current intersection and the multiple groups of entrance road delay time data, the congestion level of the current intersection is obtained; wherein the congestion level of the current intersection includes unblocked, basically unblocked, lightly congested, moderately congested, and severely congested. Congestion. Through the above configuration, the present application obtains multiple groups of vehicle trajectory data at the current intersection, obtains multiple groups of single vehicle delay time data based on the multiple groups of vehicle trajectory data, obtains multiple groups of entrance road delay time data based on the multiple groups of single vehicle delay time data, obtains the saturation of the current intersection, and obtains the congestion level of the current intersection according to the saturation of the current intersection and the multiple groups of entrance road delay time data, so that it can be used to calculate the congestion of the intersection while also improving the accuracy of judging the congestion level of the intersection.
[0097] The step division of the above methods is only for the purpose of clear description. When implemented, they can be combined into one step or some steps can be split and decomposed into multiple steps. As long as they include the same logical relationship, they are all within the scope of protection of this patent; adding insignificant modifications to the algorithm or process or introducing insignificant designs without changing the core design of the algorithm and process are all within the scope of protection of this patent.
[0098] See attached Figure 4 , Figure 4 1 is a schematic diagram of the main components of a system for determining the level of congestion at an intersection according to an embodiment of the application. Figure 4As shown, the system for judging the congestion level of the intersection in the embodiment of the present application mainly includes a vehicle trajectory data acquisition module 11, a single vehicle delay time data acquisition module 12, an entrance road delay time data acquisition module 13, a saturation acquisition module 14 of the current intersection, and a congestion level acquisition module 15 of the current intersection. In some embodiments, one or more of the vehicle trajectory data acquisition module 11, the single vehicle delay time data acquisition module 12, the entrance road delay time data acquisition module 13, the saturation acquisition module 14 of the current intersection, and the congestion level acquisition module 15 of the current intersection can be combined into one module. In some embodiments, a vehicle trajectory data acquisition module 11 is configured to acquire multiple groups of vehicle trajectory data at the current intersection; a single vehicle delay time data acquisition module 12 is configured to acquire multiple groups of single vehicle delay time data based on the multiple groups of vehicle trajectory data; an entrance road delay time data acquisition module 13 is configured to acquire multiple groups of entrance road delay time data based on multiple groups of single vehicle delay time data; a saturation acquisition module 14 of the current intersection is configured to acquire the saturation of the current intersection; a congestion level acquisition module 15 of the current intersection is configured to acquire the congestion level of the current intersection based on the saturation of the current intersection and the multiple groups of entrance road delay time data; wherein the congestion level of the current intersection includes unblocked, basically unblocked, lightly congested, moderately congested, and severely congested.
[0099] It is worth mentioning that all modules involved in this embodiment are logic modules. In practical applications, a logic unit can be a physical unit, a part of a physical unit, or a combination of multiple physical units. In addition, in order to highlight the innovative part of this application, this embodiment does not introduce units that are not closely related to solving the technical problems proposed by this application, but this does not mean that there are no other units in this embodiment.
[0100] In addition, some embodiments of the present application also provide an electronic device. The electronic device may be a digital computer in various forms, such as a laptop computer, a desktop computer, a workbench, a personal digital assistant, a server, a blade server, a mainframe computer, etc. The electronic device may also be a mobile device in various forms, such as a personal digital processing, a cellular phone, a smart phone, a wearable device, and other similar computing devices.
[0101] The electronic device includes: one or more processors; and a memory storing computer program instructions, wherein when the computer program instructions are executed, the processor executes the steps of the method provided in any one or more of the above embodiments. Figure 5 An exemplary structural diagram of the electronic device is disclosed. Figure 5As shown, the electronic device includes: one or more processors 1101, memory 1102, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. The various components are connected to each other using different buses, and can be installed on a common mainboard or installed in other ways as needed. The processor can process instructions executed in the electronic device, including instructions stored in or on the memory to display the graphical information of the GUI on an external input / output device (such as a display device coupled to the interface). In some other embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple electronic devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Among them, the components shown in this article, their connections and relationships, and their functions are only used as examples, and are not intended to limit the implementation of the present application described and / or required herein.
[0102] The electronic device may further include: an input device 1103 and an output device 1104. The processor 1101, the memory 1102, the input device 1103 and the output device 1104 may be connected via a bus or other means. Figure 6 The example of connecting through bus is taken in the following.
[0103] The input device 1103 can receive input digital or character information, and generate key signal input related to the user settings and function control of the electronic device, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, an indicator bar, one or more mouse buttons, a trackball, a joystick and other input devices. The output device 1104 may include a display device, an auxiliary lighting device (e.g., an LED) and a tactile feedback device (e.g., a vibration motor), etc. The display device may include, but is not limited to, a liquid crystal display (LCD), a light emitting diode (LED) display and a plasma display. In some embodiments, the display device may be a touch screen.
[0104] To provide interaction with a user, the electronic device may be a computer. The computer has: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user; and a keyboard and a pointing device (e.g., a mouse or a trackball), through which the user can provide input to the computer. Other types of devices may also be used to provide interaction with the user; for example, the feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form (including acoustic input, voice input, or tactile input).
[0105] In the embodiments of the present application, a computer program / instruction is stored on a computer-readable medium, and when the computer program / instruction is executed by a processor, the steps of the method provided by any one or more of the above embodiments are implemented. The computer-readable medium may be included in the electronic device described in the above embodiments; or it may exist independently without being assembled into the device. The above computer-readable medium carries one or more computer-readable instructions.
[0106] The memory 1102 can be used as a non-transient computer-readable storage medium, which can be used to store non-transient software programs, non-transient computer executable programs and modules. The processor 1101 executes various functional applications and data processing of the server by running the non-transient software programs, instructions and modules stored in the memory 1102, so as to implement the program instructions / modules corresponding to the method provided by any one or more embodiments in the embodiments of the present application.
[0107] The memory 1102 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the electronic device, etc. In addition, the memory 1102 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some embodiments, the memory 1102 may optionally include a memory remotely arranged relative to the processor 1101, and these remote memories may be connected to the electronic device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0108] It should be noted that the computer-readable medium described in the present application may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable medium may be any tangible medium containing or storing a program that can be used by or in combination with an instruction execution system, device or device.
[0109] Computer readable media include permanent and non-permanent, removable and non-removable media, and can be implemented by any method or technology to store information. Information can be computer readable instructions, data structures, modules of programs or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, read-only compact disk (CD-ROM), digital versatile disk (DVD) or other optical storage, magnetic cassettes, magnetic tape disk storage or other magnetic storage devices or any other non-transmission medium that can be used to store information that can be accessed by a computing device.
[0110] Computer program code for performing the operations of the present application may be written in one or more programming languages or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" language or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as an independent software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., using an Internet service provider to connect via the Internet).
[0111] In the above-described embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. For example, it can be implemented by using an application specific integrated circuit (ASIC), a general-purpose computer or any other similar hardware device. In certain embodiments, the software program of the present application can be executed by a processor to implement the above steps or functions. Similarly, the software program of the present application (including relevant data structures) can be stored in a computer-readable recording medium, for example, a RAM memory, a magnetic or optical drive or a floppy disk and similar devices. In addition, some steps or functions of the present application can be implemented by hardware, for example, as a circuit that cooperates with a processor to perform each step or function.
[0112] The computer program product provided in the embodiment of the present application includes one or more computer programs / instructions, and when the computer program / instructions are executed by the processor, the process or function described in the embodiment of the present application is generated in whole or in part. The computer may be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions may be stored in a computer-readable storage medium, or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from a website site, a computer, a server or a data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium may be any available medium that a computer can access or a data storage device such as a server or a data center that includes one or more available media integrations. The available medium may be a magnetic medium, (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive so lid state di sk (SSD)), etc.
[0113] The flow chart or block diagram in the accompanying drawings shows the possible architecture, function and operation of the equipment, method and computer program product according to various embodiments of the present application. In this regard, each box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some alternative implementations, the functions marked in the box can also occur in a different order from the order marked in the accompanying drawings. For example, two boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each box in the block diagram and / or flow chart, and the combination of the boxes in the block diagram and / or flow chart can be implemented with a dedicated system for hardware that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.
[0114] The scope of the present application is defined by the appended claims rather than the above description, and it is intended that all changes that fall within the meaning and scope of the equivalent elements of the claims are included in the present application. Any figure mark in the claims should not be regarded as limiting the claims involved. In addition, it is clear that the word "comprising" does not exclude other units or steps, and the singular does not exclude the plural. Multiple units or devices stated in the device claim may also be implemented by one unit or device through software or hardware. The words "first", "second", etc. are only used to distinguish the description, and do not indicate any particular order, nor can they be understood as indicating or implying relative importance.
[0115] The above is only a specific implementation of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily mention changes or substitutions within the technical scope disclosed in the present application, which should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims, and the above embodiments should be regarded as exemplary and non-restrictive.
Claims
1. A method for determining the level of congestion at an intersection, characterized in that: include: Get multiple sets of vehicle trajectory data at the current intersection; Based on the multiple sets of vehicle trajectory data, obtaining multiple sets of single vehicle delay time data; Based on multiple groups of single vehicle delay time data, multiple groups of import lane delay time data are obtained; Obtaining the saturation of the current intersection; Based on the saturation of the current intersection and the multiple groups of entrance road delay time data, the congestion level of the current intersection is obtained; wherein the congestion level of the current intersection includes unblocked, basically unblocked, slightly congested, moderately congested, and severely congested.
2. The method for determining the congestion level of an intersection according to claim 1, characterized in that: Before acquiring multiple groups of single vehicle delay time data based on the multiple groups of vehicle trajectory data, the method further includes: Preprocessing the multiple groups of vehicle trajectory data; The preprocessing includes data frequency reduction processing, data cleaning processing and data smoothing processing.
3. The method for determining the congestion level of an intersection according to claim 1, characterized in that: The obtaining the saturation of the current intersection includes: Acquire the traffic flow data of the current intersection and the maximum traffic flow data of the current intersection; Based on the traffic flow data and the maximum traffic flow data, the saturation of the current intersection is obtained.
4. The method for determining the congestion level of an intersection according to claim 1, characterized in that: The acquiring of multiple sets of single vehicle delay time data based on the multiple sets of vehicle trajectory data further includes: Obtaining free flow speed data of a road section corresponding to the current intersection; Based on the multiple groups of vehicle trajectory data and the free flow speed data of the corresponding road sections, multiple groups of static delay times and multiple groups of travel delay times are obtained; Based on the multiple groups of static delay times and the multiple groups of driving delay times, the delay time data of the single vehicle is obtained.
5. The method for determining the congestion level of an intersection according to claim 1, characterized in that: Based on the saturation of the current intersection and the multiple groups of entrance road delay time data, the congestion level of the current intersection is obtained, including: Determining whether the saturation of the current intersection is less than a first preset threshold; If yes, then the congestion level of the current intersection is determined to be unblocked; If not, the maximum value among the plurality of groups of entrance road delay time data is selected as the delay time of the intersection; Based on the delay time of the intersection, the congestion level of the current intersection is obtained.
6. The method for determining the congestion level of an intersection according to claim 5, characterized in that: include: When the number of congestion levels of the current intersection is greater than a second preset threshold, the congestion level of the current intersection is increased by one level.
7. A system for determining the level of congestion at an intersection, characterized in that: The system comprises: A vehicle trajectory data acquisition module, which is configured to acquire multiple sets of vehicle trajectory data at a current intersection; A single vehicle delay time data acquisition module, configured to acquire multiple sets of single vehicle delay time data based on the multiple sets of vehicle trajectory data; An import lane delay time data acquisition module, which is configured to acquire multiple sets of import lane delay time data based on multiple sets of single vehicle delay time data; A saturation acquisition module of a current intersection, configured to acquire the saturation of the current intersection; A module for acquiring the congestion level of a current intersection is configured to acquire the congestion level of the current intersection based on the saturation of the current intersection and the multiple sets of entrance road delay time data; wherein the congestion levels of the current intersection include unimpeded, basically unimpeded, slightly congested, moderately congested, and severely congested.
8. An electronic device, characterized in that: The electronic device comprises: one or more processors; and A memory storing computer program instructions, which, when executed, cause the processor to perform the steps of the method as claimed in any one of claims 1 to 6.
9. A computer readable medium having a computer program / instructions stored thereon, characterized in that: When the computer program / instructions are executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.
10. A computer program product comprising a computer program / instructions, characterized in that When the computer program / instructions are executed by a processor, the steps of the method according to any one of claims 1 to 6 are implemented.
