A cooperative task assignment method, device, computer equipment and storage medium

Abstract

This invention relates to the field of computer technology, and in particular to a collaborative task assignment method, apparatus, computer device, and storage medium. The method includes: issuing tasks; identifying and sorting users who will receive tasks; acquiring the location information of the users at predetermined time intervals; determining the distance between the users and a designated location based on the acquired location information; selecting a mode of transportation based on the distance; determining the time required for the users to reach the designated location based on the distance and the selected mode of transportation, thus obtaining a first parameter; adjusting the user sorting based on the calculated first parameter; repeating the above steps within a predetermined time period; determining a second parameter based on changes in the user sorting; and determining a task distribution combination based on the second parameter and assigning the tasks to the corresponding users within the distribution combination. This invention optimizes task distribution combinations by determining the task distribution order based on location changes before task distribution.

Description

Technical Field

[0001] This invention relates to the field of computer technology, and in particular to a collaborative task assignment method, apparatus, computer device, and storage medium. Background Technology

[0002] With the development of internet technology, task assignment and scheduling models based on network platforms are also constantly evolving and are widely used in industries such as ride-hailing, moving, and same-city delivery.

[0003] Traditional task dispatching involves distributing tasks into the system, where users manually or automatically accept orders on a first-come, first-served basis. This method is well-suited for simple, individual tasks, as they do not require collaboration, and the task recipient can arrange the specifics according to their own circumstances.

[0004] However, for orders that require collaboration among multiple people, existing technologies simply distribute orders into the system, allowing users to freely form combinations, without being able to adjust the order allocation or optimize the distribution of combined orders. Summary of the Invention

[0005] Therefore, it is necessary to provide a collaborative task assignment method, apparatus, computer equipment, and storage medium to address the above-mentioned problems.

[0006] This invention is implemented as follows: a collaborative task assignment method, the collaborative task assignment method comprising:

[0007] Post tasks, identify and sort users who will accept them;

[0008] Retrieve the location information of users who have accepted tasks at set time intervals;

[0009] The distance between the user and the specified location is determined based on the obtained user location information. A method of arrival is selected based on the distance between the user and the specified location. The time taken for the user to arrive at the specified location is determined based on the distance between the user and the specified location and the selected method of arrival to obtain the first parameter.

[0010] Adjust the user sorting based on the calculated first parameter;

[0011] Repeat the above steps within the set time period, and determine the second parameter based on the changes in user sorting.

[0012] The task distribution combination is determined based on the second parameter, and the task is sent to the corresponding user within the distribution combination.

[0013] In one embodiment, the present invention provides a collaborative task assignment device, the collaborative task assignment device comprising:

[0014] The first sorting module is used to publish tasks, identify users who will receive the tasks, and sort them.

[0015] The acquisition module is used to acquire the location information of users who have accepted tasks at set time intervals;

[0016] The first parameter determination module is used to determine the distance between the user and the specified location based on the acquired user location information, select a way to reach the specified location based on the distance between the user and the specified location, and determine the time required for the user to reach the specified location based on the distance between the user and the specified location and the selected way to reach the specified location to obtain the first parameter.

[0017] The second sorting module is used to adjust the user's sorting based on the calculated first parameter;

[0018] The second parameter determination module is used to repeat the above steps within a set time period and determine the second parameter based on the changes in the user's sorting.

[0019] The distribution module is used to determine the task distribution combination based on the second parameter and distribute the task to the corresponding user within the distribution combination.

[0020] In one embodiment, the present invention provides a computer device including a memory and a processor, wherein the memory stores a computer program that, when executed by the processor, causes the processor to perform the steps of the above-described cooperative task assignment method.

[0021] In one embodiment, the present invention provides a computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program, which, when executed by a processor, causes the processor to perform the steps of the above-described cooperative task assignment method.

[0022] The collaborative task assignment method provided by this invention adjusts the order in which users receive tasks based on changes in their location before task assignment, avoiding the problem of unreasonable task allocation and failure to make full use of users' effective time caused by simple order grabbing. Furthermore, this invention determines the final task allocation result based on changes in users' location. This method relies on changes in users' location to reduce the distance that users have to travel to the designated location after receiving a task, thus optimizing the allocation of user service resources. Attached Figure Description

[0023] Figure 1 A flowchart of a collaborative task assignment method provided in one embodiment;

[0024] Figure 2 A structural block diagram of a collaborative task dispatching device provided in one embodiment;

[0025] Figure 3This is a block diagram of the internal structure of a computer device in one embodiment. Detailed Implementation

[0026] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0027] It is understood that the terms "first," "second," etc., used in this invention may be used to describe various elements herein, but unless specifically stated otherwise, these elements are not limited by these terms. These terms are used only to distinguish one element from another. For example, without departing from the scope of this invention, a first script may be referred to as a second script, and similarly, a second script may be referred to as a first script.

[0028] like Figure 1 As shown, in one embodiment, a collaborative task assignment method is proposed, which may specifically include the following steps:

[0029] Step S100: Publish the task, identify and sort the users who will receive the task;

[0030] Step S200: Obtain the location information of the user who received the task at a set time interval;

[0031] Step S300: Determine the distance between the user and the specified location based on the obtained user location information; select a mode of arrival based on the distance between the user and the specified location; and determine the time required for the user to reach the specified location based on the distance between the user and the specified location and the selected mode of arrival to obtain the first parameter.

[0032] Step S400: Adjust the user sorting according to the calculated first parameter;

[0033] Step S500: Repeat the above steps within the set time period and determine the second parameter based on the changes in user sorting.

[0034] Step S600: Determine the task distribution combination based on the second parameter and distribute the task to the corresponding user within the distribution combination.

[0035] In this embodiment, the tasks include, but are not limited to, volunteer tasks at various offline venues or sites (such as venue guides, stadium staff, etc.), short-distance transport of large items, and other types of tasks requiring collaboration. This invention publishes tasks through a software platform, allowing users to claim tasks on their mobile devices. The system (server) of this invention determines which users claim the tasks. It should be noted that in this embodiment, claiming a task does not guarantee that a task will be assigned; it only indicates that the user has accepted the task. The final allocation result is determined by the system using the method provided by this invention.

[0036] In this embodiment, the time interval can be set to 5-10 minutes, depending on the time elapsed since the task started, and can be a fixed or variable value. This embodiment does not impose further limitations on this. In this embodiment, for users who have already accepted a task, the system obtains the user's location information at set time intervals and ultimately determines the task allocation based on the user's location information.

[0037] In this embodiment, the designated location refers to the starting location of the task. For tasks such as venue guides, the location is fixed and unique, while for short-distance transportation, it refers to the starting location of the transportation. In this embodiment, the mode of arrival includes, but is not limited to, walking, cycling, taking a taxi, driving, public transportation, etc. The first parameter is the time taken for the user to reach the designated location.

[0038] In this embodiment, the user sorting is adjusted according to the first parameter, avoiding the problem of uneven resource allocation caused by simply deciding task allocation through order grabbing.

[0039] In this embodiment, the set time can be a fixed time, such as one hour after the task is published, or it can be a dynamic time, such as one hour before the task starts. In this case, the set duration is the time between the task publication and one hour before the task starts. During this process, the user's location information is continuously obtained and the user's order is continuously adjusted. Therefore, the second parameter can be determined based on the changes in the user's order during this period. The second parameter can ultimately determine which users the task is assigned to.

[0040] In this embodiment, as an optional implementation, determining the task distribution group based on the second parameter means selecting the top few users with the largest second parameter or the top few users with the smallest second parameter as the distribution group, based on the magnitude of the second parameter and the set number of users required to complete the task, and then sending a task release confirmation notification to the corresponding users. In this embodiment, whether to select a larger or smaller value for the second parameter depends on how the second parameter is determined.

[0041] The collaborative task assignment method provided by this invention adjusts the order in which users receive tasks based on changes in their location before task assignment, avoiding the problem of unreasonable task allocation and failure to make full use of users' effective time caused by simple order grabbing. Furthermore, this invention determines the final task allocation result based on changes in users' location. This method relies on changes in users' location to reduce the distance that users have to travel to the designated location after receiving a task, thus optimizing the allocation of user service resources.

[0042] As a preferred embodiment of the present invention, the step of determining and sorting the users who will receive the task includes:

[0043] Upon receiving feedback from the user who has claimed the task, obtain the user's identity identifier.

[0044] Users are sorted according to the order in which they accepted the task;

[0045] Upon receiving feedback from subsequent users who have claimed tasks, determine whether the initial sorting has changed.

[0046] If the sorting remains unchanged, place the later user at the end of the sorting.

[0047] If the sorting has been changed, obtain the position information of the later users, determine the insertion position of the later users based on the position information of the later users, and insert the later users into the changed sorting.

[0048] In this embodiment, after a user receives a task via a mobile terminal such as a smartphone, the mobile terminal sends information to the terminal or server, and the system or server obtains the user's identity identifier. In this embodiment of the invention, unless otherwise specified, all sorting and other parameters refer to the user's identity identifier.

[0049] In this embodiment, users are ranked according to the order in which they accept tasks. Users who accept tasks first are ranked higher, and those who accept tasks later are ranked lower. This process reflects the strength of users' willingness to accept tasks. However, it cannot rule out the possibility that users may be unable to accept tasks in a timely manner due to other objective factors. Therefore, this ranking is only considered as one ranking. In this embodiment, "later users" refers to users who accept tasks after each ranking.

[0050] As a preferred embodiment of the present invention, the step of determining the insertion position of the later user based on the later user's location information and inserting the later user into the changed sorting includes:

[0051] Determine the distance between the subsequent user and the specified location based on the location information of the subsequent user, and select a way to get there based on the distance between the subsequent user and the specified location;

[0052] The time it takes for a subsequent user to reach the specified location is determined based on the distance between the subsequent user and the specified location, as well as the selected method of arrival.

[0053] Among the sorted users, identify the user whose arrival time at the specified position is closest to that of the subsequent user, and insert the subsequent user in front of or behind the identified user whose arrival time at the specified position is closest to that of the subsequent user.

[0054] In this embodiment, the present invention provides a method for determining the insertion position for subsequent users. In this embodiment, based on the time taken for the subsequent user to reach the specified position, the existing user with the closest arrival time is determined, and the subsequent user is inserted to the left or right of the determined user. Specifically, if the subsequent user's arrival time is shorter than that of the determined user, and the arrival time increases from left to right, the subsequent user is inserted to the left of the determined user; otherwise, it is inserted to the right.

[0055] As a preferred embodiment of the present invention, the step of adjusting the user ranking according to the calculated first parameter further includes:

[0056] Compare the sorting before and after the update to determine if there are two users who are adjacent before and after the update. If so, compare the time difference between the two users when they reach the specified location and determine if the time difference is less than the set time difference threshold. If so, cancel the change in the relative positions of the two adjacent users in the next sorting.

[0057] In this embodiment, "adjacent before and after the update" means that two users are adjacent to each other both before and after the sorting update, but the direction of adjacency can change. For example, before the update, A is to the left of B, but after the update, A is to the right of B. In this case, they are still considered to be adjacent before and after the update. The time difference threshold here is usually set to 3-5 minutes.

[0058] As a preferred embodiment of the present invention, adjusting the user ranking according to the calculated first parameter includes:

[0059] Update the user sorting from smallest to largest based on the first parameter;

[0060] Determine whether the direction of change of the first parameter of each user is the same in the last two times. If not, calculate whether the deviation of the change is greater than the set deviation threshold. If it is not greater than the set deviation threshold, take the average of the first parameter of the user in the last three times and update the user ranking.

[0061] In this embodiment, the user sorting is updated from smallest to largest, that is, according to the first parameter of each user, the users (represented by the user's identity identifier) ​​are sorted from left to right from smallest to largest.

[0062] In this embodiment, the direction of the two most recent changes refers to the first parameter increasing (or decreasing) in the (n-1)th change compared to the (n-2)th change, and the first parameter also increasing (or decreasing) in the (n-1)th change compared to the (n-2)th change. Here, n is the order of the changes after the update, n is a positive integer, and n is greater than or equal to 3. The deviation of the change is equal to the ratio of the absolute value of the difference between the value after the later change and the value after the earlier change to the value after the later change. In this embodiment, the deviation threshold is set to a value within 0.1.

[0063] As a preferred embodiment of the present invention, determining the second parameter based on changes in user ranking includes:

[0064] The second parameter is obtained by summing the order of each user's sorting in each round.

[0065] In this embodiment, the second parameter represents the overall ranking of each user in each sorting.

[0066] As a preferred embodiment of the present invention, selecting an arrival method based on the distance between the user and the specified location includes:

[0067] Get the user's previous and subsequent location changes, as well as the time of those changes;

[0068] Determine the available access methods based on changes in the user's previous and subsequent locations;

[0069] Calculate the time required for all available ways to reach the destination;

[0070] Calculate the difference between the time required for the available modes of arrival and the time required for the determined change of location, and sort the available modes of arrival in ascending order of the difference;

[0071] Based on the distance between the user and the specified location, select several available ways to reach the location, and select the available way that is ranked first.

[0072] In this embodiment, since data collection is performed periodically, the time of change in position is equal to the data collection interval. In this embodiment, each predetermined mode of transportation has an applicable distance range, such as walking within 2 kilometers; cycling within 1-5 kilometers; and public transportation (bus / subway) within urban areas. These specific settings differ and may vary depending on the usage area; this embodiment does not impose specific limitations. Several different modes of transportation can be selected based on the distance of the change in position.

[0073] In this embodiment, the time taken by various available arrival methods can be obtained by calling the navigation software interface and using the time taken by different modes of transportation between any two points provided by the navigation software to obtain the real-time arrival time.

[0074] In this embodiment, several available ways to reach the user are selected based on the distance between the user and the specified location. The method for selecting available ways to reach the user is the same as the method for determining available ways to reach the user based on changes in the user's previous and current locations in this embodiment.

[0075] like Figure 2 As shown, this embodiment of the invention also provides a collaborative task assignment device, which includes:

[0076] The first sorting module is used to publish tasks, identify users who will receive the tasks, and sort them.

[0077] The acquisition module is used to acquire the location information of users who have accepted tasks at set time intervals;

[0078] The first parameter determination module is used to determine the distance between the user and the specified location based on the acquired user location information, select a way to reach the specified location based on the distance between the user and the specified location, and determine the time required for the user to reach the specified location based on the distance between the user and the specified location and the selected way to reach the specified location to obtain the first parameter.

[0079] The second sorting module is used to adjust the user's sorting based on the calculated first parameter;

[0080] The second parameter determination module is used to repeat the above steps within a set time period and determine the second parameter based on the changes in the user's sorting.

[0081] The distribution module is used to determine the task distribution combination based on the second parameter and distribute the task to the corresponding user within the distribution combination.

[0082] In this embodiment, the above-mentioned collaborative task assignment device is a modularization of the steps of the collaborative task assignment method provided by the present invention. For the explanation of each module, please refer to the content of the method section of the present invention. The embodiments of the present invention will not be repeated here.

[0083] Figure 3 An internal structural diagram of a computer device in one embodiment is shown. Figure 3As shown, the computer device includes a processor, memory, network interface, input device, and display screen connected via a system bus. The memory includes a non-volatile storage medium and internal memory. The non-volatile storage medium stores an operating system and may also store a computer program. When executed by the processor, the computer program enables the processor to implement the cooperative task assignment method provided in this embodiment of the invention. The internal memory may also store a computer program, which, when executed by the processor, enables the processor to execute the cooperative task assignment method provided in this embodiment of the invention. The display screen of the computer device can be a liquid crystal display (LCD) or an e-ink display. The input device can be a touch layer covering the display screen, buttons, a trackball, or a touchpad mounted on the computer device casing, or an external keyboard, touchpad, or mouse, etc.

[0084] Those skilled in the art will understand that Figure 3 The structure shown is merely a block diagram of a portion of the structure related to the present invention and does not constitute a limitation on the computer device to which the present invention is applied. A specific computer device may include more or fewer components than those shown in the figure, or combine certain components, or have different component arrangements.

[0085] In one embodiment, the collaborative task assignment device provided by this invention can be implemented as a computer program, which can be implemented in the form of, for example... Figure 3 It runs on the computer device shown. The computer device's memory can store the various program modules that make up this cooperative task dispatching device, for example, Figure 2 The diagram shows a first sorting module, an acquisition module, a first parameter determination module, a second sorting module, a second parameter determination module, and a distribution module. The computer program comprised of these modules causes the processor to execute the steps of the cooperative task assignment method of the various embodiments of the present invention described in this specification.

[0086] For example, Figure 3 The computer device shown can be used as follows Figure 2 The first sorting module in the collaborative task assignment device shown executes step S100; the computer device can execute step S200 through the acquisition module; the computer device can execute step S300 through the first parameter determination module; the computer device can execute step S400 through the second sorting module; the computer device can execute step S500 through the second parameter determination module; and the computer device can execute step S600 through the distribution module.

[0087] In one embodiment, a computer device is provided, the computer device including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor, when executing the computer program, performs the following steps:

[0088] Post tasks, identify and sort users who will accept them;

[0089] Retrieve the location information of users who have accepted tasks at set time intervals;

[0090] The distance between the user and the specified location is determined based on the obtained user location information. A method of arrival is selected based on the distance between the user and the specified location. The time taken for the user to arrive at the specified location is determined based on the distance between the user and the specified location and the selected method of arrival to obtain the first parameter.

[0091] Adjust the user sorting based on the calculated first parameter;

[0092] Repeat the above steps within the set time period, and determine the second parameter based on the changes in user sorting.

[0093] The task distribution combination is determined based on the second parameter, and the task is sent to the corresponding user within the distribution combination.

[0094] In one embodiment, a computer-readable storage medium is provided, on which a computer program is stored, which, when executed by a processor, causes the processor to perform the following steps:

[0095] Post tasks, identify and sort users who will accept them;

[0096] Retrieve the location information of users who have accepted tasks at set time intervals;

[0097] The distance between the user and the specified location is determined based on the obtained user location information. A method of arrival is selected based on the distance between the user and the specified location. The time taken for the user to arrive at the specified location is determined based on the distance between the user and the specified location and the selected method of arrival to obtain the first parameter.

[0098] Adjust the user sorting based on the calculated first parameter;

[0099] Repeat the above steps within the set time period, and determine the second parameter based on the changes in user sorting.

[0100] The task distribution combination is determined based on the second parameter, and the task is sent to the corresponding user within the distribution combination.

[0101] It should be understood that although the steps in the flowcharts of the various embodiments of the present invention are shown sequentially according to the arrows, these steps are not necessarily executed in the order indicated by the arrows. Unless explicitly stated herein, there is no strict order restriction on the execution of these steps, and they can be executed in other orders. Moreover, at least some steps in the various embodiments may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily completed at the same time, but can be executed at different times. The execution order of these sub-steps or stages is not necessarily sequential, but can be performed alternately or in turn with other steps or at least a portion of the sub-steps or stages of other steps.

[0102] Those skilled in the art will understand that all or part of the processes in the methods of the above embodiments can be implemented by a computer program instructing related hardware. The program can be stored in a non-volatile computer-readable storage medium, and when executed, it can include the processes of the embodiments of the above methods. Any references to memory, storage, databases, or other media used in the embodiments provided by this invention can include non-volatile and / or volatile memory. Non-volatile memory can include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM), or flash memory. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in various forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), dual data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link DRAM (SLDRAM), RAMbus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and RAMbus dynamic RAM (RDRAM), etc.

[0103] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0104] The embodiments described above are merely illustrative of several implementations of the present invention, and while the descriptions are specific and detailed, they should not be construed as limiting the scope of the present invention. It should be noted that those skilled in the art can make various modifications and improvements without departing from the concept of the present invention, and these modifications and improvements all fall within the scope of protection of the present invention. Therefore, the scope of protection of this patent should be determined by the appended claims.

Claims

1. A collaborative task assignment method, characterized in that, The collaborative task assignment method includes: Post tasks, identify and sort users who will accept them; Retrieve the location information of users who have accepted tasks at set time intervals; The distance between the user and the specified location is determined based on the obtained user location information. A method of arrival is selected based on the distance between the user and the specified location. The time taken for the user to arrive at the specified location is determined based on the distance between the user and the specified location and the selected method of arrival to obtain the first parameter. Adjust the user sorting based on the calculated first parameter; Repeat the above steps within the set time period, and determine the second parameter based on the changes in user sorting. The task distribution combination is determined based on the second parameter, and the task is sent to the corresponding user within the distribution combination; The step of selecting a mode of arrival based on the distance between the user and the specified location includes: Get the user's previous and subsequent location changes, as well as the time of those changes; Determine the available access methods based on changes in the user's previous and subsequent locations; Calculate the time required for all available ways to reach the destination; Calculate the difference between the time required for the available modes of arrival and the time required for the determined change of location, and sort the available modes of arrival in ascending order of the difference; Select several available ways to reach the specified location based on the distance between the user and the specified location, and select the available way to reach the location that is ranked first. The step of determining the second parameter based on changes in user sorting includes: The second parameter is obtained by summing the order of each user's sorting in each round.

2. The collaborative task assignment method according to claim 1, characterized in that, The process of determining and sorting the users who will receive the task includes: Upon receiving feedback from the user who has claimed the task, obtain the user's identity identifier. Users are sorted according to the order in which they accepted the task; Upon receiving feedback from subsequent users who have claimed tasks, determine whether the initial sorting has changed. If the sorting remains unchanged, place the later user at the end of the sorting. If the sorting has been changed, obtain the position information of the later users, determine the insertion position of the later users based on the position information of the later users, and insert the later users into the changed sorting.

3. The collaborative task assignment method according to claim 2, characterized in that, The step of determining the insertion position of a subsequent user based on the user's location information and inserting the subsequent user into the changed sorting includes: Determine the distance between the subsequent user and the specified location based on the location information of the subsequent user, and select a way to get there based on the distance between the subsequent user and the specified location; The time it takes for a subsequent user to reach the specified location is determined based on the distance between the subsequent user and the specified location, as well as the selected method of arrival. Among the sorted users, identify the user whose arrival time at the specified position is closest to that of the subsequent user, and insert the subsequent user in front of or behind the identified user whose arrival time at the specified position is closest to that of the subsequent user.

4. The collaborative task assignment method according to claim 1, characterized in that, The process of adjusting the user sorting based on the calculated first parameter further includes: Compare the sorting before and after the update to determine if there are two users who are adjacent before and after the update. If so, compare the time difference between the two users when they reach the specified location and determine if the time difference is less than the set time difference threshold. If so, cancel the change in the relative positions of the two adjacent users in the next sorting.

5. The collaborative task assignment method according to claim 1, characterized in that, The step of adjusting the user sorting based on the calculated first parameter includes: Update the user sorting from smallest to largest based on the first parameter; Determine whether the direction of change of the first parameter of each user is the same in the last two times. If not, calculate whether the deviation of the change is greater than the set deviation threshold. If it is not greater than the set deviation threshold, take the average of the first parameter of the user in the last three times and update the user ranking.

6. A collaborative task assignment device, characterized in that, The collaborative task assignment device includes: The first sorting module is used to publish tasks, identify users who will receive the tasks, and sort them. The acquisition module is used to acquire the location information of users who have accepted tasks at set time intervals; The first parameter determination module is used to determine the distance between the user and the specified location based on the acquired user location information, select a way to reach the specified location based on the distance between the user and the specified location, and determine the time required for the user to reach the specified location based on the distance between the user and the specified location and the selected way to reach the specified location to obtain the first parameter. The second sorting module is used to adjust the user's sorting based on the calculated first parameter; The second parameter determination module is used to repeat the above steps within a set time period and determine the second parameter based on the changes in the user's sorting. The distribution module is used to determine the task distribution combination based on the second parameter and distribute the tasks to the corresponding users within the distribution combination; The step of selecting a mode of arrival based on the distance between the user and the specified location includes: Get the user's previous and subsequent location changes, as well as the time of those changes; Determine the available access methods based on changes in the user's previous and subsequent locations; Calculate the time required for all available ways to reach the destination; Calculate the difference between the time required for the available modes of arrival and the time required for the determined change of location, and sort the available modes of arrival in ascending order of the difference; Select several available ways to reach the specified location based on the distance between the user and the specified location, and select the available way to reach the location that is ranked first. The step of determining the second parameter based on changes in user sorting includes: The second parameter is obtained by summing the order of each user's sorting in each round.

7. A computer device, characterized in that, It includes a memory and a processor, wherein the memory stores a computer program that, when executed by the processor, causes the processor to perform the steps of the cooperative task assignment method according to any one of claims 1 to 5.

8. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores a computer program that, when executed by a processor, causes the processor to perform the steps of the cooperative task assignment method according to any one of claims 1 to 5.

Images