This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232503
If you've NEVER registered a DOI in your Lattes, check our tutorial!Optimal camera placement consists of selecting positions for cameras in an environment in order to guarantee a certain level of required coverage whilst minimizing camera costs. In this paper, we delve into this realm focusing on indoor spaces with various types of occlusions, including camera-camera occlusion constraints. We model the problem using both single objective and a bi-objective approaches exploring the total cameras versus coverage tradeoff, solving them exactly via integer programming and the ϵ-constraint method, respectively. Our experiments show that while both models are able to solve the majority of the instances, the bi-objective method leads to significant reductions in the total number of cameras with only mild decrease in coverage, with this approach also being more stable with respect to infeasibilities in environments with high obstacle density.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper