| Popis: |
Abstract The aim of this paper is to propose a novel method for solving the camera placement problem based on the Particle Swarm Optimization where the problem is to find the optimal position and orientation with minimum number of cameras in order to assure the coverage of the monitoring space. Firstly, we define the coverage problem by realistic and consistent assumptions taking into account the capabilities and limits of the cameras. Then, we adapted three versions of Binary Particle Swarm optimizations to solve the camera placement for coverage problem. Results of a number of simulation scenarios show the efficiency of the Binary Particle Swarm optimization as tool to solve the above mentioned problem. Surprisingly, the results of this paper show that, in a large scale dimension, the standard version of “BPSO” gives better results than the modified versions proposed in the literature. |
