Three particle swarm algorithms to improve coverage of camera networks with mobile nodes

This paper studies how to improve the coverage of camera networks where the locations and orientations of the cameras can be adjusted. As the power energy limits the distance that each camera can move, the coverage problem is a constrained optimization. We provide three particle swarm optimization (PSO) algorithms for the problem, which are the penalty PSO, the absorbing PSO, and the reflecting PSO. The penalty PSO adds penalty to the coverage when a camera violates the distance constraint, while the last two PSO algorithms use the feasibility operators. By the absorbing PSO, the cameras out of the distance limit will stay at the boundary of the limit, while by the reflecting PSO their locations are randomly reinitialize into the feasible area. The three PSO algorithms are tested on the benchmarks, and the statistical analysis shows that their performance is in the descendant order of absorbing PSO, penalty PSO, and reflecting PSO. The results suggest that the absorbing PSO is a good choice for the coverage problem of camera networks.

[1]  Cheng-Yan Kao,et al.  Applying Family Competition to Evolution Strategies for Constrained Optimization , 1997, Evolutionary Programming.

[2]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[3]  Jian Zhao,et al.  Optimal Camera Network Configurations for Visual Tagging , 2008, IEEE Journal of Selected Topics in Signal Processing.

[4]  Stan Sclaroff,et al.  Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements , 2006, Comput. Vis. Image Underst..

[5]  Renbin Xiao,et al.  Two hybrid compaction algorithms for the layout optimization problem , 2007, Biosyst..

[6]  Xin Yao,et al.  Evolving artificial neural networks , 1999, Proc. IEEE.

[7]  Larry S. Davis,et al.  A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion , 2007, International Journal of Computer Vision.

[8]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization in distributed sensor networks , 2004, TECS.

[9]  Michael N. Vrahatis,et al.  Particle Swarm Optimization Method for Constrained Optimization Problems , 2002 .

[10]  Bangjun Lei,et al.  Particle swarm optimization to improve the coverage of a camera network , 2009, International Symposium on Multispectral Image Processing and Pattern Recognition.

[11]  Carlos A. Coello Coello,et al.  A constraint-handling mechanism for particle swarm optimization , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[12]  Y.-C. Lee,et al.  An immune based two-phase approach for the multiple-type surveillance camera location problem , 2009, Expert Syst. Appl..

[13]  R. Lienhart,et al.  On the optimal placement of multiple visual sensors , 2006, VSSN '06.

[14]  Dario Pompili,et al.  Deployment analysis in underwater acoustic wireless sensor networks , 2006, Underwater Networks.

[15]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[16]  Dan Tao.  A Virtual Potential Field Based Coverage-Enhancing Algorithm for Directional Sensor Networks , 2007 .

[17]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[18]  Y. Rahmat-Samii,et al.  Particle swarm optimization in electromagnetics , 2004, IEEE Transactions on Antennas and Propagation.