Method and apparatus for processing collection tasks

By assigning tasks to task executors and generating task schedules, the problem of low user experience and efficiency caused by task executors arranging their own time is solved, achieving the effect of completing tasks on time and improving user experience.

CN114240202BActive Publication Date: 2026-01-20BEIJING JINGDONG ZHENSHI INFORMATION TECH CO LTD
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
CN202111574190.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-12-21
Publication Date
2026-01-20
Estimated Expiration
2041-12-21

AI Technical Summary

Technical Problem

The task executor arranges the time for carrying out the collection task on their own, which cannot guarantee that they will arrive at the customer's door at the time required by the customer, affecting the user experience and collection efficiency.

Method used

The task collection is divided into collection tasks based on the task executor's scope of execution and collection time period, and a collection task plan is generated and sent to the task executor so that he/she can carry out the task according to the plan.

Benefits of technology

It improves user experience and collection efficiency, ensures timely task completion, and optimizes the allocation of personnel and time to enhance productivity and accuracy.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114240202B_ABST
    Figure CN114240202B_ABST
Patent Text Reader

Abstract

The application provides a method and device for processing a collection task, the method comprising: dividing a collection task for a task performer according to an execution range of the task performer; grouping the collection task according to a collection time period; generating a collection task schedule for the task performer based on the collection time period and a collection location corresponding to the collection task; and sending the collection task schedule to the task performer, so that the task performer executes the collection task according to the collection task schedule. The method can improve user experience and collection efficiency.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] This invention relates to the field of data processing technology, and in particular to a method and apparatus for processing collection tasks. Background Technology

[0002] Currently, when a customer places a pickup order, a pickup task is generated on the pickup task processing platform. The task executor, such as a delivery person, receives the pickup task through the pickup terminal and plans and executes the pickup task themselves.

[0003] In the process of developing this application, the inventors discovered that task executors arrange their own collection times, which cannot guarantee on-site delivery at the time required by customers, affecting user experience and collection efficiency. Summary of the Invention

[0004] In view of this, this application provides a collection task processing method and apparatus that can improve user experience and collection efficiency.

[0005] To solve the above-mentioned technical problems, the technical solution of this application is implemented as follows:

[0006] In one embodiment, a method for processing pickup tasks is provided, the method comprising:

[0007] The task collection tasks are divided among the task executors according to their scope of execution.

[0008] The collection tasks are grouped according to the collection time period;

[0009] Based on the collection time period and the collection location corresponding to the collection task, a collection task plan table is generated for the task executor.

[0010] The collection task plan is sent to the task executor, so that the task executor can perform the collection task according to the collection task plan.

[0011] In another embodiment, a collection task processing device is provided, the device comprising: a division unit, a generation unit, and a sending unit;

[0012] The division unit is used to divide the collection tasks for the task executor according to the execution scope of the task executor; and to group the collection tasks according to the collection time period;

[0013] The generation unit is used to generate a collection task plan table for the task executor based on the collection time period and the collection location corresponding to the collection task divided by the division unit.

[0014] The sending unit is used to send the collection task plan table generated by the generating unit to the task executor, so that the task executor can perform the collection task according to the collection task plan table.

[0015] In another embodiment, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the pickup task processing method.

[0016] In another embodiment, a computer-readable storage medium is provided having a computer program stored thereon that, when executed by a processor, implements the steps of the pickup task processing method.

[0017] As can be seen from the above technical solution, in the above embodiments, after dividing the collection tasks for the task executor according to the execution scope of the task executor, a collection task plan table is generated for the task executor based on the collection time period and the collection location of each collection task, so that the task executor executes the collection tasks according to the collection task plan table. This solution executes collection tasks according to user needs, which can improve user experience and collection efficiency. Attached Figure Description

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

[0019] Figure 1 This is a schematic diagram of the pickup task processing flow in Embodiment 1 of this application;

[0020] Figure 2 This is a schematic diagram of the pickup task processing flow in Embodiment 2 of this application;

[0021] Figure 3 This is a schematic diagram of the pickup task processing flow in Embodiment 3 of this application;

[0022] Figure 4 This is a schematic diagram of the pickup task processing device in the embodiments of this application;

[0023] Figure 5 This is a schematic diagram of the physical structure of an electronic device provided in an embodiment of the present invention. Detailed Implementation

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

[0025] The terms “first,” “second,” “third,” “fourth,” etc. (if present) in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a particular order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented, for example, in orders other than those illustrated or described herein. Furthermore, the terms “comprising” and “having,” and any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatus.

[0026] The technical solution of the present invention will be described in detail below with reference to specific embodiments. The following specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments.

[0027] This application provides a method for processing pickup tasks, applied to a pickup task processing device. After dividing pickup tasks for each task executor according to their execution scope, a pickup task plan is generated for each task executor based on the pickup time period and the pickup location of each task. The task executor then executes the pickup tasks according to the pickup task plan. This solution executes pickup tasks according to user needs, improving user experience and pickup efficiency.

[0028] In this embodiment of the application, the task executor can be a delivery person, a pickup person, a collection person, a courier, etc. If the task executor is a delivery person, the execution range is the delivery range.

[0029] When the processing device receives a pickup task generated by a customer's order, it can store the pickup tasks in a unified pickup task pool, or it can pre-divide the areas and store the pickup tasks in the same area in the same pickup task pool.

[0030] The task information corresponding to a pickup task includes: pickup time period and pickup location.

[0031] The process of implementing the pickup task processing in the embodiments of this application will be described in detail below with reference to the accompanying drawings.

[0032] Example 1

[0033] See Figure 1 , Figure 1 This is a schematic diagram of the pickup task processing flow in Embodiment 1 of this application. The specific steps are as follows:

[0034] Step 101: Divide the collection tasks for the task executor according to the execution scope of the task executor.

[0035] The task collection and processing device can obtain the execution scope of each task executor. This execution device can be obtained from other servers or directly received by the task executor through page settings.

[0036] When assigning collection tasks to the task executor based on their execution scope, electronic fences can be used for this purpose.

[0037] Step 102: Group the collection tasks according to the collection time period.

[0038] Each pickup task corresponds to a pickup time period, which is the pickup time expected by the user.

[0039] If the corresponding collection time periods are: 12:00~13:00, 13:00~14:00, 14:00~15:00, and 15:00~16:00, then the collection tasks will be divided into 4 groups.

[0040] Step 103: Generate a collection task plan table for the task executor based on the collection time period and the collection location corresponding to the collection task.

[0041] In this embodiment, the pickup task processing device generates a pickup task plan table for the task executor based on the pickup time period and the pickup location corresponding to the pickup task, instead of the task executor receiving the pickup task and processing the pickup task itself according to the information corresponding to the pickup task.

[0042] The pickup task plan here should include at least the pickup task identifier, pickup location and planned completion time, and may also include the planned departure time, travel time and pickup time.

[0043] In practice, due to the uneven distribution of pickup tasks in each region, one region may correspond to one task executor or multiple task executors. The above scenarios are applicable to the embodiments of this application.

[0044] If a pickup task assigned to a specific executor fails to be added to that executor's pickup task schedule due to time constraints, the following rules shall apply:

[0045] Collection tasks assigned to the task executor but not added to the collection task plan will be allocated to other task executors according to the allocation rules.

[0046] Other task executors here can be task executors corresponding to the corresponding area or task executors in adjacent areas. This application embodiment does not restrict the allocation rules here.

[0047] Based on the task allocation, the task collection processing device can also schedule the task executor and the area served by the task executor to more rationally arrange the task collection, thereby further improving execution efficiency and user experience.

[0048] Step 104: Send the collection task plan to the task executor so that the task executor can perform the collection task according to the collection task plan.

[0049] The task executors carry out the collection tasks in the order of the planned completion time in the collection task plan.

[0050] In this embodiment, after dividing the collection tasks for the task executor according to the execution scope, a collection task plan is generated for the task executor based on the collection time period and the collection location of each collection task, so that the task executor executes the collection tasks according to the collection task plan. This solution executes collection tasks according to user needs, which can improve user experience and collection efficiency.

[0051] Example 2

[0052] See Figure 2 , Figure 2 This is a schematic diagram of the pickup task processing flow in Embodiment 2 of this application. The specific steps are as follows:

[0053] Step 201: Divide the collection tasks for the task executor according to the execution scope of the task executor.

[0054] The task collection and processing device can obtain the execution scope of each task executor. This execution device can be obtained from other servers or directly received by the task executor through page settings.

[0055] When assigning collection tasks to the task executor based on their execution scope, electronic fences can be used for this purpose.

[0056] Step 202: Group the collection tasks according to the collection time period.

[0057] Each pickup task corresponds to a pickup time period, which is the pickup time expected by the user.

[0058] If the corresponding collection time periods are: 12:00~13:00, 13:00~14:00, 14:00~15:00, and 15:00~16:00, then the collection tasks will be divided into 4 groups.

[0059] Step 203: Iterate through the collection time periods in chronological order.

[0060] For the above four collection time periods, first iterate through the collection time period 12:00 to 13:00, then iterate through the collection time period 13:00 to 14:00, and so on until the collection time period 15:00 to 16:00 is completely traversed.

[0061] Step 204: For each collection time period traversed, determine the collection location that is closest to the current starting point in terms of travel distance.

[0062] The current starting point corresponding to the first collection task in the first collection time period is the starting point configured for the task executor.

[0063] For collection tasks outside the first collection task within the first collection period, the starting point is the collection location of the previous collection task.

[0064] Step 205: Calculate the planned completion time of the pickup task corresponding to the determined pickup location based on the departure time.

[0065] For the first collection task in the first collection period, the departure time is the preset departure time of the task executor. For collection tasks other than the first collection task in the first collection period, the departure time is the planned completion time of the previous collection task.

[0066] The planned completion time for the pickup task corresponding to the pickup location, calculated based on the departure time, in this step specifically includes:

[0067] The sum of the travel time and the preset pickup time is used as the pickup time.

[0068] The travel time is the ratio of the travel distance to the preset travel speed. The preset pickup time for each pickup task can be the same or different, depending on the actual application scenario.

[0069] The sum of the departure time and pickup time is used as the planned completion time.

[0070] Step 206: Determine whether the planned completion time exceeds the maximum time of the current collection period. If yes, proceed to step 209; otherwise, proceed to step 207.

[0071] Step 207: Add the pickup task corresponding to the planned completion time to the pickup task plan table.

[0072] Collection tasks that exceed the maximum time of the current collection period will not be added to the collection task schedule because the collection task is not expected to be completed on time.

[0073] Step 208: Determine whether there are any untraversed collection tasks within the collection time period. If yes, proceed to step 204; otherwise, proceed to step 210.

[0074] Step 209: Determine whether the current collection period is the last collection period. If so, proceed to step 211; otherwise, proceed to step 210.

[0075] Step 210: Continue iterating through the collection tasks for the next collection period. Proceed to step 204.

[0076] Step 211: Use the current collection task plan as the collection task plan for the task executor.

[0077] In this embodiment, the pickup task processing device generates a pickup task plan table for the task executor based on the pickup time period and the pickup location corresponding to the pickup task, instead of the task executor receiving the pickup task and processing the pickup task itself according to the information corresponding to the pickup task.

[0078] The pickup task plan here should include at least the pickup task identifier, pickup location and planned completion time, and may also include the planned departure time, travel time and pickup time.

[0079] As shown in Table 1, Table 1 contains the contents of the collection task plan table in the embodiments of this application.

[0080]

[0081] Table 1

[0082] In practice, due to the uneven distribution of pickup tasks in each region, one region may correspond to one task executor or multiple task executors. The above scenarios are applicable to the embodiments of this application.

[0083] If a pickup task assigned to a specific executor fails to be added to that executor's pickup task schedule due to time constraints, the following rules shall apply:

[0084] Collection tasks assigned to the task executor but not added to the collection task plan will be allocated to other task executors according to the allocation rules.

[0085] Other task executors here can be task executors corresponding to the corresponding area or task executors in adjacent areas. This application embodiment does not restrict the allocation rules here.

[0086] Based on the task allocation, the task collection processing device can also schedule the task executor and the area served by the task executor to more rationally arrange the task collection, thereby further improving execution efficiency and user experience.

[0087] Step 212: Send the collection task plan to the task executor so that the task executor can perform the collection task according to the collection task plan.

[0088] The task executors carry out the collection tasks in the order of the planned completion time in the collection task plan.

[0089] In this embodiment, after dividing the collection tasks for the task executor according to the execution scope, a collection task plan is generated for the task executor based on the collection time period, collection time, pickup time, and collection location of each collection task. The task executor then executes the collection tasks according to the collection task plan. This solution executes collection tasks according to user needs, improving user experience and collection efficiency.

[0090] Example 3

[0091] When any pickup task is completed, the pickup device updates the task status to "pickup completed" and records the actual completion time. It also monitors the status of incomplete pickup tasks. When any pickup task is detected as completed, the following actions are taken:

[0092] See Figure 3 , Figure 3 This is a schematic diagram of the pickup task processing flow in Embodiment 3 of this application. The specific steps are as follows:

[0093] Step 301: When the collection task is completed, if it is determined that the actual completion time of the collection task exceeds the planned completion time, then determine the number of collection tasks in the collection task plan that cannot be completed according to the planned completion time.

[0094] In this embodiment of the application, when the actual completion time of a pickup task exceeds the planned completion time, it is necessary to determine the number of subsequent pickup tasks that cannot be completed on time due to the impact of the actual completion time.

[0095] Step 302: Determine whether the number is greater than a preset threshold. If yes, proceed to step 303; otherwise, proceed to step 304.

[0096] The preset threshold here is set according to the actual application, such as 2, etc., and is not limited here.

[0097] Step 303: Output reminders for multiple pickup tasks that cannot be completed by the planned completion time. End this process.

[0098] When the number exceeds the preset threshold, it indicates a serious impact, which may cause batch collection tasks to fail to be completed on time. At this time, instead of individual reminders, a reminder will be given indicating that multiple collection tasks may not be completed as scheduled.

[0099] Step 304: Output a reminder for pickup tasks that cannot be completed by the planned completion time.

[0100] When the number is not greater than the preset threshold, it indicates that it affects the timely completion of individual collection tasks. This is to obtain the identifier of the affected collection tasks and directly remind you that the completion time of the corresponding collection tasks has been affected, which may result in the inability to complete them on time.

[0101] In this embodiment, based on the collection task plan and the completion time of the collection tasks, the impact of the actual completion time exceeding the planned completion time on the unfinished collection tasks is determined, that is, potential risks are identified, and corresponding reminders are output according to the risk situation, so that the task executor can improve collection efficiency in a timely manner and avoid delays in collection timeliness.

[0102] In this embodiment, a pickup task plan is used to plan the driving routes and execution plans of task executors based on time aggregation and location sorting, and to assist task executors in monitoring task risks. The pickup plan allows for more scientific calculation of individual productivity, rational planning of time, allocation of tasks according to time saturation, and improved productivity and pickup accuracy.

[0103] Based on the same inventive concept, this application also provides a collection task processing device. See also Figure 4 , Figure 4 This is a schematic diagram of the pickup task processing device in an embodiment of this application. The device includes: a division unit 401, a generation unit 402, and a sending unit 403;

[0104] The division unit 401 is used to divide the collection tasks for the task executor according to the execution scope of the task executor; and to group the collection tasks according to the collection time period;

[0105] The generation unit 402 is used to generate a collection task plan table for the task executor based on the collection time period and the collection location corresponding to the collection task divided by the division unit 401.

[0106] Sending unit 403 is used to send the collection task plan table generated by generating unit 402 to the task executor, so that the task executor can perform the collection task according to the collection task plan table.

[0107] In another embodiment,

[0108] The generation unit 402, specifically used to generate a collection task plan table for the task executor based on the collection time period and the collection location corresponding to the collection task, includes:

[0109] Iterate through the collection time periods in chronological order.

[0110] For each pickup time period traversed, determine the pickup location that is closest to the current starting point in terms of travel distance;

[0111] The planned completion time of the pickup task corresponding to the pickup location determined based on the departure time;

[0112] If it is determined that the planned completion time does not exceed the maximum time of the current collection period, then the collection task corresponding to the planned completion time is added to the collection task plan table;

[0113] If it is determined that the planned completion time does not exceed the maximum time of the current collection period, and there are still collection tasks that have not been traversed within the collection period, then the collection position of the collection task corresponding to the planned completion time is used as the current starting point, and the collection position with the shortest travel distance is determined again.

[0114] If it is determined that the planned completion time exceeds the maximum time of the current collection period, or if there are no untraversed collection tasks within the collection period, the traversal of collection tasks within the current collection period ends.

[0115] In another embodiment,

[0116] The current starting point corresponding to the first collection task in the first collection time period is the starting point configured for the task executor.

[0117] In another embodiment,

[0118] The generation unit 402 is specifically used to calculate the sum of the travel time and the preset pickup time as the pickup time when calculating the planned completion time of the pickup task corresponding to the pickup location based on the departure time; wherein, the travel time is the ratio of the travel distance to the preset travel speed; and to calculate the sum of the departure time and the pickup time as the planned completion time; wherein, for the first pickup task in the first pickup time period, the departure time is the preset departure time of the task executor, and for pickup tasks other than the first pickup task in the first pickup time period, the departure time is the planned completion time of the previous pickup task.

[0119] In another embodiment,

[0120] The generation unit 402 is specifically used to determine whether the current collection period is the last collection period after the traversal of collection tasks within the current collection period ends. If so, the current collection task plan table is used as the collection task plan table of the task executor; otherwise, the collection tasks of the next collection period are traversed.

[0121] In another embodiment,

[0122] The allocation unit 401 is further configured to allocate collection tasks that have been assigned to the task executor but not added to the collection task plan table to other task executors according to the allocation rules.

[0123] In another embodiment, the device further includes: a monitoring unit 404;

[0124] The collection task plan includes: collection task identifier and planned completion time;

[0125] The monitoring unit 404 is used to determine the number of collection tasks that cannot be completed according to the planned completion time in the collection task plan table when the collection task is completed and if it is determined that the actual completion time of the collection task exceeds the planned completion time; and to determine whether the number is greater than a preset threshold.

[0126] The sending unit 403 is further configured to, if the monitoring unit 404 determines that the number is greater than a preset threshold, output a reminder that multiple collection tasks cannot be completed as scheduled; otherwise, output a reminder that collection tasks cannot be completed as scheduled.

[0127] The units in the above embodiments can be integrated into one unit or deployed separately; they can be merged into one unit or further divided into multiple sub-units.

[0128] In another embodiment, an electronic device is also provided, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the steps of the pickup task processing method.

[0129] In another embodiment, a computer-readable storage medium is also provided, on which computer instructions are stored, which, when executed by a processor, can implement the steps in the pickup task completion method.

[0130] Figure 5 This is a schematic diagram of the physical structure of an electronic device provided in an embodiment of the present invention. Figure 5As shown, the electronic device may include: a processor 510, a communications interface 520, a memory 530, and a communication bus 540, wherein the processor 510, the communications interface 520, and the memory 530 communicate with each other via the communication bus 540. The processor 510 can call logical instructions in the memory 530 to execute the following methods:

[0131] The task collection tasks are divided among the task executors according to their scope of execution.

[0132] The collection tasks are grouped according to the collection time period;

[0133] Based on the collection time period and the collection location corresponding to the collection task, a collection task plan table is generated for the task executor.

[0134] The collection task plan is sent to the task executor, so that the task executor can perform the collection task according to the collection task plan.

[0135] Furthermore, the logical instructions in the aforementioned memory 530 can be implemented as software functional units and, when sold or used as independent products, can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the present invention, essentially, or the part that contributes to the prior art, or a part of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0136] The device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Those skilled in the art can understand and implement this without any creative effort.

[0137] Through the above description of the embodiments, those skilled in the art can clearly understand that each embodiment can be implemented by means of software plus necessary general-purpose hardware platforms, and of course, it can also be implemented by hardware. Based on this understanding, the above technical solutions, in essence or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as ROM / RAM, magnetic disk, optical disk, etc., and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments or some parts of the embodiments.

[0138] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for processing pickup tasks, characterized in that, The method includes: The task collection tasks are divided among the task executors according to their scope of execution. The collection tasks are grouped according to the collection time period; Based on the collection time period and the collection location corresponding to the collection task, a collection task plan table is generated for the task executor. This generation includes: traversing the collection time periods in chronological order; determining the collection location closest to the current starting point for each traversed collection time period; calculating the planned completion time of the collection task corresponding to the determined collection location based on the departure time; if the planned completion time does not exceed the maximum time of the current collection time period, adding the collection task corresponding to the planned completion time to the collection task plan table; if the planned completion time does not exceed the maximum time of the current collection time period, and there are still untraversed collection tasks within the collection time period, using the collection location of the collection task corresponding to the planned completion time as the current starting point, and re-determining the collection location closest to the current starting point; if the planned completion time exceeds the maximum time of the current collection time period, or there are no untraversed collection tasks within the collection time period, ending the traversal of collection tasks within the current collection time period. The collection task plan is sent to the task executor so that the task executor can perform the collection task according to the collection task plan; the collection task plan includes at least the collection task identifier, collection location and planned completion time.

2. The method according to claim 1, characterized in that, The current starting point corresponding to the first collection task in the first collection time period is the starting point configured for the task executor.

3. The method according to claim 1, characterized in that, The planned completion time for the pickup task corresponding to the pickup location determined based on the departure time includes: The sum of the travel time and the preset pickup time is calculated as the pickup time; wherein, the travel time is the ratio of the travel distance to the preset travel speed; The sum of the departure time and the collection time is calculated as the planned completion time; wherein, for the first collection task in the first collection time period, the departure time is the preset departure time of the task executor, and for collection tasks other than the first collection task in the first collection time period, the departure time is the planned completion time of the previous collection task.

4. The method according to claim 1, characterized in that, After the traversal of collection tasks within the current collection time period ends, the method further includes: Determine if the current collection period is the last collection period. If so, use the current collection task plan as the collection task plan for the task executor; otherwise, continue to iterate through the collection tasks for the next collection period.

5. The method according to claim 1, characterized in that, The method further includes: Collection tasks assigned to the task executor but not added to the collection task plan will be allocated to other task executors according to the allocation rules.

6. The method according to any one of claims 1-5, characterized in that, The collection task plan includes: Collection task identifier and planned completion time; When a pickup task is detected as completed, if it is determined that the actual completion time of the pickup task exceeds the planned completion time, then the number of pickup tasks in the pickup task plan that cannot be completed according to the planned completion time is determined. Determine whether the number is greater than a preset threshold. If so, output a reminder that multiple pickup tasks cannot be completed by the planned completion time; otherwise, output a reminder that pickup tasks cannot be completed by the planned completion time.

7. A collection task processing device, characterized in that, The device includes: a partitioning unit, a generation unit, and a transmission unit; The division unit is used to divide the collection tasks for the task executor according to the execution scope of the task executor; and to group the collection tasks according to the collection time period; The generation unit is used to generate a collection task plan table for the task executor based on the collection time period and the collection location corresponding to the collection task divided by the division unit; the generation of the collection task plan table for the task executor based on the collection time period and the collection location corresponding to the collection task includes: traversing the collection time period in chronological order; determining the collection location closest to the current starting point for each traversed collection time period; calculating the planned completion time of the collection task corresponding to the determined collection location based on the departure time; and if the planned completion time does not exceed the specified time limit... If the maximum time of the current collection period is determined, the collection task corresponding to the planned completion time is added to the collection task plan table. If it is determined that the planned completion time does not exceed the maximum time of the current collection period, and there are still untraversed collection tasks within the collection period, the collection position of the collection task corresponding to the planned completion time is used as the current starting point, and the collection position with the shortest travel distance is determined again. If it is determined that the planned completion time exceeds the maximum time of the current collection period, or there are no untraversed collection tasks within the collection period, the traversal of collection tasks within the current collection period ends. The sending unit is used to send the collection task plan table generated by the generating unit to the task executor, so that the task executor can perform the collection task according to the collection task plan table; the collection task plan table includes at least the collection task identifier, collection location and planned completion time.

8. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, characterized in that, When the processor executes the program, it implements the method as described in any one of claims 1-6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the program implements the method described in any one of claims 1-6.

Citation Information

Patent Citations

  • Path planning and recommending method and device

    CN111141297A

  • Express receiving real-time early warning method and device and storage medium

    CN111738653A

  • Parcel collection task allocation method and device, parcel collection system, equipment and medium

    CN111861296A

  • Cold chain transportation method, cold chain transportation network establishment method and related equipment

    CN112580884A

  • Task list allocation method and device

    CN113780918A