Priority determination method, device and system and storage medium

Abstract

The invention discloses a priority determination method, device and system and a storage medium, which are used for determining vehicle priorities. The method comprises the steps that when it is detected that a vehicle enters a preset area, information of the vehicle is acquired; determining the final priority of the vehicle according to the information of the vehicle; and putting the final priority of the vehicle into a priority queue. By adopting the scheme, the vehicle priority can be dynamically adjusted in real time.

Description

Technical Field

[0001] The present application relates to the field of intelligent transportation technology, and in particular to a priority determination method, device, system and storage medium. Background Art

[0002] With the widespread implementation of smart transportation, the significance of counting vehicle priorities has become increasingly important. In the emergency rescue phase, accurate priority statistics can enable rescue vehicles to arrive at the scene quickly; when optimizing traffic resource allocation, road space can be reasonably allocated according to priority to improve overall traffic efficiency; in traffic flow monitoring, vehicle priority statistics can help grasp real-time road conditions; during the passage of special vehicles, it can ensure smooth and unobstructed traffic.

[0003] However, current technology has shortcomings. Most of the time, vehicles are arranged according to pre-established traffic rules, and there is a serious lack of scientific, reasonable and flexible way to determine vehicle priority. Faced with ever-changing traffic scenes, this static model is difficult to adjust the vehicle traffic order in a timely manner and cannot meet the dynamic needs in actual traffic.

[0004] Therefore, how to provide a priority determination method to dynamically adjust vehicle priorities in real time has become a technical problem that needs to be solved urgently. Summary of the invention

[0005] The present application provides a priority determination method, device, system and storage medium for dynamically adjusting vehicle priority in real time.

[0006] The present application provides a priority determination method, comprising:

[0007] When a vehicle is detected to enter a preset area, obtaining information of the vehicle;

[0008] determining a final priority of the vehicle according to the information of the vehicle;

[0009] The final priority of the vehicle is placed in the priority queue.

[0010] The beneficial effect of the present application is that when a vehicle enters a preset area, the vehicle information is immediately obtained, and the final priority of the vehicle is determined based on the vehicle information, and then the vehicle is placed in a priority queue based on the final priority, and the vehicle priority can be adjusted dynamically in real time.

[0011] In one embodiment, determining the final priority of the vehicle according to the information of the vehicle includes:

[0012] Assigning initial priority to vehicles;

[0013] Determining the vehicle priority accumulated value according to the vehicle information;

[0014] A sum of the initial priority and the priority accumulation value is determined as a final priority of the vehicle.

[0015] In one embodiment, determining the vehicle priority cumulative value according to the vehicle information includes:

[0016] Determining a vehicle priority increase value corresponding to each item of preset information according to each item of preset information of the vehicle;

[0017] The sum of all vehicle priority increase values ​​is determined as the priority cumulative value.

[0018] In one embodiment, the method further comprises:

[0019] When it is detected that a vehicle leaves the preset area, the final priority of the vehicle is deleted from the priority queue.

[0020] In one embodiment, placing the final priority of the vehicle into a priority queue comprises:

[0021] Putting the final priority of the vehicle into the priority queue by skipping the table;

[0022] The step of deleting the final priority of the vehicle from the priority queue comprises:

[0023] The final priority of the vehicle is deleted from the priority queue by skipping the table.

[0024] In one embodiment, the method further comprises:

[0025] When receiving information of a first target vehicle running a red light sent by the intelligent traffic violation monitoring management system in the preset area, querying the priority corresponding to the first target vehicle through the priority queue;

[0026] When the priority corresponding to the first target vehicle is greater than a first preset value, a prompt message of legal passage of the first target vehicle is sent to the intelligent traffic violation monitoring management system in the preset area;

[0027] When the priority corresponding to the first target vehicle is less than a first preset value, a prompt message indicating that the first target vehicle is passing illegally is sent to the intelligent traffic violation monitoring and management system in the preset area.

[0028] In one embodiment, the method further comprises:

[0029] When receiving the information of the second target vehicle sent by the parking management system in the preset area, querying the priority corresponding to the second target vehicle through the priority queue;

[0030] When the priority corresponding to the second target vehicle is greater than a second preset value, sending a prompt message allowing entry to the parking management system in the preset area;

[0031] When the priority corresponding to the second target vehicle is less than a second preset value, a prompt message of not allowing entry is sent to the parking management system in the preset area.

[0032] The present application also provides a priority determination device, comprising:

[0033] An acquisition module, used for acquiring information of the vehicle when a vehicle is detected to enter a preset area;

[0034] A determination module, used to determine the final priority of the vehicle according to the information of the vehicle;

[0035] The putting module is used for putting the final priority of the vehicle into the priority queue.

[0036] In one embodiment, the determining module includes:

[0037] The initial submodule is used to assign initial priorities to vehicles;

[0038] A first determination submodule, configured to determine the vehicle priority accumulated value according to the vehicle information;

[0039] The second determination submodule is used to determine the sum of the initial priority and the priority accumulation value as the final priority of the vehicle.

[0040] In one embodiment, the first determining submodule is further configured to:

[0041] Determining a vehicle priority increase value corresponding to each item of preset information according to each item of preset information of the vehicle;

[0042] The sum of all vehicle priority increase values ​​is determined as the priority cumulative value.

[0043] In one embodiment, the apparatus further comprises:

[0044] The deleting module is used to delete the final priority of the vehicle from the priority queue when it is detected that the vehicle leaves the preset area.

[0045] In one embodiment, the insert module is further used for:

[0046] Putting the final priority of the vehicle into the priority queue by skipping the table;

[0047] The deletion module is also used for:

[0048] The final priority of the vehicle is deleted from the priority queue by skipping the table.

[0049] In one embodiment, the apparatus further comprises:

[0050] A first query module is used to query the priority corresponding to the first target vehicle through the priority queue when receiving information of the first target vehicle running a red light sent by the intelligent traffic violation monitoring management system in the preset area;

[0051] A first sending module, used for sending a prompt message of legal passage of the first target vehicle to the intelligent traffic violation monitoring management system in the preset area when the priority corresponding to the first target vehicle is greater than a first preset value;

[0052] The first sending module is also used to send a prompt message of illegal passage of the first target vehicle to the intelligent traffic violation monitoring management system in the preset area when the priority corresponding to the first target vehicle is less than a first preset value.

[0053] In one embodiment, the apparatus further comprises:

[0054] A second query module is used to query the priority corresponding to the second target vehicle through the priority queue when receiving the information of the second target vehicle sent by the parking management system in the preset area;

[0055] A second sending module, configured to send a prompt message of allowing entry to the parking management system in the preset area when the priority corresponding to the second target vehicle is greater than a second preset value;

[0056] The second sending module is further used to send a prompt message of not allowing entry to the parking management system in the preset area when the priority corresponding to the second target vehicle is less than a second preset value.

[0057] The present application also provides a priority determination system, comprising:

[0058] at least one processor; and,

[0059] a memory communicatively connected to the at least one processor; wherein,

[0060] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to implement the priority determination method recorded in any of the above embodiments.

[0061] The present application also provides a computer-readable storage medium. When the instructions in the storage medium are executed by a processor corresponding to the priority determination system, the priority determination system can implement the priority determination method recorded in any of the above embodiments.

[0062] Other features and advantages of the present application will be described in the following description, and partly become apparent from the description, or be understood by practicing the present application. The purpose and other advantages of the present application can be realized and obtained by the structures specifically pointed out in the written description, claims, and drawings.

[0063] The technical solution of the present application is further described in detail below through the accompanying drawings and embodiments. BRIEF DESCRIPTION OF THE DRAWINGS

[0064] The accompanying drawings are used to provide a further understanding of the present application and constitute a part of the specification. Together with the embodiments of the present application, they are used to explain the present application and do not constitute a limitation of the present application. In the accompanying drawings:

[0065] Figure 1 This is a flow chart of a priority determination method in one embodiment of the present application;

[0066] Figure 2 This is a structural diagram of a priority determination device in an embodiment of the present application;

[0067] Figure 3 Schematic diagram of the hardware structure of a priority determination system in one embodiment of the present application. DETAILED DESCRIPTION

[0068] The preferred embodiments of the present application are described below in conjunction with the accompanying drawings. It should be understood that the preferred embodiments described herein are only used to illustrate and explain the present application and are not used to limit the present application.

[0069] This application proposes a priority determination method to solve many problems in vehicle traffic priority sorting and dynamic query scenarios and meet the diverse needs of modern traffic management.

[0070] Figure 1 Flow chart of a priority determination method in one embodiment of the present application. Figure 1 As shown, the method can be implemented as the following steps S101-S103:

[0071] In step S101, when a vehicle is detected to enter a preset area, information of the vehicle is obtained;

[0072] In step S102, the final priority of the vehicle is determined according to the information of the vehicle;

[0073] In step S103, the final priority of the vehicle is put into a priority queue.

[0074] When a vehicle is detected to enter a preset area, information about the vehicle is obtained, including license plate number, location, vehicle type, vehicle model, vehicle direction, vehicle speed, time when the vehicle enters the preset area, etc.

[0075] The final priority of the vehicle is determined based on the information of the vehicle. First, an initial priority is assigned to the vehicle, and usually the initial priority is assigned to 0. Secondly, the cumulative value of the vehicle priority is determined based on the information of the vehicle. For example, the priorities corresponding to various pieces of vehicle information are determined separately according to the vehicle type, entry time, etc. In addition, the vehicle priority can also be adjusted according to the vehicle's current speed, direction, location, and whether it is performing a special task. All these vehicle priority increase values ​​are summed to obtain the cumulative value of the vehicle's priority. Finally, the sum of the initial priority and the cumulative priority value is determined to be the final priority of the vehicle.

[0076] The final priority of the vehicle is placed in the priority queue. In one embodiment of the present application, the final priority of the vehicle is placed in the priority queue by means of a jump table. In this embodiment, the vehicle information and the priority of the vehicle are stored by a jump table. When it is detected that the vehicle enters the preset area and the vehicle information is obtained, the information is inserted into the jump table. The insertion algorithm of the jump table will automatically insert the new vehicle information into the appropriate position in the order of priority to ensure that the vehicle information in the jump table is always arranged in order by priority. At the same time, the priority information of the vehicle is passed to the priority queue. The priority queue will insert the new vehicle into the appropriate position according to its priority, and maintain the order of the vehicles in the queue from high to low in order to quickly process high-priority vehicles. The tree array will update the cumulative value of the corresponding priority according to the priority of the newly inserted vehicle to ensure that the tree array can reflect the priority accumulation of all current vehicles in real time and provide accurate data for subsequent range statistics.

[0077] When the vehicle priority is adjusted dynamically, the priority of the vehicle in the skip list is updated and the position is adjusted. For example, if an ordinary vehicle becomes a vehicle performing an emergency task, the vehicle priority changes, then the vehicle is found in the skip list, its priority is updated, and its position in the skip list is readjusted to ensure the orderliness of the skip list. At the same time, the tree array will synchronously update the adjusted priority statistics of the vehicle to ensure that the statistics on vehicle priorities in the entire system are accurate. In addition, the vehicle with the adjusted priority is removed from the priority queue and then reinserted into the priority queue according to the new priority to ensure the correctness of the vehicle priority order in the priority queue.

[0078] When querying and counting ranges, the jump table supports range queries to quickly find vehicles within a specific priority range: When you need to query vehicles within a specific priority range, the jump table can quickly locate and return information about vehicles that meet the conditions, providing a flexible query method for traffic management. With the range query of the jump table, the tree array can quickly count the cumulative priority value or the number of vehicles within the query range, providing a quantitative basis for traffic decision-making.

[0079] When handling high-priority events, the highest priority vehicle can be taken out from the priority queue for processing. For example, when encountering an emergency, the priority queue will respond quickly and take out the highest priority vehicle information in the queue. The system will handle the vehicle accordingly based on this information, such as opening a green channel for it, adjusting traffic signals, etc., to ensure that high-priority vehicles can pass quickly and smoothly.

[0080] In one embodiment of the present application, when a vehicle is detected to leave the preset area, the final priority of the vehicle is deleted from the priority queue. Based on the heap structure, the priority queue supports fast retrieval and deletion of the highest priority vehicle, so the highest priority vehicle can be taken out of the priority queue for processing.

[0081] Based on the vehicle priority determined above, in one embodiment, vehicle violations can be processed in the intelligent traffic violation monitoring and management system. Specifically, when information of the first target vehicle that runs a red light is received from the intelligent traffic violation monitoring and management system in the preset area, the priority corresponding to the first target vehicle is queried through the priority queue; when the priority corresponding to the first target vehicle is greater than a first preset value, a prompt message indicating the legal passage of the first target vehicle is sent to the intelligent traffic violation monitoring and management system in the preset area; when the priority corresponding to the first target vehicle is less than the first preset value, a prompt message indicating the illegal passage of the first target vehicle is sent to the intelligent traffic violation monitoring and management system in the preset area.

[0082] Based on the vehicle priority determined above, in another embodiment, the parking management system can be intelligently controlled. Specifically, when the information of the second target vehicle sent by the parking management system in the preset area is received, the priority corresponding to the second target vehicle is queried through the priority queue; when the priority corresponding to the second target vehicle is greater than a second preset value, a prompt message allowing entry is sent to the parking management system in the preset area; when the priority corresponding to the second target vehicle is less than the second preset value, a prompt message not allowing entry is sent to the parking management system in the preset area.

[0083] The beneficial effect of the present application is that when a preset area is set in the car, the vehicle information is immediately obtained, and the final priority of the vehicle is determined based on the vehicle information, and then the vehicle is placed in the priority queue according to the final priority, and the vehicle priority can be adjusted dynamically in real time.

[0084] In one embodiment, the above step S102 may be implemented as the following steps A1-A3:

[0085] In step A1, the vehicles are assigned initial priorities;

[0086] In step A2, the vehicle priority cumulative value is determined according to the vehicle information;

[0087] In step A3, the sum of the initial priority and the priority accumulation value is determined as the final priority of the vehicle.

[0088] In this embodiment, each vehicle that enters a specific management scope needs to go through a rigorous and detailed process to determine its final priority.

[0089] First, assign an initial priority to the vehicle. The system will determine the priority of the vehicle based on the preset rules and strategies and the preset information related to the priority in the vehicle information. When assigning the initial priority, an initial priority value is assigned to each vehicle based on the preset information of the vehicle. Usually, the initial priority is assigned to 0.

[0090] Secondly, the vehicle priority cumulative value is determined according to the information of the vehicle. Specifically, the vehicle priority increase value corresponding to each preset information is determined according to the preset information of the vehicle; and the sum of all vehicle priority increase values ​​is determined as the priority cumulative value. According to the preset information of the vehicle, such as vehicle type, entry time, etc., the priority corresponding to each information of the vehicle is determined respectively. For example, special vehicles such as ambulances, fire trucks, and police cars are usually given a higher initial priority; while the initial priority of ordinary civilian vehicles is relatively low. For example, vehicles that enter the area earlier may obtain a slightly higher initial priority to a certain extent. By comprehensively considering these factors, the system can determine the corresponding priority for each information of each vehicle. In addition, the system can also adjust the vehicle priority according to the current driving speed, driving direction, location, and whether the vehicle is performing a special task. For example, if an ordinary vehicle is driving away from a traffic congestion area at a high speed, and its driving direction is consistent with the direction of diverting traffic, then according to the preset rules, it may obtain a corresponding priority increase value because it is potentially helpful in alleviating congestion. Or, if a vehicle receives an emergency dispatch order and is on its way to perform a special task, the system will increase its priority value according to the urgency and importance of the task. The system will determine the vehicle priority increase value corresponding to each preset information of the vehicle based on specific algorithms and rules. Then, all these vehicle priority increase values ​​are summed up, and the final sum is the cumulative priority value of the vehicle. This process fully considers the various real-time states and related factors of the vehicle during driving, making the priority determination more in line with the actual traffic conditions.

[0091] Finally, the sum of the initial priority and the priority accumulation value is determined as the final priority of the vehicle. This final priority will become an important basis for the vehicle to make traffic decisions, resource allocation and conflict coordination in the entire traffic management system.

[0092] In one embodiment, the above step A2 may be implemented as the following steps A21-A22:

[0093] In step A21, a vehicle priority increase value corresponding to each item of preset information is determined according to each item of preset information of the vehicle;

[0094] In step A22, the sum of all vehicle priority increase values ​​is determined as a priority cumulative value.

[0095] In one embodiment, the tree array can efficiently count the cumulative value or count of vehicle priorities, especially after dynamically adjusting the priorities, the statistical value within the relevant range can be quickly updated. Therefore, the cumulative value of the priority can be counted by the tree array. And by counting the cumulative value or count of the vehicle priority by the tree array, the time complexity can be reduced to (O(logn)).

[0096] In one embodiment, the method may also be implemented as the following step S104:

[0097] In step S104, when it is detected that a vehicle leaves the preset area, the final priority of the vehicle is deleted from the priority queue.

[0098] In one embodiment, the above step S103 may be implemented as the following step B1:

[0099] In step B1, the final priority of the vehicle is put into the priority queue by skipping the table;

[0100] The above step S104 can be implemented as the following step B2:

[0101] In step B2, the final priority of the vehicle is deleted from the priority queue by jumping the table.

[0102] In one embodiment, the method can also be implemented as the following steps C1-C3:

[0103] In step C1, when information of a first target vehicle running a red light sent by the intelligent traffic violation monitoring management system in the preset area is received, the priority corresponding to the first target vehicle is queried through the priority queue;

[0104] In step C2, when the priority corresponding to the first target vehicle is greater than a first preset value, a prompt message of legal passage of the first target vehicle is sent to the intelligent traffic violation monitoring management system in the preset area;

[0105] In step C3, when the priority corresponding to the first target vehicle is less than a first preset value, a prompt message indicating that the first target vehicle is passing illegally is sent to the intelligent traffic violation monitoring and management system in the preset area.

[0106] In one embodiment, the method can also be implemented as the following steps D1-D3:

[0107] In step D1, when the information of the second target vehicle sent by the parking management system in the preset area is received, the priority corresponding to the second target vehicle is queried through the priority queue;

[0108] In step D2, when the priority corresponding to the second target vehicle is greater than a second preset value, a prompt message of allowing entry is sent to the parking management system in the preset area;

[0109] In step D3, when the priority corresponding to the second target vehicle is less than a second preset value, a prompt message of not allowing entry is sent to the parking management system in the preset area.

[0110] In one embodiment, based on the determination of vehicle priority, the vehicle can be further processed. In this embodiment, a vehicle traffic priority sorting and dynamic query solution based on a skip list, a priority queue and a tree array is provided.

[0111] A skip list is a randomized data structure, which is essentially an ordered linked list that can perform binary search. A skip list adds multiple levels of indexes to the original ordered linked list, and implements fast search through indexes. A skip list can not only improve search performance, but also improve the performance of insertion and deletion operations. In this embodiment, a skip list is used to store vehicle information, such as license plate number, location, priority, etc., and supports fast range query, realizing efficient dynamic insertion, deletion, and query operations.

[0112] Priority Queue is a special queue data structure in which elements are assigned priorities. When accessing queue elements, insertion and removal operations can be performed in the order of the element's priority. In this embodiment, the priority queue is used to handle high-priority events, such as accident rescue vehicles, special vehicle passage, etc., and supports fast retrieval and deletion of the highest priority vehicles.

[0113] A binary indexed tree (BIT) is an array based on a tree structure, which is very efficient in solving some problems related to the prefix sum of an array, such as dynamically finding interval sums, single-point updates, and other operations. In this embodiment, it is used to efficiently count the cumulative value or count of vehicle priorities, especially to quickly update the statistical values ​​within the relevant range after dynamically adjusting the priorities. The update formula of the tree array is as follows:

[0114] (1) Single-point update formula

[0115] Update the value of the element corresponding to index position i using the following formula:

[0116] BIT[i]+=Δ,i=i+(i&-i)

[0117] Among them, i is the index position, BIT[i] is the element value corresponding to the index position i, Δ The value to increase by for the element at index position i.

[0118] (2) Interval query formula

[0119] The cumulative value of the first i elements is queried using the following formula:

[0120]

[0121] Among them, BIT[j] is the element value corresponding to index position j, and sum(i) is the cumulative value of the first i element values.

[0122] (3) Interval and

[0123] The sum of the values ​​of the elements whose positions are in the range [l, r] is calculated using the following formula:

[0124] RangeSum(l,r)=Sum(r)-Sum(l-1)

[0125] Among them, RangeSum(l, r) is the sum of the element values ​​​​within the range [l, r], and sum(r) is the cumulative value of the first r element values ​​​​.

[0126] Based on this, we can take the priority information of a batch of vehicles in Table 1 as an example. The specific operations include: ① query the number of vehicles and the total priority in the priority range [3, 7]; ② adjust the priority of A002 to 9; ③ process the vehicle with the highest priority.

[0127] Table 1 Vehicle priority information

[0128] Vehicle number Priority A001 5 A002 3 A003 8 A004 2 A005 7

[0129] In order to achieve the above operation, first, initialize the jump table, that is, insert vehicle information, and sort the jump table by priority. Then, initialize the tree array, and the initial state records the priority accumulation value:

[0130] BIT[1]=5(A001, priority 5);

[0131] BIT[2]=8(A002+A001,priority 3+5);

[0132] BIT[3]=16(A003+A002+A001, priority 8+3+5);

[0133] And so on. The initial data tree array BIT = [0,5,8,16,18,25].

[0134] Then initialize the priority queue, that is, insert all vehicles, and the top of the queue is the highest priority vehicle.

[0135] (1) For operation 1: query the vehicles with priority [3,7] and the sum of their priorities,

[0136] The jump table can be used to locate vehicles A001, A002, and A005 within the range;

[0137] And use the tree array to calculate the total priority (5+3+7=15).

[0138] The total priority of vehicles in the range [3,7] is 15 (19 after updating).

[0139] (2) For operation 2: adjust the priority of vehicle number A002 to 9,

[0140] First, update the priority position of A002 in the jump table.

[0141] Then, the priority cumulative value of A002 is adjusted in the tree array: a change of +6 is added.

[0142] Finally, the priority of A002 is updated in the priority queue.

[0143] (3) For Operation 3: Process the highest priority vehicle,

[0144] First, A002 (priority 9) is taken out from the priority queue.

[0145] Then, the A002 information is deleted from the jump table and the tree array.

[0146] In this embodiment, the skip table supports dynamic insertion and deletion operations to ensure that data is always arranged in order according to priority; the tree array can quickly update the statistical value of the priority, avoid global recalculation, and ensure that the addition, deletion or update operation of the vehicle priority information can be completed within the time complexity of O (logn), reducing the dynamic maintenance cost of the system, and significantly improving the efficiency of dynamic update of vehicle priority. The skip table provides efficient range query capabilities to quickly locate vehicles in a specified range; when querying the cumulative value or count, the tree array avoids item-by-item traversal through a hierarchical structure, and when querying the cumulative value or number of vehicles within the specified priority range, the query efficiency is improved to O (logn), which can quickly respond to complex real-time traffic management needs, and the efficiency of priority retrieval and range query is improved. The priority queue is designed based on a heap structure and can quickly find the vehicle with the highest priority; combined with the skip table, the priority sorting can be dynamically adjusted after the emergency event is handled, and the rapid retrieval and dispatch of high-priority events (such as ambulances and police cars) can respond in real time. The vehicle with the highest priority can be found and processed within O (logn) time, and the response speed of emergency events is accelerated. The efficient statistical mechanism of the tree array further optimizes the performance of range operations. The data structure design makes full use of the layering and partitioning mechanism (skip list and tree array) to reduce the impact of a single operation on global performance. The solution can still maintain stable performance in high-concurrency scenarios, which is suitable for real-time processing of large-scale vehicle data and improves the overall performance stability of the system. The flexibility of the skip list supports the dynamic adjustment of vehicle information. The tree array combined with the priority queue balances the contradiction between statistical requirements and real-time scheduling. It can adapt to a variety of traffic management scenarios, including range priority scheduling, real-time event response, and statistics and analysis of long-term traffic data, and has enhanced flexibility in adapting to complex traffic scenarios.

[0147] Figure 2 Schematic diagram of a priority determination device in one embodiment of the present application. Figure 2 As shown, the device comprises:

[0148] The acquisition module 201 is used to acquire information of the vehicle when a vehicle is detected to enter a preset area;

[0149] A determination module 202, configured to determine a final priority of the vehicle according to the information of the vehicle;

[0150] The placing module 203 is used to place the final priority of the vehicle into the priority queue.

[0151] In one embodiment, the determining module includes:

[0152] The initial submodule is used to assign initial priorities to vehicles;

[0153] A first determination submodule, configured to determine the vehicle priority accumulated value according to the vehicle information;

[0154] The second determination submodule is used to determine the sum of the initial priority and the priority accumulation value as the final priority of the vehicle.

[0155] In one embodiment, the first determining submodule is further configured to:

[0156] Determining a vehicle priority increase value corresponding to each item of preset information according to each item of preset information of the vehicle;

[0157] The sum of all vehicle priority increase values ​​is determined as the priority cumulative value.

[0158] In one embodiment, the apparatus further comprises:

[0159] The deleting module is used to delete the final priority of the vehicle from the priority queue when it is detected that the vehicle leaves the preset area.

[0160] In one embodiment, the insert module is further used for:

[0161] Putting the final priority of the vehicle into the priority queue by skipping the table;

[0162] The deletion module is also used for:

[0163] The final priority of the vehicle is deleted from the priority queue by skipping the table.

[0164] In one embodiment, the apparatus further comprises:

[0165] A first query module is used to query the priority corresponding to the first target vehicle through the priority queue when receiving information of the first target vehicle running a red light sent by the intelligent traffic violation monitoring management system in the preset area;

[0166] A first sending module, used for sending a prompt message of legal passage of the first target vehicle to the intelligent traffic violation monitoring management system in the preset area when the priority corresponding to the first target vehicle is greater than a first preset value;

[0167] The first sending module is also used to send a prompt message of illegal passage of the first target vehicle to the intelligent traffic violation monitoring management system in the preset area when the priority corresponding to the first target vehicle is less than a first preset value.

[0168] In one embodiment, the apparatus further comprises:

[0169] A second query module is used to query the priority corresponding to the second target vehicle through the priority queue when receiving the information of the second target vehicle sent by the parking management system in the preset area;

[0170] A second sending module, configured to send a prompt message of allowing entry to the parking management system in the preset area when the priority corresponding to the second target vehicle is greater than a second preset value;

[0171] The second sending module is further used to send a prompt message of not allowing entry to the parking management system in the preset area when the priority corresponding to the second target vehicle is less than a second preset value.

[0172] Figure 3 FIG. 1 is a schematic diagram of the hardware structure of a priority determination system in an embodiment of the present application. Figure 3 As shown, the priority determination system includes:

[0173] at least one processor 320; and,

[0174] A memory 304 in communication with the at least one processor 320; wherein,

[0175] The memory 304 stores instructions that can be executed by the at least one processor 320, and the instructions are executed by the at least one processor 320 to implement the priority determination method described in any of the above embodiments.

[0176] Reference Figure 3 , the priority determination system 300 may include one or more of the following components: a processing component 302 , a memory 304 , a power component 306 , a multimedia component 308 , an audio component 310 , an input / output (I / O) interface 312 , a sensor component 314 , and a communication component 316 .

[0177] The processing component 302 generally controls the overall operation of the priority determination system 300. The processing component 302 may include one or more processors 320 to execute instructions to complete all or part of the steps of the above method. In addition, the processing component 302 may include one or more modules to facilitate the interaction between the processing component 302 and other components. For example, the processing component 302 may include a multimedia module to facilitate the interaction between the multimedia component 308 and the processing component 302.

[0178] The memory 304 is configured to store various types of data to support the operation of the priority determination system 300. Examples of such data include instructions for any application or method operating on the priority determination system 300, such as text, pictures, videos, etc. The memory 304 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic disk or optical disk.

[0179] The power supply component 306 provides power to the various components of the prioritization system 300. The power supply component 306 may include a power management system, one or more power supplies, and other components associated with generating, managing, and distributing power to the prioritization system 300.

[0180] The multimedia component 308 includes a screen that provides an output interface between the priority determination system 300 and the user. In some embodiments, the screen may include a liquid crystal display (LCD) and a touch panel (TP). If the screen includes a touch panel, the screen may be implemented as a touch screen to receive input signals from the user. The touch panel includes one or more touch sensors to sense touch, slide, and gestures on the touch panel. The touch sensor may not only sense the boundaries of the touch or slide action, but also detect the duration and pressure associated with the touch or slide operation. In some embodiments, the multimedia component 308 may also include a front camera and / or a rear camera. When the priority determination system 300 is in an operating mode, such as a shooting mode or a video mode, the front camera and / or the rear camera may receive external multimedia data. Each front camera and rear camera may be a fixed optical lens system or have a focal length and optical zoom capability.

[0181] The audio component 310 is configured to output and / or input audio signals. For example, the audio component 310 includes a microphone (MIC), and when the priority determination system 300 is in an operation mode, such as an alarm mode, a recording mode, a voice recognition mode, and a voice output mode, the microphone is configured to receive an external audio signal. The received audio signal can be further stored in the memory 304 or sent via the communication component 316. In some embodiments, the audio component 310 also includes a speaker for outputting audio signals.

[0182] I / O interface 312 provides an interface between processing component 302 and peripheral interface modules, such as keyboards, click wheels, buttons, etc. These buttons may include but are not limited to: a home button, a volume button, a start button, and a lock button.

[0183] The sensor assembly 314 includes one or more sensors for providing various aspects of status assessment for the priority determination system 300. For example, the sensor assembly 314 may include an acoustic sensor. In addition, the sensor assembly 314 may detect the on / off state of the priority determination system 300, the relative positioning of components, such as the display and keypad of the priority determination system 300, the operating state of the priority determination system 300 or a component of the priority determination system 300, the orientation or acceleration / deceleration of the priority determination system 300, and the temperature change of the priority determination system 300. The sensor assembly 314 may include a proximity sensor configured to detect the presence of a nearby object without any physical contact. The sensor assembly 314 may also include an optical sensor, such as a CMOS or CCD image sensor, for use in imaging applications. In some embodiments, the sensor assembly 314 may also include an acceleration sensor, a gyroscope sensor, or a temperature sensor.

[0184] The communication component 316 is configured to enable the priority determination system 300 to provide the ability to communicate with other devices and cloud platforms in a wired or wireless manner. The priority determination system 300 can access a wireless network based on a communication standard, such as WiFi, 2G or 3G, or a combination thereof. In an exemplary embodiment, the communication component 316 receives a broadcast signal or broadcast-related information from an external broadcast management system via a broadcast channel. In an exemplary embodiment, the communication component 316 also includes a near field communication (NFC) module to facilitate short-range communication. For example, the NFC module can be implemented based on radio frequency identification (RFID) technology, infrared data association (IrDA) technology, ultra-wideband (UWB) technology, Bluetooth (BT) technology and other technologies.

[0185] In an exemplary embodiment, the priority determination system 300 may be implemented by one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field programmable gate arrays (FPGAs), controllers, microcontrollers, microprocessors, or other electronic components to execute the priority determination method described in any of the above embodiments.

[0186] The present application also provides a computer-readable storage medium. When the instructions in the storage medium are executed by a processor corresponding to the priority determination system, the priority determination system can implement the priority determination method recorded in any of the above embodiments.

[0187] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage and optical storage, etc.) that contain computer-usable program code.

[0188] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0189] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0190] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0191] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A priority determination method, characterized in that: include: When a vehicle is detected to enter a preset area, obtaining information of the vehicle; determining a final priority of the vehicle according to the information of the vehicle; The final priority of the vehicle is placed in the priority queue.

2. The method according to claim 1, characterized in that The determining the final priority of the vehicle according to the information of the vehicle comprises: Assigning initial priority to vehicles; Determining the vehicle priority accumulated value according to the vehicle information; A sum of the initial priority and the priority accumulation value is determined as a final priority of the vehicle.

3. The method according to claim 2, characterized in that The step of determining the vehicle priority accumulated value according to the vehicle information includes: Determining a vehicle priority increase value corresponding to each item of preset information according to each item of preset information of the vehicle; The sum of all vehicle priority increase values ​​is determined as the priority cumulative value.

4. The method according to claim 1, characterized in that The method further comprises: When it is detected that a vehicle leaves the preset area, the final priority of the vehicle is deleted from the priority queue.

5. The method according to claim 4, characterized in that The step of placing the final priority of the vehicle into a priority queue comprises: Putting the final priority of the vehicle into the priority queue by skipping the table; The step of deleting the final priority of the vehicle from the priority queue comprises: The final priority of the vehicle is deleted from the priority queue by skipping the table.

6. The method according to claim 1, characterized in that The method further comprises: When receiving information of a first target vehicle running a red light sent by the intelligent traffic violation monitoring management system in the preset area, querying the priority corresponding to the first target vehicle through the priority queue; When the priority corresponding to the first target vehicle is greater than a first preset value, a prompt message of legal passage of the first target vehicle is sent to the intelligent traffic violation monitoring management system in the preset area; When the priority corresponding to the first target vehicle is less than a first preset value, a prompt message indicating that the first target vehicle is passing illegally is sent to the intelligent traffic violation monitoring and management system in the preset area.

7. The method according to claim 1, characterized in that The method further comprises: When receiving the information of the second target vehicle sent by the parking management system in the preset area, querying the priority corresponding to the second target vehicle through the priority queue; When the priority corresponding to the second target vehicle is greater than a second preset value, sending a prompt message allowing entry to the parking management system in the preset area; When the priority corresponding to the second target vehicle is less than a second preset value, a prompt message of not allowing entry is sent to the parking management system in the preset area.

8. A priority determination device, characterized in that: include: An acquisition module, used for acquiring information of the vehicle when a vehicle is detected to enter a preset area; A determination module, used to determine the final priority of the vehicle according to the information of the vehicle; The putting module is used for putting the final priority of the vehicle into the priority queue.

9. A priority determination system, characterized in that: include: at least one processor; as well as, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor to implement the priority determination method according to any one of claims 1 to 7.

10. A computer-readable storage medium, characterized in that: When the instructions in the storage medium are executed by a processor corresponding to the priority determination system, the priority determination system is enabled to implement the priority determination method as described in any one of claims 1 to 7.

Images