关于群智感知的任务分配算法,目前已有若干研究.然而,现有的研究很少涉及到群智感知中需要多人协作的复杂感知任务,本文则对这一类任务进行研究.首先,展示了一个与位置相关的协作群智感知任务分配问题,并对其展开形式化分析;然后,证明了该问题为NP难解问题,并针对这一问题提出了一个基于贪心策略和最小加权集合覆盖的任务分配算法;最后,用多个算法通过实验作比较,证明了所提算法的优越性. However, the existing researches seldom involve the complex perceived tasks which need multi-person collaboration in the group-wise perception, and this dissertation studies the tasks of this kind.Firstly, This paper presents a location-based cooperative groupware-aware task assignment problem and formally analyzes it. Then, it proves that the problem is NP-hard and proposes a greedy strategy based on this strategy and the least weighted set Covering the task allocation algorithm; Finally, using multiple algorithms to compare experiments to prove the superiority of the proposed algorithm.