Abstract: Target coverage in Dynamic Vision Sensor Networks(DVSN) always supposes the target as a point. But the target in most situations can not be simplified as a point. The single node even does not have the ability to cover a single target. For the problem, this paper proposes a multiple node cooperation coverage algorithm. The algorithm uses the virtual potential field to make the vision node distribute uniformly around the target. It schedules the node’s work direction with the Particle Swarm Optimization(PSO) algorithm to maximize the target coverage. Simulation experimental results validate that the algorithm is effective.

Key words: Dynamic Vision Sensor Networks(DVSN), target coverage, Particle Swarm Optimization(PSO) algorithm, virtual potential field

摘要： 视觉传感器网络中的目标覆盖通常将目标简化为一个点，从而研究如何最大化覆盖目标点。但在多数情况下，目标无法被简化为一个点，单个视觉节点不但无法覆盖多个目标，对单个目标也无法完全覆盖。针对该问题，提出一种多节点协作覆盖算法。利用虚拟势场力使视觉传感器节点均匀地分布在目标周围，通过粒子群优化算法调度节点的工作方向，实现对单个目标覆盖的最大化。仿真实验结果表明，该算法有效。

关键词: 动态视觉传感器网络, 目标覆盖, 粒子群优化算法, 虚拟势场

CLC Number: 

• TP393