A method, system, electronic device and storage medium for task allocation

Abstract

The present disclosure provides a method, system, electronic device and storage medium for task allocation, which relates to the field of information processing technology, and in particular to the field of task allocation technology. The specific implementation scheme is: after obtaining the tasks to be allocated, the configuration information of each candidate and the number of current pending tasks, based on the configuration information of each candidate and the number of current pending tasks, determine the idle personnel who can accept the task allocation, and then allocate the tasks to be allocated to the idle personnel based on the matching results of the configuration information of each idle personnel and each task to be allocated, until the number of pending tasks of the idle personnel reaches a preset task amount threshold. Applying the embodiments of the present disclosure, each task is automatically allocated to the idle personnel who can handle the task based on the preset candidate configuration information and the current number of pending tasks. Automatic task allocation is achieved, manual operations are simplified, task allocation efficiency is improved, task processing speed is accelerated, and a better allocation effect is achieved.

Description

Technical Field

[0001] The present disclosure relates to the field of information processing technology, and in particular to the field of task allocation technology. Background Art

[0002] Currently, in all walks of life, there is a process of allocating work tasks to various personnel for processing. Summary of the invention

[0003] The present disclosure provides a method, system, electronic device and storage medium for task allocation to improve task allocation efficiency.

[0004] According to one aspect of the present disclosure, a method for task allocation is provided, which is used in a task allocation system, comprising:

[0005] Get each task to be assigned;

[0006] Obtain the configuration information of each candidate and the number of tasks currently pending for each candidate;

[0007] Determine an idle person who can accept task assignment based on the configuration information of each candidate and the number of tasks currently to be processed by each candidate;

[0008] For each idle person, based on the matching result between the configuration information of the idle person and each task to be assigned, the task to be assigned is assigned to the idle person until the number of tasks to be processed by the idle person reaches a preset task amount threshold.

[0009] According to another aspect of the present disclosure, there is provided a task allocation system, comprising:

[0010] A task acquisition module to be assigned, used to acquire each task to be assigned;

[0011] The configuration information acquisition module is used to obtain the configuration information of each candidate and the number of tasks currently to be processed by each candidate;

[0012] An idle personnel determination module is used to determine idle personnel who can accept task assignment based on the configuration information of each candidate and the number of tasks currently to be processed by each candidate;

[0013] The task allocation module is used to allocate the to-be-allocated tasks to each idle person based on the matching results between the configuration information of the idle person and each to-be-allocated task, until the number of to-be-allocated tasks of the idle person reaches a preset task quantity threshold.

[0014] According to another aspect of the present disclosure, there is provided an electronic device, comprising:

[0015] at least one processor; and

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

[0017] 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 so that the at least one processor can perform any of the above-mentioned task allocation methods.

[0018] According to another aspect of the present disclosure, a non-transitory computer-readable storage medium storing computer instructions is provided, wherein the computer instructions are used to enable the computer to execute any of the above-mentioned task allocation methods.

[0019] According to another aspect of the present disclosure, a computer program product is provided, including a computer program, wherein the computer program implements any of the above-mentioned task allocation methods when executed by a processor.

[0020] It should be understood that the content described in this section is not intended to identify the key or important features of the embodiments of the present disclosure, nor is it intended to limit the scope of the present disclosure. Other features of the present disclosure will become easily understood through the following description. BRIEF DESCRIPTION OF THE DRAWINGS

[0021] The accompanying drawings are used to better understand the present solution and do not constitute a limitation of the present disclosure.

[0022] Figure 1 is a schematic diagram of a first embodiment of a method for task allocation provided by the present disclosure;

[0023] Figure 2 is a schematic diagram of the task allocation method provided by the present disclosure;

[0024] Figure 3 is a schematic diagram of a second embodiment of the method for task allocation provided by the present disclosure;

[0025] Figure 4 is a schematic diagram of performing task sequencing in an embodiment of the present disclosure;

[0026] Figure 5 is a flow chart for finding idle personnel in an embodiment of the present disclosure;

[0027] Figure 6 is an example diagram for finding an idle person in an embodiment of the present disclosure;

[0028] Figure 7 is a schematic diagram of a third embodiment of the method for task allocation provided by the present disclosure;

[0029] Figure 8is a schematic diagram of a fourth embodiment of a method for task allocation provided by the present disclosure;

[0030] Fig. 9 is a schematic diagram of a user management interface of a task allocation system provided by an embodiment of the present disclosure;

[0031] Fig.10 is a schematic diagram of a system interface for implementing manual task allocation in an embodiment of the present disclosure;

[0032] Fig.11 This is a schematic diagram of a system interface for implementing manual task consolidation in an embodiment of the present disclosure;

[0033] Fig.12 is a schematic diagram of a first embodiment of a task allocation system provided by the present disclosure;

[0034] Fig.13 is a schematic diagram of a second embodiment of a task allocation system provided by the present disclosure;

[0035] Fig.14 The block diagram is a block diagram of an electronic device for implementing the task allocation method according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0036] The following is a description of exemplary embodiments of the present disclosure in conjunction with the accompanying drawings, including various details of the embodiments of the present disclosure to facilitate understanding, which should be considered as merely exemplary. Therefore, it should be recognized by those of ordinary skill in the art that various changes and modifications may be made to the embodiments described herein without departing from the scope and spirit of the present disclosure. Similarly, for the sake of clarity and conciseness, descriptions of well-known functions and structures are omitted in the following description.

[0037] At present, in the field of maps, after collecting image data (such as pictures) for maps, these image data are usually subjected to image recognition to improve map-related products. However, the recognition results obtained through image recognition are difficult to be 100% accurate. In order to ensure the accuracy and reduce quality risks, manual verification and confirmation of the recognition results (i.e., image verification) are indispensable.

[0038] In the manual image verification process, after creating an image verification plan, the team leader is usually responsible for splitting the plan into multiple subtasks and assigning them to team members. Tasks will be generated under the name of the team member, and the team member can verify the work on the tasks under his name. However, it is difficult for the team leader to ensure the global optimality when assigning tasks, and when team members receive tasks, there will be ineffective loss of tasks due to the limit on the number of tasks. That is, some team members are idle while waiting to receive tasks, while other team members may also have a backlog of tasks under their names. The distribution effect is not good, resulting in low efficiency and increased management costs.

[0039] Based on this, the present disclosure provides a method, system, electronic device and storage medium for task allocation. The following first exemplifies the method for task allocation provided by the present disclosure.

[0040] The task allocation method provided by the present disclosure can be applied to a task allocation system to achieve automatic allocation of tasks. The above-mentioned task allocation system can be a network platform, a server, etc. And the system can display the relevant system interface to the user.

[0041] See also Figure 1 , Figure 1 Schematic diagram of a first embodiment of the method for task allocation provided by the present disclosure. The method may include the following steps:

[0042] Step S110, obtaining each task to be assigned.

[0043] In the field of map applications, it is usually necessary to mark information such as traffic lights, speed limits, traffic restrictions (such as no left turn), warning information (such as prompts for accident-prone sections) and road directions on the map. Therefore, it is necessary to perform image recognition on the image data collected by the image acquisition device to obtain the above information. For example, image recognition can be performed on the above image data to obtain recognition results such as traffic limit signs (such as no left turn signs), ground traffic limits (such as no left turn ground signs), ground vehicle signals (such as bus lane ground signs), vehicle signal signs (such as lane signs), ground speed limits, speed limit signs, warning information, road directions, traffic lights and billboard information (such as road construction billboards) in the image data, and then obtain information such as traffic lights, speed limits, traffic restrictions, warning information and road directions.

[0044] However, the recognition results of the above image recognition cannot be guaranteed to be completely accurate, so personnel are required to verify the results of the above image recognition. Accordingly, in one embodiment of the present disclosure, the above tasks to be assigned may include recognition result verification tasks for traffic limit signs, ground traffic limits, ground vehicle signals, vehicle signal signs, ground speed limits, speed limit signs, warning information, road directions, traffic lights, and billboard information, etc. The above recognition results are usually assigned to relevant personnel in the form of pictures, and the relevant personnel verify these pictures (i.e., perform picture verification).

[0045] In an embodiment of the present disclosure, after obtaining the above-mentioned tasks to be assigned, the system may store the information of each task to be assigned. For example, the task identifier (such as task number) of the task to be assigned and the task type information may be stored in correspondence.

[0046] Step S120, obtaining configuration information of each candidate and the number of tasks currently to be processed for each candidate.

[0047] In the disclosed embodiment, the candidate personnel may be personnel who can perform photo verification, such as members of groups, etc. The groups may be pre-divided based on administrative management, for example, may include a test group, etc.

[0048] In the disclosed embodiment, the configuration information of each candidate can be manually preset and stored in the system. As an implementation method, the candidate identity information (such as the candidate number, etc.) and the candidate configuration information can be manually set in the displayed system interface. In the disclosed embodiment, the system can also store the list information of pending tasks for each candidate, such as the information of pending tasks for each candidate and the number of pending tasks. And the number of pending tasks for each candidate can be updated after each task is assigned.

[0049] Therefore, in the embodiment of the present disclosure, the system can directly read the stored configuration information of each candidate and the number of tasks currently to be processed for each candidate.

[0050] In one embodiment of the present disclosure, the configuration information of the candidate may include the task processing authority, personnel status, and group information of the candidate. The task processing authority of the candidate may include the type of task that the candidate can process. The task processing authority information may be manually pre-set by taking an exam on each candidate and then based on the candidate's exam results. The personnel status may include the on / off status of the candidate's automatic task allocation and whether the person is in office. The group information is the group to which the candidate belongs.

[0051] Step S130: Based on the configuration information of each candidate and the number of tasks currently to be processed by each candidate, determine an idle person who can accept task assignment.

[0052] In the disclosed embodiment, the task volume threshold can be preset manually and stored in the system. If the number of tasks currently to be processed by the candidate exceeds the threshold, the candidate is no longer capable of accepting task assignments. The above task volume threshold can be preset manually for different groups or group members, or can be preset by the group or group member.

[0053] In one embodiment of the present disclosure, a configuration condition may be pre-set, and a task may be assigned to a candidate only if the candidate's configuration information satisfies the configuration condition.

[0054] Step S140, for each idle person, based on the matching result between the configuration information of the idle person and each task to be assigned, the task to be assigned is assigned to the idle person until the number of tasks to be processed by the idle person reaches a preset task amount threshold.

[0055] As described above, the configuration information of the candidate personnel may include the types of tasks that the candidate personnel can handle. Therefore, in one embodiment of the present disclosure, the system may match the information on the types of tasks that can be processed contained in the configuration information of the idle personnel with the types of tasks to be assigned, so as to assign the tasks to be assigned that the idle personnel can handle to the idle personnel. If the configuration information of the idle personnel fails to match the tasks to be assigned, the idle personnel cannot handle the tasks to be assigned, and even if the tasks to be assigned have a higher priority, the tasks to be assigned cannot be assigned to the idle personnel for processing. For example, for the task of verifying the restricted traffic signs for trucks, such tasks can only be assigned to the idle personnel whose configuration information contains the type of tasks.

[0056] like Figure 2 As shown, in the embodiment of the present disclosure, the system can first empower the candidate personnel (i.e., pre-configure the configuration information of each personnel), and then automatically assign tasks, i.e., push tasks to the empowered personnel.

[0057] In the embodiment of the present disclosure, the system can push the tasks to be assigned to the enabled personnel through IM (Instant Messaging) and / or email. As a specific implementation method, it can be pushed to the user terminal of the corresponding personnel through IM, etc. The present disclosure does not specifically limit the method of sending the tasks to the personnel.

[0058] It can be seen that in the disclosed embodiment, after the system obtains the tasks to be assigned, the configuration information of each candidate and the number of tasks to be processed currently for each candidate, it determines the idle personnel who can accept the task assignment based on the configuration information of each candidate and the number of tasks to be processed currently. Then, for each idle personnel, based on the matching result between the configuration information of the idle personnel and each task to be assigned, the task to be assigned is assigned to the idle personnel until the number of tasks to be processed for the idle personnel reaches the preset task amount threshold. Applying the disclosed embodiment, by presetting the configuration information of the candidate, and based on the configuration information and the number of tasks to be processed currently for each candidate, each task is automatically assigned to the idle personnel who can handle the task. Automatic task assignment is achieved, manual operation is simplified, manual verification costs are reduced, task management costs are also reduced, task assignment efficiency is improved, task processing and circulation speed are accelerated, task backlogs caused by improper task assignment are avoided, and a better assignment effect is achieved.

[0059] As mentioned above, when assigning tasks, usually after the plan is created, it is manually split into multiple tasks for image verification. In one embodiment of the present disclosure, different task types can be manually defined in the system in advance, and the system can set different plans for different task types. For example, image verification plans can be set for traffic limit signs, ground traffic limits, ground vehicle signals, vehicle signal signs, ground speed limits, speed limit signs, warning information, road directions, traffic lights, and billboard information. For each plan, the recognition results corresponding to the image data collected on the same day can be used as a task. As a specific implementation method, each recognition result can include the acquisition timestamp of the corresponding image data, and the system can split the plan according to the timestamp. In the embodiment of the present disclosure, a task can include multiple pictures to be verified.

[0060] In one embodiment of the present disclosure, before allocating the tasks to be allocated, the tasks can be sorted to give priority to high-priority tasks, prevent task backlogs, and improve task processing efficiency. Figure 1 ,like Figure 3 As shown, before the above step S140, the following steps may be included:

[0061] Step S240: sort the tasks to be assigned according to their global priorities.

[0062] In one embodiment of the present disclosure, the global priority of each task to be assigned can be calculated by the system based on a preset strategy. In the present disclosure, the strategy content can be manually preset and stored in the system. After receiving the task to be assigned, the system can calculate the global priority of each task to be assigned based on each preset strategy.

[0063] like Figure 4 As shown, for each task to be assigned in the task pool, the system can calculate the global priority of each task to be assigned based on preset strategies 1, strategy 2...strategy N. And sort each task based on the global priority of each task to be assigned to obtain a task queue. In this way, by comprehensively calculating the priority of the task to be assigned based on multiple strategies, it can be guaranteed to the greatest extent that the sorting result of each task to be assigned is globally optimal.

[0064] In an embodiment of the present disclosure, the above-mentioned preset strategy may include: one or more of the city level, location, and data lag time corresponding to the task to be assigned, etc.

[0065] In the embodiments of the present disclosure, the above-mentioned city level may be the level of the city where the image data corresponding to the task to be assigned is collected. The levels of each city can be predefined manually. For example, each city can be defined as a first-tier city, a second-tier city, a third-tier city, and so on. The above-mentioned area can be the area where the image data corresponding to the task to be assigned is collected. For example, it can be divided into urban areas and suburban areas, etc. The above-mentioned urban areas and suburban areas can also be predefined manually. The above-mentioned data lag time can be the time interval from the collection time of the image data corresponding to the task to be assigned to the current moment, and the measurement unit can be days.

[0066] As described above, each of the above-mentioned recognition results (pictures to be verified) may include the collection timestamp of the corresponding image data. In the embodiments of the present disclosure, each of the above-mentioned pictures to be verified may also include the collection location of the corresponding image data (such as city identification, area identification, etc.). Correspondingly, when the system calculates the priority of each task to be assigned, it can obtain the city level, area, and data lag time corresponding to the picture to be verified based on the timestamp information, city identification, and area identification included in each picture to be verified in the task to be assigned. If a task to be assigned includes multiple pictures to be verified, the average value of the global priorities of each picture to be verified can be taken as the priority of the task to be assigned.

[0067] As described above, there can be multiple preset policies. Therefore, as an embodiment of the present disclosure, the above-mentioned global priority can be obtained by the system through weighted calculation based on the above-mentioned preset policies.

[0068] As a specific implementation manner, if the preset policy is the city level, area, and data lag time corresponding to the task to be assigned, then the global priority can be calculated using the following formula:

[0069] Global priority = c * w1 + p * w2 + t * w3

[0070] Among them, c can represent the value corresponding to the city level, and w1 can represent the weight coefficient corresponding to this policy. As a specific example, the weight coefficient w1 can be set to 0.5, the value of a first-tier city can be set to 1.0, the value of a second-tier city can be set to 0.7, and the value of a third-tier city can be set to 0.4. p can represent the value corresponding to the area, and w2 is the weight coefficient corresponding to this policy. For example, the weight w2 can be set to 0.2, and the value of the urban area can be set to 1.0, and the value of the suburban area can be set to 0.5. t can represent the value corresponding to the data lag time, and w3 can represent the weight coefficient of this policy. For example, the weight w3 of this policy can be 0.3. It can be set that when t < 1 day, the value is 0.1; when 1 day < t < 2 days, the value is 0.2; when 3 days < t < 5 days, the value is 0.3; when t > 5 days, the value is 0.4.

[0071] It can be seen that in this embodiment, the higher the level of the city where the image data corresponding to the task to be assigned is collected, the higher the priority. For example, first-tier cities have higher priority than second- and third-tier cities. For the collection area of ​​the image data corresponding to the task to be assigned, the urban area has higher priority than the suburban area. For the lag time of the image data corresponding to the task to be assigned, the longer the lag time, the higher the priority. The global priority calculated based on these strategies can better reflect the urgency of the task to be assigned, and further ensure that more urgent tasks are assigned and processed first.

[0072] Based on the above example, if a task to be assigned contains a timestamp information of 4 days ago, the city is identified as a first-tier city, and the location is identified as an urban area, then the global priority of the task obtained by the system after weighted calculation is 1*0.5+1*0.2+*0.3*0.3=0.79.

[0073] Accordingly, in one embodiment of the present disclosure, based on Figure 1 ,like Figure 3 As shown, the above step S140 can be refined as follows:

[0074] Step S141, for each idle person, based on the matching result between the configuration information of the idle person and each task to be assigned, and the global priority order of each task to be assigned, the task to be assigned is assigned to the idle person until the number of tasks to be processed by the idle person reaches a preset task volume threshold.

[0075] In the disclosed embodiment, for each idle person, the system can match the processable task type information in the configuration information of the idle person with the task type of each task to be assigned, and assign the successfully matched tasks to the idle person according to the global priority order of the above-mentioned tasks to be assigned, until the number of tasks to be processed under the name of the idle person reaches the preset task volume threshold and can no longer accept task assignments.

[0076] For example, if the current number of pending tasks for a certain idle person is 5 and the preset task volume threshold is 10, then 5 pending tasks matching the idle person's configuration information can be assigned to the idle person according to the global priority order of each task to be assigned. After the assignment, the system can update the number of pending tasks for the idle person to 10, that is, the number of pending tasks for the person reaches the preset task volume threshold. Then the next idle person can be found.

[0077] In one embodiment of the present disclosure, Figure 5 As shown, the above step S140, determining the idle personnel who can accept the task assignment, can be refined as follows:

[0078] Step S510, according to the preset personnel search order, determine whether the configuration information of the candidate personnel meets the preset configuration conditions. If yes, execute step S520, if not, execute step S510 again to determine whether the configuration information of the next candidate personnel meets the preset configuration conditions.

[0079] In the embodiment of the present disclosure, the above-mentioned personnel search order can be manually pre-set. For example, the order can be based on the personnel identification (such as the work number) pre-set for each candidate, or it can be set based on the test scores of the candidate obtained when setting the configuration information for the candidate. The present disclosure does not make specific restrictions on this. The work numbers of the above-mentioned candidates and the test scores of the candidates can be pre-stored in the system.

[0080] As described above, the configuration information of each candidate may include the status of the candidate. As an embodiment of the present disclosure, the preset configuration condition may be that the status of the candidate is that the automatic task allocation is turned on and the candidate is in office. If the configuration information of the candidate does not meet the configuration condition, that is, the automatic task allocation is turned off and / or the candidate is not in office, the candidate cannot accept the automatic task allocation.

[0081] Step S520, determine whether the number of tasks currently to be processed by the candidate has reached the preset task quantity threshold; if not, execute step S530; if reached, return to step S510 to determine whether the configuration information of the next candidate meets the preset configuration conditions.

[0082] Step S530: Determine that the candidate is an idle person who can accept task assignment.

[0083] In the disclosed embodiment, after the system determines that the configuration information of the candidate meets the preset configuration conditions (the configuration information of the candidate successfully matches the preset configuration conditions), that is, after determining that the idle personnel can accept automatic task assignment, it can determine whether the number of currently pending tasks of the idle personnel has reached the preset task volume threshold. If the number of currently pending tasks of the candidate reaches the above task volume threshold, the candidate is no longer able to accept task assignments, so it is necessary to query the next idle personnel who can accept task assignments; if not, the candidate can accept task assignments and is an idle personnel.

[0084] Through the above steps S510 to S530, idle personnel who can accept automatic task assignment can be found more efficiently, avoiding unreasonable assignment of tasks, avoiding the situation where some personnel have a backlog of tasks while other personnel are idle due to waiting for task assignment, and ensuring the effect of automatic task assignment.

[0085] like Figure 6 As shown, Figure 6This is a flow chart of searching for free personnel in the present disclosure. After starting to search for free personnel, the following steps may be included:

[0086] In step ①, the system determines whether the personnel configuration information meets the configuration conditions. If yes, step ② is executed. If not, the query of available personnel is restarted.

[0087] In this embodiment, the above-mentioned personnel may refer to members of a working group.

[0088] In step ②, the system determines the number of tasks currently pending for processing by the personnel. If it is less than n, step ③ is executed; if it has reached n, the query for free personnel is restarted.

[0089] In this step, n is the task volume threshold value that is manually preset and stored in the system.

[0090] Step ③, assign tasks according to personnel authority. After the assignment is completed, start querying free personnel again.

[0091] In the disclosed embodiment, the system can assign the tasks to be assigned to the personnel according to the matching result of the personnel's task processing authority and the task type of each task to be assigned, and according to the priority order of each task to be assigned, until the number of tasks to be assigned to the personnel reaches the preset task amount threshold n, that is, the tasks are assigned to the personnel. Then the next free personnel can be queried.

[0092] In the disclosed embodiment, while achieving automatic task allocation, it is also possible to switch between automatic task allocation and manual task allocation. This more flexible task allocation method can further improve the effect of task allocation.

[0093] In one embodiment of the present disclosure, based on Figure 1 ,like Figure 7 As shown, the above step S140 may further include:

[0094] Step S750, receiving user operation information.

[0095] As described above, in the disclosed embodiment, the task assignment system can display a task assignment interface to the user. The task assignment interface can enable the manual task assignment mode by default, so that certain special situations can be handled manually. Of course, a switch can also be set for the manual task assignment mode to switch between automatic task assignment and manual task assignment.

[0096] In an embodiment of the present disclosure, the user operation information may be generated by the user operating in the task assignment interface. The user operation information may include assigning the task to be assigned to a certain group or candidate, etc.

[0097] Step S760: allocating the tasks to be allocated based on the user operation information.

[0098] In the embodiment of the present disclosure, after receiving the above user operation information, the system can perform the operation corresponding to the user operation information, such as assigning the task to be assigned to a certain group or candidate, etc.

[0099] As mentioned above, for image verification tasks, one task can usually contain multiple images. Therefore, in the task assignment scenario, there may be more tasks with fewer images in the task processing list assigned to the task handler. Team members need to manually merge multiple small tasks into one task for verification to reduce the number of times tasks are opened and submitted. This operation is very complicated and repetitive, resulting in low task processing efficiency. Therefore, before assigning tasks, the team leader usually manually merges multiple tasks into one task, and when manually merging tasks, it is necessary to manually determine whether the selected tasks can be merged. It consumes manpower, is inefficient, and cannot guarantee the effect of task merging.

[0100] In one embodiment of the present disclosure, based on Figure 1 ,like Figure 8 As shown, before pushing the task to be assigned to the idle personnel for processing, that is, before the above step S140, the following may also be included:

[0101] Step S840: Bundle the tasks to be assigned according to a preset bundling rule to obtain task packages to be assigned.

[0102] In an embodiment of the present disclosure, the tasks to be assigned may be combined based on a preset number of combined packages for each task type; and / or,

[0103] The to-be-assigned tasks belonging to the complex task type are not merged with the to-be-assigned tasks belonging to the simple task type; wherein the complex task type and the simple task type are manually preset.

[0104] In the disclosed embodiment, the above-mentioned complex task types and simple task types can be pre-defined manually based on the average processing time of each type of task and stored in the system. For example, for a task type with a long processing time (e.g., greater than a preset maximum time threshold), it can be defined as a complex task. For a task type with a short processing time (e.g., less than a preset minimum time threshold), it can be defined as a simple task. A task with a normal processing time (e.g., between a preset minimum time threshold and a maximum time threshold) can be defined as a general task.

[0105] For example, for the task of verifying the restricted traffic sign for trucks, since the content recognition is difficult and prone to errors, and the task processing time is also long, this type of task can be defined as a complex task. For the task of verifying the speed limit sign, the processing time is short, so this type of task can be defined as a complex task.

[0106] Of course, in the embodiments of the present disclosure, complex tasks and simple tasks can also be defined based on the amount of images contained in the task. For example, a task containing an amount of images exceeding a preset image amount threshold can be defined as a complex task, and a task containing an amount of images not exceeding the preset image amount threshold can be defined as a simple task. This disclosure does not make specific restrictions on this.

[0107] In the disclosed embodiment, different package quantities, i.e., the number of images that can be included in a task package, can be pre-set for different task types and stored in the system. For example, for simple tasks, a larger package quantity can be set, and for complex tasks, a smaller package quantity can be set due to their longer processing time.

[0108] In the disclosed embodiment, when the system combines tasks, it can combine tasks with the same preset combination amount, or it can combine tasks with different preset combination amounts. As a specific implementation, when combining tasks with different preset combination amounts, the smallest preset combination amount among these tasks can be used as the number of images included in the final combined task package. For example, if three tasks are to be combined, and the preset combination amounts of these three tasks are 9, 10, and 8 respectively, then when combining, these tasks can be combined based on a combination amount of 8.

[0109] As described above, the processing time of complex tasks and simple tasks may differ greatly. If complex tasks are merged with simple tasks, the processing time of the task package will be very uneven. After some simple tasks are processed, it will take a long time to submit them. Therefore, in the embodiment of the present disclosure, rules can also be set not to merge complex tasks with simple tasks to improve the efficiency of task completion.

[0110] In the embodiment of the present disclosure, the above-mentioned package combination rules can be manually preset and stored in the above-mentioned system.

[0111] Correspondingly, such as Figure 8 As shown, the above step S140 can be refined as follows:

[0112] Step S850, for each idle person, based on the matching result between the configuration information of the idle person and each task package to be assigned, the task package to be assigned is assigned to the idle person until the number of tasks to be processed by the idle person reaches a preset task volume threshold.

[0113] In the disclosed embodiment, the task processing personnel (eg, team members) may also automatically merge the tasks before verifying the tasks. As an implementation method, the task processing personnel may click "Merge Jobs" in the interface showing their task list to automatically merge their pending tasks.

[0114] In the disclosed embodiment, by automatically combining tasks based on the above preset rules, there is no need to repeatedly perform complex operations to manually combine tasks, which reduces unnecessary operations, improves task processing speed and combination efficiency, and does not require manual judgment, thereby reducing manpower consumption. At the same time, in actual applications, a better task combination effect can also be achieved.

[0115] Of course, in the disclosed embodiment, the manual merging function can also be retained to meet the needs in special situations. A switch can also be set for the mode of manually merging tasks to flexibly cope with different possible situations.

[0116] like Fig. 9 As shown, Fig. 9 A schematic diagram of a user management interface of a task allocation system provided in an embodiment of the present disclosure.

[0117] The user management interface may include the identity information and configuration information of each candidate. The configuration information of each candidate may include the team name, whether the candidate is currently employed, whether automatic task allocation is enabled (personnel status), and the types of tasks that the candidate can handle. It is also possible to add or delete candidate information, modify the information of each candidate, etc. in this interface.

[0118] Fig. 9 In the example, task type A can refer to speed limit sign tasks, task type B can refer to electronic eye tasks, task type C can refer to truck restriction tasks, task type D can refer to road name tasks, task type E can refer to traffic light tasks, and so on.

[0119] Based on the information displayed on the user management interface, if the system searches for idle personnel in the order of user 6-user 1, since user 6 is not on duty, it is necessary to query whether user 5 is an idle person. The automatic task allocation status of user 5 is closed, so it is necessary to query whether user 4 is an idle person. The configuration information of user 4 meets the configuration conditions. If it is determined that it is an idle person (the number of its current pending tasks does not reach the preset task volume threshold stored in the system), then type A and / or type D and / or type E tasks can be assigned to user 4 according to the global priority of the tasks to be assigned, until the number of its pending tasks reaches the preset task volume threshold. The process of assigning tasks to users 1-user 3 can refer to the process of assigning tasks to user 4, which will not be repeated here.

[0120] like Fig.10 As shown, Fig.10 It is a schematic diagram of an interface that can implement manual task allocation in an embodiment of the present disclosure.

[0121] Relevant personnel can select each group in the allocation column for each plan, and the selected group can handle the plan. That is, the plan is split and then automatically / manually allocated to each team member.

[0122] like Fig.11 As shown, Fig.11 It is a schematic diagram of an interface that can implement manual task bundling in an embodiment of the present disclosure.

[0123] Relevant personnel can select the tasks to be merged in this interface and click "Merge" to merge the tasks manually. For example, you can select Task A, Task D, and Task F, and then click "Merge" to merge Task A, Task D, and Task F and then process them.

[0124] According to an embodiment of the present disclosure, a task allocation system is also provided. Fig.12 As shown, the system may include:

[0125] The task acquisition module 1210 is used to acquire each task to be assigned;

[0126] Configuration information acquisition module 1220, used to obtain configuration information of each candidate and the number of tasks currently to be processed of each candidate;

[0127] An idle personnel determination module 1230 is used to determine an idle personnel who can accept task assignment based on the configuration information of each candidate and the number of tasks currently to be processed by each candidate;

[0128] The task allocation module 1240 is used to allocate the to-be-allocated tasks to each idle person based on the matching results between the configuration information of the idle person and each to-be-allocated task, until the number of to-be-allocated tasks of the idle person reaches a preset task quantity threshold.

[0129] In the disclosed embodiment, after the system obtains the tasks to be assigned, the configuration information of each candidate, and the number of tasks to be processed currently for each candidate, it determines the idle personnel who can accept the task assignment based on the configuration information of each candidate and the number of tasks to be processed currently. Then, for each idle personnel, based on the matching result between the configuration information of the idle personnel and each task to be assigned, the task to be assigned is assigned to the idle personnel until the number of tasks to be processed for the idle personnel reaches the preset task quantity threshold. By applying the disclosed embodiment, the candidate configuration information is pre-set, and each task is automatically assigned to the idle personnel who can handle the task based on the configuration information and the number of tasks to be processed currently for each candidate. Automatic task assignment is achieved, manual operation is simplified, manual verification costs are reduced, task assignment efficiency is improved, task processing speed is accelerated, task backlogs caused by improper task assignment are avoided, and a good assignment effect is achieved.

[0130] In one embodiment of the present disclosure, based on Fig.12 ,like Fig.13 As shown, the above system may further include:

[0131] The task to be assigned sorting module 1340 is used to sort the tasks to be assigned according to the global priority of the tasks to be assigned; the global priority of the tasks to be assigned is calculated based on a preset strategy;

[0132] The task assignment module 1240 is used to assign the tasks to be assigned to each idle personnel based on the matching results between the configuration information of the idle personnel and the tasks to be assigned, as well as the global priority order of the tasks to be assigned, until the number of tasks to be processed by the idle personnel reaches a preset task volume threshold.

[0133] In an embodiment of the present disclosure, the preset strategy includes at least: one or more of the city level, location and data lag time corresponding to the task to be assigned.

[0134] In one embodiment of the present disclosure, the idle personnel determination module 1230 is used to determine whether the configuration information of the candidate personnel meets the preset configuration conditions according to the preset personnel search order;

[0135] If yes, then determine whether the number of tasks currently to be processed by the candidate has reached the preset task volume threshold;

[0136] If the number of tasks to be processed by the candidate currently does not reach the preset task amount threshold, the candidate is determined to be an idle person who can accept task assignment;

[0137] If the configuration information of the candidate does not meet the preset configuration conditions, or the number of tasks currently to be processed by the candidate reaches the preset task volume threshold, then return to the step of determining whether the configuration information of the candidate meets the preset configuration conditions according to the preset personnel search order, and determine whether the configuration information of the next candidate meets the preset configuration conditions.

[0138] In one embodiment of the present disclosure, based on Fig.12 ,like Fig.13 As shown, the system may further include a task package module 1350, which is used to package the tasks to be assigned according to a preset package rule to obtain task packages to be assigned;

[0139] The task allocation module 1240 is used to allocate the task packages to be allocated to each idle person based on the matching results between the configuration information of the idle person and each task package to be allocated, until the number of tasks to be processed by the idle person reaches a preset task volume threshold.

[0140] In an embodiment of the present disclosure, the step of combining the tasks to be assigned according to a preset combining rule includes:

[0141] Based on the preset number of packages for each task type, the tasks to be assigned are packaged together; and / or,

[0142] The to-be-assigned tasks belonging to the complex task type are not merged with the to-be-assigned tasks belonging to the simple task type; wherein the complex task type and the simple task type are manually preset.

[0143] In one embodiment of the present disclosure, based on Fig.12 ,like Fig.13 As shown, the above system may further include a user operation information receiving module 1360, which is used to receive user operation information;

[0144] The user operation execution module 1370 is used to allocate the tasks to be allocated based on the user operation information.

[0145] In the technical solution of the present disclosure, the collection, storage, use, processing, transmission, provision and disclosure of user personal information involved are in compliance with the provisions of relevant laws and regulations and do not violate public order and good morals.

[0146] According to an embodiment of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

[0147] Fig.14A schematic block diagram of an example electronic device 1400 that can be used to implement an embodiment of the present disclosure is shown. The electronic device is intended to represent various forms of digital computers, such as laptop computers, desktop computers, workstations, personal digital assistants, servers, blade servers, mainframe computers, and other suitable computers. The electronic device can also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions are merely examples and are not intended to limit the implementation of the present disclosure described and / or required herein.

[0148] like Fig.14 As shown, the device 1400 includes a computing unit 1401, which can perform various appropriate actions and processes according to a computer program stored in a read-only memory (ROM) 1402 or a computer program loaded from a storage unit 1408 into a random access memory (RAM) 1403. In the RAM 1403, various programs and data required for the operation of the device 1400 can also be stored. The computing unit 1401, the ROM 1402, and the RAM 1403 are connected to each other via a bus 1404. An input / output (I / O) interface 1405 is also connected to the bus 1404.

[0149] A number of components in the device 1400 are connected to the I / O interface 1405, including: an input unit 1406, such as a keyboard, a mouse, etc.; an output unit 1407, such as various types of displays, speakers, etc.; a storage unit 1408, such as a disk, an optical disk, etc.; and a communication unit 1409, such as a network card, a modem, a wireless communication transceiver, etc. The communication unit 1409 allows the device 1400 to exchange information / data with other devices through a computer network such as the Internet and / or various telecommunication networks.

[0150] The computing unit 1401 may be a variety of general and / or special processing components with processing and computing capabilities. Some examples of the computing unit 1401 include, but are not limited to, a central processing unit (CPU), a graphics processing unit (GPU), various dedicated artificial intelligence (AI) computing chips, various computing units running machine learning model algorithms, digital signal processors (DSPs), and any appropriate processors, controllers, microcontrollers, etc. The computing unit 1401 performs the various methods and processes described above, such as the method of task allocation. For example, in some embodiments, the method of task allocation may be implemented as a computer software program, which is tangibly contained in a machine-readable medium, such as a storage unit 1408. In some embodiments, part or all of the computer program may be loaded and / or installed on the device 1400 via the ROM 1402 and / or the communication unit 1409. When the computer program is loaded into the RAM 1403 and executed by the computing unit 1401, one or more steps of the method of task allocation described above may be performed. Alternatively, in other embodiments, the computing unit 1401 may be configured to perform the method of task allocation by any other appropriate means (e.g., by means of firmware).

[0151] Various implementations of the systems and techniques described above herein can be implemented in digital electronic circuit systems, integrated circuit systems, field programmable gate arrays (FPGAs), application specific integrated circuits (ASICs), application specific standard products (ASSPs), systems on chips (SOCs), complex programmable logic devices (CPLDs), computer hardware, firmware, software, and / or combinations thereof. These various implementations can include: being implemented in one or more computer programs that can be executed and / or interpreted on a programmable system including at least one programmable processor, which can be a special purpose or general purpose programmable processor that can receive data and instructions from a storage system, at least one input device, and at least one output device, and transmit data and instructions to the storage system, the at least one input device, and the at least one output device.

[0152] The program code for implementing the method of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general-purpose computer, a special-purpose computer, or other programmable data processing device, so that the program code, when executed by the processor or controller, enables the functions / operations specified in the flow chart and / or block diagram to be implemented. The program code may be executed entirely on the machine, partially on the machine, partially on the machine and partially on a remote machine as a stand-alone software package, or entirely on a remote machine or server.

[0153] In the context of the present disclosure, a machine-readable medium may be a tangible medium that may contain or store a program for use by or in conjunction with an instruction execution system, device, or equipment. A machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or equipment, or any suitable combination of the foregoing. A more specific example of a machine-readable storage medium may include an electrical connection based on one or more lines, 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 foregoing.

[0154] To provide interaction with a user, the systems and techniques described herein can be implemented on a computer having: 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 pointing device (e.g., a mouse or trackball) through which the user can provide input to the computer. Other types of devices can also be used to provide interaction with the user; for example, the feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user can be received in any form (including acoustic input, voice input, or tactile input).

[0155] The systems and techniques described herein may be implemented in a computing system that includes back-end components (e.g., as a data server), or a computing system that includes middleware components (e.g., an application server), or a computing system that includes front-end components (e.g., a user computer with a graphical user interface or a web browser through which a user can interact with implementations of the systems and techniques described herein), or a computing system that includes any combination of such back-end components, middleware components, or front-end components. The components of the system may be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: a local area network (LAN), a wide area network (WAN), and the Internet.

[0156] A computer system may include a client and a server. The client and the server are generally remote from each other and usually interact through a communication network. The relationship of client and server is generated by computer programs running on respective computers and having a client-server relationship with each other. The server may be a cloud server, a server of a distributed system, or a server combined with a blockchain.

[0157] It should be understood that the various forms of processes shown above can be used to reorder, add or delete steps. For example, the steps recorded in this disclosure can be executed in parallel, sequentially or in different orders, as long as the desired results of the technical solutions disclosed in this disclosure can be achieved, and this document does not limit this.

[0158] The above specific implementations do not constitute a limitation on the protection scope of the present disclosure. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions can be made according to design requirements and other factors. Any modification, equivalent substitution and improvement made within the spirit and principle of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A task allocation method, used in a task allocation system, comprising: Acquire each task to be assigned, wherein the task to be assigned is a task of verifying an image recognition result of a road image, and each task to be assigned includes at least one picture for representing the image recognition result; Obtain the configuration information of each candidate and the number of tasks currently pending for each candidate; Determine an idle person who can accept task assignment based on the configuration information of each candidate and the number of tasks currently to be processed by each candidate; For each idle person, based on the matching result between the configuration information of the idle person and each task to be assigned, the task to be assigned is assigned to the idle person until the number of tasks to be processed by the idle person reaches a preset task amount threshold; Before the step of assigning the tasks to be assigned to each idle person based on the matching results between the configuration information of the idle person and each task to be assigned, until the number of tasks to be processed by the idle person reaches a preset task amount threshold, the step further includes: Sort the tasks to be assigned according to their global priorities; the global priorities of the tasks to be assigned are calculated based on a preset strategy, and the preset strategy at least includes: one or more of the city level, location, and data lag time corresponding to the tasks to be assigned, the city level is the level of the city where the road image corresponding to the tasks to be assigned is collected, the location is the location where the road image corresponding to the tasks to be assigned is collected, the data lag time is the time interval from the time when the road image corresponding to the tasks to be assigned is collected to the current moment, and the global priority is the weighted sum of the city level, location, and data lag time corresponding to the tasks to be assigned; The step of assigning the to-be-assigned tasks to each idle person based on the matching results between the configuration information of the idle person and each to-be-assigned task until the number of to-be-processed tasks of the idle person reaches a preset task amount threshold comprises: For each idle person, based on the matching result between the configuration information of the idle person and each task to be assigned, and the global priority order of each task to be assigned, the task to be assigned is assigned to the idle person until the number of tasks to be processed by the idle person reaches a preset task amount threshold; Before the step of assigning the tasks to be assigned to each idle person based on the matching results between the configuration information of the idle person and each task to be assigned, until the number of tasks to be processed by the idle person reaches a preset task amount threshold, the step further includes: Based on the preset number of packages for each task type, the tasks to be assigned are packaged to obtain each task package to be assigned; wherein the task types include: traffic limit signs, ground traffic limits, ground vehicle signals, vehicle signal signs, ground speed limits, speed limit signs, warning information, road directions, traffic lights, and billboard information; when a single task package to be assigned includes tasks of multiple task types, the number of images contained in the task package to be assigned is the minimum value of the preset number of packages for the multiple task types; The step of assigning the to-be-assigned tasks to each idle person based on the matching results between the configuration information of the idle person and each to-be-assigned task until the number of to-be-processed tasks of the idle person reaches a preset threshold comprises: For each idle person, based on the matching result between the configuration information of the idle person and each task package to be assigned, the task package to be assigned is assigned to the idle person until the number of tasks to be processed by the idle person reaches a preset task amount threshold.

2. The method according to claim 1, wherein: The step of determining an idle person who can accept task assignment based on the configuration information of each candidate and the number of tasks currently to be processed by each candidate includes: According to the preset personnel search order, determine whether the configuration information of the candidate personnel meets the preset configuration conditions; If yes, then determine whether the number of tasks currently to be processed by the candidate has reached the preset task volume threshold; If the number of tasks to be processed by the candidate currently does not reach the preset task amount threshold, the candidate is determined to be an idle person who can accept task assignment; If the configuration information of the candidate does not meet the preset configuration conditions, or the number of tasks currently to be processed by the candidate reaches the preset task volume threshold, then return to the step of determining whether the configuration information of the candidate meets the preset configuration conditions according to the preset personnel search order, and determine whether the configuration information of the next candidate meets the preset configuration conditions.

3. The method according to claim 1, further comprising: Receive user operation information; Based on the user operation information, the tasks to be assigned are assigned.

4. A task allocation system, comprising: A task acquisition module to be assigned, used to acquire each task to be assigned, wherein the task to be assigned is a verification task of an image recognition result of a road image, and each task to be assigned includes at least one picture for representing the image recognition result; The configuration information acquisition module is used to obtain the configuration information of each candidate and the number of tasks currently to be processed by each candidate; An idle personnel determination module is used to determine idle personnel who can accept task assignment based on the configuration information of each candidate and the number of tasks currently to be processed by each candidate; A task allocation module is used to allocate the to-be-allocated tasks to each idle person based on the matching results between the configuration information of the idle person and each to-be-allocated task, until the number of to-be-allocated tasks of the idle person reaches a preset task amount threshold; Also includes: The task sorting module to be assigned is used to sort the tasks to be assigned according to their global priorities; the global priorities of the tasks to be assigned are calculated based on a preset strategy, and the preset strategy at least includes: one or more of the city level, location and data lag time corresponding to the task to be assigned, the city level is the level of the city where the road image corresponding to the task to be assigned is collected, the location is the location where the road image corresponding to the task to be assigned is collected, the data lag time is the time interval from the time when the road image corresponding to the task to be assigned is collected to the current moment, and the global priority is the weighted sum of the city level, location and data lag time corresponding to the task to be assigned; The task assignment module is used to assign the to-be-assigned tasks to the idle personnel based on the matching results between the configuration information of the idle personnel and the to-be-assigned tasks, and the global priority order of the to-be-assigned tasks, until the number of the to-be-assigned tasks of the idle personnel reaches a preset task amount threshold; A task package combining module is used to combine the tasks to be assigned based on the preset package combining quantity for each task type to obtain each task package to be assigned; wherein the task types include: traffic limit signs, ground traffic limits, ground vehicle signals, vehicle signal signs, ground speed limits, speed limit signs, warning information, road directions, traffic lights and billboard information; when a single task package to be assigned includes tasks of multiple task types, the number of images contained in the task package to be assigned is the minimum value among the preset package combining quantities for the multiple task types; The task allocation module is used to allocate the to-be-allocated task packages to each idle person based on the matching results between the configuration information of the idle person and each to-be-allocated task package, until the number of to-be-processed tasks of the idle person reaches a preset task volume threshold.

5. The system according to claim 4, wherein: The idle personnel determination module is used to determine whether the configuration information of the candidate personnel meets the preset configuration conditions according to the preset personnel search order; If yes, then determine whether the number of tasks currently to be processed by the candidate has reached the preset task volume threshold; If the number of tasks to be processed by the candidate currently does not reach the preset task amount threshold, the candidate is determined to be an idle person who can accept task assignment; If the configuration information of the candidate does not meet the preset configuration conditions, or the number of tasks currently to be processed by the candidate reaches the preset task volume threshold, then return to the step of determining whether the configuration information of the candidate meets the preset configuration conditions according to the preset personnel search order, and determine whether the configuration information of the next candidate meets the preset configuration conditions.

6. The system according to claim 4, further comprising: A user operation information receiving module, used for receiving user operation information; The user operation execution module is used to allocate the tasks to be allocated based on the user operation information.

7. An electronic device comprising: 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 enable the at least one processor to perform the method according to any one of claims 1 to 3.

8. A non-transitory computer-readable storage medium storing computer instructions, wherein: The computer instructions are used to cause the computer to execute the method according to any one of claims 1-3.

9. A computer program product, comprising a computer program, which, when executed by a processor, implements the method according to any one of claims 1 to 3.

Images