Parallel Preprocessing for the Optimal Camera Placement Problem

This paper deals with the preprocessing needed for the optimal camera placement problem, which is stated as a unicost set covering problem (USCP). Distributed and massively parallel computations with graphics processing unit (GPU) are proposed in order to perform the reduction and visibility preprocessing respectively. An experimental study reports that a significant speedup can be achieved, and we give a general heterogeneous parallel approach that brings together these parallel computations. In addition to that, a set-based differential evolution (DE) method is applied to solve 10 instances of the considered problem, and promising results are reported