Bundled spatial crowdsourcing task allocation method, device, computer equipment and medium
Through the bundled space crowdsourcing task allocation method, considering the complementarity and mutual exclusion effects between tasks, using offline combined task allocation strategies and combination pricing strategies, the problem of low utility of series of tasks in the existing technology is solved, and the mobile operation is achieved Efficient task allocation and cost reduction in the network.
Patent Information
- Application Number
- CN202410426477.X
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-04-10
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2044-04-10
AI Technical Summary
Existing spatial crowdsourcing algorithms are difficult to deal with complementarity and substitution between series of tasks, resulting in reduced utility and failing to effectively consider the mutually exclusive effects between tasks when designing incentive mechanisms.
Using the bundled space crowdsourcing task allocation method, by obtaining the task preferences and execution costs of mobile users, the overall utility of the offline combined task allocation strategy is maximized under budget constraints and mutually exclusive constraints, and the goal is determined by combining greedy algorithms and combination pricing strategies. Users and assign tasks.
Effectively reduce costs or improve the effectiveness of task completion in real mobile networks, minimize conflicts between tasks, and improve overall utility.
Smart Images

Figure CN118229010B_ABST
Abstract
Description
Technical Field
[0001] Embodiments of the present invention relate to the field of spatial crowdsourcing technology, and in particular to a method, device, computer equipment and medium for allocating bundled spatial crowdsourcing tasks. Background Art
[0002] In recent years, due to the increasing availability of modern mobile networks and smart devices, spatial crowdsourcing (SC) has become a new model for organizing mobile workers to efficiently perform spatial tasks. Spatial crowdsourcing brings traditional crowdsourcing to the real world, providing an effective way to solve practical problems collaboratively. Therefore, spatial crowdsourcing has gradually attracted widespread attention in academia, such as MediaQ and FooDNet algorithms, and in industrial scenarios, there are examples such as Uber and OpenStreetMap. Spatial crowdsourcing mainly includes elements such as crowdsourcing platforms, mobile users, and crowdsourcing users with unknown needs (providing location-aware tasks). Specifically, in a specific spatial crowdsourcing scenario, the platform will finely assign spatial tasks to mobile users to minimize the overall cost of completing the task or maximize the overall utility of performing the task. Then, for mobile customers who complete the distributed tasks, the platform will also give corresponding rewards. This process involves two key issues: task allocation problem and reward determination problem, which can be collectively referred to as the design problem of incentive mechanism.
[0003] However, most of the current spatial crowdsourcing algorithms still have some problems. Most algorithms only allow clients to request and process a single task, and there is no way to process a series of tasks. This limitation will cause these spatial crowdsourcing algorithms to ignore the complementarity and substitutability between a series of tasks in actual scenarios, resulting in reduced utility. Summary of the invention
[0004] The embodiments of the present invention provide a bundled spatial crowdsourcing task allocation method, apparatus, computer equipment and medium, so as to consider task bundling when designing an incentive mechanism, capture the complementarity and substitutability between tasks, and consider the mutual exclusion effect generated by task bundling, so as to better effectively reduce costs or improve the utility of completing tasks in the real mobile network world.
[0005] In a first aspect, an embodiment of the present invention provides a method for allocating bundled spatial crowdsourcing tasks, the method comprising:
[0006] Obtaining task preferences and execution costs declared by mobile users for bundled tasks to be assigned;
[0007] According to the task preference and the execution cost, a target user is selected from the mobile users based on an offline combined task allocation strategy, and the bundled task is allocated to the target user; the offline combined task allocation strategy maximizes the overall utility of the bundled task under the conditions of budget constraints and mutual exclusion constraints.
[0008] Optionally, the offline combined task allocation strategy includes:
[0009] determining an allocation standard index of the mobile user according to the task preference and the execution cost;
[0010] Based on the greedy algorithm, according to the budget constraint and the mutual exclusion constraint, one or more mobile users with the highest allocation standard index are selected as the target users.
[0011] Optionally, determining the allocation standard index of the mobile user according to the task preference and the execution cost includes:
[0012]
[0013] Among them, ρ i represents the allocation standard index of mobile user i, θ i represents the task preference declared by mobile user i, c i represents the execution cost of the mobile user i’s declaration, f i (θ i ) indicates that mobile user i executes θ i Offline utility.
[0014] Optionally, after allocating the bundling task to the target user, the method further includes:
[0015] Based on the combined pricing strategy, the task remuneration of the target user is determined and distributed according to the conflicting users who are not selected due to the conflicting preferences with the target user.
[0016] Optionally, the combined pricing strategy includes:
[0017] For each of the target users, determining a winner set based on the offline combined task allocation strategy according to the task preferences and execution costs declared by all users other than the target user;
[0018] Selecting a target conflicting user from the winner set who has the highest allocation standard index and has a preference conflict with the target user;
[0019] Selecting a target reference user with the lowest allocation standard index from all the target users;
[0020] The task remuneration of the target user is determined according to the target conflicting user and the target reference user.
[0021] Optionally, the method further includes:
[0022] Modeling a combinatorial multi-armed bandit problem based on the task preferences and the execution costs;
[0023] Estimate a user standard set of a current round according to the combinatorial multi-armed bandit problem and online utilities of historical rounds;
[0024] According to the user standard set, the job user of the current round is determined based on the offline combined task allocation strategy.
[0025] Optionally, the modeling of the combined multi-armed bandit problem according to the task preference and the execution cost includes:
[0026]
[0027] Among them, λ i,t represents the online allocation standard of mobile user i in round t, [t] = {1, 2, …, t}, θ i represents the task preference declared by mobile user i, c min represents the minimum execution cost declared by the mobile user, represents the budget constraint, γ i,t represents the number of times mobile user i is selected in the first t rounds, f i,k (θ i ) indicates that mobile user i executes θ in round k i Online utility.
[0028] In a second aspect, an embodiment of the present invention further provides a bundled spatial crowdsourcing task allocation device, the device comprising:
[0029] A declaration acquisition module, used to acquire the task preference and execution cost declared by the mobile user for the bundled task to be assigned;
[0030] A task allocation module is used to select a target user from the mobile users according to the task preference and the execution cost based on an offline combined task allocation strategy, and allocate the bundled task to the target user; the offline combined task allocation strategy maximizes the overall utility of the bundled task under the conditions of budget constraints and mutual exclusion constraints.
[0031] In a third aspect, an embodiment of the present invention further provides a computer device, the computer device comprising:
[0032] one or more processors;
[0033] A memory for storing one or more programs;
[0034] When the one or more programs are executed by the one or more processors, the one or more processors implement the bundling space crowdsourcing task allocation method provided by any embodiment of the present invention.
[0035] In a fourth aspect, an embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the bundled spatial crowdsourcing task allocation method provided by any embodiment of the present invention.
[0036] The embodiment of the present invention provides a bundled spatial crowdsourcing task allocation method, which first obtains the task preferences and execution costs declared by mobile users for the bundled tasks to be allocated, and then selects the target user from all mobile users based on the task preferences and execution costs of all mobile users and the offline combined task allocation strategy to allocate the bundled task to the target user, wherein the offline combined task allocation strategy can maximize the overall utility of the bundled task under the conditions of budget constraints and mutual exclusion constraints. The bundled spatial crowdsourcing task allocation method provided by the embodiment of the present invention takes task bundling into consideration when designing the incentive mechanism, thereby taking into account the complementarity and substitutability between a series of tasks, and also takes into account the mutual exclusion effect generated by task bundling. Compared with traditional methods, it can better resolve conflicts between tasks, maximize utility or reduce costs, and has great potential for real-world mobile network applications. BRIEF DESCRIPTION OF THE DRAWINGS
[0037] Figure 1 A flowchart of a method for allocating bundled spatial crowdsourcing tasks provided in Embodiment 1 of the present invention;
[0038] Figure 2 A structural diagram of an online combined reverse auction framework provided in the first embodiment of the present invention;
[0039] Figure 3 A schematic diagram of a combined pricing strategy provided in Embodiment 1 of the present invention;
[0040] Figure 4 A schematic diagram of the structure of a bundled spatial crowdsourcing task allocation device provided in Embodiment 2 of the present invention;
[0041] Figure 5 This is a schematic diagram of the structure of a computer device provided in Embodiment 3 of the present invention. DETAILED DESCRIPTION
[0042] The present invention will be further described in detail below in conjunction with the accompanying drawings and embodiments. It is to be understood that the specific embodiments described herein are only used to explain the present invention, rather than to limit the present invention. It should also be noted that, for ease of description, only parts related to the present invention, rather than all structures, are shown in the accompanying drawings.
[0043] It should be mentioned before discussing the exemplary embodiments in more detail that some exemplary embodiments are described as processes or methods depicted as flow charts. Although the flow charts describe the steps as sequential processes, many of the steps therein can be implemented in parallel, concurrently or simultaneously. In addition, the order of the steps can be rearranged. The process can be terminated when its operation is completed, but can also have additional steps not included in the accompanying drawings. The process can correspond to a method, function, procedure, subroutine, subprogram, etc.
[0044] Embodiment 1
[0045] Figure 1 This is a flowchart of the bundled space crowdsourcing task allocation method provided in the first embodiment of the present invention. This embodiment is applicable to the allocation of bundled tasks that may have certain mutual exclusivity. The method can be executed by the bundled space crowdsourcing task allocation device provided in the embodiment of the present invention. The device can be implemented by hardware and / or software, and can generally be integrated into a computer device. Figure 1 As shown, the specific steps include:
[0046] S11. Obtaining the task preference and execution cost declared by the mobile user for the bundled task to be assigned.
[0047] S12. According to the task preference and the execution cost, a target user is selected from the mobile users based on an offline combined task allocation strategy, and the bundled task is allocated to the target user; the offline combined task allocation strategy maximizes the overall utility of the bundled task under the conditions of budget constraints and mutual exclusion constraints.
[0048] For example, for two food delivery tasks with geographically close destinations, when the travel distance or cost of the courier performing the two tasks together is less than the sum of the costs of performing the two tasks separately, that is, spatial crowdsourcing of task bundling, there is complementarity and substitutability between the tasks. Alternatively, for two air quality monitoring tasks with similar locations, due to substitutability, the utility of performing them together is less than the utility of performing them separately. Therefore, in the implementation of real-world mobile networks, capturing the complementarity and substitutability between tasks and considering the incentive mechanism of spatial crowdsourcing of bundled tasks can effectively improve utility or reduce costs. However, due to the possible mutual exclusion between the task packages of bundled tasks, it may lead to the situation where tasks contained in different task packages are assigned to multiple users, which is unreasonable in many mobile network cases in the real world. For example, a passenger is assigned to two taxi drivers at the same time in a ride-hailing application.
[0049] Therefore, this embodiment can first focus on solving the contradiction between how to balance the mutual exclusivity of bundled space crowdsourcing tasks and the efficiency of task allocation. In order to overcome the shortcomings of the existing technology, the characteristics of the bundled tasks can be analyzed first, and an online combinatorial reverse auction framework can be constructed to simulate the actual interaction process between mobile users and crowdsourcing platforms. The framework structure is as follows: Figure 2 In this framework, mobile users who can perform tasks can upload their task preferences and execution costs for certain bundled tasks. The crowdsourcing platform then assigns bundled tasks to specific target users (task assignment phase) and distributes rewards to target users after they complete the bundled tasks (reward distribution phase).
[0050] In the task assignment phase, the application is offline. Assuming that the utility of the bundled tasks (i.e., offline utility) is known and available to the crowdsourcing platform, an offline combinatorial assignment policy (CAP) compatible with task mutual exclusivity can be designed and used. First, the crowdsourcing platform can obtain the mobile user's statement, which may include the mobile user's task preference and the execution cost of executing the corresponding task. The task preference can be a single task package or multiple preferences for different task packages. Each task package may include one or more tasks that are more suitable for bundled execution. Then, according to the obtained task preferences and execution costs, an offline combinatorial task assignment strategy (such as Figure 2 π a ) under a predefined budget constraint The bundled tasks to be assigned are assigned to mobile users in the form of task packages to optimize the overall utility. There may be conflicts between the task packages provided by different mobile users. If the same task appears in the task packages of different mobile users, the allocation process also needs to meet the conditions of mutual exclusion constraints, that is, the same task can only be assigned to one mobile user. Specifically, an offline combined task allocation strategy can be used. Under the conditions of budget constraints and mutual exclusion constraints, with the goal of maximizing the overall utility, a target user is selected from all mobile users, and the bundled tasks to be assigned are assigned to the target user. For example, Figure 2 As shown, the black user's task package includes two tasks (black dashed box), the blue user's task package includes three tasks (blue dashed box), and the green user's task package includes one task (green dashed box). There is a conflict between the black user's task package and the blue user's task package (the black dashed box overlaps with the blue dashed box), so the offline combined task allocation strategy π is applied. a , black users and green users can be finally selected as target users.
[0051] For the overall utility, we can define a variable to indicate whether mobile user i is selected (e.g., i=1 for selected, i=0 for unselected), and n represents the total number of mobile users. The overall utility of applying the offline combined task allocation strategy can be expressed as:
[0052]
[0053] Where I represents the set of selected mobile users, f i (θ i ) represents the mobile user i’s preference for performing his task θ i Offline utility. It can be seen that the goal is to maximize ∑ i∈[n] x i f i (θ i ) is equivalent to a value with weight f i (θ i ) and budget constraints The set covering problem is a well-known NP-complete problem, so finding the optimal solution to the bundled task assignment problem is also an NP-complete problem. Following the common idea of solving NP-complete problems, an approximate strategy can be designed to find the solution that is as close to the optimal solution of the bundled task assignment problem as possible within polynomial time complexity. However, due to the conflict between mutual exclusivity and task assignment efficiency, it is also challenging to design such an approximate strategy for task packages. For example, if a well-matched task package overlaps with a previously assigned task package, it cannot be assigned to any user, which reduces the assignment efficiency.
[0054] Optionally, the offline combined task allocation strategy includes: determining the allocation standard index of the mobile user according to the task preference and the execution cost; based on a greedy algorithm, according to the budget constraint and the mutual exclusion constraint, selecting one or more mobile users with the highest allocation standard index as the target users.
[0055] Specifically, a greedy offline combined task allocation strategy can be used to effectively solve the offline bundle allocation problem. Specifically, the user allocation standard of the optimal result can be generated according to the mutual exclusion relationship between task packages, and the user allocation standard can help the overall strategy to be as close to the optimal result as possible. In the offline combined task allocation strategy, the allocation standard index of each mobile user can be calculated according to the task preference and execution cost of each mobile user, and then the mobile user with the highest allocation standard index can be greedily expanded. The expansion process is subject to budget constraints and mutual exclusion constraints.
[0056] Optionally, determining the allocation standard index of the mobile user according to the task preference and the execution cost includes:
[0057]
[0058] Among them, ρ i represents the allocation standard index of mobile user i, θ i represents the task preference declared by mobile user i, c i represents the execution cost of the mobile user i’s declaration, f i (θ i ) indicates that mobile user i executes θ i It can be seen that the offline combined task allocation strategy focuses on the user's declaration of the task package rather than the user itself, so the strategy is also applicable to more practical situations, that is, users can declare multiple preferences for different task packages. The approximation ratio and computational complexity of the offline combined task allocation strategy can be further analyzed. The approximation ratio between the approximate solution obtained by applying the strategy and the optimal solution is The approximation ratio reflects the closeness between the approximate strategy and the optimal strategy, and can be quantified as the lower limit of the ratio between the result of the approximate strategy and the optimal strategy. It has been verified that the offline combination task allocation strategy can achieve an effective approximation ratio.
[0059] Based on the above technical solution, optionally, after assigning the bundled task to the target user, it also includes: based on a combined pricing strategy, determining and distributing the task remuneration of the target user according to conflicting users who are not selected due to preference conflicts with the target user.
[0060] In the reward distribution stage, some mobile users may report false costs in order to earn more income, which leads to unfair competition. Therefore, in order to solve the contradiction between bundling tasks and the authenticity of user bids, a combinatorial pricing policy (CPP) can be designed and used to pay target users task rewards that can achieve both incentive compatibility and individual rationality, and ensure the authenticity of mobile users' bids even under mutually exclusive constraints. Figure 2 As shown, crowdsourcing platforms can use a combination pricing strategy π p Determine the task reward for each assigned target user. Specifically, Figure 3 As shown in FIG. 1 , in this strategy, the task reward of the target user (Winners) can be determined by the reward of the conflicting user (the user marked by the blue dotted line) who was not selected due to a preference conflict (Conflict) with the target user (Winners).
[0061] Further optionally, the combined pricing strategy includes: for each of the target users, determining a winner set based on the offline combined task allocation strategy according to the task preferences and execution costs declared by all users other than the target user; selecting a target conflicting user with the highest allocation standard index and a preference conflict with the target user from the winner set; selecting a target reference user with the lowest allocation standard index from all the target users; and determining the task remuneration of the target user based on the target conflicting user and the target reference user.
[0062] Specifically, in the use of CAP and all mobile users' declaration After obtaining the target users, all target users can form the target user set I. For each target user i in I, let For all users except i, I -i To apply CAP to The winner set obtained. Then we can determine I -i The target conflict user k with the highest allocation standard index and a preference conflict with the target user i is selected, that is, k is the first user who is rejected from the target user set I due to the conflict with i. Then, the target reference user z with the lowest allocation standard index is determined from the target user set I, and the task reward of the target user i can be determined based on the target conflict user k and the target reference user z.
[0063] Based on the above technical solution, optionally, the method also includes: modeling a combined multi-armed bandit problem according to the task preference and the execution cost; estimating a user standard set for the current round according to the combined multi-armed bandit problem and the online utility of historical rounds; and determining the job user for the current round based on an offline combined task allocation strategy according to the user standard set.
[0064] Specifically, the offline combinatorial task allocation strategy can also be extended to online practical application scenarios with unknown utility, that is, the utility of the user who executes the task package is unknown in advance and difficult to determine. Consider the application of multi-armed bandit technology, which is an effective algorithm for exploring and exploring unknown environments and can provide a series of decisions in unknown environments. In the basic multi-armed bandit, the decision maker pulls the arm of a bandit in each round and obtains a random reward extracted from an unknown distribution. In order to balance the exploration and utilization of multi-armed bandits, traditional methods such as ε-greedy, upper confidence bandit algorithm and Topson sampling method are used. If we consider pulling the arms of multiple bandits at the same time in each round, it can be called a combinatorial multi-armed bandit (CMAB) problem. Early related work studied the cost-free CMAB setting, while considering a more practical setting, multiple bandit arms can be pulled in each round until the cumulative cost reaches the budget constraint. However, due to ignoring the interaction between task packages, the existing CMAB algorithm cannot be directly used in the online task package allocation situation.
[0065] In order to solve the contradiction between exploration and utilization in the online allocation process, an online combinatorial assignment policy (OCAP) based on a combinatorial multi-armed bandit with a provable regret bound can be designed and used to balance exploration and utilization under mutually exclusive constraints. Specifically, the online combinatorial assignment policy π o Explore multiple rounds of unknown utilities in a sequential manner and iteratively estimate these utilities to approach their true values. This process can involve multiple discrete time rounds [T] = {1, 2, ..., T}. In a given time range T, the key to solving the online bundled task allocation problem lies in the trade-off between the exploitation of user groups that produce large overall utilities in the first few rounds and the exploration of user groups that have the potential to produce huge utilities in the future.
[0066] For the online combined task allocation strategy, we can first model it as a combined multi-armed bandit problem based on task preferences and execution costs. Then, in each round t∈[T], we can use the obtained combined multi-armed bandit problem and the online utility observed in the historical rounds to calculate the user standard set for the current round. Specifically, at the beginning, each mobile user is selected once to obtain its initial online utility For subsequent calculations. After the estimation of The job users of the current round are obtained, so that the current bundled tasks can be assigned to the job users for execution. After execution, the above-mentioned combined pricing strategy can also be applied to distribute the task rewards. At the same time, the relevant variables can be updated according to the results observed in the current round for the next round of calculations. When the time round T is reached, the online combined task allocation strategy can terminate and output the cumulative utility of the platform since round T. It is shown that this strategy achieves a bounded expected regret Where |θ|=max{|θ i |:i∈[n]} is the maximum cardinality of a set of bundled tasks.
[0067] Further optionally, the modeling of the combined multi-armed bandit problem according to the task preference and the execution cost includes:
[0068]
[0069] Among them, λ i,t represents the online allocation standard of mobile user i in round t, [t] = {1, 2, …, t}, θ i represents the task preference declared by mobile user i, c min represents the minimum execution cost declared by the mobile user, represents the budget constraint, γ i,t represents the number of times mobile user i is selected in the first t rounds, f i,k (θ i ) indicates that mobile user i executes θ in round k i Specifically, we use a time-varying variable λ i,t As the online allocation criterion for each mobile user i, and based on the statement of mobile user i <θ i ,c i > to balance the exploitation-exploration trade-off. After a mobile user i is selected, the crowdsourcing platform can observe that the user performs task package θ in round t. i The actual online utility f i,t (θ i ), which can be viewed as having a mean of μ i In the above expression, the first addition term is the mobile user i executing task package θ in round t. iThe empirical average of the utility of can reflect the preference for exploitation and can be called the exploitation index. The second additive term is based on the upper confidence limit and can reflect the preference for exploration and can be called the exploration index. For example, a user who is not often selected (i.e., γ i,t smaller value) will get a larger second item value, making it more likely to be selected in the next round.
[0070] The offline combined task allocation strategy π provided above a , Combination pricing strategy π p and the online combined task allocation strategy π o Combined incentive mechanism that can jointly constitute bundled spatial crowdsourcing We further conducted theoretical analysis and numerical simulations using real-world mobile network datasets to verify the effectiveness of these strategies, which can effectively solve the problems caused by the mutual exclusivity and substitutability between task packages.
[0071] The technical solution provided by the embodiment of the present invention first obtains the task preference and execution cost of the bundled task to be assigned declared by the mobile user, and then selects the target user from all mobile users based on the offline combined task allocation strategy according to the task preference and execution cost of all mobile users, so as to allocate the bundled task to the target user, wherein the offline combined task allocation strategy can maximize the overall utility of the bundled task under the conditions of budget constraints and mutual exclusion constraints. Task bundling is taken into account when designing the incentive mechanism, thereby taking into account the complementarity and substitutability between the series of tasks, and also taking into account the mutual exclusion effect generated by task bundling. Compared with traditional methods, it can better resolve conflicts between tasks, maximize utility or reduce costs, and has great potential for real mobile network applications.
[0072] Embodiment 2
[0073] Figure 4 This is a schematic diagram of the structure of the bundled space crowdsourcing task allocation device provided in the second embodiment of the present invention. The device can be implemented by hardware and / or software, and can generally be integrated into a computer device to execute the bundled space crowdsourcing task allocation method provided in any embodiment of the present invention. Figure 4 As shown, the device comprises:
[0074] A declaration acquisition module 41, used to acquire the task preference and execution cost declared by the mobile user for the bundled task to be assigned;
[0075] The task allocation module 42 is used to select a target user from the mobile users according to the task preference and the execution cost based on an offline combined task allocation strategy, and allocate the bundled task to the target user; the offline combined task allocation strategy maximizes the overall utility of the bundled task under the conditions of budget constraints and mutual exclusion constraints.
[0076] The technical solution provided by the embodiment of the present invention first obtains the task preference and execution cost of the bundled task to be assigned declared by the mobile user, and then selects the target user from all mobile users based on the offline combined task allocation strategy according to the task preference and execution cost of all mobile users, so as to allocate the bundled task to the target user, wherein the offline combined task allocation strategy can maximize the overall utility of the bundled task under the conditions of budget constraints and mutual exclusion constraints. Task bundling is taken into account when designing the incentive mechanism, thereby taking into account the complementarity and substitutability between the series of tasks, and also taking into account the mutual exclusion effect generated by task bundling. Compared with traditional methods, it can better resolve conflicts between tasks, maximize utility or reduce costs, and has great potential for real mobile network applications.
[0077] On the basis of the above technical solution, optionally, the offline combined task allocation strategy includes:
[0078] determining an allocation standard index of the mobile user according to the task preference and the execution cost;
[0079] Based on the greedy algorithm, according to the budget constraint and the mutual exclusion constraint, one or more mobile users with the highest allocation standard index are selected as the target users.
[0080] Based on the above technical solution, optionally, determining the allocation standard index of the mobile user according to the task preference and the execution cost includes:
[0081]
[0082] Among them, ρ i represents the allocation standard index of mobile user i, θ i represents the task preference declared by mobile user i, c i represents the execution cost of the mobile user i’s declaration, f i (θ i ) indicates that mobile user i executes θ i Offline utility.
[0083] On the basis of the above technical solution, optionally, the bundled spatial crowdsourcing task allocation device further includes:
[0084] The task reward distribution module is used to determine and distribute the task reward of the target user according to the conflicting users who are not selected due to preference conflicts with the target user based on a combined pricing strategy after the bundled task is assigned to the target user.
[0085] On the basis of the above technical solution, optionally, the combined pricing strategy includes:
[0086] For each of the target users, determining a winner set based on the offline combined task allocation strategy according to the task preferences and execution costs declared by all users other than the target user;
[0087] Selecting a target conflicting user from the winner set who has the highest allocation standard index and has a preference conflict with the target user;
[0088] Selecting a target reference user with the lowest allocation standard index from all the target users;
[0089] The task remuneration of the target user is determined according to the target conflicting user and the target reference user.
[0090] On the basis of the above technical solution, optionally, the bundled spatial crowdsourcing task allocation device further includes:
[0091] A problem modeling module, for modeling a combined multi-armed bandit problem according to the task preference and the execution cost;
[0092] A user standard set estimation module, used for estimating the user standard set of the current round according to the combined multi-armed bandit problem and the online utility of the historical rounds;
[0093] The job user determination module is used to determine the job user of the current round according to the user standard set and based on the offline combined task allocation strategy.
[0094] Based on the above technical solution, optionally, the problem modeling module is specifically used for:
[0095]
[0096] Among them, λ i,t represents the online allocation standard of mobile user i in round t, [t] = {1, 2, …, t}, θ i represents the task preference declared by mobile user i, c min represents the minimum execution cost declared by the mobile user, represents the budget constraint, γ i,t represents the number of times mobile user i is selected in the first t rounds, f i,k (θ i) indicates that mobile user i executes θ in round k i Online utility.
[0097] The bundled space crowdsourcing task allocation device provided in the embodiment of the present invention can execute the bundled space crowdsourcing task allocation method provided in any embodiment of the present invention, and has the corresponding functional modules and beneficial effects of the execution method.
[0098] It is worth noting that in the above-mentioned embodiment of the bundled spatial crowdsourcing task allocation device, the various units and modules included are only divided according to functional logic, but are not limited to the above-mentioned division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of distinguishing each other, and are not used to limit the scope of protection of the present invention.
[0099] Embodiment 3
[0100] Figure 5 The schematic diagram of the structure of the computer device provided for the third embodiment of the present invention shows a block diagram of an exemplary computer device suitable for implementing the implementation mode of the present invention. Figure 5 The computer device shown is only an example and should not limit the functions and scope of use of the embodiments of the present invention. Figure 5 As shown, the computer device includes a processor 51, a memory 52, an input device 53 and an output device 54; the number of processors 51 in the computer device can be one or more. Figure 5 Taking a processor 51 as an example, the processor 51, memory 52, input device 53 and output device 54 in the computer device can be connected through a bus or other means. Figure 5 The example of connecting through bus is taken in the following.
[0101] The memory 52 is a computer-readable storage medium that can be used to store software programs, computer executable programs and modules, such as the program instructions / modules corresponding to the bundled space crowdsourcing task allocation method in the embodiment of the present invention (for example, the declaration acquisition module 41 and the task allocation module 42 in the bundled space crowdsourcing task allocation device). The processor 51 executes various functional applications and data processing of the computer device by running the software programs, instructions and modules stored in the memory 52, that is, realizing the above-mentioned bundled space crowdsourcing task allocation method.
[0102] The memory 52 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and at least one application required for a function; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 52 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 52 may further include a memory remotely arranged relative to the processor 51, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0103] The input device 53 can be used to obtain the task preference and execution cost of the bundled task to be assigned declared by the mobile user, and generate key signal input related to user settings and function control of the computer device, etc. The output device 54 can be used to notify the user to execute the task, etc.
[0104] Embodiment 4
[0105] Embodiment 4 of the present invention further provides a storage medium containing computer executable instructions, which, when executed by a computer processor, is used to execute a method for allocating bundled spatial crowdsourcing tasks, the method comprising:
[0106] Obtaining task preferences and execution costs declared by mobile users for bundled tasks to be assigned;
[0107] According to the task preference and the execution cost, a target user is selected from the mobile users based on an offline combined task allocation strategy, and the bundled task is allocated to the target user; the offline combined task allocation strategy maximizes the overall utility of the bundled task under the conditions of budget constraints and mutual exclusion constraints.
[0108] The storage medium may be any of various types of memory devices or storage devices. The term "storage medium" is intended to include: installation media, such as CD-ROM, floppy disk or tape device; computer system memory or random access memory, such as DRAM, DDR RAM, SRAM, EDO RAM, Rambus RAM, etc.; non-volatile memory, such as flash memory, magnetic media (such as hard disk or optical storage); registers or other similar types of memory elements, etc. The storage medium may also include other types of memory or combinations thereof. In addition, the storage medium may be located in the computer system in which the program is executed, or may be located in a different second computer system, which is connected to the computer system via a network (such as the Internet). The second computer system may provide program instructions to the computer for execution. The term "storage medium" may include two or more storage media that may reside in different locations (e.g., in different computer systems connected via a network). The storage medium may store program instructions (e.g., embodied as a computer program) that may be executed by one or more processors.
[0109] Of course, the storage medium containing computer executable instructions provided by an embodiment of the present invention is not limited to the method operations described above, and the computer executable instructions can also execute related operations in the bundled spatial crowdsourcing task allocation method provided by any embodiment of the present invention.
[0110] Computer-readable signal media may include data signals propagated in baseband or as part of a carrier wave, which carry computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. Computer-readable signal media may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with an instruction execution system, apparatus, or device.
[0111] The program code embodied on the computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
[0112] Through the above description of the implementation methods, the technicians in the relevant field can clearly understand that the present invention can be implemented by means of software and necessary general hardware, and of course it can also be implemented by hardware, but in many cases the former is a better implementation method. Based on such an understanding, the technical solution of the present invention, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product, and the computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, read-only memory (ROM), random access memory (RAM), flash memory (FLASH), hard disk or optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, server, or network device, etc.) to execute the methods described in each embodiment of the present invention.
[0113] Note that the above are only preferred embodiments of the present invention and the technical principles used. Those skilled in the art will understand that the present invention is not limited to the specific embodiments described herein, and that various obvious changes, readjustments and substitutions can be made by those skilled in the art without departing from the scope of protection of the present invention. Therefore, although the present invention has been described in more detail through the above embodiments, the present invention is not limited to the above embodiments, and may include more other equivalent embodiments without departing from the concept of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims
1. A method for allocating tasks in a bundled spatial crowdsourcing environment. It is characterized in that include: Obtaining task preferences and execution costs declared by mobile users for bundled tasks to be assigned; According to the task preference and the execution cost, a target user is selected from the mobile users based on an offline combined task allocation strategy, and the bundled task is allocated to the target user; The offline combined task allocation strategy maximizes the overall utility of the bundled tasks under the conditions of budget constraints and mutual exclusion constraints; The offline combined task allocation strategy includes: determining an allocation standard index of the mobile user according to the task preference and the execution cost; Based on the greedy algorithm, according to the budget constraint and the mutually exclusive constraint, one or more mobile users with the highest allocation standard index are selected as the target users; The step of determining the allocation standard index of the mobile user according to the task preference and the execution cost comprises: Among them, ρ i represents the allocation standard index of mobile user i, θ i represents the task preference declared by mobile user i, c i represents the execution cost of the mobile user i’s declaration, f i (θ i ) indicates that mobile user i executes θ i Offline utility; After assigning the bundling task to the target user, the method further includes: Based on the combined pricing strategy, determining and distributing the task remuneration of the target user according to the conflicting users who are not selected due to the conflicting preferences with the target user; The combined pricing strategy includes: For each of the target users, determining a winner set based on the offline combined task allocation strategy according to the task preferences and execution costs declared by all users other than the target user; Selecting a target conflicting user from the winner set who has the highest allocation standard index and has a preference conflict with the target user; Selecting a target reference user with the lowest allocation standard index from all the target users; The task remuneration of the target user is determined according to the target conflicting user and the target reference user.
2. The method for allocating bundled spatial crowdsourcing tasks according to claim 1, It is characterized in that The method further comprises: Modeling a combinatorial multi-armed bandit problem based on the task preferences and the execution costs; Estimate a user standard set of a current round according to the combinatorial multi-armed bandit problem and online utilities of historical rounds; According to the user standard set, the job user of the current round is determined based on the offline combined task allocation strategy.
3. The method for allocating bundled spatial crowdsourcing tasks according to claim 2, It is characterized in that The method of modeling a combined multi-armed bandit problem according to the task preference and the execution cost includes: Among them, λ i,t represents the online allocation standard of mobile user i in round t, [t] = {1, 2, …, t}, θ i represents the task preference declared by mobile user i, c min represents the minimum execution cost declared by the mobile user, B represents the budget constraint, γ i,t represents the number of times mobile user i is selected in the first t rounds, f i,k (θ i ) indicates that mobile user i executes θ in round k i Online utility.
4. A bundled spatial crowdsourcing task allocation device, It is characterized in that include: A declaration acquisition module, used for acquiring the task preference and execution cost declared by the mobile user for the bundled task to be assigned; A task allocation module, configured to select a target user from the mobile users according to the task preference and the execution cost and based on an offline combined task allocation strategy, and allocate the bundled task to the target user; The offline combined task allocation strategy maximizes the overall utility of the bundled tasks under the conditions of budget constraints and mutual exclusion constraints; The offline combined task allocation strategy includes: determining an allocation standard index of the mobile user according to the task preference and the execution cost; Based on the greedy algorithm, according to the budget constraint and the mutually exclusive constraint, one or more mobile users with the highest allocation standard index are selected as the target users; The step of determining the allocation standard index of the mobile user according to the task preference and the execution cost comprises: Among them, ρ i represents the allocation standard index of mobile user i, θ i represents the task preference declared by mobile user i, c i represents the execution cost of the mobile user i’s declaration, f i (θ i ) indicates that mobile user i executes θ i Offline utility; The bundled spatial crowdsourcing task allocation device further includes: A task reward distribution module is used to determine and distribute the task reward of the target user according to the conflicting users who are not selected due to preference conflicts with the target user based on a combined pricing strategy after the bundled task is assigned to the target user; The combined pricing strategy includes: For each of the target users, determining a winner set based on the offline combined task allocation strategy according to the task preferences and execution costs declared by all users other than the target user; Selecting a target conflicting user from the winner set who has the highest allocation standard index and has a preference conflict with the target user; Selecting a target reference user with the lowest allocation standard index from all the target users; The task remuneration of the target user is determined according to the target conflicting user and the target reference user.
5. A computer device, It is characterized in that include: one or more processors; A memory for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the bundling space crowdsourcing task allocation method as described in any one of claims 1-3.
6. A computer-readable storage medium having a computer program stored thereon, It is characterized in that When the program is executed by a processor, the bundled spatial crowdsourcing task allocation method as described in any one of claims 1 to 3 is implemented.
Citation Information
Patent Citations
Task distribution method considering user heteroplasmy and user preference in crowdsourcing system
CN106570639A
Task crowdsourcing allocation processing method based on personalized bidding task decomposition
CN109858831A
Multi-stage task allocation method, system and equipment in crowdsourcing environment and medium
CN117455200A
Systems and methods for managing recruiting and player allocations within sporting competitions
US20080220877A1
Methods and systems for crowdsourcing of tasks
US20160071048A1
