Sparse crowd sensing task allocation method based on two-stage heuristic search

The two-stage heuristic search algorithm addresses poor data inference in sparse crowd sensing by optimizing participant and sub-region assignments based on spatiotemporal correlations and credibility, enhancing data quality and accuracy.

CN119094976AActive Publication Date: 2024-12-06NORTHWESTERN POLYTECHNICAL UNIV

Patent Information

Application Number
CN202411177069.1
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-08-26
Publication Date
2024-12-06
Estimated Expiration
2044-08-26

AI Technical Summary

Technical Problem

Existing sparse crowd sensing task allocation methods suffer from poor data inference accuracy due to the use of low-quality data from participants with varying device performance and credibility, often ignoring potentially valuable data points and focusing excessively on uncertainty.

Method used

A two-stage heuristic search algorithm is employed to match participants with perception sub-regions, considering spatiotemporal correlations and participant credibility, to improve data inference accuracy by constructing a bipartite graph and optimizing participant and sub-region assignments.

Benefits of technology

The method enhances data inference accuracy by evaluating participant trust and spatial-temporal characteristics, improving the quality of perception data while adhering to total cost constraints.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119094976A_ABST
    Figure CN119094976A_ABST
Patent Text Reader

Abstract

The invention discloses a sparse crowd sensing task allocation method based on two-stage heuristic search. The method comprises the following steps: acquiring a sensing task and the total cost of the sensing task; dividing the sensing task into m sensing periods in time, and dividing the sensing task into n initial sensing sub-areas in a sensing area; on the basis of historical data and spatio-temporal correlation of the n initial sensing sub-regions, similar initial sensing sub-regions in the n initial sensing sub-regions are divided into a set, and L sensing sub-region sets after division are obtained; according to the method, the technical problem that the accuracy of data inference in current sparse crowd sensing task allocation is poor, namely the quality of sensing data is poor is solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of task allocation, and in particular to a sparse crowd-sensing task allocation method based on two-stage heuristic search. Background Art

[0002] As smart mobile devices are equipped with more and more sensors, such as accelerometers, gyroscopes, GPS, cameras, and microphones, mobile crowd sensing (MCS) has become a promising data collection method in smart city projects. This technology effectively addresses the challenges of large-scale data collection tasks by leveraging the collaboration between groups and the sensing, computing, and communication capabilities of mobile devices themselves. In order to ensure the high quality of data, MCS applications usually require mobilizing a large number of participants to cover a wide geographical area, but this practice is often accompanied by high perception costs. Therefore, many studies are devoted to finding ways to reduce perception costs without sacrificing data quality. Some researchers have proposed a new framework called sparse crowd sensing (Sparse MCS). This framework implements a data collection strategy in a few key sub-areas by mining the temporal and spatial correlation of data, so that the data situation of the entire uncovered area can be inferred based on limited data input. Through this strategy, Sparse MCS significantly reduces the number of tasks and perception costs while still maintaining the high quality of collected data. This not only improves the efficiency of overall data collection, but also provides strong technical support for the sustainable development of smart cities.

[0003] Existing sparse crowd sensing task allocation methods are often oversimplified as a sub-region selection problem. This method is usually based on the assumption that there are many participants in the target sensing area, each sensing sub-region is reachable, and the participants will submit accurate sensing data. However, the actual situation is much more complicated than this. The quality of the sensing data submitted by the participants may vary due to differences in personal device performance, improper operation or malicious behavior. Especially in sparse crowd sensing, the number of selected sub-regions is limited, and the data inference of the remaining unperceived areas depends on the data of these selected areas. If low-quality data submitted by participants with low credibility is used for inference, it will directly affect the perception effect and reliability of the entire system. In addition, in early sensing sub-region selection strategies, such as Query by Committee (QBC), sub-regions are mainly selected based on uncertainty. Although this method can identify areas with insufficient information, it sometimes ignores other areas that may contain important information because of excessive focus on uncertainty. This bias may lead to an incomplete assessment of the value of data points, thereby ignoring other data points with potential high value. Summary of the invention

[0004] The embodiment of the present invention provides a sparse crowd sensing task allocation method based on two-stage heuristic search, so as to at least solve the technical problem of poor accuracy of data inference in the current sparse crowd sensing task allocation, that is, poor quality of perception data.

[0005] According to one aspect of an embodiment of the present invention, a sparse crowd intelligence perception task allocation method based on two-stage heuristic search is provided. The method may include: obtaining the perception task and the total cost of the perception task; dividing the perception task into m perception cycles in time, and dividing the perception task into n initial perception sub-regions in the perception area; based on the historical data and spatiotemporal correlation of the n initial perception sub-regions, dividing the similar initial perception sub-regions in the n initial perception sub-regions into a set to obtain L perception sub-region sets after division; when any one or more participants are in any one of the m perception cycles, matching any one or more participants with any initial perception sub-region in a subset of a partial perception sub-region set in the L perception sub-region set based on a two-stage heuristic search algorithm to obtain multiple initial perception matching pairs, wherein each initial perception matching pair includes any one or more participants to any initial perception sub-region in a subset of a partial perception sub-region set. The geographical distance of the area, the target perception value and the movement cost corresponding to the geographical distance, the target perception value is determined according to the credibility and initial perception value of any one or more participants; based on the spatiotemporal correlation of the L perception sub-area sets, the initial perception matrix in the multiple initial perception matching pairs is inferred by using the data inference algorithm F to obtain the inferred data matrix, wherein the initial perception matrix is ​​composed of multiple target perception values; based on the real data matrix and the inferred data matrix, the error between the real data matrix and the inferred data matrix is ​​determined; based on the movement cost and geographical distance corresponding to the geographical distance of each initial perception matching pair in the multiple initial perception matching pairs, the target values ​​of the multiple initial perception matching pairs are determined; when the target values ​​of the multiple initial perception matching pairs are less than the total cost of the perception task, the perception matching pair set corresponding to the minimum error between the real data matrix and the inferred data matrix is ​​determined.

[0006] Optionally, based on the historical data and spatiotemporal correlation of the n initial perceptual sub-regions, similar initial perceptual sub-regions among the n initial perceptual sub-regions are divided into a set, and the expression of the divided set of L perceptual sub-regions is:

[0007] U sim = {U 1 ,U 2 ,...}={{u 1 ,u 2 ,u 3},{u4 ,u 5},...,{u m-2 ,u m-1 ,u m}}

[0008] Among them, {u 1 ,u 2 ,u 3}、{u 4 ,u 5} and {u m-2 ,u m-1 ,u m} respectively represent that similar initial perception sub-regions in n initial perception sub-regions are divided into a set, U 1 That is {u 1 ,u 2 ,u 3}, U sim is the set of L perception sub-areas after division.

[0009] Optionally, based on a two-stage heuristic search algorithm, any one or multiple participants are matched with any initial perceptual sub-region in a subset of a partial perceptual sub-region set in a set of L perceptual sub-regions to obtain multiple initial perceptual matching pairs, including: a first stage: selecting any one participant with the closest geographical distance to any initial perceptual sub-region for matching to obtain multiple first perceptual matching pairs, and excluding multiple participants and multiple initial perceptual sub-regions in the multiple first perceptual matches in the second stage; a second stage: matching multiple participants remaining unmatched in the first stage with multiple initial perceptual sub-regions to obtain multiple second initial perceptual matching pairs; an iterative stage: adjusting multiple first initial perceptual matching pairs and multiple second initial perceptual matching pairs of the current cycle through inference errors to obtain multiple adjusted first perceptual matching pairs and multiple second perceptual matching pairs; and obtaining multiple initial perceptual matching pairs based on the adjusted multiple first perceptual matching pairs and multiple second perceptual matching pairs.

[0010] Optionally, based on the adjusted multiple first perceptual matching pairs and the multiple second perceptual matching pairs, multiple initial perceptual matching pairs are obtained, including: merging the adjusted multiple first perceptual matching pairs and the multiple second perceptual matching pairs to obtain multiple initial perceptual matching pairs.

[0011] Optionally, based on the spatiotemporal correlation of the L sets of perception sub-regions, the initial perception matrix in the multiple initial perception matching pairs is inferred using the data inference algorithm F, and the expression of the inferred data matrix is ​​obtained as follows:

[0012] D infer =F(D sense )

[0013] Among them, D infer is the inference data matrix, F is the data inference algorithm, D sense is the initial perception matrix.

[0014] Optionally, based on the mobility cost and geographic distance corresponding to the geographic distance of each of the multiple initial perceptual matching pairs, target values ​​of the multiple initial perceptual matching pairs are determined, including: multiplying the mobility cost corresponding to the geographic distance of each of the multiple initial perceptual matching pairs by the geographic distance to obtain the target value of each initial perceptual match; adding the target values ​​of each initial perceptual match to obtain the target values ​​of the multiple initial perceptual matching pairs.

[0015] Beneficial effects of the present invention:

[0016] The present invention proposes a sparse crowd intelligence perception task allocation method based on two-stage heuristic search, and uses the historical task execution data of participants stored on the platform to comprehensively evaluate the trust of participants from four aspects: task completion rate, data accuracy, timeliness and activity. At the same time, the temporal characteristics and spatial characteristics of the perception sub-area are extracted for cluster analysis, and the perception sub-areas with similar temporal and spatial characteristics are divided into the same subset. Afterwards, a sparse crowd intelligence perception task allocation problem is constructed based on a bipartite graph, that is, the matching problem of participants and perception sub-areas. A two-stage heuristic search algorithm is used to solve and generate a series of <participants, perception sub-areas> pairs, which solves the current poor accuracy of data inference in sparse crowd intelligence perception task allocation, that is, the poor quality of perception data. The technical problem is solved, and task allocation is performed under the constraint of total cost in the sparse crowd intelligence perception task allocation process, which improves the accuracy of data inference, that is, improves the quality of perception data. The technical effect. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] The drawings described herein are used to provide a further understanding of the present invention and constitute a part of this application. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute an improper limitation of the present invention. In the drawings:

[0018] Figure 1 is a flowchart of a sparse crowd sensing task allocation method based on two-stage heuristic search according to an embodiment of the present invention;

[0019] Figure 2 is a schematic diagram of a cluster analysis result in a similarity analysis according to an embodiment of the present invention;

[0020] Figure 3 is a schematic diagram of participant reputation evaluation according to an embodiment of the present invention. DETAILED DESCRIPTION

[0021] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only embodiments of a part of the present invention, not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.

[0022] It should be noted that the terms "first", "second", etc. in the specification and claims of the present invention and the above-mentioned drawings are used to distinguish similar objects and to describe a specific order or sequence. It should be understood that the terms used in this way can be interchangeable where appropriate, so that the embodiments of the present invention described herein can be implemented in an order other than those illustrated or described herein. In addition, the terms "including" and "having" and any variations thereof are intended to cover non-exclusive inclusions, for example, a process, method, system, product or device that includes a series of steps or units is not necessarily limited to those steps or units that are clearly listed, but may include other steps or units that are not clearly listed or inherent to these processes, methods, products or devices.

[0023] Example 1

[0024] According to an embodiment of the present invention, a sparse crowd sensing task allocation method based on two-stage heuristic search is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system comprising at least one set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described may be executed in an order different from that shown here.

[0025] Figure 1 is a flowchart of a sparse crowd sensing task allocation method based on two-stage heuristic search according to an embodiment of the present invention, such as Figure 1 As shown, the method may include the following steps:

[0026] Step S101, obtaining the perception task and the total cost of the perception task.

[0027] In the technical solution provided in the above step S101 of the present invention, a perception task is obtained, wherein the perception task may be an image classification task or an image segmentation task, etc., and the total cost of the perception task is limited to C.

[0028] Step S102: divide the sensing task into m sensing cycles in time, and divide the sensing task into n initial sensing sub-areas in the sensing area.

[0029] In the technical solution provided in step S102 of the present invention, the sensing task is evenly divided into m sensing cycles in time: T = {t 1 ,t 2 ,...t m}, the perception area is divided into n perception sub-areas: U = {u 1 ,u 2 ,...,u n}, the sensing activity can actually be regarded as a combination of m×n sensing tasks, each of which is performed at a specific time and place, {u 1 ,u 2 ,...,u n} represent the first perception sub-area, the second perception sub-area and the nth perception sub-area respectively.

[0030] Step S103: based on the historical data and spatiotemporal correlation of the n initial perceptual sub-regions, similar initial perceptual sub-regions among the n initial perceptual sub-regions are divided into a set to obtain L sets of divided perceptual sub-regions.

[0031] In the technical solution provided in step S103 of the present invention, for the way of evenly dividing the perceptual sub-regions, some perceptual sub-regions may have similar perceptual data, resulting in perceptual redundancy during selection. Therefore, the historical data and spatiotemporal correlation of the n initial perceptual sub-regions are combined to divide the similar initial perceptual sub-regions in the n initial perceptual sub-regions into a set, and the divided L perceptual sub-region sets are obtained. According to an embodiment of the present invention, a schematic diagram of cluster analysis results in similarity analysis is provided. Figure 2 is a schematic diagram of a cluster analysis result in a similarity analysis according to an embodiment of the present invention, such as Figure 2 As shown, similar initial perception sub-regions are determined by the perception sub-region similarity analysis. The perception sub-region similarity analysis is based on historical data, and spatiotemporal feature extraction and cluster analysis are performed on the perception data in each sub-region. The perception sub-regions with similar spatiotemporal features of the data belong to the same cluster and are finally divided into the same set, obtaining the cluster analysis result.

[0032] Step S104: when any one or more participants are in any one of the m perception cycles, any one or more participants are matched with any initial perception sub-region in a subset of the partial perception sub-region set in the L perception sub-region set based on a two-stage heuristic search algorithm to obtain multiple initial perception matching pairs, wherein each initial perception matching pair includes the geographical distance from any one or more participants to any initial perception sub-region in the subset of the partial perception sub-region set, the target perception value and the movement cost corresponding to the geographical distance, and the target perception value is determined based on the credibility and initial perception value of the one or more participants.

[0033] In the technical solution provided in the above step S104 of the present invention, when any one or more participants are in any one of the m perception cycles, a two-stage heuristic search algorithm is used to match any one or more participants with any initial perception sub-region in a subset of the partial perception sub-region set in the L perception sub-region set, to obtain multiple initial perception matching pairs, wherein each initial perception matching pair includes a geographical distance L (p ) from any one or more participants to any initial perception sub-region in the subset of the partial perception sub-region set. k ,u j ), target perception value d ij The cost of movement C corresponding to the geographical distance pk , target perception value d ij It is determined based on the reputation and initial perception value of any one or more participants. k ,u j ) k represents the Kth participant, u j represents any initial perception sub-area of ​​the subset in the partial perception sub-area set, L represents the geographical distance, C pk represents the mobile version corresponding to the Kth participant, where the initial perception value is the perception value of any one participant or multiple participants to any initial perception sub-area of ​​the subset of the partial perception sub-area set of multiple participants, and the calculation process of a participant of the target perception value is as follows:

[0034] The reputation R of a participant can be expressed as the weighted average of C, A, T, and L as shown in the following formula:

[0035] R=w 1 ·C+w 2 ·A+w 3 ·T+w 4 ·L

[0036] Among them: C is the task completion rate, A is the data accuracy, T is the timeliness, and L is the activity.1 ,w 2 ,w 3 ,w 4 are the weights of these indicators, and satisfy w 1 +w 2 +w 3 +w 4 = 1. According to an embodiment of the present invention, a participant reputation evaluation is provided. Figure 3 is a schematic diagram of participant reputation evaluation according to an embodiment of the present invention, such as Figure 3 As shown, in Figure 3 In the above figure, the R value distribution is not much different from the fitted normal distribution curve, so for participants from channels without historical task execution data, the median can be used as the initial credibility setting. According to the R value results, the proportions of high, medium, and low credibility participants are set to 0.25, 0.5, and 0.25.

[0037] To ensure that the evaluation results more accurately reflect current performance, the latest data of each indicator should have a more important impact on the final evaluation than the earlier data. By using an exponential decay weighting method, the most recent data points are given a higher weight, and this weight gradually decreases as the data point grows older. The reputation evaluation of participants is determined based on the historical observation data of the participants.

[0038] w(t i )=e -λ·(T-t)

[0039] 1: Task completion rate C

[0040]

[0041] 2: Data Accuracy A

[0042] For a completed task, data accuracy A is the average difference between the submitted data and the true data.

[0043]

[0044] 3: Timeliness

[0045] For completed tasks, timeliness T is the average difference between the task submission time and the deadline time.

[0046]

[0047] 4: Activity

[0048] Activity L is the frequency with which participants complete tasks within a certain period of time.

[0049]

[0050] in:

[0051] N is the total number of tasks assigned to the participants, and M is the total number of tasks completed by the participants;

[0052] w(t i ) is based on the completion time t of the i-th task i The time weighting factor of

[0053] s i is the completion status of the i-th task, 1 for completed and 0 for uncompleted;

[0054] d i is the submission data of the ith task, is the real data of the i-th task;

[0055] t i is the completion time of the ith task, st i is the start time of the ith task, et i is the end time of the i-th task;

[0056] O is the length of the observation period.

[0057] Step S105, based on the spatiotemporal correlation of the L perception sub-region sets, the initial perception matrix in the multiple initial perception matching pairs is inferred using the data inference algorithm F to obtain an inferred data matrix, wherein the initial perception matrix is ​​composed of multiple target perception values.

[0058] In the technical solution provided in the above step S105 of the present invention, based on the spatiotemporal correlation of the set of L perception sub-areas, the data inference algorithm F is used to infer the initial perception matrix in multiple initial perception matching pairs to obtain an inferred data matrix, wherein the initial perception matrix is ​​composed of multiple target perception values. For example, the initial perception matrix is ​​30 data, then according to the data inference algorithm F, the inferred data matrix of the n perception sub-areas of the perception task can be inferred, wherein the inferred data matrix is ​​close to the real perception data.

[0059] Step S106, based on the real data matrix and the inferred data matrix, determining the error between the real data matrix and the inferred data matrix.

[0060] In the technical solution provided in the above step S106 of the present invention, based on the real data matrix and the inferred data matrix, the calculation expression for determining the error between the real data matrix and the inferred data matrix is ​​as follows:

[0061]

[0062] Among them, for tasks that collect continuous initial perception values ​​(such as temperature and humidity), the mean absolute error (MAE) is used to define E. For classification perception tasks (such as the air quality index (AQI)), the classification error (CE) is used to define E. When the perception task is a continuous perception task, D infer (i,j) represents the inferred data of the jth initial perception sub-region observed in the i-th perception cycle, D real (i, j) represents the real data of the jth initial perception sub-area observed in the i-th perception cycle, where the value range of i is 1~m and the value range of j is 1~n. When the perception task is a discrete perception task, ψD infer (i,j) represents the inferred data of the jth initial perception sub-region observed in the i-th perception cycle, ψD real (i, j) represents the real data of the jth initial perception sub-area observed in the i-th perception cycle, where the value of i ranges from 1 to m, and the value of j ranges from 1 to n. 1 represents when ψD infer (i,j) and ψD real When (i,j) are not equal, it is recorded as 1.

[0063] Step S107 : determining target values ​​of the multiple initial perceptual matching pairs based on the movement cost and the geographical distance corresponding to the geographical distance of each of the multiple initial perceptual matching pairs.

[0064] In the technical solution provided in the above step S107 of the present invention, the movement cost and the geographical distance corresponding to the geographical distance of each of the multiple initial perceptual matching pairs are calculated to obtain the target values ​​of the multiple initial perceptual matching pairs.

[0065] Step S108, when the target values ​​of the multiple initial perceptual matching pairs are less than the total cost of the perceptual task, determine a set of perceptual matching pairs corresponding to the minimum error between the real data matrix and the inferred data matrix.

[0066] In the technical solution provided in step S108 of the present invention, when the target values ​​of the multiple initial perceptual matching pairs are less than the total cost of the perceptual task, a set of perceptual matching pairs corresponding to the minimum error between the real data matrix and the inferred data matrix is ​​determined, as shown in the following expression:

[0067]

[0068] Among them, Φ is a set containing the mapping relationship of <participant, perception sub-area> pairs, representing the participant p k Assigned to the perceptual sub-region u iPerform the perception task. P×U is the Cartesian product of all possible <actor, perception sub-region> pairs, The set of perceptual matching pairs corresponding to the minimum error between the real data matrix and the inferred data matrix, It indicates that the target value of multiple initial perceptual matching pairs is less than the total cost of the perceptual task, and C represents the total cost of the perceptual task.

[0069] The above method of this embodiment is further introduced below.

[0070] As an optional implementation manner, in step S103, based on the historical data and spatiotemporal correlation of the n initial perceptual sub-regions, similar initial perceptual sub-regions in the n initial perceptual sub-regions are divided into a set, and the expression of the divided set of L perceptual sub-regions is obtained as follows:

[0071] U sim = {U 1 ,U 2 ,...}={{u 1 ,u 2 ,u 3},{u 4 ,u 5},...,{u m-2 ,u m-1 ,u m}}

[0072] Among them, {u 1 ,u 2 ,u 3}、{u 4 ,u 5} and {u m-2 ,u m-1 ,u m} respectively represent that similar initial perception sub-regions in n initial perception sub-regions are divided into a set, U 1 That is {u 1 ,u 2 ,u 3}, U sim is the set of L perception sub-areas after division.

[0073] As an optional implementation method, step S104, based on a two-stage heuristic search algorithm, matches any one or multiple participants with any initial perceptual sub-region in a subset of a part of the perceptual sub-region sets in the L perceptual sub-region sets to obtain multiple initial perceptual matching pairs, including: the first stage: select any one participant with the closest geographical distance to any initial perceptual sub-region for matching, to obtain multiple first perceptual matching pairs, and exclude multiple participants and multiple initial perceptual sub-regions in the multiple first perceptual matches in the second stage; the second stage: match the multiple participants remaining unmatched in the first stage with the multiple initial perceptual sub-regions to obtain multiple second initial perceptual matching pairs; iterative stage: adjust the multiple first initial perceptual matching pairs and the multiple second initial perceptual matching pairs of the current cycle through the inference error to obtain the adjusted multiple first perceptual matching pairs and the multiple second perceptual matching pairs; based on the adjusted multiple first perceptual matching pairs and the multiple second perceptual matching pairs, obtain multiple initial perceptual matching pairs.

[0074] In this embodiment, in each sensing cycle, the problem of assigning participants to sensing units to perform tasks can be regarded as a weighted bipartite graph optimal matching problem. All participants are represented as the left nodes of the bipartite graph, and all sensing units are represented as the right nodes of the bipartite graph. For each participant p k And each perceptual unit u j , if p k Up to u j , then add a line from p to the bipartite graph k to u j The initial weight of the edge is defined as w kj .

[0075]

[0076] In the first stage, for U sim For each subset in , select the closest actor and sensor pair (p k ,u j ) to match. Add this match to the initial match set M 0 and p k and u j Exclude from the subsequent matching process to avoid repeated matching and resource waste. The main purpose of this step is to quickly reduce the number of uncovered perceptual units and ensure that at least one unit in each subset is guaranteed by preliminary data collection.

[0077] In the second stage, a bipartite graph G′=(P′,U′,E′) is constructed between the remaining unmatched participants and the perception units, and the KM algorithm is applied to find the optimal match M′ on G′, considering the cost constraint C / m, where P′ represents the remaining participants except the participants in the first stage, U′ represents the remaining perception sub-areas except the perception sub-areas in the first stage, and E′ represents the weight of the edge in the second stage.

[0078] Finally, the algorithm merges the matching results of the two stages to form a matching solution for the current perception cycle.

[0079] M=M 0 ∪M′

[0080] Iteration: After the perception cycle ends, the data inference and error calculation of the current cycle are performed, and the weights of the edges in the bipartite graph are adjusted based on the inference error. (Specifically, if the data provided by a participant leads to a large inference error, the weight of the edge from the participant to the assigned perception unit is increased, otherwise, the weight is reduced. The optimal matching process is performed again using the adjusted weights until the predetermined number of cycles is reached).

[0081]

[0082] Among them, E base is the pre-set error limit, is the updated weight, represents the weights that need to be updated in the first or second stage, v ijk represents the value of the jth initial perception sub-area observed by participant k in the i-th perception cycle, D real (i, j) represents the true value of the jth initial perception sub-region observed in the i-th perception cycle.

[0083] As an optional implementation method, multiple initial perceptual matching pairs are obtained based on the adjusted multiple first perceptual matching pairs and multiple second perceptual matching pairs, including: merging the adjusted multiple first perceptual matching pairs and multiple second perceptual matching pairs to obtain multiple initial perceptual matching pairs.

[0084] In this embodiment, the adjusted multiple first perceptual matching pairs and the multiple second perceptual matching pairs are combined to obtain multiple initial perceptual matching pairs.

[0085] As an optional implementation manner, step S105, based on the spatiotemporal correlation of the L perception sub-region sets, the initial perception matrix in the multiple initial perception matching pairs is inferred using the data inference algorithm F, and the expression of the inferred data matrix is ​​obtained as follows:

[0086] D infer =F(D sense )

[0087] Among them, D infer is the inference data matrix, F is the data inference algorithm, D sense is the initial perception matrix.

[0088] As an optional implementation method, step S107 determines the target values ​​of multiple initial perceptual matching pairs based on the mobility cost and geographic distance corresponding to the geographic distance of each initial perceptual matching pair in the multiple initial perceptual matching pairs, including: multiplying the mobility cost corresponding to the geographic distance of each initial perceptual matching pair in the multiple initial perceptual matching pairs by the geographic distance to obtain the target value of each initial perceptual matching; adding the target values ​​of each initial perceptual matching to obtain the target values ​​of multiple initial perceptual matching pairs.

[0089] In this embodiment, the movement cost corresponding to the geographical distance of each initial perceptual matching pair in multiple initial perceptual matching pairs is multiplied by the geographical distance to obtain the target value of each initial perceptual matching, and the target values ​​of multiple initial perceptual matching pairs are added together to obtain the target values ​​of multiple initial perceptual matching pairs.

[0090] In an embodiment of the present invention, by acquiring a perception task and a total cost of the perception task; dividing the perception task into m perception cycles in time, and dividing the perception task into n initial perception sub-regions in the perception area; based on the historical data and spatiotemporal correlation of the n initial perception sub-regions, dividing similar initial perception sub-regions in the n initial perception sub-regions into a set to obtain L perception sub-region sets after division; when any one or more participants are in any one of the m perception cycles, matching any one or more participants with any initial perception sub-region in a subset of a partial perception sub-region set in the L perception sub-region set based on a two-stage heuristic search algorithm to obtain multiple initial perception matching pairs, wherein each initial perception matching pair includes the geographical distance from any one or more participants to any initial perception sub-region in a subset of the partial perception sub-region set, the target perception value, and the movement cost corresponding to the geographical distance, and the target perception value is calculated based on the reputation of any one or more participants and The initial perception value is determined; based on the spatiotemporal correlation of the L perception sub-area sets, the initial perception matrix in the multiple initial perception matching pairs is inferred by the data inference algorithm F to obtain the inferred data matrix, wherein the initial perception matrix is ​​composed of multiple target perception values; based on the real data matrix and the inferred data matrix, the error between the real data matrix and the inferred data matrix is ​​determined; based on the movement cost and the geographical distance corresponding to the geographical distance of each initial perception matching pair in the multiple initial perception matching pairs, the target values ​​of the multiple initial perception matching pairs are determined; when the target values ​​of the multiple initial perception matching pairs are less than the total cost of the perception task, the perception matching pair set corresponding to the minimum error between the real data matrix and the inferred data matrix is ​​determined, which solves the current technical problem of poor accuracy of data inference in sparse crowd intelligence perception task allocation, that is, poor quality of perception data, and achieves task allocation under the constraint of total cost in the process of sparse crowd intelligence perception task allocation, thereby improving the accuracy of data inference, that is, improving the quality of perception data.

[0091] The serial numbers of the above embodiments of the present invention are only for description and do not represent the advantages or disadvantages of the embodiments.

[0092] In the above embodiments of the present invention, the description of each embodiment has its own emphasis. For parts that are not described in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

[0093] In the several embodiments provided in this application, it should be understood that the disclosed technical content can be implemented in other ways. Among them, the device embodiments described above are only schematic. For example, the division of units can be a logical function division. There may be other division methods in actual implementation. For example, multiple units or components can be combined or integrated into another system, or some features can be ignored or not executed. Another point is that the mutual coupling or direct coupling or communication connection shown or discussed can be through some interfaces, indirect coupling or communication connection of units or modules, which can be electrical or other forms.

[0094] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place or distributed over multiple units. Some or all of the units may be selected according to actual needs to achieve the purpose of the present embodiment.

[0095] In addition, each functional unit in each embodiment of the present invention may be integrated into a first processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit. The above-mentioned integrated unit may be implemented in the form of hardware or in the form of software functional units.

[0096] The above are only preferred embodiments of the present invention. It should be pointed out that, for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications should also be regarded as the scope of protection of the present invention.

Claims

1. A sparse crowd-sensing task allocation method based on two-stage heuristic search, characterized in that: include: Get the total cost of the sensing task and the sensing task; Divide the perception task into m perception cycles in time and divide the perception task into n initial perception sub-areas in the perception area; Based on the historical data and spatiotemporal correlation of the n initial perception sub-regions, similar initial perception sub-regions among the n initial perception sub-regions are divided into a set to obtain L perception sub-region sets after division; When any one or more participants are in any one of the m perception cycles, the any one or more participants are matched with any initial perception sub-region in the subset of the partial perception sub-region set in the L perception sub-region set based on a two-stage heuristic search algorithm to obtain multiple initial perception matching pairs, wherein each initial perception matching pair includes the geographical distance from any one or more participants to any initial perception sub-region in the subset of the partial perception sub-region set, the target perception value and the movement cost corresponding to the geographical distance, and the target perception value is determined according to the reputation and initial perception value of any one or more participants; Based on the spatiotemporal correlation of the L perception sub-region sets, the initial perception matrix in the multiple initial perception matching pairs is inferred using the data inference algorithm F to obtain an inferred data matrix, where the initial perception matrix is ​​composed of multiple target perception values; Based on the real data matrix and the inferred data matrix, determining the error between the real data matrix and the inferred data matrix; determining target values ​​of the plurality of initial perceptual matching pairs based on the movement cost and the geographical distance corresponding to the geographical distance of each of the plurality of initial perceptual matching pairs; When the target values ​​of the multiple initial perceptual matching pairs are less than the total cost of the perceptual task, a set of perceptual matching pairs corresponding to the minimum error between the real data matrix and the inferred data matrix is ​​determined.

2. The method according to claim 1, characterized in that Based on the historical data and spatiotemporal correlation of the n initial perception sub-regions, similar initial perception sub-regions in the n initial perception sub-regions are divided into a set, and the expression of the divided L perception sub-region set is: U sim ={U1,U2,...}={{u1,u2,u3},{u4,u5},...,{u m-2 ,u m-1 ,u m }} Among them, {u1,u2,u3}, {u4,u5} and {u m-2 ,u m-1 ,u m } respectively represent that similar initial perceptual sub-regions in n initial perceptual sub-regions are divided into a set, U1 is a set of {u1,u2,u3}, U sim is the set of L perception sub-areas after division.

3. The method according to claim 1, characterized in that Based on a two-stage heuristic search algorithm, any one or more participants are matched with any initial perception sub-region in a subset of a part of the perception sub-region sets in the L perception sub-region sets to obtain multiple initial perception matching pairs, including: The first stage: select any participant with the closest geographical distance to any initial perception sub-region for matching, obtain multiple first perception matching pairs, and exclude multiple participants and multiple initial perception sub-regions in the multiple first perception matches in the second stage; The second stage: matching the remaining unmatched participants in the first stage with the multiple initial perception sub-areas to obtain multiple second initial perception matching pairs; Iteration stage: adjusting the multiple first initial perceptual matching pairs and the multiple second initial perceptual matching pairs of the current cycle by using the inference error to obtain the adjusted multiple first perceptual matching pairs and the multiple second perceptual matching pairs; Based on the adjusted multiple first perceptual matching pairs and multiple second perceptual matching pairs, multiple initial perceptual matching pairs are obtained.

4. The method according to claim 3, characterized in that Based on the adjusted plurality of first perceptual matching pairs and the plurality of second perceptual matching pairs, a plurality of initial perceptual matching pairs are obtained, including: The adjusted multiple first perceptual matching pairs and the multiple second perceptual matching pairs are merged to obtain multiple initial perceptual matching pairs.

5. The method according to claim 1, characterized in that: Based on the spatiotemporal correlation of the L sets of perceptual sub-regions, the data inference algorithm F is used to infer the initial perceptual matrix in multiple initial perceptual matching pairs, and the expression of the inferred data matrix is ​​obtained as follows: D infer =F(D sense ) Among them, D infer is the inference data matrix, F is the data inference algorithm, D sense is the initial perception matrix.

6. The method according to claim 1, characterized in that Determining target values ​​of the plurality of initial perceptual matching pairs based on the movement cost and the geographical distance corresponding to the geographical distance of each of the plurality of initial perceptual matching pairs includes: Multiplying the movement cost corresponding to the geographical distance of each initial perception match pair in the plurality of initial perception match pairs by the geographical distance to obtain a target value for each initial perception match; The target values ​​of each of the multiple initial perceptual matches are added together to obtain the target values ​​of the multiple initial perceptual matching pairs.

7. A processor, characterized in that: The processor is used to run a program, wherein the program executes the method according to any one of claims 1 to 7 when running.

8. A computer-readable storage medium, characterized in that: The computer-readable storage medium includes a stored program, wherein when the program is executed, the device where the computer-readable storage medium is located is controlled to execute the method according to any one of claims 1 to 7.

Citation Information

Patent Citations

  • Participant optimization selection method oriented to sparse crowd sensing

    CN114722904A

  • Mobile crowd sensing task allocation method and equipment based on integrated neighborhood search

    CN116887343A

Cited By

  • Online data completion method for large-scale sparse mobile Internet of Things perception

    CN119939131A

  • An online data completion method for large-scale sparse mobile IoT perception

    CN119939131B