Optimal coverage of camera networks using PSO algorithm

In a camera network, one fundamental research issue is how well the target field is monitored, which is referred as the coverage problem. A good coverage method can reduce the cost and allow the monitor system to scale. The existing work on coverage problem use the k-coverage as its model and coverage percentage as its optimal metric. With this model and metric, there have been many optimal algorithms to solve this coverage problem. In this paper, we first propose a Binary Integer Programming (BIP) approach and a Hierarchical approach. This two algorithms both are time-consumer. Then we use particle swarm optimization (PSO) algorithm to solve the coverage problem and find that by PSO algorithm we can get a near-optimal solution with a higher real-time quality. Finally we compare the PSO algorithm and the Hierarchical approach by simulation.