Exact Biobjective Optimization Methods for Camera Coverage Problem in Three-Dimensional Areas

This paper deals with the problem of deploying necessary camera sensors ensuring the maximum sum of weighted target points in 3-D areas while minimizing the total sensor network camera cost. The problem is NP-complete as it can be considered as a total grid coverage problem, which is an NP-complete problem when the sensing field is a 2-D area. We solve the problem optimally by three exact biobjective methods: 1) weighted sum scalarization approach; 2) a two-phase method; and 3) an $\varepsilon $ -constraint method. The simulation results show that each adopted resolution approach dominates the other approaches in at least one criterium when the problem size increases and the resolution process is stopped after a predefined computation time limit.