Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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 ε-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.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02316396
Contributor : Jean-Baptiste Vu Van <>
Submitted on : Tuesday, October 15, 2019 - 11:47:22 AM
Last modification on : Tuesday, June 16, 2020 - 4:04:02 PM

Identifiers

Collections

Citation

Maher Rebai, Matthieu Le Berre, Faicel Hnaien, Hichem Snoussi. Exact Biobjective Optimization Methods for Camera Coverage Problem in Three-Dimensional Areas. IEEE Sensors Journal, Institute of Electrical and Electronics Engineers, 2016, 16 (9), pp.3323-3331. ⟨10.1109/JSEN.2016.2519451⟩. ⟨hal-02316396⟩

Share

Metrics

Record views

35